Martin Farach - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 56 from 56

2003

Randomization, Persuasiveness and Rigor in ProofsCatherine Womach, Martin Farach. synthese, 134(1-2):71-84, 2003. [doi]

1999

On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup. SICOMP, 28(3):1073-1085, 1999.

Efficient Algorithms for Inverting EvolutionMartin Farach, Sampath Kannan. JACM, 46(4):437-449, 1999. [doi]

1998

Optimal Parallel Two Dimensional Text Searching on a CREW PRAMAmihood Amir, Gary Benson, Martin Farach. iandc, 144(1):1-17, 1998.

On Local Register AllocationMartin Farach, Vincenzo Liberatore. soda 1998: 564-573

String Matching in Lempel-Ziv Compressed StringsMartin Farach, Mikkel Thorup. algorithmica, 20(4):388-404, 1998.

Overcoming the Memory Bottleneck in Suffix Tree ConstructionMartin Farach, Paolo Ferragina, S. Muthukrishnan. focs 1998: 174-185 [doi]

1997

Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP modelRicha Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, S. Muthukrishnan, Steven Skiena. recomb 1997: 1-2 [doi]

Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP ModelRicha Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, Steven Skiena. soda 1997: 390-399

Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP ModelRicha Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Sridhar Hannenhalli, Martin Farach, S. Muthukrishnan, Steven Skiena. jcb, 4(3):275-296, 1997.

Nearly Tight Bounds on the Learnability of EvolutionAndris Ambainis, Richard Desper, Martin Farach, Sampath Kannan. focs 1997: 524-533 [doi]

Two dimensional matchingAmihood Amir, Martin Farach. In Alberto Apostolico, Zvi Galil, editors, Pattern Matching Algorithms. pages 267-292, Oxford University Press, 1997.

Optimal Two-Dimensional Compressed MatchingAmihood Amir, Gary Benson, Martin Farach. jal, 24(2):354-379, 1997.

Numerical Taxonomy on Data: Experimental ResultsJaime Cohen, Martin Farach. jcb, 4(4):547-558, 1997.

Numerical taxonomy on data (abstract): experimental resultsJaime Cohen, Martin Farach. recomb 1997: 98 [doi]

Numerical Taxonomy on Data: Experimental ResultsJaime Cohen, Martin Farach. soda 1997: 410-417

Optimal Parallel Randomized RenamingMartin Farach, S. Muthukrishnan. ipl, 61(1):7-10, 1997. [doi]

Optimal Suffix Tree Construction with Large AlphabetsMartin Farach. focs 1997: 137-143 [doi]

Recognizing Circular Decompossible MetricsMartin Farach. jcb, 4(2):157-162, 1997.

Group testing problems with sequences in experimental molecular biologyMartin Farach, Sampath Kannan, E. Knill, S. Muthukrishnan. sequences 1997: 357-367 [doi]

Sparse Dynamic Programming for Evolutionary-Tree ComparisonMartin Farach, Mikkel Thorup. SICOMP, 26(1):210-230, 1997.

DNA Strand Separation Prediction: A Parallel ImplementationGabriela Hristescu, Craig J. Benham, Martin Farach. pdpta 1997: 610-619

1996

1995

Efficient 2-Dimensional Approximate Matching of Half-Rectangular FiguresAmihood Amir, Martin Farach. iandc, 118(1):1-11, April 1995.

Improved Dynamic Dictionary MatchingAmihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer. iandc, 119(2):258-282, June 1995.

On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid ConvergenceMartin Farach, Michiel O. Noordewier, Serap A. Savari, Larry A. Shepp, Aaron D. Wyner, Jacob Ziv. soda 1995: 48-57

Optimal Parallel Dictionary Matching and Compression (Extended Abstract)Martin Farach, S. Muthukrishnan. spaa 1995: 244-253 [doi]

A Robust Model for Finding Optimal Evolutionary TreesMartin Farach, Sampath Kannan, Tandy Warnow. algorithmica, 13(1/2):155-179, 1995.

String matching in Lempel-Ziv compressed stringsMartin Farach, Mikkel Thorup. stoc 1995: 703-712 [doi]

Fast Comparison of Evolutionary TreesMartin Farach, Mikkel Thorup. iandc, 123(1):29-37, 1995.

Computing the Agreement of Trees with Bounded DegreesMartin Farach, Teresa M. Przytycka, Mikkel Thorup. esa 1995: 381-393

On the Agreement of Many TreesMartin Farach, Teresa M. Przytycka, Mikkel Thorup. ipl, 55(6):297-301, 1995. [doi]

1994

Optimal Two-Dimensional Compressed MatchingAmihood Amir, Gary Benson, Martin Farach. icalp 1994: 215-226

Let Sleeping Files Lie: Pattern Matching in Z-compressed FilesAmihood Amir, Gary Benson, Martin Farach. soda 1994: 705-714

Alphabet Dependence in Parameterized MatchingAmihood Amir, Martin Farach, S. Muthukrishnan. ipl, 49(3):111-115, 1994.

An Alphabet Independent Approach to Two-Dimensional Pattern MatchingAmihood Amir, Gary Benson, Martin Farach. SICOMP, 23(2):313-323, 1994.

Dynamic Dictionary MatchingAmihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park. jcss, 49(2):208-222, 1994.

Fast Comparison of Evolutionary TreesMartin Farach, Mikkel Thorup. soda 1994: 481-488

Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract)Martin Farach, Mikkel Thorup. focs 1994: 770-779

An Efficient Algorithm for Dynamic Text IndexingMing Gu, Martin Farach, Richard Beigel. soda 1994: 697-704

1993

Optimal Parallel Two Dimensional Pattern MatchingAmihood Amir, Gary Benson, Martin Farach. spaa 1993: 79-85 [doi]

Improved Dynamic Dictionary MatchingAmihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer. soda 1993: 392-401

A robust model for finding optimal evolutionary treesMartin Farach, Sampath Kannan, Tandy Warnow. stoc 1993: 137-145 [doi]

1992

Alphabet Independent Two Dimensional MatchingAmihood Amir, Gary Benson, Martin Farach. stoc 1992: 59-68

Two-Dimensional Dictionary MatchingAmihood Amir, Martin Farach. ipl, 44(5):233-239, 1992.

Efficient Randomized Dictionary Matching Algorithms (Extended Abstract)Amihood Amir, Martin Farach, Yossi Matias. cpm 1992: 262-275

1991

Adaptive Dictionary MatchingAmihood Amir, Martin Farach. focs 1991: 760-766

Efficient 2-dimensional Approximate Matching of Non-Rectangular FiguresAmihood Amir, Martin Farach. soda 1991: 212-223

Efficient matching of nonrectangular shapesAmihood Amir, Martin Farach. AMAI, 4:211-224, 1991.

Optimal Superprimitivity Testing for StringsAlberto Apostolico, Martin Farach, Costas S. Iliopoulos. ipl, 39(1):17-20, 1991.

1989

Generating plausible diagnostic hypotheses with self-processing causal networksJonathan Wald, Martin Farach, Malle A. Tagamets, James A. Reggia. jetai, 1(2):91-112, 1989. [doi]

All Publications

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Martin Farach'

Viewing Publication 1 - 56 from 56

2003

1999

1998

1997

1996

1995

1994

1993

1992

1991

1989

All Publications

Filter by YearOR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Martin Farach'

Viewing Publication 1 - 56 from 56

2003

1999

1998

1997

1996

1995

1994

1993

1992

1991

1989

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1