2013
55Forty Years of Text Indexing. Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan. CPM 2013, 1-10. Web SearchBibTeXDownload
54Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound). Martin Farach-Colton, Antonio Fernández Anta, Miguel A. Mosteiro. Theor. Comput. Sci. (472): 60-80 (2013). Web SearchBibTeXDownload
2012
53Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks. LATIN 2012, 303-314. Web SearchBibTeXDownload
52Don't Thrash: How to Cache Your Hash on Flash. Michael A. Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Erez Zadok. PVLDB (5): 1627-1637 (2012). Web SearchBibTeXDownload
2011
51Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro. CoRR (abs/1109.4373) (2011). Web SearchBibTeXDownload
50Opportunistic Information. Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks. CoRR (abs/1105.6151) (2011). Web SearchBibTeXDownload
49Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization vs. Determinism. Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks. DISC 2011, 202-204. Web SearchBibTeXDownload
2009
48Bootstrapping a hop-optimal network in the weak sensor model. Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro. ACM Transactions on Algorithms (5) (2009). Web SearchBibTeXDownload
47Efficient and Robust Prediction Algorithms for Protein Complexes Using Gomory-Hu Trees. Antonina Mitrofanova, Martin Farach-Colton, Bud Mishra. Pacific Symposium on Biocomputing 2009, 215-226. Web SearchBibTeXDownload
2008
46Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics. Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos. ACM Transactions on Algorithms (4) (2008). Web SearchBibTeXDownload
45A Linear Delay Algorithm for Building Concept Lattices. Martin Farach-Colton, Yang Huang. CPM 2008, 204-216. Web SearchBibTeXDownload
44Fast and compact regular expression matching. Philip Bille, Martin Farach-Colton. Theor. Comput. Sci. (409): 486-496 (2008). Web SearchBibTeXDownload
2007
43Introduction to SODA 2002 and 2003 special issue. Harold N. Gabow, Michael A. Bender, Martin Farach-Colton. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
42Sensor Network Gossiping or How to Break the Broadcast Lower Bound. Martin Farach-Colton, Miguel A. Mosteiro. ISAAC 2007, 232-243. Web SearchBibTeXDownload
41Optimal spaced seeds for faster approximate string matching. Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur. J. Comput. Syst. Sci. (73): 1035-1044 (2007). Web SearchBibTeXDownload
40Lattice based Clustering of Temporal Gene-Expression Matrices. Yang Huang, Martin Farach-Colton. SDM 2007. Web SearchBibTeXDownload
39Cache-oblivious streaming B-trees. Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson. SPAA 2007, 81-92. Web SearchBibTeXDownload
38Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. Martin Farach-Colton, Miguel A. Mosteiro. WADS 2007, 565-576. Web SearchBibTeXDownload
2006
37On the Complexity of Ordinal Clustering. Rahul Shah, Martin Farach-Colton. J. Classification (23): 79-102 (2006). Web SearchBibTeXDownload
36Lower Bounds for Clear Transmissions in Radio Networks. Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro. LATIN 2006, 447-454. Web SearchBibTeXDownload
35Cache-oblivious string B-trees. Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul. PODS 2006, 233-242. Web SearchBibTeXDownload
34Insertion Sort is O(n log n). Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro. Theory Comput. Syst. (39): 391-397 (2006). Web SearchBibTeXDownload
2005
33Fast and Compact Regular Expression Matching. Philip Bille, Martin Farach-Colton. CoRR (abs/cs/0509069) (2005). Web SearchBibTeXDownload
32Bootstrapping a Hop-Optimal Network in the Weak Sensor Model. Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro. ESA 2005, 827-838. Web SearchBibTeXDownload
31Optimal Spaced Seeds for Faster Approximate String Matching. Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur. ICALP 2005, 1251-1262. Web SearchBibTeXDownload
30Lowest common ancestors in trees and directed acyclic graphs. Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin. J. Algorithms (57): 75-94 (2005). Web SearchBibTeXDownload
29Cache-Oblivious B-Trees. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton. SIAM J. Comput. (35): 341-358 (2005). Web SearchBibTeXDownload
28Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos. SODA 2005, 650-659. Web SearchBibTeXDownload
27Adversarial contention resolution for simple channels. Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson. SPAA 2005, 325-332. Web SearchBibTeXDownload
2004
26Insertion Sort is O(n log n). Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro. CoRR (cs.DS/0407003) (2004). Web SearchBibTeXDownload
25Adversarial Analyses of Window Backoff Strategies. Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson. IPDPS Next Generation Software Program - NSFNGS - PI Workshop 2004. Web SearchBibTeXDownload
24Discovering temporal relations in molecular pathways using protein-protein interactions. Martin Farach-Colton, Yang Huang, John L. L. Woolford. RECOMB 2004, 150-156. Web SearchBibTeXDownload
23The Level Ancestor Problem simplified. Michael A. Bender, Martin Farach-Colton. Theor. Comput. Sci. (321): 5-12 (2004). Web SearchBibTeXDownload
22Finding frequent items in data streams. Moses Charikar, Kevin Chen, Martin Farach-Colton. Theor. Comput. Sci. (312): 3-15 (2004). Cited by 15Web SearchBibTeXDownload
2003
21Barnacle: An Assembly Algorithm for Clone-based Sequences of Whole Genomes. Vicky Choi, Martin Farach-Colton. CoRR (cs.DS/0302005) (2003). Web SearchBibTeXDownload
20Adventures at Google. Martin Farach-Colton. ENC 2003, 3. Web SearchBibTeXDownload
2002
19Fast, Fair and Frugal Bandwidth Allocation in ATM Networks. Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang. Algorithmica (33): 272-286 (2002). Web SearchBibTeXDownload
18Efficient Tree Layout in a Multilevel Memory Hierarchy. Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup. ESA (cs.DS/0211010): 165-173 (2002). Web SearchBibTeXDownload
17Two Simplified Algorithms for Maintaining Order in a List. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito. ESA 2002, 152-164. Web SearchBibTeXDownload
16Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton. ESA 2002, 139-151. Web SearchBibTeXDownload
15Finding Frequent Items in Data Streams. Moses Charikar, Kevin Chen, Martin Farach-Colton. ICALP 2002, 693-703. Web SearchBibTeXDownload
14The Level Ancestor Problem Simplified. Michael A. Bender, Martin Farach-Colton. LATIN 2002, 508-515. Web SearchBibTeXDownload
13Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. Rahul Shah, Martin Farach-Colton. SODA 2002, 108-115. Web SearchBibTeXDownload
2001
12On the midpath tree conjuncture: a counter-example. Rahul Shah, Martin Farach-Colton. SODA 2001, 208-209. Web SearchBibTeXDownload
2000
11COFE: A Scalable Method for Feature Extraction from Complex Objects. Gabriela Hristescu, Martin Farach-Colton. DaWaK 2000, 358-371. Web SearchBibTeXDownload
10Cache-Oblivious B-Trees. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton. FOCS 2000, 399-409. Web SearchBibTeXDownload
9On the sorting-complexity of suffix tree construction. Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan. J. ACM (47): 987-1011 (2000). Cited by 96Web SearchBibTeXDownload
8On Local Register Allocation. Martin Farach-Colton, Vincenzo Liberatore. J. Algorithms (37): 37-65 (2000). Web SearchBibTeXDownload
7NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees. Kevin Chen, Dannie Durand, Martin Farach-Colton. Journal of Computational Biology (7): 429-447 (2000). Web SearchBibTeXDownload
6The LCA Problem Revisited. Michael A. Bender, Martin Farach-Colton. LATIN 2000, 88-94. Web SearchBibTeXDownload
5Notung: dating gene duplications using gene family trees. Kevin Chen, Dannie Durand, Martin Farach-Colton. RECOMB 2000, 96-106. Web SearchBibTeXDownload
4An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa M. Przytycka, Mikkel Thorup. SIAM J. Comput. (30): 1385-1404 (2000). Web SearchBibTeXDownload
1999
3Evaluation of Algorithms for Local Register Allocation. Vincenzo Liberatore, Martin Farach-Colton, Ulrich Kremer. CC 1999, 137-152. Web SearchBibTeXDownload
2Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. Martin Farach-Colton, Piotr Indyk. FOCS 1999, 171-180. Cited by 24Web SearchBibTeXDownload
1Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks. Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang. SODA 1999, 92-101. Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ Untitled Document - Retrieved 2013-05-13 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research