| Guided blocks WOM codes | 0 | 0.34 | 2023 |
| Combining Forward Compression with PPM | 0 | 0.34 | 2022 |
| Minsum scheduling with acceptable lead-times and optional job rejection | 0 | 0.34 | 2022 |
| Generalization of Fibonacci Codes to the Non-Binary Case. | 0 | 0.34 | 2022 |
| Weighted forward looking adaptive coding | 0 | 0.34 | 2022 |
| Enhanced Context Sensitive Flash Codes | 0 | 0.34 | 2022 |
| Single machine scheduling with non-availability interval and optional job rejection | 0 | 0.34 | 2022 |
| A Huffman Code Based Crypto-System | 0 | 0.34 | 2022 |
| Selective Weighted Adaptive Coding | 0 | 0.34 | 2022 |
| Smaller Compressed Suffix Arrays† | 0 | 0.34 | 2021 |
| Backward Weighted Coding | 1 | 0.63 | 2021 |
| Integrated encryption in dynamic arithmetic compression | 1 | 0.39 | 2021 |
| Forward Looking Huffman Coding | 1 | 0.36 | 2021 |
| Guided Blocks WOM codes | 0 | 0.34 | 2021 |
| Deep Reinforcement Learning For A Dictionary Based Compression Schema (Student Abstract) | 0 | 0.34 | 2021 |
| Approximate Hashing for Bioinformatics | 0 | 0.34 | 2021 |
| Single Machine Lot Scheduling With Optional Job-Rejection | 1 | 0.36 | 2021 |
| Optimal Skeleton And Reduced Huffman Trees | 0 | 0.34 | 2021 |
| Weighted Adaptive Huffman Coding | 0 | 0.34 | 2020 |
| New Compression Schemes for Natural Number Sequences. | 0 | 0.34 | 2020 |
| Lot scheduling on a single machine to minimize the (weighted) number of tardy orders | 0 | 0.34 | 2020 |
| Regular scheduling measures on proportionate flowshop with job rejection | 1 | 0.35 | 2020 |
| Flowshop Scheduling With Learning Effect And Job Rejection | 1 | 0.35 | 2020 |
| Direct merging of delta encoded files | 0 | 0.34 | 2020 |
| Dynamic determination of variable sizes of chunks in a deduplication system | 0 | 0.34 | 2020 |
| Non-Binary Robust Universal Variable Length Codes | 0 | 0.34 | 2020 |
| New Approaches for Context Sensitive Flash Codes. | 0 | 0.34 | 2019 |
| Edit Distance with Multiple Block Operations†. | 0 | 0.34 | 2019 |
| Enhanced Context Sensitive Flash Codes | 0 | 0.34 | 2019 |
| Improved algorithms for scheduling on proportionate flowshop with job-rejection | 2 | 0.37 | 2019 |
| Context Sensitive Rewriting Codes for Flash Memory†. | 0 | 0.34 | 2019 |
| Selective Dynamic Compression | 0 | 0.34 | 2019 |
| On the Randomness of Compressed Data | 0 | 0.34 | 2019 |
| Better Than Optimal Huffman Coding? | 0 | 0.34 | 2019 |
| Synchronizing Dynamic Huffman Codes. | 0 | 0.34 | 2018 |
| Fibonacci Based Compressed Suffix Array | 0 | 0.34 | 2018 |
| Fibonacci Based Compressed Suffix Array. | 0 | 0.34 | 2018 |
| Compressed Hierarchical Clustering. | 0 | 0.34 | 2018 |
| Scheduling with regular performance measures and optional job rejection on a single machine. | 2 | 0.37 | 2017 |
| A Space Efficient Direct Access Data Structure. | 0 | 0.34 | 2017 |
| Range Queries Using Huffman Wavelet Trees. | 0 | 0.34 | 2017 |
| Optimal Skeleton Huffman Trees. | 0 | 0.34 | 2017 |
| Integrated Encryption in Dynamic Arithmetic Compression. | 0 | 0.34 | 2017 |
| Hierarchical Parallel Evaluation of a Hamming Code. | 0 | 0.34 | 2017 |
| Analysis of a Rewriting Compression System for Flash Memory | 0 | 0.34 | 2016 |
| Compressed matching for feature vectors | 2 | 0.43 | 2016 |
| Random access to Fibonacci encoded files | 6 | 0.50 | 2016 |
| Enhanced Direct Access to Huffman Encoded Files | 0 | 0.34 | 2015 |
| Direct Processing of Compressed SIFT Feature Vectors | 0 | 0.34 | 2014 |
| Boosting the Compression of Rewriting on Flash Memory | 0 | 0.34 | 2014 |
