Dana Shapira

Orcid: 0000-0002-2320-9064

According to our database1, Dana Shapira authored at least 87 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Weighted Burrows-Wheeler Compression.
SN Comput. Sci., May, 2023

Bidirectional adaptive compression.
Discret. Appl. Math., May, 2023

Lot scheduling involving completion time problems on identical parallel machines.
Oper. Res., March, 2023

Guided blocks WOM codes.
Inf. Process. Lett., 2023

New compression schemes for natural number sequences.
Discret. Appl. Math., 2023

Enhanced Ternary Fibonacci Codes.
Proceedings of the Implementation and Application of Automata, 2023

Selective Weighted Adaptive Coding.
Proceedings of the Prague Stringology Conference 2023, 2023

Turning Compression Schemes into Crypto-Systems.
Proceedings of the Prague Stringology Conference 2023, 2023

2022
Weighted forward looking adaptive coding.
Theor. Comput. Sci., 2022

Combining Forward Compression with PPM.
SN Comput. Sci., 2022

Minsum scheduling with acceptable lead-times and optional job rejection.
Optim. Lett., 2022

Scheduling problems on a new setting of flexible flowshops: ℓ-Machine proportionate flowshops.
J. Oper. Res. Soc., 2022

Single machine scheduling with non-availability interval and optional job rejection.
J. Comb. Optim., 2022

Enhanced Context Sensitive Flash Codes.
Comput. J., 2022

Generalization of Fibonacci Codes to the Non-Binary Case.
IEEE Access, 2022

A Huffman Code Based Crypto-System.
Proceedings of the Data Compression Conference, 2022

2021
Optimal skeleton and reduced Huffman trees.
Theor. Comput. Sci., 2021

Forward Looking Huffman Coding.
Theory Comput. Syst., 2021

Single machine lot scheduling with optional job-rejection.
J. Comb. Optim., 2021

Integrated encryption in dynamic arithmetic compression.
Inf. Comput., 2021

Smaller Compressed Suffix Arrays†.
Comput. J., 2021

Approximate Hashing for Bioinformatics.
Proceedings of the Implementation and Application of Automata, 2021

Backward Weighted Coding.
Proceedings of the 31st Data Compression Conference, 2021

Deep Reinforcement Learning for a Dictionary Based Compression Schema (Student Abstract).
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Flowshop scheduling with learning effect and job rejection.
J. Sched., 2020

Scheduling with regular performance measures and optional job rejection on a single machine.
J. Oper. Res. Soc., 2020

Lot scheduling on a single machine to minimize the (weighted) number of tardy orders.
Inf. Process. Lett., 2020

On the Randomness of Compressed Data.
Inf., 2020

Direct merging of delta encoded files.
Discret. Appl. Math., 2020

Dynamic determination of variable sizes of chunks in a deduplication system.
Discret. Appl. Math., 2020

Accelerated partial decoding in wavelet trees.
Discret. Appl. Math., 2020

Weighted Adaptive Coding.
CoRR, 2020

Regular scheduling measures on proportionate flowshop with job rejection.
Comput. Appl. Math., 2020

New Compression Schemes for Natural Number Sequences.
Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

Non-Binary Robust Universal Variable Length Codes.
Proceedings of the Data Compression Conference, 2020

Weighted Adaptive Huffman Coding.
Proceedings of the Data Compression Conference, 2020

2019
Improved algorithms for scheduling on proportionate flowshop with job-rejection.
J. Oper. Res. Soc., 2019

Context Sensitive Rewriting Codes for Flash Memory†.
Comput. J., 2019

Edit Distance with Multiple Block Operations†.
Comput. J., 2019

New Approaches for Context Sensitive Flash Codes.
Proceedings of the Implementation and Application of Automata, 2019

Selective Dynamic Compression.
Proceedings of the Prague Stringology Conference 2019, 2019

Bidirectional Adaptive Compression.
Proceedings of the Prague Stringology Conference 2019, 2019

Better Than Optimal Huffman Coding?
Proceedings of the Data Compression Conference, 2019

2018
Synchronizing Dynamic Huffman Codes.
Proceedings of the Prague Stringology Conference 2018, 2018

Fibonacci Based Compressed Suffix Array.
Proceedings of the Prague Stringology Conference 2018, 2018

Applying Compression to Hierarchical Clustering.
Proceedings of the Similarity Search and Applications - 11th International Conference, 2018

Fibonacci Based Compressed Suffix Array.
Proceedings of the 2018 Data Compression Conference, 2018

Compressed Hierarchical Clustering.
Proceedings of the 2018 Data Compression Conference, 2018

2017
A space efficient direct access data structure.
J. Discrete Algorithms, 2017

Hierarchical Parallel Evaluation of a Hamming Code.
Algorithms, 2017

Range Queries Using Huffman Wavelet Trees.
Proceedings of the Prague Stringology Conference 2017, 2017

Optimal Skeleton Huffman Trees.
Proceedings of the String Processing and Information Retrieval, 2017

2016
Compressed matching for feature vectors.
Theor. Comput. Sci., 2016

Random access to Fibonacci encoded files.
Discret. Appl. Math., 2016

Analysis of a Rewriting Compression System for Flash Memory.
Proceedings of the 2016 Data Compression Conference, 2016

2015
Enhanced Extraction from Huffman Encoded Files.
Proceedings of the Prague Stringology Conference 2015, 2015

Controlling the Chunk-Size in Deduplication Systems.
Proceedings of the Prague Stringology Conference 2015, 2015

Enhanced Direct Access to Huffman Encoded Files.
Proceedings of the 2015 Data Compression Conference, 2015

2014
Practical fixed length Lempel-Ziv coding.
Discret. Appl. Math., 2014

Expert-Based Fusion Algorithm of an Ensemble of Anomaly Detection Algorithms.
Proceedings of the Technologies and Applications of Artificial Intelligence, 2014

Reputation Prediction of Anomaly Detection Algorithms for Reliable System.
Proceedings of the 2014 IEEE International Conference on Software Science, 2014

Metric Preserving Dense SIFT Compression.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Random Access to Fibonacci Codes.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Direct Processing of Compressed SIFT Feature Vectors.
Proceedings of the Data Compression Conference, 2014

Boosting the Compression of Rewriting on Flash Memory.
Proceedings of the Data Compression Conference, 2014

2013
Lossless Compression of Rotated Maskless Lithography Images.
Proceedings of the 2013 Data Compression Conference, 2013

2012
Bidirectional delta files.
Inf. Process. Manag., 2012

The String-to-Dictionary Matching Problem.
Comput. J., 2012

2011
Huffman Coding with Non-Sorted Frequencies.
Math. Comput. Sci., 2011

On improving Tunstall codes.
Inf. Process. Manag., 2011

Edit Distance with Block Deletions.
Algorithms, 2011

Compressed Matching in Dictionaries.
Algorithms, 2011

2010
Neural Markovian Predictive Compression: An Algorithm for Online Lossless Data Compression.
Proceedings of the 2010 Data Compression Conference (DCC 2010), 2010

2009
On the Usefulness of Backspace.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Compressed Transitive Delta Encoding.
Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

2008
Modeling Delta Encoding of Compressed Files.
Int. J. Found. Comput. Sci., 2008

Improved Variable-to-Fixed Length Codes.
Proceedings of the String Processing and Information Retrieval, 2008

2007
Edit distance with move operations.
J. Discrete Algorithms, 2007

Compressed Delta Encoding for LZSS Encoded Files.
Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

2006
Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts.
Inf. Process. Manag., 2006

Compressed Pattern Matching in Jpeg Images.
Int. J. Found. Comput. Sci., 2006

2005
Pattern matching in Huffman encoded texts.
Inf. Process. Manag., 2005

In Place Differential File Compression.
Comput. J., 2005

2004
In-Place Differential File Compression of Non-Aligned Files With Applications to File Distribution, Backups, and String Similarity.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003
Large Edit Distance with Multiple Block Operations.
Proceedings of the String Processing and Information Retrieval, 2003

2002
Searching in Compressed Dictionaries.
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2000
A New Compression Method for Compressed Matching.
Proceedings of the Data Compression Conference, 2000


  Loading...