| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Jon M. Kleinberg Jon M. Kleinberg, Mark Sandler , Aleksandrs Slivkins : Network failure detection and graph connectivity. SODA 2004 : 76-85 Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : Segmentation problems. J. ACM 51 (2): 263-280 (2004) Jon M. Kleinberg, Mark Sandler : Convergent algorithms for collaborative filtering. ACM Conference on Electronic Commerce 2003 : 1-10 David Liben-Nowell , Jon M. Kleinberg: The link prediction problem for social networks. CIKM 2003 : 556-559 David Kempe , Jon M. Kleinberg, Éva Tardos : Maximizing the spread of influence through a social network. KDD 2003 : 137-146 Jon M. Kleinberg: Bursty and Hierarchical Structure in Streams. Data Min. Knowl. Discov. 7 (4): 373-397 (2003) Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : Auditing Boolean attributes. J. Comput. Syst. Sci. 66 (1): 244-253 (2003) David Kempe , Jon M. Kleinberg: Protocols and Impossibility Results for Gossip-Based Communication Mechanisms. FOCS 2002 : 471-480 Jon M. Kleinberg: Information Networks, Link Analysis, and Temporal Dynamics. IFIP TCS 2002 : 23-25 Jon M. Kleinberg: Bursty and hierarchical structure in streams. KDD 2002 : 91-101 Debra Goldberg , Susan McCouch , Jon M. Kleinberg: Constructing Comparative Genome Maps with Unresolved Marker Order. Pacific Symposium on Biocomputing 2002 : 139-150 Elliot Anshelevich , David Kempe , Jon M. Kleinberg: Stability of load balancing algorithms in dynamic adversarial systems. STOC 2002 : 399-406 Jon 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) Moses 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) David Kempe , Jon M. Kleinberg, Amit Kumar : Connectivity and Inference Problems for Temporal Networks. J. Comput. Syst. Sci. 64 (4): 820-842 (2002) Lenore Cowen , Ronald Fagin , Joe Kilian , Jon M. Kleinberg: Guest Editor's Foreword. J. Comput. Syst. Sci. 65 (1): 1 (2002) 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) Jon M. Kleinberg: Small-World Phenomena and the Dynamics of Information. NIPS 2001 : 431-438 David Kempe , Jon M. Kleinberg, Alan J. Demers : Spatial gossip and resource location protocols. STOC 2001 : 163-172 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 Avrim Blum , Adam Kalai , Jon M. Kleinberg: Admission Control to Minimize Rejections. WADS 2001 : 155-164 Allan Borodin , Jon M. Kleinberg, Prabhakar Raghavan , Madhu Sudan , David P. Williamson : Adversarial queuing theory. J. ACM 48 (1): 13-38 (2001) 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. J. ACM 48 (1): 39-69 (2001) Jon M. Kleinberg, Amit Kumar : Wavelength Conversion in Optical Networks. J. Algorithms 38 (1): 25-50 (2001) Jon M. Kleinberg, Yuval Rabani , Éva Tardos : Fairness in Routing and Load Balancing. J. Comput. Syst. Sci. 63 (1): 2-20 (2001) David Liben-Nowell , Jon M. Kleinberg: Structural Properties and Tractability Results for Linear Synteny. CPM 2000 : 248-263 Jon M. Kleinberg: Detecting a Network Failure. FOCS 2000 : 231-239 Amit Kumar , Jon M. Kleinberg: Fairness Measures for Resource Allocation. FOCS 2000 : 75-85 Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : Auditing Boolean Attributes. PODS 2000 : 86-91 Jon M. Kleinberg: The small-world phenomenon: an algorithm perspective. STOC 2000 : 163-170 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 David Kempe , Jon M. Kleinberg, Amit Kumar : Connectivity and inference problems for temporal networks. STOC 2000 : 504-513 Moses Charikar , Ronald Fagin , Venkatesan Guruswami , Jon M. Kleinberg, Prabhakar Raghavan , Amit Sahai : Query strategies for priced information (extended abstract). STOC 2000 : 582-591 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) Jon M. Kleinberg, Yuval Rabani , Éva Tardos : Allocating Bandwidth for Bursty Connections. SIAM J. Comput. 30 (1): 191-217 (2000) David Gibson , Jon M. Kleinberg, Prabhakar Raghavan : Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB J. 8 (3-4): 222-236 (2000) Jon M. Kleinberg, Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : The Web as a Graph: Measurements, Models, and Methods. COCOON 1999 : 1-17 Jon M. Kleinberg, Éva Tardos : Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. FOCS 1999 : 14-23 Jon M. Kleinberg, Yuval Rabani , Éva Tardos : Fairness in Routing and Load Balancing. FOCS 1999 : 568-578 Jon M. Kleinberg, Andrew Tomkins : Applications of Linear Algebra in Information Retrieval and Hypertext Analysis. PODS 1999 : 185-193 L. Paul Chew , Daniel P. Huttenlocher , Klara Kedem , Jon M. Kleinberg: Fast detection of common geometric substructure in proteins. RECOMB 1999 : 104-114 Jon M. Kleinberg: Efficient algorithms for protein sequence design and the analysis of certain evolutionary fitness landscapes. RECOMB 1999 : 226-237 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 Jon M. Kleinberg, Amit Kumar : Wavelength Conversion in Optical Networks. SODA 1999 : 566-575 Jon M. Kleinberg: Hubs, authorities, and communities. ACM Comput. Surv. 31 (4es): 5 (1999) 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) Bonnie Berger , Jon M. Kleinberg, Frank Thomson Leighton : Reconstructing a Three-Dimensional Model with Arbitrary Errors. J. ACM 46 (2): 212-235 (1999) Jon M. Kleinberg: Authoritative Sources in a Hyperlinked Environment. J. ACM 46 (5): 604-632 (1999) 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) 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) David Gibson , Jon M. Kleinberg, Prabhakar Raghavan : Inferring Web Communities from Link Topology. Hypertext 1998 : 225-234 Jon M. Kleinberg: Authoritative Sources in a Hyperlinked Environment. SODA 1998 : 668-677 Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : Segmentation Problems. STOC 1998 : 473-482 Jon M. Kleinberg: Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem. STOC 1998 : 530-539 David Gibson , Jon M. Kleinberg, Prabhakar Raghavan : Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB 1998 : 311-322 Soumen 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) Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : A Microeconomic View of Data Mining. Data Min. Knowl. Discov. 2 (4): 311-324 (1998) 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) Jon 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) Jon M. Kleinberg, Rajeev Motwani , Prabhakar Raghavan , Suresh Venkatasubramanian : Storage Management for Evolving Databases. FOCS 1997 : 353-362 Jon M. Kleinberg: Two Algorithms for Nearest-Neighbor Search in High Dimensions. STOC 1997 : 599-608 Jon M. Kleinberg, Yuval Rabani , Éva Tardos : Allocating Bandwidth for Bursty Connections. STOC 1997 : 664-673 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) 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 Jon M. Kleinberg: Single-Source Unsplittable Flow. FOCS 1996 : 68-77 Jon M. Kleinberg, Ronitt Rubinfeld : Short Paths in Expander Graphs. FOCS 1996 : 86-95 Michel X. Goemans , Jon M. Kleinberg: An Improved Approximation Ratio for the Minimum Latency Problem. SODA 1996 : 152-158 Allan Borodin , Jon M. Kleinberg, Prabhakar Raghavan , Madhu Sudan , David P. Williamson : Adversarial Queueing Theory. STOC 1996 : 376-385 Bonnie Berger , Jon M. Kleinberg, Frank Thomson Leighton : Reconstructing a Three-Dimensional Model with Arbitrary Errors. STOC 1996 : 449-458 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 Jon M. Kleinberg, Éva Tardos : Disjoint Paths in Densely Embedded Graphs. FOCS 1995 : 52-61 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 Jon M. Kleinberg, Éva Tardos : Approximations for the disjoint paths problem in high-diameter planar networks. STOC 1995 : 26-35 Ran El-Yaniv , Jon M. Kleinberg: Geometric Two-Server Algorithms. Inf. Process. Lett. 53 (6): 355-358 (1995) Jon M. Kleinberg: The Localization Problem for Mobile Robots FOCS 1994 : 521-531 Daniel P. Huttenlocher , Jon M. Kleinberg: Comparing Point Sets Under Projection. SODA 1994 : 1-7 Jon M. Kleinberg: On-line Search in a Simple Polygon. SODA 1994 : 8-15 Jon M. Kleinberg: A Lower Bound for Two-Server Balancing Algorithms. Inf. Process. Lett. 52 (1): 39-43 (1994) 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 Jon M. Kleinberg, Sendhil Mullainathan : Resource Bounds and Combinations of Consensus Objects. PODC 1993 : 133-143 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 Daniel P. Huttenlocher , Klara Kedem , Jon M. Kleinberg: Voronoi Diagrams of Rigidly Moving Sets of Points. Inf. Process. Lett. 43 (4): 217-223 (1992) 1 [ 13 ] [ 49 ] 2 [ 19 ] [ 60 ] 3 [ 71 ] 4 [ 11 ] 5 [ 19 ] [ 60 ] 6 [ 14 ] [ 36 ] 7 [ 62 ] 8 [ 15 ] [ 61 ] 9 [ 27 ] [ 37 ] 10 [ 40 ] [ 50 ] [ 69 ] 11 [ 4 ] [ 20 ] [ 33 ] [ 42 ] 12 [ 67 ] 13 [ 66 ] 14 [ 64 ] 15 [ 27 ] [ 37 ] 16 [ 9 ] 17 [ 50 ] [ 52 ] [ 67 ] [ 69 ] 18 [ 19 ] [ 60 ] 19 [ 27 ] [ 28 ] [ 32 ] [ 37 ] [ 47 ] 20 [ 16 ] [ 24 ] 21 [ 66 ] 22 [ 72 ] 23 [ 4 ] [ 20 ] 24 [ 63 ] 25 [ 50 ] [ 69 ] 26 [ 66 ] 27 [ 1 ] [ 2 ] [ 4 ] [ 7 ] [ 20 ] [ 33 ] [ 42 ] 28 [ 62 ] 29 [ 66 ] 30 [ 52 ] 31 [ 1 ] [ 2 ] [ 4 ] [ 20 ] [ 33 ] [ 42 ] 32 [ 51 ] [ 64 ] [ 68 ] [ 71 ] [ 75 ] [ 78 ] 33 [ 67 ] 34 [ 4 ] [ 20 ] 35 [ 39 ] [ 51 ] [ 55 ] [ 59 ] [ 63 ] [ 68 ] 36 [ 37 ] [ 40 ] [ 46 ] 37 [ 14 ] [ 19 ] [ 36 ] [ 60 ] 38 [ 57 ] [ 79 ] 39 [ 19 ] [ 60 ] 40 [ 11 ] 41 [ 72 ] 42 [ 23 ] 43 [ 3 ] 44 [ 26 ] [ 30 ] [ 54 ] [ 66 ] [ 76 ] [ 81 ] 45 [ 21 ] [ 44 ] [ 48 ] [ 58 ] 46 [ 15 ] [ 23 ] [ 26 ] [ 27 ] [ 28 ] [ 30 ] [ 32 ] [ 37 ] [ 46 ] [ 47 ] [ 50 ] [ 52 ] [ 54 ] [ 61 ] [ 66 ] [ 69 ] [ 76 ] [ 81 ] 47 [ 27 ] [ 37 ] [ 40 ] [ 46 ] [ 52 ] 48 [ 63 ] 49 [ 17 ] [ 52 ] 50 [ 40 ] [ 50 ] [ 69 ] 51 [ 80 ] [ 82 ] 52 [ 66 ] 53 [ 82 ] 54 [ 15 ] [ 52 ] [ 61 ] 55 [ 10 ] [ 12 ] [ 21 ] [ 25 ] [ 44 ] [ 45 ] [ 48 ] [ 58 ] [ 70 ] [ 78 ] 56 [ 37 ] [ 40 ] [ 43 ] [ 46 ] [ 52 ] 57 [ 23 ] 58 [ 13 ] [ 15 ] [ 49 ] [ 61 ] 59 [ 63 ]  ©2004 Association for Computing Machinery |
