Lawrence L. Larmore

	2012
114		Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit: Ring Exploration with Oblivious Myopic Robots CoRR abs/1205.5003: (2012)
	2011
113		Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes: Sorting on Skip Chains. ICNC 2011: 193-199
112		Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, François Kawala, Maria Potop-Butucaru: Multi-resource Allocation with Unknown Participants. ICNC 2011: 200-206
111		Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre, Ajoy Kumar Datta, Lawrence L. Larmore: Self-Stabilizing Small k-Dominating Sets. ICNC 2011: 30-39
110		Eddy Caron, Benjamin Depardon, Ajoy Kumar Datta, Lawrence L. Larmore: On-Line Optimization of Publish/Subscribe Overlays. IPDPS Workshops 2011: 1919-1929
109		Alain Bui, Simon Clavière, Ajoy Kumar Datta, Lawrence L. Larmore, Devan Sohier: Self-stabilizing Hierarchical Construction of Bounded Size Clusters. SIROCCO 2011: 54-65
108		Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre: Self-stabilizing Labeling and Ranking in Ordered Trees. SSS 2011: 148-162
107		Ajoy Kumar Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, Erwan Le Merrer: Brief Announcement: A Stable and Robust Membership Protocol. SSS 2011: 441-442
106		Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore: Brief Announcement: Sorting on Skip Chains. SSS 2011: 443-444
105		Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk: Knowledge State Algorithms. Algorithmica 60(3): 653-678 (2011)
104		Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore: Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. Int. J. Found. Comput. Sci. 22(3): 657-677 (2011)
103		Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula: An O(n)-time self-stabilizing leader election algorithm. J. Parallel Distrib. Comput. 71(11): 1532-1544 (2011)
102		Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore: Un algorithme autostabilisant pour le problème du K-partitionnement sur graphe pondéré. Technique et Science Informatiques 30(10): 1191-1216 (2011)
101		Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula: Self-stabilizing leader election in optimal space under an arbitrary scheduler. Theor. Comput. Sci. 412(40): 5541-5561 (2011)
100		Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec: A randomized algorithm for two servers in cross polytope spaces. Theor. Comput. Sci. 412(7): 563-572 (2011)
	2010
99		Ajoy Kumar Datta, Lawrence L. Larmore, Hema Piniganti: Self-stabilizing Leader Election in Dynamic Networks. SSS 2010: 35-49
98		Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula: A Self-Stabilizing O(k)-Time k-Clustering Algorithm. Comput. J. 53(3): 342-350 (2010)
97		Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore: A self-stabilizing k-clustering algorithm for weighted graphs. J. Parallel Distrib. Comput. 70(11): 1159-1173 (2010)
	2009
96		Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore: A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric. Euro-Par 2009: 602-614
95		Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore: Self-Stabilizing k-out-of-l exclusion on tree networks. IPDPS 2009: 1-8
94		Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore: A Self-Stabilizing O(n)-Round k-Clustering Algorithm. SRDS 2009: 147-155
93		Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang: The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. ACM Transactions on Algorithms 6(1): (2009)
92		Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs CoRR abs/0904.1002: (2009)
91		Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. Int. J. Found. Comput. Sci. 20(1): 167-183 (2009)
90		Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: Optimally competitive list batching. Theor. Comput. Sci. 410(38-40): 3631-3639 (2009)
89		Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough: A quadratic time 2-approximation algorithm for block sorting. Theor. Comput. Sci. 410(8-10): 711-717 (2009)
	2008
88		Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge States: A Tool for Randomized Online Algorithms. HICSS 2008: 476
87		Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore: Self-stabilizing algorithms for sorting and heapification. IPDPS 2008: 1-12
86		Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula: Self-Stabilizing Leader Election in Optimal Space. SSS 2008: 109-123
85		Doina Bein, Ajoy Kumar Datta, Chitwan K. Gupta, Lawrence L. Larmore: Local Synchronization on Oriented Rings. SSS 2008: 141-155
84		Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore: Self-stabilizing K-out-of-L exclusion on tree network CoRR abs/0812.1093: (2008)
83		Christian Boulinier, Ajoy Kumar Datta, Lawrence L. Larmore, Franck Petit: Space efficient and time optimal distributed BFS tree construction. Inf. Process. Lett. 108(5): 273-278 (2008)
82		Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore: Synchronization Algorithms on Oriented Chains. Sci. Ann. Comp. Sci. 18: 13-34 (2008)
	2007
81		Wolfgang W. Bein, Lawrence L. Larmore, John Noga: Equitable Revisited. ESA 2007: 419-426
80		Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec: A Randomized Algorithm for Two Servers in Cross Polytope Spaces. WAOA 2007: 246-259
79		Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge State Algorithms: Randomization with Limited Information CoRR abs/cs/0701142: (2007)
78		Wolfgang W. Bein, Lawrence L. Larmore, John Noga: Uniform metrical task systems with a limited number of states. Inf. Process. Lett. 104(4): 123-128 (2007)
	2006
77		Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore: On Self-stabilizing Search Trees. DISC 2006: 76-89
76		Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore: Self-stabilizing Space Optimal Synchronization Algorithms on Trees. SIROCCO 2006: 334-348
75		Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang: The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. SODA 2006: 31-40
74		Lawrence L. Larmore, James A. Oravec: T-Theory Applications to Online Algorithms for the Server Problem CoRR abs/cs/0611088: (2006)
	2005
73		T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler: Optimal Integer Alphabetic Trees in Linear Time. ESA 2005: 226-237
72		Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough: A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT 2005: 115-124
71		Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga: The Delayed k-Server Problem. FCT 2005: 281-292
70		Wolfgang W. Bein, Lawrence L. Larmore, John Noga: A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN 2005: 94-99
69		Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park: The algebraic Monge property and path problems. Discrete Applied Mathematics 145(3): 455-464 (2005)
	2004
68		Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN 2004: 307-312
67		Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: Optimally Competitive List Batching. SWAT 2004: 77-89
66		Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Embedding A Complete Binary Tree Into A Three-Dimensional Grid. Journal of Interconnection Networks 5(2): 111-130 (2004)
65		Marek Karpinski, Lawrence L. Larmore, Yakov Nekrich: Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. Parallel Processing Letters 14(1): 99-105 (2004)
	2003
64		Lawrence L. Larmore, Michel X. Goemans: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA ACM 2003
63		Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter: Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227
62		Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough: Block Sorting is Hard. Int. J. Found. Comput. Sci. 14(3): 425-437 (2003)
	2002
61		Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Fixed Layer Embeddings of Binary Trees. ISPAN 2002: 281-
60		Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough: Block Sorting is Hard. ISPAN 2002: 349-354
59		Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park: Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117
58		Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter: Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. J. Algorithms 42(2): 277-303 (2002)
57		Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter: On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. J. Comput. Syst. Sci. 65(2): 332-350 (2002)
56		Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore: The 3-server problem in the plane. Theor. Comput. Sci. 289(1): 335-354 (2002)
	2001
55		Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter: The k-Median Problem for Directed Trees. MFCS 2001: 260-271
	2000
54		Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Three-Dimensional Embedding of Binary Trees. ISPAN 2000: 140-147
53		Yair Bartal, Marek Chrobak, Lawrence L. Larmore: A Randomized Algorithm for Two Servers on the Line. Inf. Comput. 158(1): 53-69 (2000)
52		Wolfgang W. Bein, Lawrence L. Larmore: Trackless online algorithms for the server problem. Inf. Process. Lett. 74(1-2): 73-79 (2000)
51		Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore: Limited bookmark randomized online algorithms for the paging problem. Inf. Process. Lett. 76(4-6): 155-162 (2000)
	1999
50		Jeffrey Scott Vitter, Lawrence L. Larmore, Frank Thomson Leighton: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA ACM 1999
49		Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore: The 3-Server Problem in the Plane. ESA 1999: 301-312
	1998
48		Yair Bartal, Marek Chrobak, Lawrence L. Larmore: A Randomized Algorithm for Two Servers on the Line (Extended Abstract). ESA 1998: 247-258
47		Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter: Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. ESA 1998: 43-54
46		Lawrence L. Larmore, Teresa M. Przytycka: The Optimal Alphabetic Tree Problem Revisited. J. Algorithms 28(1): 1-20 (1998)
45		Lawrence L. Larmore, Wojciech Rytter: Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. Theor. Comput. Sci. 197(1-2): 189-201 (1998)
	1997
44		Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter: On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. CPM 1997: 40-51
43		Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold: A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. Inf. Process. Lett. 63(2): 79-83 (1997)
42		Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook: Page Migration Algorithms Using Work Functions. J. Algorithms 24(1): 124-157 (1997)
41		Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter: Correctness of Constructing Optimal Alphabetic Trees Revisited. Theor. Comput. Sci. 180(1-2): 309-324 (1997)
	1996
40		Marek Chrobak, Lawrence L. Larmore: Metrical Task Systems, the Server Problem and the Work Function Algorithm. Online Algorithms 1996: 74-96
39		Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter: Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. SODA 1996: 36-41
38		Lawrence L. Larmore, Teresa M. Przytycka: A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees. J. Parallel Distrib. Comput. 35(1): 49-56 (1996)
	1995
37		Lawrence L. Larmore, Teresa M. Przytycka: Constructing Huffman Trees in Parallel. SIAM J. Comput. 24(6): 1163-1169 (1995)
	1994
36		Teresa M. Przytycka, Lawrence L. Larmore: The Optimal Alphabetic Tree Problem Revisited. ICALP 1994: 251-262
35		Lawrence L. Larmore, Wojciech Rytter: An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. Inf. Process. Lett. 52(1): 31-34 (1994)
34		Marek Chrobak, Lawrence L. Larmore: Generosity Helps or an 11-Competitive Algorithm for Three Servers. J. Algorithms 16(2): 234-263 (1994)
33		Lawrence L. Larmore, Teresa M. Przytycka: A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees. SIAM J. Comput. 23(6): 1283-1312 (1994)
	1993
32		Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook: Page Migration Algorithms Using Work Functions. ISAAC 1993: 406-415
31		Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter: Parallel Construction of Optimal Alphabetic Trees. SPAA 1993: 214-223
	1992
30		Marek Chrobak, Lawrence L. Larmore: Generosity Helps, or an 11-Competitive Algorithm for Three Servers. SODA 1992: 196-202
29		Lawrence L. Larmore, Wojciech Rytter: Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. STACS 1992: 121-132
28		Lawrence L. Larmore, Daniel D. Gajski, Allen C.-H. Wu: Layout placement for sliced architecture. IEEE Trans. on CAD of Integrated Circuits and Systems 11(1): 102-114 (1992)
27		Daniel S. Hirschberg, Lawrence L. Larmore: The Traveler's Problem. J. Algorithms 13(1): 148-160 (1992)
26		Marek Chrobak, Lawrence L. Larmore: Harmonic is 3-Competitive for Two Servers. Theor. Comput. Sci. 98(2): 339-346 (1992)
	1991
25		Lawrence L. Larmore, Teresa M. Przytycka: Parallel Construction of Trees with Optimal Weighted Path Length. SPAA 1991: 71-80
24		Marek Chrobak, Lawrence L. Larmore: A Note on the Server Problem and a Benevolent Adversary. Inf. Process. Lett. 38(4): 173-175 (1991)
23		Lawrence L. Larmore, Baruch Schieber: On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. J. Algorithms 12(3): 490-515 (1991)
22		Marek Chrobak, Lawrence L. Larmore: On Fast Algorithms for Two Servers. J. Algorithms 12(4): 607-614 (1991)
21		Marek Chrobak, Lawrence L. Larmore: An Optimal On-Line Algorithm for k-Servers on Trees. SIAM J. Comput. 20(1): 144-148 (1991)
20		Marek Chrobak, Lawrence L. Larmore: A New Approach to the Server Problem. SIAM J. Discrete Math. 4(3): 323-328 (1991)
	1990
19		Marek Chrobak, Lawrence L. Larmore: On Fast Algorithms for Two Servers. MFCS 1990: 202-208
18		Lawrence L. Larmore, Daniel S. Hirschberg: Length-Limited Coding. SODA 1990: 310-318
17		Lawrence L. Larmore, Baruch Schieber: On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. SODA 1990: 503-512
16		Lawrence L. Larmore: An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching. Inf. Process. Lett. 36(3): 147-151 (1990)
15		Lawrence L. Larmore, Daniel S. Hirschberg: A Fast Algorithm for Optimal Length-Limited Huffman Codes J. ACM 37(3): 464-473 (1990)
14		Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott McFaddin: Efficient Parallel Algorithms for String Editing and Related Problems. SIAM J. Comput. 19(5): 968-988 (1990)
	1989
13		Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng: Constructing Trees in Parallel. SPAA 1989: 421-431
12		Daniel S. Hirschberg, Lawrence L. Larmore: The Set-Set LCS Problem. Algorithmica 4(4): 503-510 (1989)
11		Lawrence L. Larmore: Minimum Delay Codes. SIAM J. Comput. 18(1): 82-94 (1989)
	1988
10		James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore: Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. J. Algorithms 9(2): 245-253 (1988)
	1987
9		Daniel S. Hirschberg, Lawrence L. Larmore: The Set LCS Problem. Algorithmica 2: 91-95 (1987)
8		Kadri Krause, Lawrence L. Larmore, Dennis J. Volper: Packing Items from a Triangular Distribution. Inf. Process. Lett. 25(6): 351-362 (1987)
7		Daniel S. Hirschberg, Lawrence L. Larmore: New applications of failure functions. J. ACM 34(3): 616-625 (1987)
6		Lawrence L. Larmore: A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees. J. Algorithms 8(4): 579-591 (1987)
5		Daniel S. Hirschberg, Lawrence L. Larmore: The Least Weight Subsequence Problem. SIAM J. Comput. 16(4): 628-638 (1987)
4		Lawrence L. Larmore: Height Restricted Optimal Binary Trees. SIAM J. Comput. 16(6): 1115-1123 (1987)
	1986
3		Daniel S. Hirschberg, Lawrence L. Larmore: Average Case Analysis of Marking Algorithms. SIAM J. Comput. 15(4): 1069-1074 (1986)
	1985
2		Daniel S. Hirschberg, Lawrence L. Larmore: The Least Weight Subsequence Problem (Extended Abstract) FOCS 1985: 137-143
1		Lawrence L. Larmore, Daniel S. Hirschberg: Efficient Optimal Pagination of Scrolls. Commun. ACM 28(8): 854-856 (1985)

Coauthor Index

1	Alberto Apostolico	[14]
2	Mikhail J. Atallah	[13] [14]
3	Yair Bartal	[48] [53]
4	Doina Bein	[76] [77] [82] [85] [87]
5	Wolfgang W. Bein	[49] [51] [52] [54] [56] [59] [60] [61] [62] [66] [67] [68] [69] [70] [71] [72] [75] [78] [79] [80] [81] [88] [89] [90] [91] [92] [93] [100] [105]
6	Robert Benkoczi	[63]
7	Piotr Berman	[44] [57]
8	Binay K. Bhattacharya	[63]
9	Christian Boulinier	[83]
10	Phillip G. Bradford	[47] [58]
11	Peter Brucker	[59] [69]
12	Alain Bui	[109]
13	Eddy Caron	[96] [97] [102] [110]
14	Marek Chrobak	[19] [20] [21] [22] [24] [26] [30] [32] [34] [40] [42] [43] [48] [49] [53] [55] [56] [63]
15	Simon Clavière	[109]
16	Ajoy Kumar Datta	[76] [77] [82] [83] [84] [85] [86] [87] [94] [95] [96] [97] [98] [99] [101] [102] [103] [104] [106] [107] [108] [109] [110] [111] [112] [113] [114]
17	Benjamin Depardon	[96] [97] [102] [110]
18	Stéphane Devismes	[84] [94] [95] [104] [106] [108] [111] [112] [113]
19	Leah Epstein	[67] [90] [92]
20	Rudolf Fleischer	[51]
21	Daniel Gajski (Daniel D. Gajski)	[28]
22	Michel X. Goemans	[64]
23	Mordecai J. Golin	[47] [58] [75] [93]
24	Chitwan K. Gupta	[85]
25	James H. Hester	[10]
26	Karel Heurtefeux	[111]
27	Daniel S. Hirschberg	[1] [2] [3] [5] [7] [9] [10] [12] [15] [18] [27]
28	Florian Horn	[84] [95] [104]
29	T. C. Hu	[73]
30	Kazuo Iwama	[71] [80] [100]
31	Marek Karpinski	[39] [41] [44] [57] [65]
32	Jun Kawahara	[80] [100]
33	François Kawala	[112]
34	Anne-Marie Kermarrec	[107]
35	S. Rao Kosaraju	[13]
36	Kadri Krause	[8]
37	Anissa Lamani	[114]
38	Shahram Latifi	[60] [62]
39	Frank Thomson Leighton (Tom Leighton)	[50]
40	Carsten Lund	[43]
41	Scott McFaddin	[14]
42	Erwan Le Merrer	[107]
43	Gary L. Miller	[13]
44	Linda Morales	[72] [89]
45	J. David Morgenthaler	[73]
46	Yakov Nekrich	[65]
47	John Noga	[67] [70] [71] [78] [81] [90] [92] [105]
48	James A. Oravec	[74] [80] [100]
49	James K. Park	[59] [69]
50	Franck Petit	[83] [114]
51	Hema Piniganti	[99]
52	Wojciech Plandowski	[44] [57]
53	Maria Gradinariu Potop-Butucaru (Maria Potop-Butucaru, Maria Gradinariu)	[112]
54	Teresa M. Przytycka	[25] [31] [33] [36] [37] [38] [46]
55	Nick Reingold	[32] [42] [43]
56	Rüdiger Reischuk	[68] [79] [88] [91] [105]
57	Yvan Rivierre	[108] [111]
58	Wojciech Rytter	[29] [31] [35] [39] [41] [44] [45] [47] [55] [57] [58] [63]
59	Baruch Schieber	[17] [23]
60	Charles Shields Jr.	[54] [61] [66]
61	Devan Sohier	[109]
62	Ivan Hal Sudborough	[54] [60] [61] [62] [66] [72] [89]
63	Shang-Hua Teng	[13]
64	Priyanka Vemula	[86] [98] [101] [103]
65	Jeffrey Scott Vitter	[50]
66	Dennis J. Volper	[8]
67	Jeffery Westbrook	[32] [42]
68	Allen C.-H. Wu	[28]
69	Yan Zhang	[75] [93]

Colors in the list of coauthors

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page