![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Jon M. Kleinberg 76 Jon M. Kleinberg, Mark Sandler : Convergent algorithms for collaborative filtering. ACM Conference on Electronic Commerce 2003 : 1-10 75 Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : Auditing Boolean attributes. JCSS 66 (1): 244-253 (2003) 74 David Kempe , Jon M. Kleinberg: Protocols and Impossibility Results for Gossip-Based Communication Mechanisms. FOCS 2002 : 471-480 73 Jon M. Kleinberg: Information Networks, Link Analysis, and Temporal Dynamics. IFIP TCS 2002 : 23-25 72 Jon M. Kleinberg: Bursty and hierarchical structure in streams. KDD 2002 : 91-101 71 Debra Goldberg , Susan McCouch , Jon M. Kleinberg: Constructing Comparative Genome Maps with Unresolved Marker Order. Pacific Symposium on Biocomputing 2002 : 139-150 70 Elliot Anshelevich , David Kempe , Jon M. Kleinberg: Stability of load balancing algorithms in dynamic adversarial systems. STOC 2002 : 399-406 69 Jon M. Kleinberg, Éva Tardos : Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. JACM 49 (5): 616-639 (2002) 68 Moses Charikar , Ronald Fagin , Venkatesan Guruswami , Jon M. Kleinberg, Prabhakar Raghavan , Amit Sahai : Query Strategies for Priced Information. JCSS 64 (4): 785-819 (2002) 67 David Kempe , Jon M. Kleinberg, Amit Kumar : Connectivity and Inference Problems for Temporal Networks. JCSS 64 (4): 820-842 (2002) 66 Lenore Cowen , Ronald Fagin , Joe Kilian , Jon M. Kleinberg: Guest Editor's Foreword. JCSS 65 (1): 1 (2002) 65 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. TCS 289 (1): 69-83 (2002) 64 David Kempe , Jon M. Kleinberg, Alan J. Demers : Spatial gossip and resource location protocols. STOC 2001 : 163-172 63 Anupam 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 62 Avrim Blum , Adam Kalai , Jon M. Kleinberg: Admission Control to Minimize Rejections. WADS 2001 : 155-164 61 Jon M. Kleinberg, Amit Kumar : Wavelength Conversion in Optical Networks. J. Algorithms 38 (1): 25-50 (2001) 60 Allan Borodin , Jon M. Kleinberg, Prabhakar Raghavan , Madhu Sudan , David P. Williamson : Adversarial queuing theory. JACM 48 (1): 13-38 (2001) 59 Matthew 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. JACM 48 (1): 39-69 (2001) 58 Jon M. Kleinberg, Yuval Rabani , Éva Tardos : Fairness in Routing and Load Balancing. JCSS 63 (1): 2-20 (2001) 57 David Liben-Nowell , Jon M. Kleinberg: Structural Properties and Tractability Results for Linear Synteny. CPM 2000 : 248-263 56 Jon M. Kleinberg: Detecting a Network Failure. FOCS 2000 : 231-239 55 Amit Kumar , Jon M. Kleinberg: Fairness Measures for Resource Allocation. FOCS 2000 : 75-85 54 Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : Auditing Boolean Attributes. PODS 2000 : 86-91 53 Jon M. Kleinberg: The small-world phenomenon: an algorithm perspective. STOC 2000 : 163-170 52 Ronald 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 51 David Kempe , Jon M. Kleinberg, Amit Kumar : Connectivity and inference problems for temporal networks. STOC 2000 : 504-513 50 Moses Charikar , Ronald Fagin , Venkatesan Guruswami , Jon M. Kleinberg, Prabhakar Raghavan , Amit Sahai : Query strategies for priced information (extended abstract). STOC 2000 : 582-591 49 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) 48 Jon M. Kleinberg, Yuval Rabani , Éva Tardos : Allocating Bandwidth for Bursty Connections. SIAM J. Comput. 30 (1): 191-217 (2000) 47 David Gibson , Jon M. Kleinberg, Prabhakar Raghavan : Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB Journal 8 (3-4): 222-236 (2000) 46 Jon M. Kleinberg, Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : The Web as a Graph: Measurements, Models, and Methods. COCOON 1999 : 1-17 45 Jon M. Kleinberg, Éva Tardos : Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. FOCS 1999 : 14-23 44 Jon M. Kleinberg, Yuval Rabani , Éva Tardos : Fairness in Routing and Load Balancing. FOCS 1999 : 568-578 43 Jon M. Kleinberg, Andrew Tomkins : Applications of Linear Algebra in Information Retrieval and Hypertext Analysis. PODS 1999 : 185-193 42 L. Paul Chew , Daniel P. Huttenlocher , Klara Kedem , Jon M. Kleinberg: Fast detection of common geometric substructure in proteins. RECOMB 1999 : 104-114 41 Jon M. Kleinberg: Efficient algorithms for protein sequence design and the analysis of certain evolutionary fitness landscapes. RECOMB 1999 : 226-237 40 Moses 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 39 Jon M. Kleinberg, Amit Kumar : Wavelength Conversion in Optical Networks. SODA 1999 : 566-575 38 Jon M. Kleinberg: Hubs, authorities, and communities. ACM Computing Surveys 31 (4es): 5 (1999) 37 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) 36 Bonnie Berger , Jon M. Kleinberg, Frank Thomson Leighton : Reconstructing a Three-Dimensional Model with Arbitrary Errors. JACM 46 (2): 212-235 (1999) 35 Jon M. Kleinberg: Authoritative Sources in a Hyperlinked Environment. JACM 46 (5): 604-632 (1999) 34 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) 33 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) 32 David Gibson , Jon M. Kleinberg, Prabhakar Raghavan : Inferring Web Communities from Link Topology. Hypertext 1998 : 225-234 31 Jon M. Kleinberg: Authoritative Sources in a Hyperlinked Environment. SODA 1998 : 668-677 30 Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : Segmentation Problems. STOC 1998 : 473-482 29 Jon M. Kleinberg: Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem. STOC 1998 : 530-539 28 David Gibson , Jon M. Kleinberg, Prabhakar Raghavan : Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB 1998 : 311-322 27 Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : A Microeconomic View of Data Mining. Data Mining and Knowledge Discovery 2 (4): 311-324 (1998) 26 Jon M. Kleinberg, Éva Tardos : Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks. JCSS 57 (1): 61-73 (1998) 25 Jon M. Kleinberg, Michel X. Goemans : The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover. SIAM Journal on Discrete Mathematics 11 (2): 196-204 (1998) 24 Soumen Chakrabarti , Byron Dom , Prabhakar Raghavan , Sridhar Rajagopalan , David Gibson , Jon M. Kleinberg: Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text. WWW7 / Computer Networks 30 (1-7): 65-74 (1998) 23 Jon M. Kleinberg, Rajeev Motwani , Prabhakar Raghavan , Suresh Venkatasubramanian : Storage Management for Evolving Databases. FOCS 1997 : 353-362 22 Jon M. Kleinberg: Two Algorithms for Nearest-Neighbor Search in High Dimensions. STOC 1997 : 599-608 21 Jon 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. Computational Geometry 7 : 113-124 (1997) 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 15 Allan Borodin , Jon M. Kleinberg, Prabhakar Raghavan , Madhu Sudan , David P. Williamson : Adversarial Queueing Theory. STOC 1996 : 376-385 14 Bonnie Berger , Jon M. Kleinberg, Frank Thomson Leighton : Reconstructing a Three-Dimensional Model with Arbitrary Errors. STOC 1996 : 449-458 13 Alok 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 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 10 Jon M. Kleinberg, Éva Tardos : Approximations for the disjoint paths problem in high-diameter planar networks. STOC 1995 : 26-35 9 Ran El-Yaniv , Jon M. Kleinberg: Geometric Two-Server Algorithms. Information Processing Letters 53 (6): 355-358 (1995) 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. Information Processing Letters 52 (1): 39-43 (1994) 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 2 Daniel 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. Information Processing Letters 43 (4): 217-223 (1992) ![]() DiSC'03 © 2003 Association for Computing Machinery |