| Publication | Date of Publication | Type |
|---|
Formally verified suffix array construction
Journal of Automated Reasoning | 2025-10-22 | Paper |
| A fast and space-economical algorithm for length-limited coding | 2023-03-21 | Paper |
In-place calculation of minimum-redundancy codes
Lecture Notes in Computer Science | 2022-12-16 | Paper |
A framework for adaptive sorting
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
CSA++: Fast Pattern Search for Large Alphabets
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
String search experimentation using massive data
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Comment on ``Efficient Huffman decoding'' and ``An efficient finite-state machine implementation of Huffman decoders''
Information Processing Letters | 2016-06-09 | Paper |
Binary codes for locally homogeneous sequences
Information Processing Letters | 2010-01-29 | Paper |
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management | 2005-08-03 | Paper |
| scientific article; zbMATH DE number 2087041 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1792104 (Why is no real title available?) | 2002-11-11 | Paper |
On-line adaptive canonical prefix coding with bounded compression loss
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Housekeeping for prefix coding
IEEE Transactions on Communications | 2001-12-02 | Paper |
| scientific article; zbMATH DE number 1630078 (Why is no real title available?) | 2001-10-04 | Paper |
Efficient construction of minimum-redundancy codes for large alphabets
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
| scientific article; zbMATH DE number 1304039 (Why is no real title available?) | 1999-06-17 | Paper |
A tree-based mergesort
Acta Informatica | 1999-04-26 | Paper |
A probability-ratio approach to approximate binary arithmetic coding
IEEE Transactions on Information Theory | 1998-06-21 | Paper |
A framework for adaptive sorting
Discrete Applied Mathematics | 1995-06-06 | Paper |
| scientific article; zbMATH DE number 756768 (Why is no real title available?) | 1995-05-21 | Paper |
HISTORICAL SEARCHING
International Journal of Foundations of Computer Science | 1994-01-13 | Paper |
Supporting random access in files of variable length records
Information Processing Letters | 1993-09-21 | Paper |
| scientific article; zbMATH DE number 140488 (Why is no real title available?) | 1993-03-28 | Paper |
Linear time adaptive arithmetic coding
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
SIAM Journal on Computing | 1987-01-01 | Paper |
A priority queue for the all pairs shortest path problem
Information Processing Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3700238 (Why is no real title available?) | 1980-01-01 | Paper |
