The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Farach: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amihood Amir, Martin Farach
    Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. [Citation Graph (1, 0)][DBLP]
    SODA, 1991, pp:212-223 [Conf]
  2. Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park
    Dynamic Dictionary Matching. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:2, pp:208-222 [Journal]
  3. Martin Farach, S. Muthukrishnan
    Perfect Hashing for Strings: Formalization and Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:130-140 [Conf]
  4. Amihood Amir, Martin Farach, Yossi Matias
    Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CPM, 1992, pp:262-275 [Conf]
  5. George Christopher, Martin Farach, Michael A. Trick
    The Structure of Circular Decomposable Metrics. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:486-500 [Conf]
  6. Martin Farach, Teresa M. Przytycka, Mikkel Thorup
    Computing the Agreement of Trees with Bounded Degrees. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:381-393 [Conf]
  7. Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan
    Nearly Tight Bounds on the Learnability of Evolution. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:524-533 [Conf]
  8. Amihood Amir, Martin Farach
    Adaptive Dictionary Matching [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:760-766 [Conf]
  9. Martin Farach
    Optimal Suffix Tree Construction with Large Alphabets. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:137-143 [Conf]
  10. Martin Farach, Paolo Ferragina, S. Muthukrishnan
    Overcoming the Memory Bottleneck in Suffix Tree Construction. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:174-185 [Conf]
  11. Martin Farach, Mikkel Thorup
    Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:770-779 [Conf]
  12. Amihood Amir, Gary Benson, Martin Farach
    Optimal Two-Dimensional Compressed Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:215-226 [Conf]
  13. Martin Farach, S. Muthukrishnan
    Optimal Logarithmic Time Randomized Suffix Tree Construction. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:550-561 [Conf]
  14. Gabriela Hristescu, Craig J. Benham, Martin Farach
    DNA Strand Separation Prediction: A Parallel Implementation. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1997, pp:610-619 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:1-2 [Conf]
  16. Jaime Cohen, Martin Farach
    Numerical taxonomy on data (abstract): experimental results. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:98- [Conf]
  17. Amihood Amir, Gary Benson, Martin Farach
    Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:705-714 [Conf]
  18. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:390-399 [Conf]
  19. Richa Agarwala, Vineet Bafna, Martin Farach, Babu O. Narayanan, Mike Paterson, Mikkel Thorup
    On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:365-372 [Conf]
  20. Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer
    Improved Dynamic Dictionary Matching. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:392-401 [Conf]
  21. Jaime Cohen, Martin Farach
    Numerical Taxonomy on Data: Experimental Results. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:410-417 [Conf]
  22. Martin Farach, Vincenzo Liberatore
    On Local Register Allocation. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:564-573 [Conf]
  23. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:48-57 [Conf]
  24. Martin Farach, Mikkel Thorup
    Fast Comparison of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:481-488 [Conf]
  25. Ming Gu, Martin Farach, Richard Beigel
    An Efficient Algorithm for Dynamic Text Indexing. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:697-704 [Conf]
  26. Amihood Amir, Gary Benson, Martin Farach
    Optimal Parallel Two Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:79-85 [Conf]
  27. Martin Farach, S. Muthukrishnan
    Optimal Parallel Dictionary Matching and Compression (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:244-253 [Conf]
  28. Amihood Amir, Gary Benson, Martin Farach
    Alphabet Independent Two Dimensional Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:59-68 [Conf]
  29. Martin Farach, Sampath Kannan
    Efficient Algorithms for Inverting Evolution. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:230-236 [Conf]
  30. Martin Farach, Sampath Kannan, Tandy Warnow
    A robust model for finding optimal evolutionary trees. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:137-145 [Conf]
  31. Martin Farach, Mikkel Thorup
    String matching in Lempel-Ziv compressed strings. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:703-712 [Conf]
  32. Martin Farach, Sampath Kannan, Tandy Warnow
    A Robust Model for Finding Optimal Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:1/2, pp:155-179 [Journal]
  33. Martin Farach, Mikkel Thorup
    String Matching in Lempel-Ziv Compressed Strings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:4, pp:388-404 [Journal]
  34. Amihood Amir, Martin Farach
    Efficient matching of nonrectangular shapes. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1991, v:4, n:, pp:211-224 [Journal]
  35. Amihood Amir, Gary Benson, Martin Farach
    Optimal Parallel Two Dimensional Text Searching on a CREW PRAM. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:144, n:1, pp:1-17 [Journal]
  36. Amihood Amir, Martin Farach
    Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:1, pp:1-11 [Journal]
  37. Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer
    Improved Dynamic Dictionary Matching [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:119, n:2, pp:258-282 [Journal]
  38. Martin Farach, Mikkel Thorup
    Fast Comparison of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:29-37 [Journal]
  39. Amihood Amir, Martin Farach, S. Muthukrishnan
    Alphabet Dependence in Parameterized Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:3, pp:111-115 [Journal]
  40. Amihood Amir, Martin Farach
    Two-Dimensional Dictionary Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:5, pp:233-239 [Journal]
  41. Alberto Apostolico, Martin Farach, Costas S. Iliopoulos
    Optimal Superprimitivity Testing for Strings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:1, pp:17-20 [Journal]
  42. Martin Farach, S. Muthukrishnan
    Optimal Parallel Randomized Renaming. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:1, pp:7-10 [Journal]
  43. Martin Farach, Teresa M. Przytycka, Mikkel Thorup
    On the Agreement of Many Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:6, pp:297-301 [Journal]
  44. Martin Farach, Sampath Kannan
    Efficient Algorithms for Inverting Evolution. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:4, pp:437-449 [Journal]
  45. Amihood Amir, Gary Benson, Martin Farach
    Optimal Two-Dimensional Compressed Matching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:354-379 [Journal]
  46. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:3, pp:275-296 [Journal]
  47. Jaime Cohen, Martin Farach
    Numerical Taxonomy on Data: Experimental Results. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:4, pp:547-558 [Journal]
  48. Martin Farach
    Recognizing Circular Decompossible Metrics. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:2, pp:157-162 [Journal]
  49. Amihood Amir, Gary Benson, Martin Farach
    Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:2, pp:299-307 [Journal]
  50. Amihood Amir, Gary Benson, Martin Farach
    An Alphabet Independent Approach to Two-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:313-323 [Journal]
  51. Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup
    On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:3, pp:1073-1085 [Journal]
  52. Martin Farach, Mikkel Thorup
    Sparse Dynamic Programming for Evolutionary-Tree Comparison. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:210-230 [Journal]

Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002