Martin Farach-Colton

Antonio Fernández Anta

Alessia Milani

Shmuel Zaks

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Don't Thrash: How to Cache Your Hash on Flash.

[BibT_eX]

[DOI]

Proceedings of the 3rd USENIX Workshop on Hot Topics in Storage and File Systems, 2011

2009

Bootstrapping a hop-optimal network in the weak sensor model.

[BibT_eX]

[DOI]

Rohan J. Fernandes

ACM Trans. Algorithms, 2009

Efficient and Robust Prediction Algorithms for Protein Complexes Using Gomory-Hu Trees.

[BibT_eX]

[DOI]

Antonina Mitrofanova

Bud Mishra

Proceedings of the Biocomputing 2009: Proceedings of the Pacific Symposium, 2009

2008

Fast and compact regular expression matching.

[BibT_eX]

[DOI]

Philip Bille

Mohammad Taghi Hajiaghayi

Theor. Comput. Sci., 2008

Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics.

[BibT_eX]

[DOI]

Anastasios Sidiropoulos

ACM Trans. Algorithms, 2008

A Linear Delay Algorithm for Building Concept Lattices.

[BibT_eX]

[DOI]

Yang Huang

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

Preface.

[BibT_eX]

[DOI]

Mary Cryan

Theor. Comput. Sci., 2007

Introduction to SODA 2002 and 2003 special issue.

[BibT_eX]

[DOI]

Harold N. Gabow

ACM Trans. Algorithms, 2007

Optimal spaced seeds for faster approximate string matching.

[BibT_eX]

[DOI]

Gad M. Landau

Süleyman Cenk Sahinalp

Dekel Tsur

J. Comput. Syst. Sci., 2007

Cache-oblivious streaming B-trees.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Lattice based Clustering of Temporal Gene-Expression Matrices.

[BibT_eX]

[DOI]

Yang Huang

Proceedings of the Seventh SIAM International Conference on Data Mining, 2007

Sensor Network Gossiping or How to Break the Broadcast Lower Bound.

[BibT_eX]

[DOI]

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

2006

Insertion Sort is O(n log n).

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

On the Complexity of Ordinal Clustering.

[BibT_eX]

[DOI]

Rahul Shah

J. Classif., 2006

Cache-oblivious string B-trees.

[BibT_eX]

[DOI]

Bradley C. Kuszmaul

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

Lower Bounds for Clear Transmissions in Radio Networks.

[BibT_eX]

[DOI]

Rohan J. Fernandes

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Cache-Oblivious B-Trees.

[BibT_eX]

[DOI]

Erik D. Demaine

SIAM J. Comput., 2005

Lowest common ancestors in trees and directed acyclic graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2005

Adversarial contention resolution for simple channels.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

2004

Finding frequent items in data streams.

[BibT_eX]

[DOI]

Moses Charikar

Kevin C. Chen

Theor. Comput. Sci., 2004

The Level Ancestor Problem simplified.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Discovering temporal relations in molecular pathways using protein-protein interactions.

[BibT_eX]

[DOI]

Yang Huang

John L. L. Woolford

Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004

Adversarial Analyses of Window Backoff Strategies.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Randomization, Persuasiveness and Rigor in Proofs.

[BibT_eX]

[DOI]

Catherine Womach

Synth., 2003

Barnacle: An Assembly Algorithm for Clone-based Sequences of Whole Genomes

[BibT_eX]

[DOI]

Vicky Choi

CoRR, 2003

Adventures at Google.

[BibT_eX]

[DOI]

Proceedings of the 4th Mexican International Conference on Computer Science (ENC 2003), 2003

2002

Efficient Tree Layout in a Multilevel Memory Hierarchy

[BibT_eX]

[DOI]

CoRR, 2002

Fast, Fair and Frugal Bandwidth Allocation in ATM Networks.

[BibT_eX]

[DOI]

Algorithmica, 2002

Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees.

[BibT_eX]

[DOI]

Rahul Shah

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Efficient Tree Layout in a Multilevel Memory Hierarchy.

[BibT_eX]

[DOI]

Erik D. Demaine

Proceedings of the Algorithms, 2002

Two Simplified Algorithms for Maintaining Order in a List.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

On the midpath tree conjuncture: a counter-example.

[BibT_eX]

[DOI]

Rahul Shah

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees.

[BibT_eX]

[DOI]

Kevin C. Chen

Dannie Durand

J. Comput. Biol., 2000

On Local Register Allocation.

[BibT_eX]

[DOI]

Vincenzo Liberatore

J. Algorithms, 2000

On the sorting-complexity of suffix tree construction.

[BibT_eX]

[DOI]

Paolo Ferragina

J. ACM, 2000

Notung: dating gene duplications using gene family trees.

[BibT_eX]

[DOI]

Kevin C. Chen

Dannie Durand

Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, 2000

The LCA Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

COFE: A Scalable Method for Feature Extraction from Complex Objects.

[BibT_eX]

[DOI]

Gabriela Hristescu

Proceedings of the Data Warehousing and Knowledge Discovery, 2000

1999

On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics).

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Efficient Algorithms for Inverting Evolution.

[BibT_eX]

[DOI]

Sampath Kannan

J. ACM, 1999

Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings.

[BibT_eX]

[DOI]

Piotr Indyk

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Evaluation of Algorithms for Local Register Allocation.

[BibT_eX]

[DOI]

Vincenzo Liberatore

Ulrich Kremer

Proceedings of the Compiler Construction, 8th International Conference, 1999

1998

Optimal Parallel Two Dimensional Text Searching on a CREW PRAM.

[BibT_eX]

[DOI]

Inf. Comput., 1998

String Matching in Lempel-Ziv Compressed Strings.

[BibT_eX]

[DOI]

Algorithmica, 1998

Overcoming the Memory Bottleneck in Suffix Tree Construction.

[BibT_eX]

[DOI]

Paolo Ferragina

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Sparse Dynamic Programming for Evolutionary-Tree Comparison.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

Recognizing Circular Decompossible Metrics.

[BibT_eX]

[DOI]

J. Comput. Biol., 1997

Numerical Taxonomy on Data: Experimental Results.

[BibT_eX]

[DOI]

Jaime Cohen

J. Comput. Biol., 1997

Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model.

[BibT_eX]

[DOI]

J. Comput. Biol., 1997

Optimal Two-Dimensional Compressed Matching.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Optimal Parallel Randomized Renaming.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Group testing problems with sequences in experimental molecular biology.

[BibT_eX]

[DOI]

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Numerical taxonomy on data (abstract): experimental results.

[BibT_eX]

[DOI]

Jaime Cohen

Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

DNA Strand Separation Prediction: A Parallel Implementation.

[BibT_eX]

Gabriela Hristescu

Craig J. Benham

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

Optimal Suffix Tree Construction with Large Alphabets.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Nearly Tight Bounds on the Learnability of Evolution.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Two dimensional matching.

[BibT_eX]

Proceedings of the Pattern Matching Algorithms, 1997

1996

Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics).

[BibT_eX]

[DOI]

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

Optimal Logarithmic Time Randomized Suffix Tree Construction.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

The Structure of Circular Decomposable Metrics.

[BibT_eX]

[DOI]

George Christopher

Michael A. Trick

Proceedings of the Algorithms, 1996

Perfect Hashing for Strings: Formalization and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995

Improved Dynamic Dictionary Matching

[BibT_eX]

[DOI]

Ramana M. Idury

Johannes A. La Poutré

Alejandro A. Schäffer

Inf. Comput., June, 1995

Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures

[BibT_eX]

[DOI]

Inf. Comput., April, 1995

On the Agreement of Many Trees.

[BibT_eX]

[DOI]

Teresa M. Przytycka

Inf. Process. Lett., 1995

Fast Comparison of Evolutionary Trees.

[BibT_eX]

[DOI]

Inf. Comput., 1995

A Robust Model for Finding Optimal Evolutionary Trees.

[BibT_eX]

[DOI]

Sampath Kannan

Tandy J. Warnow

Algorithmica, 1995

Optimal Parallel Dictionary Matching and Compression (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence.

[BibT_eX]

[DOI]

Michiel O. Noordewier

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Computing the Agreement of Trees with Bounded Degrees.

[BibT_eX]

[DOI]

Teresa M. Przytycka

Proceedings of the Algorithms, 1995

1994

An Alphabet Independent Approach to Two-Dimensional Pattern Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Dynamic Dictionary Matching.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Alphabet Dependence in Parameterized Matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

An Efficient Algorithm for Dynamic Text Indexing.

[BibT_eX]

[DOI]

Ming Gu

Richard Beigel

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Optimal Parallel Two Dimensional Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1992

Two-Dimensional Dictionary Matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Alphabet Independent Two Dimensional Matching

[BibT_eX]

[DOI]

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Efficient Randomized Dictionary Matching Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Yossi Matias

Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991

Optimal Superprimitivity Testing for Strings.

[BibT_eX]

[DOI]

Alberto Apostolico

Costas S. Iliopoulos

Inf. Process. Lett., 1991

Efficient matching of nonrectangular shapes.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1991

Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Adaptive Dictionary Matching

[BibT_eX]

[DOI]