Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Farach-Colton, Martin - Department of Computer Science, Rutgers University
On the Complexity of Ordinal Clustering Rahul Shah? and Martin Farach-Colton??
Efficient Algorithms for Inverting Evolution Martin Farach
Optimal Parallel Randomized Renaming Martin Farach
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Efficient 2-dimensional Approximate Matching of Non-rectangular Figures
Notung: Dating Gene Duplications using Gene Family Trees Kevin Chen,
Evaluation of Algorithms for Local Register Vincenzo Liberatore1
Discovering Temporal Relations in Molecular Pathways Using Protein-Protein Interactions
! " #$%& '()0 " 34567 89@4ABCD EFGH4I PFGF59Q8@RH@IA
' ( ) 0 1 2 3 1 4 5 1 6 1 7 8 9 @ A ' B 8 C @ D E
Optimal Logarithmic Time Randomized Suffix Tree Construction Martin Farach
Optimal Superprimitivity Testing for Alberto Apostolico
Notung: A Program for Dating Gene Duplications and Optimizing Gene Family Trees
Alphabet Dependence in Parameterized Matching Amihood Amir
Finding Frequent Items in Data Streams Moses Charikar 1
Cofe: A Scalable Method for Feature Extraction from Complex Objects
Two Dimensional Dictionary Matching Amihood Amir
Spring 1995 Farach CS 513: Exam #1
