Dana Shapira

Elina Opalinsky

Discret. Appl. Math., 2024

Selective dynamic compression.

[BibT_eX]

[DOI]

Elina Opalinsky

Discret. Appl. Math., 2024

Word-Based Forward Coding.

[BibT_eX]

[DOI]

Igor Zavadskyi

Proceedings of the Data Compression Conference, 2024

Computation over APT Compressed Data.

[BibT_eX]

[DOI]

Avivit Levy

Proceedings of the Data Compression Conference, 2024

Denser High-Order Fibonacci Codes.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2024

2023

Weighted Burrows-Wheeler Compression.

[BibT_eX]

[DOI]

SN Comput. Sci., May, 2023

Bidirectional adaptive compression.

[BibT_eX]

[DOI]

Discret. Appl. Math., May, 2023

Lot scheduling involving completion time problems on identical parallel machines.

[BibT_eX]

[DOI]

Oper. Res., March, 2023

Guided blocks WOM codes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

New compression schemes for natural number sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2023

Enhanced Ternary Fibonacci Codes.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2023

Turning Compression Schemes into Crypto-Systems.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2023, 2023

2022

Weighted forward looking adaptive coding.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Combining Forward Compression with PPM.

[BibT_eX]

[DOI]

Rachel Mustakis Avrunin

SN Comput. Sci., 2022

Minsum scheduling with acceptable lead-times and optional job rejection.

[BibT_eX]

[DOI]

Optim. Lett., 2022

Scheduling problems on a new setting of flexible flowshops: ℓ-Machine proportionate flowshops.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2022

Single machine scheduling with non-availability interval and optional job rejection.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Enhanced Context Sensitive Flash Codes.

[BibT_eX]

[DOI]

Comput. J., 2022

Generalization of Fibonacci Codes to the Non-Binary Case.

[BibT_eX]

[DOI]

IEEE Access, 2022

Selective Weighted Adaptive Coding.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2022

A Huffman Code Based Crypto-System.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2022

2021

Optimal skeleton and reduced Huffman trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Forward Looking Huffman Coding.

[BibT_eX]

[DOI]

Shoham Saadia

Theory Comput. Syst., 2021

Single machine lot scheduling with optional job-rejection.

[BibT_eX]

[DOI]

Gur Mosheiov

J. Comb. Optim., 2021

Integrated encryption in dynamic arithmetic compression.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Smaller Compressed Suffix Arrays†.

[BibT_eX]

[DOI]

Ekaterina Benza

Comput. J., 2021

Backward Weighted Coding.

[BibT_eX]

[DOI]

Proceedings of the 31st Data Compression Conference, 2021

Approximate Hashing for Bioinformatics.

[BibT_eX]

[DOI]

Proceedings of the 31st Data Compression Conference, 2021

Deep Reinforcement Learning for a Dictionary Based Compression Schema (Student Abstract).

[BibT_eX]

[DOI]

Keren Nivasch

Amos Azaria

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Flowshop scheduling with learning effect and job rejection.

[BibT_eX]

[DOI]

Gur Mosheiov

J. Sched., 2020

Scheduling with regular performance measures and optional job rejection on a single machine.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2020

Lot scheduling on a single machine to minimize the (weighted) number of tardy orders.

[BibT_eX]

[DOI]

Gur Mosheiov

Inf. Process. Lett., 2020

On the Randomness of Compressed Data.

[BibT_eX]

[DOI]

Inf., 2020

Direct merging of delta encoded files.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Dynamic determination of variable sizes of chunks in a deduplication system.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Accelerated partial decoding in wavelet trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Weighted Adaptive Coding.

[BibT_eX]

[DOI]

CoRR, 2020

Regular scheduling measures on proportionate flowshop with job rejection.

[BibT_eX]

[DOI]

Comput. Appl. Math., 2020

New Compression Schemes for Natural Number Sequences.

[BibT_eX]

[DOI]

Sapir Asraf

Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

Non-Binary Robust Universal Variable Length Codes.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2020

Weighted Adaptive Huffman Coding.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2020

2019

Improved algorithms for scheduling on proportionate flowshop with job-rejection.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2019

Context Sensitive Rewriting Codes for Flash Memory†.

[BibT_eX]

[DOI]

Comput. J., 2019

Edit Distance with Multiple Block Operations†.

[BibT_eX]

[DOI]

Mira Gonen

Comput. J., 2019

New Approaches for Context Sensitive Flash Codes.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2019

Bidirectional Adaptive Compression.

[BibT_eX]

[DOI]

Aharon Fruchtman

Proceedings of the Prague Stringology Conference 2019, 2019

Better Than Optimal Huffman Coding?

[BibT_eX]

[DOI]

Shoham Saadia

Proceedings of the Data Compression Conference, 2019

2018

Fibonacci Based Compressed Suffix Array.

[BibT_eX]

[DOI]

Ekaterina Benza

Proceedings of the Prague Stringology Conference 2018, 2018

Applying Compression to Hierarchical Clustering.

[BibT_eX]

[DOI]

Proceedings of the Similarity Search and Applications - 11th International Conference, 2018

Fibonacci Based Compressed Suffix Array.

[BibT_eX]

[DOI]

Proceedings of the 2018 Data Compression Conference, 2018

Compressed Hierarchical Clustering.

[BibT_eX]

[DOI]

Proceedings of the 2018 Data Compression Conference, 2018

2017

A space efficient direct access data structure.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2017

Hierarchical Parallel Evaluation of a Hamming Code.

[BibT_eX]

[DOI]

Algorithms, 2017

Range Queries Using Huffman Wavelet Trees.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2017, 2017

Optimal Skeleton Huffman Trees.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

2016

Compressed matching for feature vectors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Random access to Fibonacci encoded files.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Analysis of a Rewriting Compression System for Flash Memory.

[BibT_eX]

[DOI]

Proceedings of the 2016 Data Compression Conference, 2016

2015

Enhanced Extraction from Huffman Encoded Files.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2015, 2015

Controlling the Chunk-Size in Deduplication Systems.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2015, 2015

Enhanced Direct Access to Huffman Encoded Files.

[BibT_eX]

[DOI]

Josh Herzberg

Proceedings of the 2015 Data Compression Conference, 2015

2014

Practical fixed length Lempel-Ziv coding.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Expert-Based Fusion Algorithm of an Ensemble of Anomaly Detection Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Technologies and Applications of Artificial Intelligence, 2014

Reputation Prediction of Anomaly Detection Algorithms for Reliable System.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Conference on Software Science, 2014

Metric Preserving Dense SIFT Compression.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Random Access to Fibonacci Codes.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Direct Processing of Compressed SIFT Feature Vectors.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2014

Boosting the Compression of Rewriting on Flash Memory.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2014

2013

Lossless Compression of Rotated Maskless Lithography Images.

[BibT_eX]

[DOI]

Gal Shelef

Proceedings of the 2013 Data Compression Conference, 2013

2012

Bidirectional delta files.

[BibT_eX]

[DOI]

Michael Kats

Inf. Process. Manag., 2012

The String-to-Dictionary Matching Problem.

[BibT_eX]

[DOI]

Comput. J., 2012

2011

Huffman Coding with Non-Sorted Frequencies.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2011

On improving Tunstall codes.

[BibT_eX]

[DOI]

Inf. Process. Manag., 2011

Edit Distance with Block Deletions.

[BibT_eX]

[DOI]

Algorithms, 2011

Compressed Matching in Dictionaries.

[BibT_eX]

[DOI]

Algorithms, 2011

2010

Neural Markovian Predictive Compression: An Algorithm for Online Lossless Data Compression.

[BibT_eX]

[DOI]

Erez Shermer

Mireille Avigal

Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

2009

On the Usefulness of Backspace.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Compressed Transitive Delta Encoding.

[BibT_eX]

[DOI]

Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

2008

Modeling Delta Encoding of Compressed Files.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Improved Variable-to-Fixed Length Codes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2008

2007

Edit distance with move operations.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Compressed Delta Encoding for LZSS Encoded Files.

[BibT_eX]

[DOI]

Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

2006

Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts.

[BibT_eX]

[DOI]

Ajay H. Daptardar

Inf. Process. Manag., 2006

Compressed Pattern Matching in Jpeg Images.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

2005

Pattern matching in Huffman encoded texts.

[BibT_eX]

[DOI]

Inf. Process. Manag., 2005

In Place Differential File Compression.

[BibT_eX]

[DOI]

Comput. J., 2005

2004

In-Place Differential File Compression of Non-Aligned Files With Applications to File Distribution, Backups, and String Similarity.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

Large Edit Distance with Multiple Block Operations.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2003

2002

Searching in Compressed Dictionaries.

[BibT_eX]

[DOI]

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2000

A New Compression Method for Compressed Matching.

[BibT_eX]

[DOI]