Ely Porat

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Partial Permutations Comparison, Maintenance and Applications.

[BibT_eX]

[DOI]

Avivit Levy

B. Riva Shalom

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions.

[BibT_eX]

[DOI]

IEEE Trans. Netw. Serv. Manag., 2021

Support Optimality and Adaptive Cuckoo Filters.

[BibT_eX]

[DOI]

Samuel McCauley

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Small-space and streaming pattern matching with $k$ edits.

[BibT_eX]

[DOI]

Tomasz Kociumaka

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Incremental Edge Orientation in Forests.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Online recognition of dictionary with one gap.

[BibT_eX]

[DOI]

Inf. Comput., 2020

An O(log3/2n) Parallel Time Population Protocol for Majority with O(log n) States.

[BibT_eX]

[DOI]

CoRR, 2020

Approximating text-to-pattern Hamming distances.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Constructions and Applications for Accurate Counting of the Bloom Filter False Positive Free Zone.

[BibT_eX]

[DOI]

Proceedings of the SOSR '20: Symposium on SDN Research, San Jose, CA, USA, March 3, 2020, 2020

Locally Consistent Parsing for Text Indexing in Small Space.

[BibT_eX]

[DOI]

Or Birenzwige

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Improved Circular k-Mismatch Sketches.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2020

2019

Approximate cover of strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

{-1, 0, 1}-APSP and (min, max)-Product Problems.

[BibT_eX]

[DOI]

CoRR, 2019

The Strong 3SUM-INDEXING Conjecture is False.

[BibT_eX]

[DOI]

CoRR, 2019

Streaming Pattern Matching with d Wildcards.

[BibT_eX]

[DOI]

Algorithmica, 2019

Mind the Gap! - Online Dictionary Matching with One Gap.

[BibT_eX]

[DOI]

Algorithmica, 2019

Dynamic Dictionary Matching in the Online Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

The streaming k-mismatch problem.

[BibT_eX]

[DOI]

Raphaël Clifford

Tomasz Kociumaka

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

On the Hardness of Set Disjointness and Set Intersection with Bounded Universe.

[BibT_eX]

[DOI]

Isaac Goldstein

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Identification of Parallel Passages Across a Large Hebrew/Aramaic Corpus.

[BibT_eX]

[DOI]

Avi Shmidman

Moshe Koppel

J. Data Min. Digit. Humanit., 2018

Worst-case Optimal Join Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2018

Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest.

[BibT_eX]

[DOI]

Yair Rosenmutter

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance.

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Improved Space-Time Tradeoffs for kSUM.

[BibT_eX]

[DOI]

Isaac Goldstein

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Quasi-Periodicity Under Mismatch Errors.

[BibT_eX]

[DOI]

Avivit Levy

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

For-All Sparse Recovery in Near-Optimal Time.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

d-k-min-wise independent family of hash functions.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Erratum to: A Grouping Approach for Succinct Dynamic Dictionary Matching.

[BibT_eX]

[DOI]

Algorithmica, 2017

A Grouping Approach for Succinct Dynamic Dictionary Matching.

[BibT_eX]

[DOI]

Algorithmica, 2017

Conditional Lower Bounds for Space/Time Tradeoffs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Orthogonal Vectors Indexing.

[BibT_eX]

[DOI]

Isaac Goldstein

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Simultaneously Load Balancing for Every p-norm, With Reassignments.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Real-Time Streaming Multi-Pattern Search for Constant Alphabet.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Optimal In/Out TCAM Encodings of Ranges.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2016

Set Intersection and Sequence Matching with mismatch counting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Corrigendum to "The frequent items problem, under polynomial decay, in the streaming model" [Theoret. Comput. Sci. 411(34-36) (2010) 3048-3054].

[BibT_eX]

[DOI]

Ofra Itzhaki

Theor. Comput. Sci., 2016

Special issue in honor of the 60th birthday of Amihood Amir.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Addendum to 'Exponential time improvement for min-wise based algorithms' [Information and Computation 209 (2011) 737-747].

[BibT_eX]

[DOI]

Inf. Comput., 2016

The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Higher Lower Bounds from the 3SUM Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

The k-mismatch problem revisited.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Distance Labeling Schemes for Trees.

[BibT_eX]

[DOI]

Stephen Alstrup

Inge Li Gørtz

Esben Bistrup Halvorsen

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

New Parameterized Algorithms for APSP in Directed Graphs.

[BibT_eX]

[DOI]

Eduard Shahbazian

Roei Tov

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

How Hard is it to Find (Honest) Witnesses?.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Sublinear Distance Labeling.

[BibT_eX]

[DOI]

Stephen Alstrup

Søren Dahlgaard

Mathias Bæk Tejs Knudsen

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Linear Time Succinct Indexable Dictionary Construction with Applications.

[BibT_eX]

[DOI]

Proceedings of the 2016 Data Compression Conference, 2016

Succinct Online Dictionary Matching with Improved Worst-Case Guarantees.

[BibT_eX]

[DOI]

Yaron Rozen

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

Efficient sampling of non-strict turnstile data streams.

[BibT_eX]

[DOI]

Neta Barkay

Theor. Comput. Sci., 2015

Dictionary matching with a few gaps.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A PTAS for the Square Tiling Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Fingerprints for highly similar streams.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Breaking the Variance: Approximating the Hamming Distance in $\tilde O(1/ε)$ Time Per Alignment.

[BibT_eX]

[DOI]

CoRR, 2015

The k-mismatch problem revisited.

[BibT_eX]

[DOI]

CoRR, 2015

Online Dictionary Matching with One Gap.

[BibT_eX]

[DOI]

CoRR, 2015

Sublinear distance labeling for sparse graphs.

[BibT_eX]

[DOI]

Stephen Alstrup

Søren Dahlgaard

Mathias Bæk Tejs Knudsen

CoRR, 2015

Dynamic Set Intersection.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Dictionary Matching in a Stream.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Range LCP.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

3SUM Hardness in (Dynamic) Data Structures.

[BibT_eX]

[DOI]

Casper Kejlberg-Rasmussen

CoRR, 2014

Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets.

[BibT_eX]

[DOI]

CoRR, 2014

Polynomials: a new tool for length reduction in binary discrete convolutions.

[BibT_eX]

[DOI]

CoRR, 2014

(Near) optimal resource-competitive broadcast with jamming.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Orienting Fully Dynamic Graphs with Worst-Case Time Bounds.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

An Improved Query Time for Succinct Dynamic Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Dictionary Matching with One Gap.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

Building a personalized tourist attraction recommender system using crowdsourcing.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Space lower bounds for online pattern matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A Space Lower Bound for Dynamic Approximate Membership Data Structures.

[BibT_eX]

[DOI]

Shachar Lovett

SIAM J. Comput., 2013

Pattern Matching under Polynomial Transformation.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Sharing Rewards in Cooperative Connectivity Games.

[BibT_eX]

[DOI]

Jeffrey S. Rosenschein

J. Artif. Intell. Res., 2013

Preprocess, Set, Query!

[BibT_eX]

[DOI]

Liam Roditty

Algorithmica, 2013

Guest Editorial for "Group Testing: models and applications".

[BibT_eX]

[DOI]

Ferdinando Cicalese

Algorithmica, 2013

Homomorphic fingerprints under misalignments: sketching edit and shift distances.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

On finding an optimal TCAM encoding scheme for packet classification.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Weight Distribution and List-Decoding Size of Reed-Muller Codes.

[BibT_eX]

[DOI]

Tali Kaufman

Shachar Lovett

IEEE Trans. Inf. Theory, 2012

Cycle detection and correction.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Approximate Sparse Recovery: Optimizing Time and Measurements.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Mismatch sampling.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Feasible Sampling of Non-strict Turnstile Data Streams

[BibT_eX]

[DOI]

Neta Barkay

CoRR, 2012

Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion.

[BibT_eX]

[DOI]

Hung Q. Ngo

Atri Rudra

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Sublinear time, measurement-optimal, sparse recovery for all.

[BibT_eX]

[DOI]

Martin J. Strauss

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Worst-case optimal join algorithms: [extended abstract].

[BibT_eX]

[DOI]

Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

Efficient signature scheme for network coding.

[BibT_eX]

[DOI]

Erez Waisbard

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Exponential Space Improvement for minwise Based Algorithms.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

A Cuckoo Hashing Variant with Improved Memory Utilization and Insertion Time.

[BibT_eX]

[DOI]

Proceedings of the 2012 Data Compression Conference, Snowbird, UT, USA, April 10-12, 2012, 2012

Pattern Matching in Multiple Streams.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Explicit Nonadaptive Combinatorial Group Testing Schemes.

[BibT_eX]

[DOI]

Amir Rothschild

IEEE Trans. Inf. Theory, 2011

Approximate string matching with stuck address bits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Exponential time improvement for min-wise based algorithms.

[BibT_eX]

[DOI]

Inf. Comput., 2011

A black box for online approximate pattern matching.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Another one flew over the cuckoo's nest

[BibT_eX]

[DOI]

CoRR, 2011

Even Better Framework for min-wise Based Algorithms

[BibT_eX]

[DOI]

CoRR, 2011

Approximate Pattern Matching with the L1, L2 and L∞ Metrics.

[BibT_eX]

[DOI]

Algorithmica, 2011

Fast moment estimation in data streams in optimal space.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Persistency in Suffix Trees with Applications to String Interval Problems.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2011

Camouflaged Private Communication.

[BibT_eX]

[DOI]

Proceedings of the PASSAT/SocialCom 2011, Privacy, 2011

Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract).

[BibT_eX]

[DOI]

Hung Q. Ngo

Atri Rudra

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Toward Real Time Internet Traffic Monitoring.

[BibT_eX]

[DOI]

Benny Porat

Proceedings of the Web Intelligence and Security, 2010

The frequent items problem, under polynomial decay, in the streaming model.

[BibT_eX]

[DOI]

Ofra Itzhaki

Theor. Comput. Sci., 2010

The approximate swap and mismatch edit distance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Fast set intersection and two-patterns matching.

[BibT_eX]

[DOI]

Hagai Cohen

Theor. Comput. Sci., 2010

Pattern matching with don't cares and few errors.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

A filtering algorithm for k-mismatch with don't cares.

[BibT_eX]

[DOI]

Raphaël Clifford

Inf. Process. Lett., 2010

String matching with up to k swaps and mismatches.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Fast computation of a longest increasing subsequence and application.

[BibT_eX]

[DOI]

Maxime Crochemore

Inf. Comput., 2010

A lower bound for dynamic approximate membership data structures.

[BibT_eX]

[DOI]

Shachar Lovett

Electron. Colloquium Comput. Complex., 2010

Fast Pseudo-Random Fingerprints

[BibT_eX]

[DOI]

CoRR, 2010

On the hardness of distance oracle for sparse graph

[BibT_eX]

[DOI]

Hagai Cohen

CoRR, 2010

Path disruption games.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009

Approximate string matching with address bit errors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Efficient computations of l1 and l∞ rearrangement distances.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On the Cost of Interchange Rearrangement in Strings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Pattern matching with address errors: Rearrangement distances.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2009

Real Two Dimensional Scaled Matching.

[BibT_eX]

[DOI]

Algorithmica, 2009

Set Intersection and Sequence Matching.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2009

Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems.

[BibT_eX]

[DOI]

Ralf Herbrich

Proceedings of the String Processing and Information Retrieval, 2009

From coding theory to efficient pattern matching.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Range Non-overlapping Indexing.

[BibT_eX]

[DOI]

Hagai Cohen

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Sketching Techniques for Collaborative Filtering.

[BibT_eX]

[DOI]

Jeffrey S. Rosenschein

Proceedings of the IJCAI 2009, 2009

Exact and Approximate Pattern Matching in the Streaming Model.

[BibT_eX]

[DOI]

Benny Porat

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Explicit Non-Adaptive Combinatorial Group Testing Schemes.

[BibT_eX]

[DOI]

Amir Rothschild

Proceedings of the Search Methodologies, 05.07. - 10.07.2009, 2009

An Optimal Bloom Filter Replacement Based on Matrix Solving.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2009

2008

Pattern matching with pair correlation distance.

[BibT_eX]

[DOI]

Benny Porat

Asaf Zur

Theor. Comput. Sci., 2008

Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2008

L1 pattern matching lower bound.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Approximate matching in the Linfinity metric.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Improved Deterministic Length Reduction

[BibT_eX]

[DOI]

CoRR, 2008

Approximated Pattern Matching with the L1, L2 and Linfinit Metrics.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2008

Approximating general metric distances between a pattern and a text.

[BibT_eX]

[DOI]

Klim Efremenko

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Computing a Longest Increasing Subsequence of Length k in Time O(n log log k).

[BibT_eX]

[DOI]

Maxime Crochemore

Proceedings of the Visions of Computer Science, 2008

Power and stability in connectivity games.

[BibT_eX]

[DOI]

Jeffrey S. Rosenschein

Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

2007

Efficient pebbling for list traversal synopses with application to program rollback.

[BibT_eX]

[DOI]

Yossi Matias

Theor. Comput. Sci., 2007

Efficient one-dimensional real scaled matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

A Filtering Algorithm for k -Mismatch with Don't Cares.

[BibT_eX]

[DOI]

Raphaël Clifford

Proceedings of the String Processing and Information Retrieval, 2007

Jump-Matching with Errors.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2007

Efficient Computations of l1 and linfinity Rearrangement Distances.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2007

Approximate String Matching with Swap and Mismatch.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

k -Mismatch with Don't Cares.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2007

Improved Sketching of Hamming Distance with Error Correcting.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications.

[BibT_eX]

[DOI]

Oren Kapah

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

Function Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Swap and Mismatch Edit Distance.

[BibT_eX]

[DOI]

Estrella Eisenberg

Algorithmica, 2006

Finding the Position of the k-Mismatch and Approximate Tandem Repeats.

[BibT_eX]

[DOI]

Haim Kaplan

Nira Shafrir

Proceedings of the Algorithm Theory, 2006

LTS: The List-Traversal Synopses System.

[BibT_eX]

[DOI]

Michael Furman

Yossi Matias

Proceedings of the Next Generation Information Technologies and Systems, 2006

Approximate Matching in Weighted Sequences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 17th Annual Symposium, 2006

2005

Approximate Matching in the L1 Metric.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004

Faster algorithms for string matching with k mismatches.

[BibT_eX]

[DOI]

J. Algorithms, 2004

Closest Pair Problems in Very High Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Overlap matching.

[BibT_eX]

[DOI]

Inf. Comput., 2003

Efficient Pebbling for List Traversal Synopses.

[BibT_eX]

[DOI]

Yossi Matias

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Function Matching: Algorithms, Applications, and a Lower Bound.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Approximate swapped matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

2001

A faster implementation of the Goemans-Williamson clustering algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximate subset matching with Don't Cares.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Faster algorithms for string matching with k mismatches.

[BibT_eX]

[DOI]