| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks |
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism.  |
LATIN  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks |
Opportunistic Information |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro |
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro |
Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. |
OPODIS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks |
Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. |
DISC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro |
Bootstrapping a hop-optimal network in the weak sensor model. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonina Mitrofanova, Martin Farach-Colton, Bud Mishra |
Efficient and Robust Prediction Algorithms for Protein Complexes Using Gomory-Hu Trees. |
Pacific Symposium on Biocomputing |
2009 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Martin Farach-Colton |
Fast and compact regular expression matching. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos |
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
ordinal embedding, Metrics, distortion, relaxation |
| 1 | Martin Farach-Colton, Yang Huang |
A Linear Delay Algorithm for Building Concept Lattices. |
CPM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mary Cryan, Martin Farach-Colton |
Preface. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Harold N. Gabow, Michael A. Bender, Martin Farach-Colton |
Introduction to SODA 2002 and 2003 special issue. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur |
Optimal spaced seeds for faster approximate string matching. |
J. Comput. Syst. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yang Huang, Martin Farach-Colton |
Lattice based Clustering of Temporal Gene-Expression Matrices. |
SDM |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Farach-Colton, Miguel A. Mosteiro |
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson |
Cache-oblivious streaming B-trees. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
buffered repository tree, cache-oblivious B-tree, cascading array, deamortized, lookahead array, shuttle tree |
| 1 | Martin Farach-Colton, Miguel A. Mosteiro |
Sensor Network Gossiping or How to Break the Broadcast Lower Bound. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Shah, Martin Farach-Colton |
On the Complexity of Ordinal Clustering. |
J. Classification |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro |
Insertion Sort is O(n log n). |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro |
Lower Bounds for Clear Transmissions in Radio Networks. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
Station selection, Wake up, Weak Sensor Model, ACM-class: F.2.2, Sensor network, Ad-hoc network, Lower bound, Broadcast, Dominating set, Leader election, Radio network, Maximal independent set, Contention resolution, Random geometric graphs |
| 1 | Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul |
Cache-oblivious string B-trees. |
PODS |
2006 |
DBLP DOI BibTeX RDF |
cache oblivious string B-tree, locality preserving front compression, packed-memory array, rebalance, range query |
| 1 | Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin |
Lowest common ancestors in trees and directed acyclic graphs. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Martin Farach-Colton |
Fast and Compact Regular Expression Matching |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael A. Bender, Erik D. Demaine, Martin Farach-Colton |
Cache-Oblivious B-Trees. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro |
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos |
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur |
Optimal Spaced Seeds for Faster Approximate String Matching. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson |
Adversarial contention resolution for simple channels. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
exponential backoff, polynomial backoff, worst-case backoff performance, on-line, batch |
| 1 | Michael A. Bender, Martin Farach-Colton |
The Level Ancestor Problem simplified. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Kevin Chen, Martin Farach-Colton |
Finding frequent items in data streams. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro |
Insertion Sort is O(n log n) |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson |
Adversarial Analyses of Window Backoff Strategies. |
IPDPS Next Generation Software Program - NSFNGS - PI Workshop |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton (eds.) |
LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings |
LATIN |
2004 |
DBLP BibTeX RDF |
|
| 1 | Martin Farach-Colton, Yang Huang, John L. L. Woolford |
Discovering temporal relations in molecular pathways using protein-protein interactions. |
RECOMB |
2004 |
DBLP DOI BibTeX RDF |
molecular pathways, probe interval graphs, ribosomal assembly pathway, vertex ordering, interval graphs, protein-protein interaction |
| 1 | Vicky Choi, Martin Farach-Colton |
Barnacle: An Assembly Algorithm for Clone-based Sequences of Whole Genomes |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Martin Farach-Colton |
Adventures at Google. |
ENC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang |
Fast, Fair and Frugal Bandwidth Allocation in ATM Networks. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
ABR/MCR traffic, Convergence, ATM networks, Bandwidth allocation, Max-min fairness |
| 1 | Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup |
Efficient Tree Layout in a Multilevel Memory Hierarchy |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton |
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito |
Two Simplified Algorithms for Maintaining Order in a List. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Erik D. Demaine, Martin Farach-Colton |
Efficient Tree Layout in a Multilevel Memory Hierarchy. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Shah, Martin Farach-Colton |
Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Kevin Chen, Martin Farach-Colton |
Finding Frequent Items in Data Streams. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Martin Farach-Colton |
The Level Ancestor Problem Simplified. |
LATIN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Shah, Martin Farach-Colton |
On the midpath tree conjuncture: a counter-example. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Chen, Dannie Durand, Martin Farach-Colton |
NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees. |
Journal of Computational Biology |
2000 |
DBLP BibTeX RDF |
|
| 1 | Martin Farach-Colton, Vincenzo Liberatore |
On Local Register Allocation. |
J. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan |
On the sorting-complexity of suffix tree construction. |
J. ACM |
2000 |
DBLP DOI BibTeX RDF |
DAM model, RAM model, sorting complexity, suffix tree, suffix array, external-memory data structures |
| 1 | Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup |
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriela Hristescu, Martin Farach-Colton |
COFE: A Scalable Method for Feature Extraction from Complex Objects. |
DaWaK |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Martin Farach-Colton |
The LCA Problem Revisited. |
LATIN |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Erik D. Demaine, Martin Farach-Colton |
Cache-Oblivious B-Trees. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
cache-oblivious B-trees, dynamic search-tree data structures, optimal search bound, amortized memory transfers, computational complexity, memory hierarchy, cache storage, tree data structures, insertions, deletions, tree searching, hierarchical memory, worst-case bounds |
| 1 | Kevin Chen, Dannie Durand, Martin Farach-Colton |
Notung: dating gene duplications using gene family trees. |
RECOMB |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Sampath Kannan |
Efficient Algorithms for Inverting Evolution. |
J. ACM |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup |
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang |
Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincenzo Liberatore, Martin Farach-Colton, Ulrich Kremer |
Evaluation of Algorithms for Local Register Allocation. |
CC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Piotr Indyk |
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Mikkel Thorup |
String Matching in Lempel-Ziv Compressed Strings. |
Algorithmica |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gary Benson, Martin Farach |
Optimal Parallel Two Dimensional Text Searching on a CREW PRAM. |
Inf. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Vincenzo Liberatore |
On Local Register Allocation. |
SODA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Paolo Ferragina, S. Muthukrishnan |
Overcoming the Memory Bottleneck in Suffix Tree Construction. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
External-Memory Computation, Data Structures, String Matching, Models of Computation |
| 1 | Martin Farach-Colton (eds.) |
Combinatorial Pattern Matching, 9th Annual Symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings |
CPM |
1998 |
DBLP BibTeX RDF |
|
| 1 | Martin Farach, S. Muthukrishnan |
Optimal Parallel Randomized Renaming. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaime Cohen, Martin Farach |
Numerical Taxonomy on Data: Experimental Results. |
Journal of Computational Biology |
1997 |
DBLP BibTeX RDF |
|
| 1 | Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Sridhar Hannenhalli, Martin Farach, S. Muthukrishnan, Steven Skiena |
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. |
Journal of Computational Biology |
1997 |
DBLP BibTeX RDF |
|
| 1 | Martin Farach |
Recognizing Circular Decompossible Metrics. |
Journal of Computational Biology |
1997 |
DBLP BibTeX RDF |
|
| 1 | Amihood Amir, Gary Benson, Martin Farach |
Optimal Two-Dimensional Compressed Matching. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Mikkel Thorup |
Sparse Dynamic Programming for Evolutionary-Tree Comparison. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaime Cohen, Martin Farach |
Numerical Taxonomy on Data: Experimental Results. |
SODA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, Steven Skiena |
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. |
SODA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriela Hristescu, Craig J. Benham, Martin Farach |
DNA Strand Separation Prediction: A Parallel Implementation. |
PDPTA |
1997 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan |
Nearly Tight Bounds on the Learnability of Evolution. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
nearly tight bounds, evolution learnability, Cavender-Farris trees, edge weighted trees, Phylogeny Construction Problem, CF tree, computationally expensive, genetic algorithms, maximum likelihood estimator, stochastic process, DNA, convergence rate, random variable |
| 1 | Martin Farach |
Optimal Suffix Tree Construction with Large Alphabets. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
large alphabets, combinatorial pattern matching, integer alphabet, integer alphabets, data structure, pattern matching, sorting, suffix tree |
| 1 | Jaime Cohen, Martin Farach |
Numerical taxonomy on data (abstract): experimental results. |
RECOMB |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, S. Muthukrishnan, Steven Skiena |
Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. |
RECOMB |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gary Benson, Martin Farach |
Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | George Christopher, Martin Farach, Michael A. Trick |
The Structure of Circular Decomposable Metrics. |
ESA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Richa Agarwala, Vineet Bafna, Martin Farach, Babu O. Narayanan, Mike Paterson, Mikkel Thorup |
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, S. Muthukrishnan |
Optimal Logarithmic Time Randomized Suffix Tree Construction. |
ICALP |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, S. Muthukrishnan |
Perfect Hashing for Strings: Formalization and Algorithms. |
CPM |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Sampath Kannan |
Efficient Algorithms for Inverting Evolution. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Teresa M. Przytycka, Mikkel Thorup |
On the Agreement of Many Trees. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Sampath Kannan, Tandy Warnow |
A Robust Model for Finding Optimal Evolutionary Trees. |
Algorithmica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Martin Farach |
Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Mikkel Thorup |
Fast Comparison of Evolutionary Trees. |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer |
Improved Dynamic Dictionary Matching |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Teresa M. Przytycka, Mikkel Thorup |
Computing the Agreement of Trees with Bounded Degrees. |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Michiel O. Noordewier, Serap A. Savari, Larry A. Shepp, Aaron D. Wyner, Jacob Ziv |
On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence. |
SODA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, S. Muthukrishnan |
Optimal Parallel Dictionary Matching and Compression (Extended Abstract). |
SPAA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Mikkel Thorup |
String matching in Lempel-Ziv compressed strings. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Martin Farach, S. Muthukrishnan |
Alphabet Dependence in Parameterized Matching. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park |
Dynamic Dictionary Matching. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gary Benson, Martin Farach |
An Alphabet Independent Approach to Two-Dimensional Pattern Matching. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Mikkel Thorup |
Fast Comparison of Evolutionary Trees. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gary Benson, Martin Farach |
Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming Gu, Martin Farach, Richard Beigel |
An Efficient Algorithm for Dynamic Text Indexing. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gary Benson, Martin Farach |
Optimal Two-Dimensional Compressed Matching. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach, Mikkel Thorup |
Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
evolutionary tree comparison, sparse dynamic programming, Maximum Agreement Subtree Problem, sparsification follows, Unary Weighted Bipartite Matching, dynamic program, computational biology |
| 1 | Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer |
Improved Dynamic Dictionary Matching. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")