dblp.uni-trier.dewww.uni-trier.de

Mikkel Thorup Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
143EEPhilip Bille, Mikkel Thorup: Faster Regular Expression Matching. ICALP (1) 2009: 171-182
142EEEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Stream sampling for variance-optimal estimation of subset sums. SODA 2009: 1255-1264
141EEMikkel Thorup: String hashing for linear probing. SODA 2009: 655-664
140EEOmid Madani, Mikkel Thorup, Uri Zwick: Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. SODA 2009: 958-967
139EEEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. PVLDB 2(1): 431-442 (2009)
2008
138EEEdith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup: Confident estimation for multistage measurement sampling and aggregation. SIGMETRICS 2008: 109-120
137EEMike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick: Maximum overhang. SODA 2008: 756-765
136EEMikkel Thorup: Minimum k-way cuts via deterministic greedy tree packing. STOC 2008: 159-166
135EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms 4(3): (2008)
134EELiam Roditty, Mikkel Thorup, Uri Zwick: Roundtrip spanners and roundtrip routing in directed graphs. ACM Transactions on Algorithms 4(3): (2008)
133EEEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Variance optimal sampling based estimation of subset sums CoRR abs/0803.0473: (2008)
132EELuciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup: Speeding Up Dynamic Shortest-Path Algorithms. INFORMS Journal on Computing 20(2): 191-204 (2008)
131EECamil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran: Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. 37(5): 1299-1318 (2008)
2007
130EEMikkel Thorup: Compact Oracles for Approximate Distances Around Obstacles in the Plane. ESA 2007: 383-394
129EEMario Szegedy, Mikkel Thorup: On the Variance of Subset Sum Estimation. ESA 2007: 75-86
128EEMihai Patrascu, Mikkel Thorup: Planning for Fast Connectivity Updates. FOCS 2007: 263-271
127EEEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Comference 2007: 265-278
126EEEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Sketching unaggregated data streams for subpopulation-size queries. PODS 2007: 253-262
125EEMihai Patrascu, Mikkel Thorup: Randomization does not help searching predecessors. SODA 2007: 555-564
124EEMario Szegedy, Mikkel Thorup: On the variance of subset sum estimation CoRR abs/cs/0702029: (2007)
123EEMikkel Thorup: Fully-Dynamic Min-Cut. Combinatorica 27(1): 91-127 (2007)
122EEArne Andersson, Mikkel Thorup: Dynamic ordered sets with exponential search trees. J. ACM 54(3): 13 (2007)
121EEMikkel Thorup: Equivalence between priority queues and sorting. J. ACM 54(6): (2007)
120EENick G. Duffield, Carsten Lund, Mikkel Thorup: Priority sampling for estimation of arbitrary subset sums. J. ACM 54(6): (2007)
119EELuciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup: Survivable IP network design with OSPF routing. Networks 49(1): 51-64 (2007)
2006
118EECamil Demetrescu, Pompeo Faruolo, Giuseppe F. Italiano, Mikkel Thorup: Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths? ESA 2006: 732-743
117EEMihai Patrascu, Mikkel Thorup: Higher Lower Bounds for Near-Neighbor and Further Rich Problems. FOCS 2006: 646-654
116EEMikkel Thorup: Confidence intervals for priority sampling. SIGMETRICS/Performance 2006: 252-263
115EEMikkel Thorup, Uri Zwick: Spanners and emulators with sublinear distance errors. SODA 2006: 802-809
114EEMihai Patrascu, Mikkel Thorup: Time-space trade-offs for predecessor search. STOC 2006: 232-240
113EERan Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick: Melding priority queues. ACM Transactions on Algorithms 2(4): 535-556 (2006)
112EEMihai Patrascu, Mikkel Thorup: Time-Space Trade-Offs for Predecessor Search CoRR abs/cs/0603043: (2006)
2005
111EELiam Roditty, Mikkel Thorup, Uri Zwick: Deterministic Constructions of Approximate Distance Oracles and Spanners. ICALP 2005: 261-272
110EEStephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick: Union-Find with Constant Time Deletions. ICALP 2005: 78-89
109EENick G. Duffield, Carsten Lund, Mikkel Thorup: Optimal Combination of Sampled Network Measurements. Internet Measurment Conference 2005: 91-104
108EENoga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup: Estimating arbitrary subset sums with few probes. PODS 2005: 317-325
107EEMikkel Thorup: Worst-case update times for fully-dynamic all-pairs shortest paths. STOC 2005: 112-119
106EEStephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup: Black box for constant-time insertion in priority queues (note). ACM Transactions on Algorithms 1(1): 102-106 (2005)
105EEStephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms 1(2): 243-264 (2005)
104EENick G. Duffield, Carsten Lund, Mikkel Thorup: Sampling to estimate arbitrary subset sums CoRR abs/cs/0509026: (2005)
103EENick G. Duffield, Carsten Lund, Mikkel Thorup: Learn more, sample less: control of volume and variance in network measurement. IEEE Transactions on Information Theory 51(5): 1756-1775 (2005)
102EENick G. Duffield, Carsten Lund, Mikkel Thorup: Estimating flow distributions from sampled flow statistics. IEEE/ACM Trans. Netw. 13(5): 933-946 (2005)
101EEMikkel Thorup, Uri Zwick: Approximate distance oracles. J. ACM 52(1): 1-24 (2005)
100EELuciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro, Mikkel Thorup: A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks 46(1): 36-56 (2005)
2004
99EEAnna Pagh, Rasmus Pagh, Mikkel Thorup: On Adaptive Integer Sorting. ESA 2004: 556-579
98EENick G. Duffield, Carsten Lund, Mikkel Thorup: Flow sampling under hard resource constraints. SIGMETRICS 2004: 85-96
97EERan Mendelson, Mikkel Thorup, Uri Zwick: Meldable RAM priority queues and minimum directed spanning trees. SODA 2004: 40-48
96EEMikkel Thorup, Yin Zhang: Tabulation based 4-universal hashing with applications to second moment estimation. SODA 2004: 615-624
95EEIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup: Compact name-independent routing with minimum stretch. SPAA 2004: 20-24
94EERan Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick: Melding Priority Queues. SWAT 2004: 223-235
93EEMikkel Thorup: Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. SWAT 2004: 384-396
92EEMikkel Thorup: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51(6): 993-1024 (2004)
91EEMikkel Thorup: Integer priority queues with decrease key in constant time and the single source shortest paths problem. J. Comput. Syst. Sci. 69(3): 330-353 (2004)
90EEDavid R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. Math. Oper. Res. 29(3): 436-461 (2004)
89EEAdam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup: OPT Versus LOAD in Dynamic Storage Allocation. SIAM J. Comput. 33(3): 632-646 (2004)
88EEMikkel Thorup: Quick k-Median, k-Center, and Facility Location for Sparse Graphs. SIAM J. Comput. 34(2): 405-432 (2004)
2003
87EEDavid Applegate, Mikkel Thorup: Load optimal MPLS routing with N+M labels. INFOCOM 2003
86EEMatthew Roughan, Mikkel Thorup, Yin Zhang: Traffic engineering with estimated traffic matrices. Internet Measurement Comference 2003: 248-258
85EENick G. Duffield, Carsten Lund, Mikkel Thorup: Estimating flow distributions from sampled flow statistics. SIGCOMM 2003: 325-336
84EEMatthew Roughan, Mikkel Thorup, Yin Zhang: Performance of estimated traffic matrices in traffic engineering. SIGMETRICS 2003: 326-327
83EEMikkel Thorup: Quick and good facility location. SODA 2003: 178-185
82EEMikkel Thorup: On AC0 implementations of fusion trees and atomic heaps. SODA 2003: 699-707
81EEAnupam Gupta, Amit Kumar, Mikkel Thorup: Tree based MPLS routing. SPAA 2003: 193-199
80EEMikkel Thorup: Integer priority queues with decrease key in constant time and the single source shortest paths problem. STOC 2003: 149-158
79EEAdam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup: OPT versus LOAD in dynamic storage allocation. STOC 2003: 556-564
78EEMikkel Thorup: Space efficient dynamic stabbing with fast queries. STOC 2003: 649-658
77EEStephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Maintaining Information in Fully-Dynamic Trees with Top Trees CoRR cs.DS/0310065: (2003)
76EEMikkel Thorup: Combinatorial power in multimedia processors. SIGARCH Computer Architecture News 31(4): 5-11 (2003)
75EEMatthew H. Austern, Bjarne Stroustrup, Mikkel Thorup, John Wilkinson: Untangling the balancing and searching of balanced binary search trees. Softw., Pract. Exper. 33(13): 1273-1298 (2003)
2002
74EEMikkel Thorup: On Distance Oracles and Routing in Graphs. ESA 2002: 4
73EEMikkel Thorup: Equivalence between Priority Queues and Sorting. FOCS 2002: 125-134
72EEYijie Han, Mikkel Thorup: Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space. FOCS 2002: 135-144
71EENick G. Duffield, Carsten Lund, Mikkel Thorup: Properties and prediction of flow statistics from sampled packet streams. Internet Measurement Workshop 2002: 159-171
70EECamil Demetrescu, Mikkel Thorup: Oracles for distances avoiding a link-failure. SODA 2002: 838-843
69EELiam Roditty, Mikkel Thorup, Uri Zwick: Roundtrip spanners and roundtrip routing in directed graphs. SODA 2002: 844-851
68EEDavid R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut CoRR cs.DS/0205051: (2002)
67EEArne Andersson, Mikkel Thorup: Dynamic Ordered Sets with Exponential Search Trees CoRR cs.DS/0210006: (2002)
66EEStephen 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)
65EEMikkel Thorup: Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations. J. Algorithms 42(2): 205-230 (2002)
2001
64EEValerie King, Mikkel Thorup: A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. COCOON 2001: 268-277
63 Mikkel Thorup: Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. FOCS 2001: 242-251
62EEMikkel Thorup: Quick k-Median, k-Center, and Facility Location for Sparse Graphs. ICALP 2001: 249-260
61EENick G. Duffield, Carsten Lund, Mikkel Thorup: Charging from sampled network usage. Internet Measurement Workshop 2001: 245-256
60EEArne Andersson, Mikkel Thorup: Dynamic string searching. SODA 2001: 307-308
59EEMikkel Thorup, Uri Zwick: Compact routing schemes. SPAA 2001: 1-10
58EEMikkel Thorup, Uri Zwick: Approximate distance oracles. STOC 2001: 183-192
57EEMikkel Thorup: Fully-dynamic min-cut. STOC 2001: 224-230
56 Raj Iyer, David R. Karger, Hariharan Rahul, Mikkel Thorup: An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. ACM Journal of Experimental Algorithmics 6: 4 (2001)
55EEJacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4): 723-760 (2001)
2000
54EEBernard Fortz, Mikkel Thorup: Internet Traffic Engineering by Optimizing OSPF Weights. INFOCOM 2000: 519-528
53EEMikkel Thorup: Even strongly universal hashing is pretty fast. SODA 2000: 496-497
52EEStephen Alstrup, Jens P. Secher, Mikkel Thorup: Word encoding tree connectivity works. SODA 2000: 498-499
51EEArne Andersson, Mikkel Thorup: Tight(er) worst-case bounds on dynamic searching and priority queues. STOC 2000: 335-342
50EEMikkel Thorup: Near-optimal fully-dynamic graph connectivity. STOC 2000: 343-350
49EEMikkel Thorup: Dynamic Graph Algorithms with Applications. SWAT 2000: 1-9
48EEStephen Alstrup, Jacob Holm, Mikkel Thorup: Maintaining Center and Median in Dynamic Trees. SWAT 2000: 46-56
47EEStephen Alstrup, Peter W. Lauridsen, Mikkel Thorup: Generalized Dominators for Structured Programs. Algorithmica 27(3): 244-253 (2000)
46 Stephen Alstrup, Mikkel Thorup: Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. J. Algorithms 35(2): 169-188 (2000)
45 Mikkel Thorup: Floats, Integers, and Single Source Shortest Paths. J. Algorithms 35(2): 189-201 (2000)
44 Mikkel Thorup: On RAM Priority Queues. SIAM J. Comput. 30(1): 86-109 (2000)
43EERichard 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
42EEDavid R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young: Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. STOC 1999: 668-678
41EEMikkel Thorup: Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. J. ACM 46(3): 362-394 (1999)
40 Mikkel Thorup: Decremental Dynamic Connectivity. J. Algorithms 33(2): 229-243 (1999)
39 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)
38 Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup: Dominators in Linear Time. SIAM J. Comput. 28(6): 2117-2132 (1999)
37EEArne Andersson, Peter Bro Miltersen, Mikkel Thorup: Fusion Trees can be Implemented with AC0 Instructions Only. Theor. Comput. Sci. 215(1-2): 337-344 (1999)
1998
36EEMikkel Thorup: Map Graphs in Polynomial Time. FOCS 1998: 396-405
35 Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Direct Routing on Trees (Extended Abstract). SODA 1998: 342-349
34 Mikkel Thorup: Faster Deterministic Sorting and Priority Queues in Linear Space. SODA 1998: 550-555
33EEMikkel Thorup: Floats, Integers, and Single Source Shortest Paths. STACS 1998: 14-24
32EEJacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. STOC 1998: 79-89
31 Martin Farach, Mikkel Thorup: String Matching in Lempel-Ziv Compressed Strings. Algorithmica 20(4): 388-404 (1998)
30 Mikkel Thorup: All Structured Programs have Small Tree-Width and Good Register Allocation. Inf. Comput. 142(2): 159-181 (1998)
1997
29EEMikkel Thorup: Undirected Single Source Shortest Path in Linear Time. FOCS 1997: 12-21
28EEStephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup: Minimizing Diameters of Dynamic Trees. ICALP 1997: 270-280
27 Mikkel Thorup: Decremental Dynamic Connectivity. SODA 1997: 305-313
26 Mikkel Thorup: Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations. SODA 1997: 352-359
25 Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup: Finding Cores of Limited Length. WADS 1997: 45-54
24EEMikkel Thorup: Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). WG 1997: 318-332
23 Mikkel Thorup: Parallel Shortcutting of Rooted Trees. J. Algorithms 23(1): 139-159 (1997)
22 Monika Rauch Henzinger, Mikkel Thorup: Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Struct. Algorithms 11(4): 369-379 (1997)
21 Martin Farach, Mikkel Thorup: Sparse Dynamic Programming for Evolutionary-Tree Comparison. SIAM J. Comput. 26(1): 210-230 (1997)
1996
20 Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup: Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. FOCS 1996: 441-450
19EEMonika Rauch Henzinger, Mikkel Thorup: Improved Sampling with Applications to Dynamic Graph Algorithms. ICALP 1996: 290-299
18 Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup: Generalized Dominators for Structured Programs. SAS 1996: 42-51
17 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
16 Mikkel Thorup: On RAM Priority Queues. SODA 1996: 59-67
15EEStephen Alstrup, Mikkel Thorup: Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. SWAT 1996: 212-222
14 Mikkel Thorup: Disambiguating Grammars by Exclusion of Sub-Parse Trees. Acta Inf. 33(6): 511-522 (1996)
13 Mikkel Thorup: Efficient Preprocessing of Simple Binay Pattern Forests. J. Algorithms 20(3): 602-612 (1996)
1995
12EEMartin Farach, Teresa M. Przytycka, Mikkel Thorup: Computing the Agreement of Trees with Bounded Degrees. ESA 1995: 381-393
11EEMartin Farach, Mikkel Thorup: String matching in Lempel-Ziv compressed strings. STOC 1995: 703-712
10 Mikkel Thorup: Shortcutting Planar Digraphs. Combinatorics, Probability & Computing 4: 287-315 (1995)
9 Martin Farach, Mikkel Thorup: Fast Comparison of Evolutionary Trees. Inf. Comput. 123(1): 29-37 (1995)
8EEMartin Farach, Teresa M. Przytycka, Mikkel Thorup: On the Agreement of Many Trees. Inf. Process. Lett. 55(6): 297-301 (1995)
1994
7 Martin Farach, Mikkel Thorup: Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) FOCS 1994: 770-779
6 Martin Farach, Mikkel Thorup: Fast Comparison of Evolutionary Trees. SODA 1994: 481-488
5EEMikkel Thorup: Efficient Preprocessing of Simple Binary Pattern Forests. SWAT 1994: 350-358
4EEMikkel Thorup: Controlled Grammatic Ambiguity. ACM Trans. Program. Lang. Syst. 16(3): 1024-1050 (1994)
1992
3EEMikkel Thorup: On Shortcutting Digraphs. WG 1992: 205-211
1991
2 Andrzej Blikle, Andrzej Tarlecki, Mikkel Thorup: On Conservative Extensions of Syntax in System Development. Theor. Comput. Sci. 90(1): 209-233 (1991)
1990
1EEAndrzej Blikle, Mikkel Thorup: On Conservative Extensions of Syntax in the Process of System Development. VDM Europe 1990: 504-525

Coauthor Index

1Ittai Abraham [95] [135]
2Richa Agarwala [17] [39]
3Noga Alon [108]
4Stephen Alstrup [15] [18] [25] [28] [35] [38] [46] [47] [48] [52] [66] [77] [105] [106] [110]
5Arne Andersson [20] [37] [51] [60] [67] [122]
6David Applegate [87]
7Matthew H. Austern [75]
8Vineet Bafna [17] [39]
9Michael A. Bender [66]
10Philip Bille [143]
11Andrzej Blikle [1] [2]
12Adam L. Buchsbaum [79] [89]
13Luciana S. Buriol [100] [119] [132]
14Rezaul Alam Chowdhury [131]
15Edith Cohen [126] [127] [133] [138] [139] [142]
16Richard Cole [43]
17Erik D. Demaine [66]
18Camil Demetrescu [70] [118] [131]
19Nick G. Duffield [61] [71] [85] [98] [102] [103] [104] [108] [109] [120] [126] [127] [133] [138] [139] [142]
20Martin Farach-Colton (Martin Farach) [6] [7] [8] [9] [11] [12] [17] [21] [31] [39] [43] [66]
21Pompeo Faruolo [118]
22Bernard Fortz [54]
23Cyril Gavoille [95] [135]
24Inge Li Gørtz [110]
25Anupam Gupta [81]
26Yijie Han [72]
27Dov Harel [38]
28Ramesh Hariharan [43]
29Monika Rauch Henzinger (Monika Rauch) [19] [22]
30Jacob Holm [28] [32] [35] [48] [55] [77] [105]
31Thore Husfeldt [106]
32Giuseppe F. Italiano [118]
33Raj Iyer [56]
34Haim Kaplan [126] [127] [133] [139] [142]
35David R. Karger [42] [56] [68] [90]
36Howard J. Karloff [79] [89]
37Valerie King [64]
38Philip N. Klein [42] [68] [90]
39Amit Kumar [81]
40Peter W. Lauridsen [18] [25] [38] [47]
41Kristian de Lichtenberg [28] [32] [35] [55] [77] [105]
42Carsten Lund [61] [71] [85] [98] [102] [103] [104] [108] [109] [120] [126] [127] [133] [138] [139] [142]
43Omid Madani [140]
44Dahlia Malkhi (Dalia Malki) [95] [135]
45Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [79] [89]
46Ran Mendelson [94] [97] [113]
47Peter Bro Miltersen [20] [37]
48J. Ian Munro [66]
49Babu O. Narayanan [17]
50Noam Nisan [95] [135]
51Anna Pagh (Anna Östlin) [99]
52Rasmus Pagh [99]
53Mike Paterson [17] [39] [137]
54Mihai Patrascu [112] [114] [117] [125] [128]
55Yuval Peres [137]
56Teresa M. Przytycka [8] [12] [43]
57Hariharan Rahul [56]
58Vijaya Ramachandran [131]
59Theis Rauhe [66] [106] [110]
60Nick Reingold [79] [89]
61Mauricio G. C. Resende [100] [119] [132]
62Celso C. Ribeiro [100]
63Søren Riis [20]
64Liam Roditty [69] [111] [134]
65Matthew Roughan [84] [86]
66Jens P. Secher [52]
67Peer Sommerlund [25]
68Clifford Stein [42] [68] [90]
69Bjarne Stroustrup [75]
70Mario Szegedy [124] [129]
71Robert Endre Tarjan [94] [113]
72Andrzej Tarlecki [2]
73John Wilkinson [75]
74Peter Winkler (Peter M. Winkler) [137]
75Neal E. Young [42] [68] [90]
76Yin Zhang [84] [86] [96]
77Uri Zwick [58] [59] [69] [94] [97] [101] [110] [111] [113] [115] [134] [137] [140]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)