| Publication | Date of Publication | Type |
|---|
| Static optimality theorem for external memory string access | 2026-05-29 | Paper |
| Online scheduling to minimize average stretch | 2026-05-06 | Paper |
| Overcoming the memory bottleneck in suffix tree construction | 2025-10-29 | Paper |
Compact grid layouts of multi-level networks Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Multi-method dispatching: a geometric approach with applications to string matching problems Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Non-standard stringology: algorithms and complexity Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Optimal parallel randomized renaming Information Processing Letters | 2016-06-01 | Paper |
Periodicity testing with sublinear samples and space ACM Transactions on Algorithms | 2014-11-18 | Paper |
On distributing symmetric streaming computations ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Substring compression problems | 2014-10-13 | Paper |
| Improved range-summable random variable construction algorithms | 2014-10-13 | Paper |
| The bin-covering technique for thresholding random geometric graph properties | 2014-10-13 | Paper |
Nearly optimal private convolution Lecture Notes in Computer Science | 2013-09-17 | Paper |
Frugal Streaming for Estimating Quantiles Lecture Notes in Computer Science | 2013-09-13 | Paper |
Strictly-black-box zero-knowledge and efficient validation of financial transactions Automata, Languages, and Programming | 2013-08-12 | Paper |
| Functionally private approximations of negligibly-biased estimators | 2012-10-24 | Paper |
What's hot and what's not: tracking most frequent items dynamically ACM Transactions on Database Systems | 2008-12-21 | Paper |
Parallel scheduling problems in next generation wireless networks Networks | 2005-02-23 | Paper |
Parallel scheduling problems in next generation wireless networks Networks | 2005-02-23 | Paper |
Optimal logarithmic time randomized suffix tree construction Lecture Notes in Computer Science | 2004-09-24 | Paper |
An improved algorithm for sequence comparison with block reversals Lecture Notes in Computer Science | 2004-08-11 | Paper |
Histogramming data streams with fast per-item processing Lecture Notes in Computer Science | 2004-08-11 | Paper |
Simple and practical sequence nearest neighbors with block operations Lecture Notes in Computer Science | 2004-08-11 | Paper |
Range searching in categorical data: Colored range searching on grid Lecture Notes in Computer Science | 2003-07-08 | Paper |
Estimating rarity and similarity over data stream windows Lecture Notes in Computer Science | 2003-07-08 | Paper |
Efficient approximation algorithms for tiling and packing problems with rectangles Journal of Algorithms | 2002-07-08 | Paper |
Permutation editing and matching via embeddings Lecture Notes in Computer Science | 2002-06-12 | Paper |
Exact size of binary space partitionings and improved rectangle tiling algorithms SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
| Improved approximation algorithms for rectangle tiling and packing. | 2002-01-30 | Paper |
| Internet packet filter management and rectangle geometry | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1263231 (Why is no real title available?) | 2001-08-28 | Paper |
Tight Analyses of Two Local Load Balancing Algorithms SIAM Journal on Computing | 1999-10-28 | Paper |
First- and second-order diffusive methods for rapid, coarse, distributed load balancing Theory of Computing Systems | 1999-01-27 | Paper |
Detecting false matches in string-matching algorithms Algorithmica | 1997-07-23 | Paper |