The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Vincenzo Liberatore, Martin Farach-Colton, Ulrich Kremer
    Evaluation of Algorithms for Local Register Allocation. [Citation Graph (0, 0)][DBLP]
    CC, 1999, pp:137-152 [Conf]
  2. Gabriela Hristescu, Martin Farach-Colton
    COFE: A Scalable Method for Feature Extraction from Complex Objects. [Citation Graph (0, 0)][DBLP]
    DaWaK, 2000, pp:358-371 [Conf]
  3. Martin Farach-Colton
    Adventures at Google. [Citation Graph (0, 0)][DBLP]
    ENC, 2003, pp:3- [Conf]
  4. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton
    Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:139-151 [Conf]
  5. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito
    Two Simplified Algorithms for Maintaining Order in a List. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:152-164 [Conf]
  6. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Efficient Tree Layout in a Multilevel Memory Hierarchy. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:165-173 [Conf]
  7. Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro
    Bootstrapping a Hop-Optimal Network in the Weak Sensor Model. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:827-838 [Conf]
  8. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Cache-Oblivious B-Trees. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:399-409 [Conf]
  9. Martin Farach-Colton, Piotr Indyk
    Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:171-180 [Conf]
  10. Moses Charikar, Kevin Chen, Martin Farach-Colton
    Finding Frequent Items in Data Streams. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:693-703 [Conf]
  11. Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur
    Optimal Spaced Seeds for Faster Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1251-1262 [Conf]
  12. Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson
    Adversarial Analyses of Window Backoff Strategies. [Citation Graph (0, 0)][DBLP]
    IPDPS Next Generation Software Program - NSFNGS - PI Workshop, 2004, pp:- [Conf]
  13. Michael A. Bender, Martin Farach-Colton
    The LCA Problem Revisited. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:88-94 [Conf]
  14. Michael A. Bender, Martin Farach-Colton
    The Level Ancestor Problem Simplified. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:508-515 [Conf]
  15. Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro
    Lower Bounds for Clear Transmissions in Radio Networks. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:447-454 [Conf]
  16. Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul
    Cache-oblivious string B-trees. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:233-242 [Conf]
  17. Kevin Chen, Dannie Durand, Martin Farach-Colton
    Notung: dating gene duplications using gene family trees. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2000, pp:96-106 [Conf]
  18. Martin Farach-Colton, Yang Huang, John L. L. Woolford
    Discovering temporal relations in molecular pathways using protein-protein interactions. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2004, pp:150-156 [Conf]
  19. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:650-659 [Conf]
  20. Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang
    Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:92-101 [Conf]
  21. Rahul Shah, Martin Farach-Colton
    On the midpath tree conjuncture: a counter-example. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:208-209 [Conf]
  22. Rahul Shah, Martin Farach-Colton
    Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:108-115 [Conf]
  23. Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson
    Adversarial contention resolution for simple channels. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:325-332 [Conf]
  24. Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang
    Fast, Fair and Frugal Bandwidth Allocation in ATM Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:3, pp:272-286 [Journal]
  25. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  26. Vicky Choi, Martin Farach-Colton
    Barnacle: An Assembly Algorithm for Clone-based Sequences of Whole Genomes [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  27. Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro
    Insertion Sort is O(n log n) [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  28. Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan
    On the sorting-complexity of suffix tree construction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:6, pp:987-1011 [Journal]
  29. Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin
    Lowest common ancestors in trees and directed acyclic graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:57, n:2, pp:75-94 [Journal]
  30. Martin Farach-Colton, Vincenzo Liberatore
    On Local Register Allocation. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:1, pp:37-65 [Journal]
  31. Kevin Chen, Dannie Durand, Martin Farach-Colton
    NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2000, v:7, n:3-4, pp:429-447 [Journal]
  32. Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro
    Insertion Sort is O(n log n). [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:391-397 [Journal]
  33. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Cache-Oblivious B-Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:341-358 [Journal]
  34. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1385-1404 [Journal]
  35. Michael A. Bender, Martin Farach-Colton
    The Level Ancestor Problem simplified. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:1, pp:5-12 [Journal]
  36. Moses Charikar, Kevin Chen, Martin Farach-Colton
    Finding frequent items in data streams. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:1, pp:3-15 [Journal]
  37. Yang Huang, Martin Farach-Colton
    Lattice based Clustering of Temporal Gene-Expression Matrices. [Citation Graph (0, 0)][DBLP]
    SDM, 2007, pp:- [Conf]
  38. Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson
    Cache-oblivious streaming B-trees. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:81-92 [Conf]
  39. Martin Farach-Colton, Miguel A. Mosteiro
    Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:565-576 [Conf]
  40. Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur
    Optimal spaced seeds for faster approximate string matching. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:7, pp:1035-1044 [Journal]
  41. Mary Cryan, Martin Farach-Colton
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:85- [Journal]

  42. A Linear Delay Algorithm for Building Concept Lattices. [Citation Graph (, )][DBLP]


  43. Sensor Network Gossiping or How to Break the Broadcast Lower Bound. [Citation Graph (, )][DBLP]


  44. Fast and Compact Regular Expression Matching [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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