Martin Farach-Colton

Martin Farach

	2012
110		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: 303-314
	2011
109		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: 202-204
108		Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro: Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution. OPODIS 2011: 513-527
107		Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks: Opportunistic Information CoRR abs/1105.6151: (2011)
106		Paulo Sérgio Almeida, Carlos Baquero, Martin Farach-Colton, Paulo Jesus, Miguel A. Mosteiro: Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution CoRR abs/1109.4373: (2011)
	2009
105		Antonina Mitrofanova, Martin Farach-Colton, Bud Mishra: Efficient and Robust Prediction Algorithms for Protein Complexes Using Gomory-Hu Trees. Pacific Symposium on Biocomputing 2009: 215-226
104		Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro: Bootstrapping a hop-optimal network in the weak sensor model. ACM Transactions on Algorithms 5(4): (2009)
	2008
103		Martin Farach-Colton, Yang Huang: A Linear Delay Algorithm for Building Concept Lattices. CPM 2008: 204-216
102		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 4(4): (2008)
101		Philip Bille, Martin Farach-Colton: Fast and compact regular expression matching. Theor. Comput. Sci. 409(3): 486-496 (2008)
	2007
100		Martin Farach-Colton, Miguel A. Mosteiro: Sensor Network Gossiping or How to Break the Broadcast Lower Bound. ISAAC 2007: 232-243
99		Yang Huang, Martin Farach-Colton: Lattice based Clustering of Temporal Gene-Expression Matrices. SDM 2007
98		Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson: Cache-oblivious streaming B-trees. SPAA 2007: 81-92
97		Martin Farach-Colton, Miguel A. Mosteiro: Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model. WADS 2007: 565-576
96		Harold N. Gabow, Michael A. Bender, Martin Farach-Colton: Introduction to SODA 2002 and 2003 special issue. ACM Transactions on Algorithms 3(4): (2007)
95		Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur: Optimal spaced seeds for faster approximate string matching. J. Comput. Syst. Sci. 73(7): 1035-1044 (2007)
94		Mary Cryan, Martin Farach-Colton: Preface. Theor. Comput. Sci. 382(2): 85 (2007)
	2006
93		Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro: Lower Bounds for Clear Transmissions in Radio Networks. LATIN 2006: 447-454
92		Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul: Cache-oblivious string B-trees. PODS 2006: 233-242
91		Rahul Shah, Martin Farach-Colton: On the Complexity of Ordinal Clustering. J. Classification 23(1): 79-102 (2006)
90		Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro: Insertion Sort is O(n log n). Theory Comput. Syst. 39(3): 391-397 (2006)
	2005
89		Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro: Bootstrapping a Hop-Optimal Network in the Weak Sensor Model. ESA 2005: 827-838
88		Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur: Optimal Spaced Seeds for Faster Approximate String Matching. ICALP 2005: 1251-1262
87		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: 650-659
86		Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson: Adversarial contention resolution for simple channels. SPAA 2005: 325-332
85		Philip Bille, Martin Farach-Colton: Fast and Compact Regular Expression Matching CoRR abs/cs/0509069: (2005)
84		Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2): 75-94 (2005)
83		Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Cache-Oblivious B-Trees. SIAM J. Comput. 35(2): 341-358 (2005)
	2004
82		Martin Farach-Colton: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings Springer 2004
81		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
80		Martin Farach-Colton, Yang Huang, John L. L. Woolford: Discovering temporal relations in molecular pathways using protein-protein interactions. RECOMB 2004: 150-156
79		Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro: Insertion Sort is O(n log n) CoRR cs.DS/0407003: (2004)
78		Moses Charikar, Kevin Chen, Martin Farach-Colton: Finding frequent items in data streams. Theor. Comput. Sci. 312(1): 3-15 (2004)
77		Michael A. Bender, Martin Farach-Colton: The Level Ancestor Problem simplified. Theor. Comput. Sci. 321(1): 5-12 (2004)
	2003
76		Martin Farach-Colton: Adventures at Google. ENC 2003: 3
75		Vicky Choi, Martin Farach-Colton: Barnacle: An Assembly Algorithm for Clone-based Sequences of Whole Genomes CoRR cs.DS/0302005: (2003)
	2002
74		Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton: Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. ESA 2002: 139-151
73		Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito: Two Simplified Algorithms for Maintaining Order in a List. ESA 2002: 152-164
72		Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Efficient Tree Layout in a Multilevel Memory Hierarchy. ESA 2002: 165-173
71		Moses Charikar, Kevin Chen, Martin Farach-Colton: Finding Frequent Items in Data Streams. ICALP 2002: 693-703
70		Michael A. Bender, Martin Farach-Colton: The Level Ancestor Problem Simplified. LATIN 2002: 508-515
69		Rahul Shah, Martin Farach-Colton: Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. SODA 2002: 108-115
68		Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang: Fast, Fair and Frugal Bandwidth Allocation in ATM Networks. Algorithmica 33(3): 272-286 (2002)
67		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 cs.DS/0211010: (2002)
	2001
66		Rahul Shah, Martin Farach-Colton: On the midpath tree conjuncture: a counter-example. SODA 2001: 208-209
	2000
65		Gabriela Hristescu, Martin Farach-Colton: COFE: A Scalable Method for Feature Extraction from Complex Objects. DaWaK 2000: 358-371
64		Michael A. Bender, Erik D. Demaine, Martin Farach-Colton: Cache-Oblivious B-Trees. FOCS 2000: 399-409
63		Michael A. Bender, Martin Farach-Colton: The LCA Problem Revisited. LATIN 2000: 88-94
62		Kevin Chen, Dannie Durand, Martin Farach-Colton: Notung: dating gene duplications using gene family trees. RECOMB 2000: 96-106
61		Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan: On the sorting-complexity of suffix tree construction. J. ACM 47(6): 987-1011 (2000)
60		Martin Farach-Colton, Vincenzo Liberatore: On Local Register Allocation. J. Algorithms 37(1): 37-65 (2000)
59		Kevin Chen, Dannie Durand, Martin Farach-Colton: NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees. Journal of Computational Biology 7(3-4): 429-447 (2000)
58		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. 30(5): 1385-1404 (2000)
	1999
57		Vincenzo Liberatore, Martin Farach-Colton, Ulrich Kremer: Evaluation of Algorithms for Local Register Allocation. CC 1999: 137-152
56		Martin Farach-Colton, Piotr Indyk: Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. FOCS 1999: 171-180
55		Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang: Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks. SODA 1999: 92-101
54		Martin Farach, Sampath Kannan: Efficient Algorithms for Inverting Evolution. J. ACM 46(4): 437-449 (1999)
53		Richa Agarwala, Vineet Bafna, Martin Farach, Mike Paterson, Mikkel Thorup: On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). SIAM J. Comput. 28(3): 1073-1085 (1999)
	1998
52		Martin Farach-Colton: Combinatorial Pattern Matching, 9th Annual Symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings Springer 1998
51		Martin Farach, Paolo Ferragina, S. Muthukrishnan: Overcoming the Memory Bottleneck in Suffix Tree Construction. FOCS 1998: 174-185
50		Martin Farach, Vincenzo Liberatore: On Local Register Allocation. SODA 1998: 564-573
49		Martin Farach, Mikkel Thorup: String Matching in Lempel-Ziv Compressed Strings. Algorithmica 20(4): 388-404 (1998)
48		Amihood Amir, Gary Benson, Martin Farach: Optimal Parallel Two Dimensional Text Searching on a CREW PRAM. Inf. Comput. 144(1): 1-17 (1998)
	1997
47		Martin Farach: Optimal Suffix Tree Construction with Large Alphabets. FOCS 1997: 137-143
46		Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan: Nearly Tight Bounds on the Learnability of Evolution. FOCS 1997: 524-533
45		Gabriela Hristescu, Craig J. Benham, Martin Farach: DNA Strand Separation Prediction: A Parallel Implementation. PDPTA 1997: 610-619
44		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: 1-2
43		Jaime Cohen, Martin Farach: Numerical taxonomy on data (abstract): experimental results. RECOMB 1997: 98
42		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: 390-399
41		Jaime Cohen, Martin Farach: Numerical Taxonomy on Data: Experimental Results. SODA 1997: 410-417
40		Martin Farach, S. Muthukrishnan: Optimal Parallel Randomized Renaming. Inf. Process. Lett. 61(1): 7-10 (1997)
39		Amihood Amir, Gary Benson, Martin Farach: Optimal Two-Dimensional Compressed Matching. J. Algorithms 24(2): 354-379 (1997)
38		Martin Farach: Recognizing Circular Decompossible Metrics. Journal of Computational Biology 4(2): 157-162 (1997)
37		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 4(3): 275-296 (1997)
36		Jaime Cohen, Martin Farach: Numerical Taxonomy on Data: Experimental Results. Journal of Computational Biology 4(4): 547-558 (1997)
35		Martin Farach, Mikkel Thorup: Sparse Dynamic Programming for Evolutionary-Tree Comparison. SIAM J. Comput. 26(1): 210-230 (1997)
	1996
34		Martin Farach, S. Muthukrishnan: Perfect Hashing for Strings: Formalization and Algorithms. CPM 1996: 130-140
33		George Christopher, Martin Farach, Michael A. Trick: The Structure of Circular Decomposable Metrics. ESA 1996: 486-500
32		Martin Farach, S. Muthukrishnan: Optimal Logarithmic Time Randomized Suffix Tree Construction. ICALP 1996: 550-561
31		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: 365-372
30		Martin Farach, Sampath Kannan: Efficient Algorithms for Inverting Evolution. STOC 1996: 230-236
29		Amihood Amir, Gary Benson, Martin Farach: Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files. J. Comput. Syst. Sci. 52(2): 299-307 (1996)
	1995
28		Martin Farach, Teresa M. Przytycka, Mikkel Thorup: Computing the Agreement of Trees with Bounded Degrees. ESA 1995: 381-393
27		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: 48-57
26		Martin Farach, S. Muthukrishnan: Optimal Parallel Dictionary Matching and Compression (Extended Abstract). SPAA 1995: 244-253
25		Martin Farach, Mikkel Thorup: String matching in Lempel-Ziv compressed strings. STOC 1995: 703-712
24		Martin Farach, Sampath Kannan, Tandy Warnow: A Robust Model for Finding Optimal Evolutionary Trees. Algorithmica 13(1/2): 155-179 (1995)
23		Amihood Amir, Martin Farach: Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures Inf. Comput. 118(1): 1-11 (1995)
22		Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer: Improved Dynamic Dictionary Matching Inf. Comput. 119(2): 258-282 (1995)
21		Martin Farach, Mikkel Thorup: Fast Comparison of Evolutionary Trees. Inf. Comput. 123(1): 29-37 (1995)
20		Martin Farach, Teresa M. Przytycka, Mikkel Thorup: On the Agreement of Many Trees. Inf. Process. Lett. 55(6): 297-301 (1995)
	1994
19		Martin Farach, Mikkel Thorup: Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) FOCS 1994: 770-779
18		Amihood Amir, Gary Benson, Martin Farach: Optimal Two-Dimensional Compressed Matching. ICALP 1994: 215-226
17		Martin Farach, Mikkel Thorup: Fast Comparison of Evolutionary Trees. SODA 1994: 481-488
16		Ming Gu, Martin Farach, Richard Beigel: An Efficient Algorithm for Dynamic Text Indexing. SODA 1994: 697-704
15		Amihood Amir, Gary Benson, Martin Farach: Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. SODA 1994: 705-714
14		Amihood Amir, Martin Farach, S. Muthukrishnan: Alphabet Dependence in Parameterized Matching. Inf. Process. Lett. 49(3): 111-115 (1994)
13		Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park: Dynamic Dictionary Matching. J. Comput. Syst. Sci. 49(2): 208-222 (1994)
12		Amihood Amir, Gary Benson, Martin Farach: An Alphabet Independent Approach to Two-Dimensional Pattern Matching. SIAM J. Comput. 23(2): 313-323 (1994)
	1993
11		Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer: Improved Dynamic Dictionary Matching. SODA 1993: 392-401
10		Amihood Amir, Gary Benson, Martin Farach: Optimal Parallel Two Dimensional Pattern Matching. SPAA 1993: 79-85
9		Martin Farach, Sampath Kannan, Tandy Warnow: A robust model for finding optimal evolutionary trees. STOC 1993: 137-145
	1992
8		Amihood Amir, Martin Farach, Yossi Matias: Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). CPM 1992: 262-275
7		Amihood Amir, Gary Benson, Martin Farach: Alphabet Independent Two Dimensional Matching STOC 1992: 59-68
6		Amihood Amir, Martin Farach: Two-Dimensional Dictionary Matching. Inf. Process. Lett. 44(5): 233-239 (1992)
	1991
5		Amihood Amir, Martin Farach: Adaptive Dictionary Matching FOCS 1991: 760-766
4		Amihood Amir, Martin Farach: Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. SODA 1991: 212-223
3		Amihood Amir, Martin Farach: Efficient matching of nonrectangular shapes. Ann. Math. Artif. Intell. 4: 211-224 (1991)
2		Alberto Apostolico, Martin Farach, Costas S. Iliopoulos: Optimal Superprimitivity Testing for Strings. Inf. Process. Lett. 39(1): 17-20 (1991)
	1989
1		Jonathan Wald, Martin Farach, Malle A. Tagamets, James A. Reggia: Generating plausible diagnostic hypotheses with self-processing causal networks. J. Exp. Theor. Artif. Intell. 1(2): 91-112 (1989)

Coauthor Index

1	Richa Agarwala	[31] [37] [42] [44] [53]
2	Paulo Sérgio Almeida	[106] [108]
3	Noga Alon	[87] [102]
4	Stephen Alstrup	[67]
5	Andris Ambainis	[46]
6	Amihood Amir	[3] [4] [5] [6] [7] [8] [10] [11] [12] [13] [14] [15] [18] [22] [23] [29] [39] [48]
7	Alberto Apostolico	[2]
8	Mihai Badoiu	[87] [102]
9	Vineet Bafna	[31] [53]
10	Carlos Baquero	[106] [108]
11	Yair Bartal	[55] [68]
12	Serafim Batzoglou	[37] [42] [44]
13	Richard Beigel	[16]
14	Michael A. Bender	[63] [64] [67] [70] [72] [73] [74] [77] [79] [81] [83] [84] [86] [90] [92] [96] [98]
15	Craig J. Benham	[45]
16	Gary Benson	[7] [10] [12] [15] [18] [29] [39] [48]
17	Philip Bille	[85] [101]
18	Moses Charikar	[71] [78]
19	Kevin Chen	[59] [62] [71] [78]
20	Vicky Choi	[75]
21	George Christopher	[33]
22	Jaime Cohen	[36] [41] [43]
23	Richard Cole	[58] [73] [74]
24	Mary Cryan	[94]
25	Vlado Dancík	[37] [42] [44]
26	Scott E. Decatur	[37] [42] [44]
27	Erik D. Demaine	[64] [67] [72] [73] [74] [83] [87] [102]
28	Richard Desper	[46]
29	Dannie Durand	[59] [62]
30	Rohan J. Fernandes	[89] [93] [104]
31	Antonio Fernández (Antonio Fernández Anta)	[107] [109] [110]
32	Paolo Ferragina	[51] [61]
33	Jeremy T. Fineman	[98]
34	Yonatan R. Fogel	[98]
35	Harold N. Gabow	[96]
36	Zvi Galil	[13]
37	Raffaele Giancarlo	[13]
38	Ming Gu	[16]
39	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[87] [102]
40	Sridhar Hannenhalli	[37] [42] [44]
41	Ramesh Hariharan	[58]
42	Simai He	[81] [86]
43	Gabriela Hristescu	[45] [65]
44	Yang Huang	[80] [99] [103]
45	Ramana M. Idury	[11] [22]
46	Costas S. Iliopoulos	[2]
47	Piotr Indyk	[56]
48	Paulo Jesus	[106] [108]
49	Sampath Kannan	[9] [24] [30] [46] [54]
50	Ulrich Kremer	[57]
51	Bradley C. Kuszmaul	[81] [86] [92] [98]
52	Gad M. Landau	[88] [95]
53	Charles E. Leiserson	[81] [86]
54	Vincenzo Liberatore	[50] [57] [60]
55	Yossi Matias	[8]
56	Alessia Milani	[107] [109] [110]
57	Bud Mishra (Bhubaneswar Mishra)	[105]
58	Antonina Mitrofanova	[105]
59	Miguel A. Mosteiro	[79] [89] [90] [93] [97] [100] [104] [106] [107] [108] [109] [110]
60	J. Ian Munro	[67]
61	S. Muthukrishnan (S. Muthu Muthukrishnan)	[14] [26] [32] [34] [37] [40] [44] [51] [61]
62	Babu O. Narayanan	[31]
63	Jelani Nelson	[98]
64	Michiel O. Noordewier	[27]
65	Kunsoo Park	[13]
66	Mike Paterson	[31] [53]
67	Giridhar Pemmasani	[84]
68	Johannes A. La Poutré (Han La Poutré)	[11] [22]
69	Teresa M. Przytycka	[20] [28] [58]
70	Theis Rauhe	[67]
71	James A. Reggia	[1]
72	Süleyman Cenk Sahinalp	[88] [95]
73	Serap A. Savari	[27]
74	Alejandro A. Schäffer	[11] [22]
75	Rahul Shah	[66] [69] [91]
76	Larry A. Shepp (Laurence A. Shepp)	[27]
77	Anastasios Sidiropoulos	[87] [102]
78	Steven Skiena	[37] [42] [44] [84]
79	Pavel Sumazin	[84]
80	Malle A. Tagamets	[1]
81	Mikkel Thorup	[17] [19] [20] [21] [25] [28] [31] [35] [49] [53] [58] [67]
82	Michael A. Trick	[33]
83	Dekel Tsur	[88] [95]
84	Jonathan Wald	[1]
85	Tandy Warnow	[9] [24]
86	John L. L. Woolford	[80]
87	Aaron D. Wyner	[27]
88	Shibu Yooseph	[55] [68]
89	Shmuel Zaks	[107] [109] [110]
90	Lisa Zhang	[55] [68]
91	Jack Zito	[73]
92	Jacob Ziv	[27]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page