| Publication | Date of Publication | Type |
|---|
| Removing the log factor from (,+)-products on bounded range integer matrices | 2026-05-26 | Paper |
Partial permutations comparison, maintenance and applications
Theoretical Computer Science | 2025-10-17 | Paper |
Locally consistent parsing for text indexing in small space
SIAM Journal on Computing | 2025-08-21 | Paper |
| Small-space and streaming pattern matching with k edits | 2025-08-13 | Paper |
| Breaking the variance: approximating the Hamming distance in 1/ time per alignment | 2025-08-05 | Paper |
| A lower bound for dynamic approximate membership data structures | 2025-04-29 | Paper |
An improved algorithm for the k-Dyck edit distance problem
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| String factorization via prefix free families | 2024-10-21 | Paper |
| An improved algorithm for the \(k\)-Dyck edit distance problem | 2024-07-19 | Paper |
| Partial permutations comparison, maintenance and applications | 2024-05-06 | Paper |
scientific article; zbMATH DE number 7758348 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
Incremental Edge Orientation in Forests
(available as arXiv preprint) | 2023-09-20 | Paper |
scientific article; zbMATH DE number 7651106 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650240 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Support optimality and adaptive cuckoo filters
(available as arXiv preprint) | 2022-03-25 | Paper |
scientific article; zbMATH DE number 7378707 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
| Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams | 2021-07-28 | Paper |
An<i>O</i>(log<sup>3/2</sup><i>n</i>) Parallel Time Population Protocol for Majority with<i>O</i>(log<i>n</i>) States
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Locally Consistent Parsing for Text Indexing in Small Space
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Approximating text-to-pattern Hamming distances
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| Quasi-periodicity under mismatch errors | 2020-12-16 | Paper |
Online recognition of dictionary with one gap
Information and Computation | 2020-12-15 | Paper |
Orthogonal vectors indexing
(available as arXiv preprint) | 2020-11-25 | Paper |
| Real-Time Streaming Multi-Pattern Search for Constant Alphabet | 2020-05-27 | Paper |
| Approximate cover of strings | 2020-05-25 | Paper |
| Dynamic dictionary matching in the online model | 2020-01-16 | Paper |
| A simple algorithm for approximating the text-to-pattern Hamming distance | 2019-10-25 | Paper |
The streaming \(k\)-mismatch problem
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Approximate cover of strings
Theoretical Computer Science | 2019-10-07 | Paper |
Mind the gap!
Algorithmica | 2019-05-17 | Paper |
Sublinear time, measurement-optimal, sparse recovery for all
(available as arXiv preprint) | 2019-05-10 | Paper |
| Sublinear time, measurement-optimal, sparse recovery for all | 2019-05-10 | Paper |
Streaming pattern matching with \(d\) wildcards
Algorithmica | 2019-05-07 | Paper |
| From coding theory to efficient pattern matching | 2019-05-06 | Paper |
Worst-case optimal join algorithms
Journal of the ACM | 2018-12-06 | Paper |
Worst-case optimal join algorithms
Journal of the ACM | 2018-12-06 | Paper |
For-all sparse recovery in near-optimal time
ACM Transactions on Algorithms | 2018-11-05 | Paper |
The \(k\)-mismatch problem revisited
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Higher lower bounds from the 3SUM conjecture
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Simultaneously load balancing for every p-norm, with reassignments | 2018-05-03 | Paper |
| Mind the gap: essentially optimal algorithms for online dictionary matching with one gap | 2018-04-19 | Paper |
How hard is it to find (honest) witnesses?
(available as arXiv preprint) | 2018-03-02 | Paper |
Sublinear Distance Labeling
(available as arXiv preprint) | 2018-03-02 | Paper |
Streaming Pattern Matching with d Wildcards
(available as arXiv preprint) | 2018-03-02 | Paper |
| New Parameterized Algorithms for APSP in Directed Graphs | 2018-03-02 | Paper |
Distance labeling schemes for trees
(available as arXiv preprint) | 2017-12-19 | Paper |
A filtering algorithm for \(k\)-mismatch with don't cares
Information Processing Letters | 2017-11-03 | Paper |
| Succinct online dictionary matching with improved worst-case guarantees | 2017-10-17 | Paper |
| Exponential time improvement for min-wise based algorithms | 2017-09-29 | Paper |
Conditional lower bounds for space/time tradeoffs
(available as arXiv preprint) | 2017-09-22 | Paper |
Weight Distribution and List-Decoding Size of Reed–Muller Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Explicit Nonadaptive Combinatorial Group Testing Schemes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
A grouping approach for succinct dynamic dictionary matching
Algorithmica | 2017-03-06 | Paper |
| Exponential space improvement for min-wise based algorithms | 2017-01-26 | Paper |
On the relationship between histogram indexing and block-mass indexing
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Addendum to: ``Exponential time improvement for min-wise based algorithms''
Information and Computation | 2016-11-18 | Paper |
d-k-min-wise independent family of hash functions
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Set intersection and sequence matching with mismatch counting
Theoretical Computer Science | 2016-06-16 | Paper |
Dictionary matching in a stream
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Dynamic set intersection
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Fingerprints for highly similar streams
Information and Computation | 2015-09-28 | Paper |
Efficient sampling of non-strict turnstile data streams
Theoretical Computer Science | 2015-06-10 | Paper |
Dictionary matching with a few gaps
Theoretical Computer Science | 2015-06-01 | Paper |
Preprocess, set, query!
Algorithmica | 2015-03-23 | Paper |
Cycle detection and correction
ACM Transactions on Algorithms | 2014-12-05 | Paper |
A PTAS for the square tiling problem
Theoretical Computer Science | 2014-12-02 | Paper |
Approximate sparse recovery: optimizing time and measurements
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Homomorphic fingerprints under misalignments
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Exact and Approximate Pattern Matching in the Streaming Model
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Orienting fully dynamic graphs with worst-case time bounds
Automata, Languages, and Programming | 2014-07-01 | Paper |
For-all sparse recovery in near-optimal time
Lecture Notes in Computer Science | 2014-07-01 | Paper |
Dictionary matching with one gap
Combinatorial Pattern Matching | 2014-06-30 | Paper |
An improved query time for succinct dynamic dictionary matching
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Range LCP
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Fast moment estimation in data streams in optimal space
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
A space lower bound for dynamic approximate membership data structures
SIAM Journal on Computing | 2014-04-11 | Paper |
Space lower bounds for online pattern matching
Theoretical Computer Science | 2014-01-09 | Paper |
Efficient sampling of non-strict turnstile data streams
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints
Automata, Languages, and Programming | 2013-08-07 | Paper |
\(\ell _{2}/\ell _{2}\)-foreach sparse recovery with low risk
Automata, Languages, and Programming | 2013-08-06 | Paper |
Pattern matching under polynomial transformation
SIAM Journal on Computing | 2013-07-24 | Paper |
Sharing rewards in cooperative connectivity games
Journal of Artificial Intelligence Research | 2013-06-20 | Paper |
| Efficiently decodable compressed sensing by list-recoverable codes and recursion | 2012-08-23 | Paper |
Pattern matching in multiple streams
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Approximate sparse recovery: optimizing time and measurements
SIAM Journal on Computing | 2012-08-10 | Paper |
Mismatch sampling
Information and Computation | 2012-05-24 | Paper |
Range LCP
Algorithms and Computation | 2011-12-16 | Paper |
Preprocess, set, query!
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Approximate string matching with stuck address bits
Theoretical Computer Science | 2011-07-14 | Paper |
Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
Automata, Languages and Programming | 2011-07-06 | Paper |
Space Lower Bounds for Online Pattern Matching
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
Algorithmica | 2011-05-10 | Paper |
Exponential time improvement for min-wise based algorithms
Information and Computation | 2011-04-28 | Paper |
A black box for online approximate pattern matching
Information and Computation | 2011-04-28 | Paper |
The approximate swap and mismatch edit distance
Theoretical Computer Science | 2010-11-11 | Paper |
Fast set intersection and two-patterns matching
Theoretical Computer Science | 2010-10-11 | Paper |
Fast computation of a longest increasing subsequence and application
Information and Computation | 2010-10-07 | Paper |
String matching with up to k swaps and mismatches
Information and Computation | 2010-10-07 | Paper |
Cycle detection and correction
Automata, Languages and Programming | 2010-09-07 | Paper |
On the cost of interchange rearrangement in strings
SIAM Journal on Computing | 2010-09-06 | Paper |
Pattern matching with address errors
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
The frequent items problem, under polynomial decay, in the streaming model
Theoretical Computer Science | 2010-08-11 | Paper |
Approximating general metric distances between a pattern and a text
(available as arXiv preprint) | 2010-08-06 | Paper |
Fast set intersection and two-patterns matching
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Real two dimensional scaled matching.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Approximate matching in the \(L_{\infty }\) metric
Information Processing Letters | 2010-03-24 | Paper |
\(L_{1}\) pattern matching lower bound
Information Processing Letters | 2010-03-24 | Paper |
Pattern matching with don't cares and few errors
Journal of Computer and System Sciences | 2010-02-12 | Paper |
Range non-overlapping indexing
Algorithms and Computation | 2009-12-17 | Paper |
Approximate string matching with address bit errors
Theoretical Computer Science | 2009-11-18 | Paper |
Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances
Theoretical Computer Science | 2009-10-09 | Paper |
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
String Processing and Information Retrieval | 2009-09-29 | Paper |
An Optimal Bloom Filter Replacement Based on Matrix Solving
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Pattern matching with address errors: rearrangement distances
Journal of Computer and System Sciences | 2009-07-24 | Paper |
Real two dimensional scaled matching
Algorithmica | 2009-06-17 | Paper |
Pattern matching with pair correlation distance
Theoretical Computer Science | 2008-11-18 | Paper |
k-Mismatch with Don’t Cares
Algorithms – ESA 2007 | 2008-09-25 | Paper |
On the Cost of Interchange Rearrangement in Strings
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Explicit Non-adaptive Combinatorial Group Testing Schemes
Automata, Languages and Programming | 2008-08-28 | Paper |
Improved Sketching of Hamming Distance with Error Correcting
Combinatorial Pattern Matching | 2008-06-17 | Paper |
A Black Box for Online Approximate Pattern Matching
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Approximate String Matching with Address Bit Errors
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Approximate String Matching with Swap and Mismatch
Algorithms and Computation | 2008-05-27 | Paper |
Improved algorithms for polynomial-time decay and time-decay with additive error
Theory of Computing Systems | 2008-04-11 | Paper |
Efficient one-dimensional real scaled matching
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Approximate Matching in Weighted Sequences
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Finding the Position of the k-Mismatch and Approximate Tandem Repeats
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Efficient pebbling for list traversal synopses with application to program rollback
Theoretical Computer Science | 2007-07-16 | Paper |
Swap and mismatch edit distance
Algorithmica | 2007-06-21 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Function Matching
SIAM Journal on Computing | 2006-06-01 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Faster algorithms for string matching with k mismatches
Journal of Algorithms | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2080211 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2038765 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 2038764 (Why is no real title available?) | 2004-02-08 | Paper |
Overlap matching.
Information and Computation | 2003-08-19 | Paper |
Approximate swapped matching.
Information Processing Letters | 2003-01-21 | Paper |
| A faster implementation of the Goemans-Williamson clustering algorithm | 2003-01-20 | Paper |
| Overlap matching | 2002-06-18 | Paper |
| Approximate subset matching with don't cares | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1445379 (Why is no real title available?) | 2000-05-10 | Paper |
