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

Jon M. Kleinberg

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

2009
134EECristian Danescu-Niculescu-Mizil, Gueorgi Kossinets, Jon M. Kleinberg, Lillian Lee: How opinions are received by online communities: a case study on amazon.com helpfulness votes. WWW 2009: 141-150
133EEDavid J. Crandall, Lars Backstrom, Daniel P. Huttenlocher, Jon M. Kleinberg: Mapping the world's photos. WWW 2009: 761-770
132EEAlan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany: Line-of-Sight Networks. Combinatorics, Probability & Computing 18(1-2): 145-163 (2009)
131EET.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. SIAM J. Comput. 38(6): 2303-2329 (2009)
2008
130EEJon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler: Strategic network formation with structural holes. ACM Conference on Electronic Commerce 2008: 284-293
129EEJon M. Kleinberg: Link structures, information flow, and social processes. Hypertext 2008: 3-4
128EEDavid J. Crandall, Dan Cosley, Daniel P. Huttenlocher, Jon M. Kleinberg, Siddharth Suri: Feedback effects between similarity and social influence in online communities. KDD 2008: 160-168
127EEGueorgi Kossinets, Jon M. Kleinberg, Duncan J. Watts: The structure of information pathways in a social communication network. KDD 2008: 435-443
126EEJon M. Kleinberg, Éva Tardos: Balanced outcomes in social exchange networks. STOC 2008: 295-304
125EELars Backstrom, Jon M. Kleinberg, Ravi Kumar, Jasmine Novak: Spatial variation in search engine queries. WWW 2008: 357-366
124EEGueorgi Kossinets, Jon M. Kleinberg, Duncan J. Watts: The Structure of Information Pathways in a Social Communication Network CoRR abs/0806.3201: (2008)
123EEJon M. Kleinberg: The convergence of social and technological networks. Commun. ACM 51(11): 66-72 (2008)
122EEJon M. Kleinberg, Mark Sandler: Using mixture models for collaborative filtering. J. Comput. Syst. Sci. 74(1): 49-69 (2008)
121EEElliot Anshelevich, David Kempe, Jon M. Kleinberg: Stability of Load Balancing Algorithms in Dynamic Adversarial Systems. SIAM J. Comput. 37(5): 1656-1673 (2008)
120EEJon M. Kleinberg, Mark Sandler, Aleksandrs Slivkins: Network Failure Detection and Graph Connectivity. SIAM J. Comput. 38(4): 1330-1346 (2008)
119EEElliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden: The Price of Stability for Network Design with Fair Cost Allocation. SIAM J. Comput. 38(4): 1602-1623 (2008)
2007
118EELarry Blume, David Easley, Jon M. Kleinberg, Éva Tardos: Trading networks with price-setting agents. ACM Conference on Electronic Commerce 2007: 143-151
117EENicole Immorlica, Jon M. Kleinberg, Mohammad Mahdian, Tom Wexler: The role of compatibility in the diffusion of technologies through social networks. ACM Conference on Electronic Commerce 2007: 75-83
116EEJon M. Kleinberg: Challenges in mining social network data: processes, privacy, and paradoxes. KDD 2007: 4-5
115EEAlan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany: Line-of-sight networks. SODA 2007: 968-977
114EELars Backstrom, Cynthia Dwork, Jon M. Kleinberg: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. WWW 2007: 181-190
113EEDavid Liben-Nowell, Jon M. Kleinberg: The link-prediction problem for social networks. JASIST 58(7): 1019-1031 (2007)
112EEJure Leskovec, Jon M. Kleinberg, Christos Faloutsos: Graph evolution: Densification and shrinking diameters. TKDD 1(1): (2007)
2006
111 Jon M. Kleinberg: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006 ACM 2006
110EEAndreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg: Near-optimal sensor placements: maximizing information while minimizing communication cost. IPSN 2006: 2-10
109EELars Backstrom, Daniel P. Huttenlocher, Jon M. Kleinberg, Xiangyang Lan: Group formation in large social networks: membership, growth, and evolution. KDD 2006: 44-54
108EEJure Leskovec, Ajit Singh, Jon M. Kleinberg: Patterns of Influence in a Recommendation Network. PAKDD 2006: 380-389
107EEJon M. Kleinberg: Distributed social systems. PODC 2006: 5-6
106EEJon M. Kleinberg: Social networks, incentives, and search. SIGIR 2006: 210-211
105EEAmit Kumar, Jon M. Kleinberg: Fairness Measures for Resource Allocation. SIAM J. Comput. 36(3): 657-680 (2006)
2005
104EEJon M. Kleinberg, Prabhakar Raghavan: Query Incentive Networks. FOCS 2005: 132-141
103EEAnirban Dasgupta, John E. Hopcroft, Jon M. Kleinberg, Mark Sandler: On Learning Mixtures of Heavy-Tailed Distributions. FOCS 2005: 491-500
102EEJon M. Kleinberg: An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs. FOCS 2005: 627-636
101EEIttai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins: Metric Embeddings with Relaxed Guarantees. FOCS 2005: 83-100
100EEDavid Kempe, Jon M. Kleinberg, Éva Tardos: Influential Nodes in a Diffusion Model for Social Networks. ICALP 2005: 1127-1138
99EEJure Leskovec, Jon M. Kleinberg, Christos Faloutsos: Graphs over time: densification laws, shrinking diameters and possible explanations. KDD 2005: 177-187
98EEJure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos: Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication. PKDD 2005: 133-145
97EERobert D. Kleinberg, Jon M. Kleinberg: Isomorphism and embedding problems for infinite limits of scale-free graphs. SODA 2005: 277-286
2004
96EEElliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden: The Price of Stability for Network Design with Fair Cost Allocation. FOCS 2004: 295-304
95EEJon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler: Triangulation and Embedding Using Small Sets of Beacons. FOCS 2004: 444-453
94EELori Lorigo, Jon M. Kleinberg, Richard Eaton, Robert L. Constable: A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics. MKM 2004: 220-235
93EELeonid Meyerguz, David Kempe, Jon M. Kleinberg, Ron Elber: The evolutionary capacity of protein structures. RECOMB 2004: 290-297
92EEJon M. Kleinberg, Mark Sandler, Aleksandrs Slivkins: Network failure detection and graph connectivity. SODA 2004: 76-85
91EEJon M. Kleinberg, Mark Sandler: Using mixture models for collaborative filtering. STOC 2004: 569-578
90EEJon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: Segmentation problems. J. ACM 51(2): 263-280 (2004)
89EEDavid Kempe, Jon M. Kleinberg, Alan J. Demers: Spatial gossip and resource location protocols. J. ACM 51(6): 943-967 (2004)
88EEDavid Liben-Nowell, Jon M. Kleinberg: Structural properties and tractability results for linear synteny. J. Discrete Algorithms 2(2): 207-228 (2004)
87EEMoses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins: Minimizing Wirelength in Zero and Bounded Skew Clock Trees. SIAM J. Discrete Math. 17(4): 582-595 (2004)
2003
86EEJon M. Kleinberg, Mark Sandler: Convergent algorithms for collaborative filtering. ACM Conference on Electronic Commerce 2003: 1-10
85EEDavid Liben-Nowell, Jon M. Kleinberg: The link prediction problem for social networks. CIKM 2003: 556-559
84EEDavid Kempe, Jon M. Kleinberg, Éva Tardos: Maximizing the spread of influence through a social network. KDD 2003: 137-146
83EEPedro F. Felzenszwalb, Daniel P. Huttenlocher, Jon M. Kleinberg: Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis. NIPS 2003
82EEJon M. Kleinberg: Bursty and Hierarchical Structure in Streams. Data Min. Knowl. Discov. 7(4): 373-397 (2003)
81 Jon M. Kleinberg: Detecting a Network Failure. Internet Mathematics 1(1): (2003)
80 Avrim Blum, Adam Tauman Kalai, Jon M. Kleinberg: Admission Control to Minimize Rejections. Internet Mathematics 1(2): (2003)
79EEJon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: Auditing Boolean attributes. J. Comput. Syst. Sci. 66(1): 244-253 (2003)
78EEJohannes Gehrke, Paul Ginsparg, Jon M. Kleinberg: Overview of the 2003 KDD Cup. SIGKDD Explorations 5(2): 149-151 (2003)
2002
77EEDavid Kempe, Jon M. Kleinberg: Protocols and Impossibility Results for Gossip-Based Communication Mechanisms. FOCS 2002: 471-480
76 Jon M. Kleinberg: Information Networks, Link Analysis, and Temporal Dynamics. IFIP TCS 2002: 23-25
75EEJon M. Kleinberg: Bursty and hierarchical structure in streams. KDD 2002: 91-101
74EEJon M. Kleinberg: An Impossibility Theorem for Clustering. NIPS 2002: 446-453
73EEDebra Goldberg, Susan McCouch, Jon M. Kleinberg: Constructing Comparative Genome Maps with Unresolved Marker Order. Pacific Symposium on Biocomputing 2002: 139-150
72EEElliot Anshelevich, David Kempe, Jon M. Kleinberg: Stability of load balancing algorithms in dynamic adversarial systems. STOC 2002: 399-406
71EEJon M. Kleinberg, Éva Tardos: Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. J. ACM 49(5): 616-639 (2002)
70EEMoses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai: Query Strategies for Priced Information. J. Comput. Syst. Sci. 64(4): 785-819 (2002)
69EEDavid Kempe, Jon M. Kleinberg, Amit Kumar: Connectivity and Inference Problems for Temporal Networks. J. Comput. Syst. Sci. 64(4): 820-842 (2002)
68EELenore Cowen, Ronald Fagin, Joe Kilian, Jon M. Kleinberg: Guest Editor's Foreword. J. Comput. Syst. Sci. 65(1): 1 (2002)
67 Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning: A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289(1): 69-83 (2002)
2001
66EEJon M. Kleinberg: Small-World Phenomena and the Dynamics of Information. NIPS 2001: 431-438
65EEDavid Kempe, Jon M. Kleinberg, Alan J. Demers: Spatial gossip and resource location protocols. STOC 2001: 163-172
64EEAnupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, Bülent Yener: Provisioning a virtual private network: a network design problem for multicommodity flow. STOC 2001: 389-398
63EEAvrim Blum, Adam Kalai, Jon M. Kleinberg: Admission Control to Minimize Rejections. WADS 2001: 155-164
62EEAllan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson: Adversarial queuing theory. J. ACM 48(1): 13-38 (2001)
61EEMatthew Andrews, Baruch Awerbuch, Antonio Fernández, Frank Thomson Leighton, Zhiyong Liu, Jon M. Kleinberg: Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM 48(1): 39-69 (2001)
60 Jon M. Kleinberg, Amit Kumar: Wavelength Conversion in Optical Networks. J. Algorithms 38(1): 25-50 (2001)
59 Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Fairness in Routing and Load Balancing. J. Comput. Syst. Sci. 63(1): 2-20 (2001)
2000
58EEDavid Liben-Nowell, Jon M. Kleinberg: Structural Properties and Tractability Results for Linear Synteny. CPM 2000: 248-263
57 Jon M. Kleinberg: Detecting a Network Failure. FOCS 2000: 231-239
56 Amit Kumar, Jon M. Kleinberg: Fairness Measures for Resource Allocation. FOCS 2000: 75-85
55EEJon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: Auditing Boolean Attributes. PODS 2000: 86-91
54EEJon M. Kleinberg: The small-world phenomenon: an algorithm perspective. STOC 2000: 163-170
53EERonald Fagin, Anna R. Karlin, Jon M. Kleinberg, Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt Rubinfeld, Madhu Sudan, Andrew Tomkins: Random walks with ``back buttons'' (extended abstract). STOC 2000: 484-493
52EEDavid Kempe, Jon M. Kleinberg, Amit Kumar: Connectivity and inference problems for temporal networks. STOC 2000: 504-513
51EEMoses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai: Query strategies for priced information (extended abstract). STOC 2000: 582-591
50 Alok Aggarwal, Jon M. Kleinberg, David P. Williamson: Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. SIAM J. Comput. 29(4): 1321-1333 (2000)
49 Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Allocating Bandwidth for Bursty Connections. SIAM J. Comput. 30(1): 191-217 (2000)
48EEDavid Gibson, Jon M. Kleinberg, Prabhakar Raghavan: Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB J. 8(3-4): 222-236 (2000)
1999
47EEJon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: The Web as a Graph: Measurements, Models, and Methods. COCOON 1999: 1-17
46EEJon M. Kleinberg, Éva Tardos: Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. FOCS 1999: 14-23
45EEJon M. Kleinberg, Yuval Rabani, Éva Tardos: Fairness in Routing and Load Balancing. FOCS 1999: 568-578
44EEJon M. Kleinberg, Andrew Tomkins: Applications of Linear Algebra in Information Retrieval and Hypertext Analysis. PODS 1999: 185-193
43EEL. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: Fast detection of common geometric substructure in proteins. RECOMB 1999: 104-114
42EEJon M. Kleinberg: Efficient algorithms for protein sequence design and the analysis of certain evolutionary fitness landscapes. RECOMB 1999: 226-237
41EEMoses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins: Minimizing Wirelength in Zero and Bounded Skew Clock Trees. SODA 1999: 177-184
40EEJon M. Kleinberg, Amit Kumar: Wavelength Conversion in Optical Networks. SODA 1999: 566-575
39EEJon M. Kleinberg: Hubs, authorities, and communities. ACM Comput. Surv. 31(4es): 5 (1999)
38 Soumen Chakrabarti, Byron Dom, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins, David Gibson, Jon M. Kleinberg: Mining the Web's Link Structure. IEEE Computer 32(8): 60-67 (1999)
37EEBonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton: Reconstructing a Three-Dimensional Model with Arbitrary Errors. J. ACM 46(2): 212-235 (1999)
36EEJon M. Kleinberg: Authoritative Sources in a Hyperlinked Environment. J. ACM 46(5): 604-632 (1999)
35 Jon M. Kleinberg: Efficient Algorithms for Protein Sequence Design and the Analysis of Certain Evolutionary Fitness Landscapes. Journal of Computational Biology 6(3/4): (1999)
34 L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: Fast Detection of Common Geometric Substructure in Proteins. Journal of Computational Biology 6(3/4): (1999)
1998
33EEDavid Gibson, Jon M. Kleinberg, Prabhakar Raghavan: Inferring Web Communities from Link Topology. Hypertext 1998: 225-234
32 Jon M. Kleinberg: Authoritative Sources in a Hyperlinked Environment. SODA 1998: 668-677
31EEJon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: Segmentation Problems. STOC 1998: 473-482
30EEJon M. Kleinberg: Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem. STOC 1998: 530-539
29EEDavid Gibson, Jon M. Kleinberg, Prabhakar Raghavan: Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB 1998: 311-322
28EESoumen Chakrabarti, Byron Dom, Prabhakar Raghavan, Sridhar Rajagopalan, David Gibson, Jon M. Kleinberg: Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text. Computer Networks 30(1-7): 65-74 (1998)
27 Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: A Microeconomic View of Data Mining. Data Min. Knowl. Discov. 2(4): 311-324 (1998)
26 Jon M. Kleinberg, Éva Tardos: Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks. J. Comput. Syst. Sci. 57(1): 61-73 (1998)
25 Michel X. Goemans, Jon M. Kleinberg: An improved approximation ratio for the minimum latency problem. Math. Program. 82: 111-124 (1998)
24EEJon M. Kleinberg, Michel X. Goemans: The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover. SIAM J. Discrete Math. 11(2): 196-204 (1998)
1997
23EEJon M. Kleinberg, Rajeev Motwani, Prabhakar Raghavan, Suresh Venkatasubramanian: Storage Management for Evolving Databases. FOCS 1997: 353-362
22EEJon M. Kleinberg: Two Algorithms for Nearest-Neighbor Search in High Dimensions. STOC 1997: 599-608
21EEJon M. Kleinberg, Yuval Rabani, Éva Tardos: Allocating Bandwidth for Bursty Connections. STOC 1997: 664-673
20 L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets: Geometric Pattern Matching Under Euclidean Motion. Comput. Geom. 7: 113-124 (1997)
1996
19 Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu: Universal Stability Results for Greedy Contention-Resolution Protocols. FOCS 1996: 380-389
18 Jon M. Kleinberg: Single-Source Unsplittable Flow. FOCS 1996: 68-77
17 Jon M. Kleinberg, Ronitt Rubinfeld: Short Paths in Expander Graphs. FOCS 1996: 86-95
16 Michel X. Goemans, Jon M. Kleinberg: An Improved Approximation Ratio for the Minimum Latency Problem. SODA 1996: 152-158
15EEAllan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson: Adversarial Queueing Theory. STOC 1996: 376-385
14EEBonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton: Reconstructing a Three-Dimensional Model with Arbitrary Errors. STOC 1996: 449-458
13EEAlok Aggarwal, Jon M. Kleinberg, David P. Williamson: Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. STOC 1996: 585-594
1995
12 Jon M. Kleinberg, Éva Tardos: Disjoint Paths in Densely Embedded Graphs. FOCS 1995: 52-61
11 Jon M. Kleinberg, Hagit Attiya, Nancy A. Lynch: Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report). ISTCS 1995: 258-267
10EEJon M. Kleinberg, Éva Tardos: Approximations for the disjoint paths problem in high-diameter planar networks. STOC 1995: 26-35
9EERan El-Yaniv, Jon M. Kleinberg: Geometric Two-Server Algorithms. Inf. Process. Lett. 53(6): 355-358 (1995)
1994
8 Jon M. Kleinberg: The Localization Problem for Mobile Robots FOCS 1994: 521-531
7 Daniel P. Huttenlocher, Jon M. Kleinberg: Comparing Point Sets Under Projection. SODA 1994: 1-7
6 Jon M. Kleinberg: On-line Search in a Simple Polygon. SODA 1994: 8-15
5 Jon M. Kleinberg: A Lower Bound for Two-Server Balancing Algorithms. Inf. Process. Lett. 52(1): 39-43 (1994)
1993
4 L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets: Geometric Pattern Matching Under Euclidean Motion. CCCG 1993: 151-156
3 Jon M. Kleinberg, Sendhil Mullainathan: Resource Bounds and Combinations of Consensus Objects. PODC 1993: 133-143
1992
2EEDaniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: On Dynamic Voronoi Diagrams and the Minimum Hausdorff Distance for Point Sets Under Euclidean Motion in the Plane. Symposium on Computational Geometry 1992: 110-119
1 Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: Voronoi Diagrams of Rigidly Moving Sets of Points. Inf. Process. Lett. 43(4): 217-223 (1992)

Coauthor Index

1Ittai Abraham [101]
2Alok Aggarwal [13] [50]
3Matthew Andrews [19] [61]
4Elliot Anshelevich [72] [96] [119] [121]
5Hagit Attiya (Chagit Attiya) [11]
6Baruch Awerbuch [19] [61]
7Lars Backstrom [109] [114] [125] [133]
8Yair Bartal [101]
9Bonnie Berger [14] [37]
10Avrim Blum [63] [80]
11Larry Blume [118]
12Allan Borodin [15] [62]
13Deepayan Chakrabarti [98]
14Soumen Chakrabarti [28] [38]
15T.-H. Hubert Chan (Hubert T.-H. Chan) [101] [131]
16Moses Charikar [41] [51] [70] [87]
17L. Paul Chew [4] [20] [34] [43]
18Robert L. Constable [94]
19Dan Cosley [128]
20Lenore Cowen [68]
21David J. Crandall [128] [133]
22Cristian Danescu-Niculescu-Mizil [134]
23Evgeny Dantsin [67]
24Anirban Dasgupta [96] [103] [119]
25Warren Debany [115] [132]
26Alan J. Demers [65] [89]
27Kedar Dhamdhere [101] [131]
28Byron Dom [28] [38]
29Cynthia Dwork [114]
30David Easley [118]
31Richard Eaton [94]
32Ran El-Yaniv [9]
33Ron Elber [93]
34Ronald Fagin [51] [53] [68] [70]
35Christos Faloutsos [98] [99] [112]
36Pedro F. Felzenszwalb [83]
37Antonio Fernández [19] [61]
38Alan M. Frieze [115] [132]
39Johannes Gehrke [78]
40David Gibson [28] [29] [33] [38] [48]
41Paul Ginsparg [78]
42Michel X. Goemans [16] [24] [25]
43Andreas Goerdt [67]
44Debra Goldberg [73]
45Michael T. Goodrich [4] [20]
46Carlos Guestrin [110]
47Anupam Gupta [64] [101] [110] [131]
48Venkatesan Guruswami [51] [70]
49Edward A. Hirsch [67]
50John E. Hopcroft [103]
51Daniel P. Huttenlocher [1] [2] [4] [7] [20] [34] [43] [83] [109] [128] [133]
52Nicole Immorlica [117]
53Adam Tauman Kalai (Adam Kalai) [63] [80]
54Ravi Kannan (Ravindran Kannan) [67]
55Anna R. Karlin [53]
56Klara Kedem [1] [2] [4] [20] [34] [43]
57David Kempe [52] [65] [69] [72] [77] [84] [89] [93] [100] [121]
58Joe Kilian [68]
59Robert D. Kleinberg (Robert Kleinberg) [97]
60Gueorgi Kossinets [124] [127] [134]
61Andreas Krause [110]
62Dina Kravets [4] [20]
63Amit Kumar [40] [52] [56] [60] [64] [69] [105]
64Ravi Kumar (S. Ravi Kumar) [38] [41] [47] [87] [125]
65Xiangyang Lan [109]
66Lillian Lee [134]
67Frank Thomson Leighton (Tom Leighton) [14] [19] [37] [61]
68Jure Leskovec [98] [99] [108] [112]
69David Liben-Nowell [58] [85] [88] [113]
70Zhiyong Liu [19] [61]
71Lori Lorigo [94]
72Nancy A. Lynch [11]
73Mohammad Mahdian [117]
74Susan McCouch [73]
75Leonid Meyerguz [93]
76Rajeev Motwani [23]
77Sendhil Mullainathan [3]
78Ofer Neiman [101]
79Jasmine Novak [125]
80Christos H. Papadimitriou [27] [31] [55] [67] [79] [90]
81Yuval Rabani [21] [45] [49] [59]
82Prabhakar Raghavan [15] [23] [27] [28] [29] [31] [33] [38] [47] [48] [51] [53] [55] [62] [67] [70] [79] [90] [104]
83Sridhar Rajagopalan [28] [38] [41] [47] [53] [87]
84Rajeev Rastogi [64]
85R. Ravi [115] [132]
86Tim Roughgarden [96] [119]
87Ronitt Rubinfeld [17] [53]
88Amit Sahai [41] [51] [70] [87]
89Mark Sandler [86] [91] [92] [103] [120] [122]
90Uwe Schöning [67]
91Ajit Singh [108]
92Aleksandrs Slivkins [92] [95] [101] [120] [131]
93Madhu Sudan [15] [53] [62]
94Siddharth Suri [128] [130]
95Éva Tardos [10] [12] [21] [26] [45] [46] [49] [59] [71] [84] [96] [100] [118] [119] [126] [130]
96Andrew Tomkins [38] [41] [44] [47] [53] [87]
97Suresh Venkatasubramanian [23]
98Duncan J. Watts [124] [127]
99Tom Wexler [95] [96] [117] [119] [130]
100David P. Williamson [13] [15] [50] [62]
101Bülent Yener [64]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)