 | 2009 |
|---|
| 141 |       | Jure Leskovec,
Lars Backstrom,
Jon M. Kleinberg:
Meme-tracking and the dynamics of the news cycle.
KDD 2009: 497-506 |
| 140 | | Lars Backstrom,
Jon M. Kleinberg,
Ravi Kumar:
Optimizing web traffic via the media scheduling problem.
KDD 2009: 89-98 |
| 139 | | Cristian 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 |
| 138 | | David J. Crandall,
Lars Backstrom,
Daniel P. Huttenlocher,
Jon M. Kleinberg:
Mapping the world's photos.
WWW 2009: 761-770 |
| 137 | | Cristian 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
CoRR abs/0906.3741: (2009) |
| 136 | | Alan M. Frieze,
Jon M. Kleinberg,
R. Ravi,
Warren Debany:
Line-of-Sight Networks.
Combinatorics, Probability & Computing 18(1-2): 145-163 (2009) |
| 135 | | Jon M. Kleinberg,
Prabhakar Raghavan:
Some results of Christos Papadimitriou on internet structure, network routing, and web information.
Computer Science Review 3(2): 119-125 (2009) |
| 134 | | Jon M. Kleinberg,
Aleksandrs Slivkins,
Tom Wexler:
Triangulation and embedding using small sets of beacons.
J. ACM 56(6): (2009) |
| 133 | | T.-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) |
| 132 | | Scott Aaronson,
Sudipto Guha,
Jon M. Kleinberg,
Frank McSherry,
Dieter van Melkebeek,
Amit Sahai:
Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006).
SIAM J. Comput. 39(1): (2009) |
| 2008 |
|---|
| 131 | | Jon M. Kleinberg,
Siddharth Suri,
Éva Tardos,
Tom Wexler:
Strategic network formation with structural holes.
ACM Conference on Electronic Commerce 2008: 284-293 |
| 130 | | Jon M. Kleinberg:
Link structures, information flow, and social processes.
Hypertext 2008: 3-4 |
| 129 | | David 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 |
| 128 | | Gueorgi Kossinets,
Jon M. Kleinberg,
Duncan J. Watts:
The structure of information pathways in a social communication network.
KDD 2008: 435-443 |
| 127 | | Jon M. Kleinberg,
Éva Tardos:
Balanced outcomes in social exchange networks.
STOC 2008: 295-304 |
| 126 | | Lars Backstrom,
Jon M. Kleinberg,
Ravi Kumar,
Jasmine Novak:
Spatial variation in search engine queries.
WWW 2008: 357-366 |
| 125 | | Gueorgi Kossinets,
Jon M. Kleinberg,
Duncan J. Watts:
The Structure of Information Pathways in a Social Communication Network
CoRR abs/0806.3201: (2008) |
| 124 | | Jon M. Kleinberg:
The convergence of social and technological networks.
Commun. ACM 51(11): 66-72 (2008) |
| 123 | | Jon M. Kleinberg,
Mark Sandler:
Using mixture models for collaborative filtering.
J. Comput. Syst. Sci. 74(1): 49-69 (2008) |
| 122 | | Elliot Anshelevich,
David Kempe,
Jon M. Kleinberg:
Stability of Load Balancing Algorithms in Dynamic Adversarial Systems.
SIAM J. Comput. 37(5): 1656-1673 (2008) |
| 121 | | Jon M. Kleinberg,
Mark Sandler,
Aleksandrs Slivkins:
Network Failure Detection and Graph Connectivity.
SIAM J. Comput. 38(4): 1330-1346 (2008) |
| 120 | | Elliot 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) |
| 119 | | Jon M. Kleinberg,
Siddharth Suri,
Éva Tardos,
Tom Wexler:
Strategic network formation with structural holes.
SIGecom Exchanges 7(3): (2008) |
| 2007 |
|---|
| 118 | | Larry Blume,
David A. Easley,
Jon M. Kleinberg,
Éva Tardos:
Trading networks with price-setting agents.
ACM Conference on Electronic Commerce 2007: 143-151 |
| 117 | | Nicole 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 |
| 116 | | Jon M. Kleinberg:
Challenges in mining social network data: processes, privacy, and paradoxes.
KDD 2007: 4-5 |
| 115 | | Alan M. Frieze,
Jon M. Kleinberg,
R. Ravi,
Warren Debany:
Line-of-sight networks.
SODA 2007: 968-977 |
| 114 | | Lars Backstrom,
Cynthia Dwork,
Jon M. Kleinberg:
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography.
WWW 2007: 181-190 |
| 113 | | David Liben-Nowell,
Jon M. Kleinberg:
The link-prediction problem for social networks.
JASIST 58(7): 1019-1031 (2007) |
| 112 | | Jure 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 |
| 110 | | Andreas Krause,
Carlos Guestrin,
Anupam Gupta,
Jon M. Kleinberg:
Near-optimal sensor placements: maximizing information while minimizing communication cost.
IPSN 2006: 2-10 |
| 109 | | Lars Backstrom,
Daniel P. Huttenlocher,
Jon M. Kleinberg,
Xiangyang Lan:
Group formation in large social networks: membership, growth, and evolution.
KDD 2006: 44-54 |
| 108 | | Jure Leskovec,
Ajit Singh,
Jon M. Kleinberg:
Patterns of Influence in a Recommendation Network.
PAKDD 2006: 380-389 |
| 107 | | Jon M. Kleinberg:
Distributed social systems.
PODC 2006: 5-6 |
| 106 | | Jon M. Kleinberg:
Social networks, incentives, and search.
SIGIR 2006: 210-211 |
| 105 | | Amit Kumar,
Jon M. Kleinberg:
Fairness Measures for Resource Allocation.
SIAM J. Comput. 36(3): 657-680 (2006) |
| 2005 |
|---|
| 104 | | Jon M. Kleinberg,
Prabhakar Raghavan:
Query Incentive Networks.
FOCS 2005: 132-141 |
| 103 | | Anirban Dasgupta,
John E. Hopcroft,
Jon M. Kleinberg,
Mark Sandler:
On Learning Mixtures of Heavy-Tailed Distributions.
FOCS 2005: 491-500 |
| 102 | | Jon M. Kleinberg:
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs.
FOCS 2005: 627-636 |
| 101 | | Ittai 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 |
| 100 | | David Kempe,
Jon M. Kleinberg,
Éva Tardos:
Influential Nodes in a Diffusion Model for Social Networks.
ICALP 2005: 1127-1138 |
| 99 | | Jure Leskovec,
Jon M. Kleinberg,
Christos Faloutsos:
Graphs over time: densification laws, shrinking diameters and possible explanations.
KDD 2005: 177-187 |
| 98 | | Jure Leskovec,
Deepayan Chakrabarti,
Jon M. Kleinberg,
Christos Faloutsos:
Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication.
PKDD 2005: 133-145 |
| 97 | | Robert D. Kleinberg,
Jon M. Kleinberg:
Isomorphism and embedding problems for infinite limits of scale-free graphs.
SODA 2005: 277-286 |
| 2004 |
|---|
| 96 | | Elliot 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 |
| 95 | | Jon M. Kleinberg,
Aleksandrs Slivkins,
Tom Wexler:
Triangulation and Embedding Using Small Sets of Beacons.
FOCS 2004: 444-453 |
| 94 | | Lori 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 |
| 93 | | Leonid Meyerguz,
David Kempe,
Jon M. Kleinberg,
Ron Elber:
The evolutionary capacity of protein structures.
RECOMB 2004: 290-297 |
| 92 | | Jon M. Kleinberg,
Mark Sandler,
Aleksandrs Slivkins:
Network failure detection and graph connectivity.
SODA 2004: 76-85 |
| 91 | | Jon M. Kleinberg,
Mark Sandler:
Using mixture models for collaborative filtering.
STOC 2004: 569-578 |
| 90 | | Jon M. Kleinberg,
Christos H. Papadimitriou,
Prabhakar Raghavan:
Segmentation problems.
J. ACM 51(2): 263-280 (2004) |
| 89 | | David Kempe,
Jon M. Kleinberg,
Alan J. Demers:
Spatial gossip and resource location protocols.
J. ACM 51(6): 943-967 (2004) |
| 88 | | David Liben-Nowell,
Jon M. Kleinberg:
Structural properties and tractability results for linear synteny.
J. Discrete Algorithms 2(2): 207-228 (2004) |
| 87 | | Moses 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 |
|---|
| 86 | | Jon M. Kleinberg,
Mark Sandler:
Convergent algorithms for collaborative filtering.
ACM Conference on Electronic Commerce 2003: 1-10 |
| 85 | | David Liben-Nowell,
Jon M. Kleinberg:
The link prediction problem for social networks.
CIKM 2003: 556-559 |
| 84 | | David Kempe,
Jon M. Kleinberg,
Éva Tardos:
Maximizing the spread of influence through a social network.
KDD 2003: 137-146 |
| 83 | | Pedro F. Felzenszwalb,
Daniel P. Huttenlocher,
Jon M. Kleinberg:
Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis.
NIPS 2003 |
| 82 | | Jon 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) |
| 79 | | Jon M. Kleinberg,
Christos H. Papadimitriou,
Prabhakar Raghavan:
Auditing Boolean attributes.
J. Comput. Syst. Sci. 66(1): 244-253 (2003) |
| 78 | | Johannes Gehrke,
Paul Ginsparg,
Jon M. Kleinberg:
Overview of the 2003 KDD Cup.
SIGKDD Explorations 5(2): 149-151 (2003) |
| 2002 |
|---|
| 77 | | David 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 |
| 75 | | Jon M. Kleinberg:
Bursty and hierarchical structure in streams.
KDD 2002: 91-101 |
| 74 | | Jon M. Kleinberg:
An Impossibility Theorem for Clustering.
NIPS 2002: 446-453 |
| 73 | | Debra Goldberg,
Susan McCouch,
Jon M. Kleinberg:
Constructing Comparative Genome Maps with Unresolved Marker Order.
Pacific Symposium on Biocomputing 2002: 139-150 |
| 72 | | Elliot Anshelevich,
David Kempe,
Jon M. Kleinberg:
Stability of load balancing algorithms in dynamic adversarial systems.
STOC 2002: 399-406 |
| 71 | | 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) |
| 70 | | 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) |
| 69 | | David Kempe,
Jon M. Kleinberg,
Amit Kumar:
Connectivity and Inference Problems for Temporal Networks.
J. Comput. Syst. Sci. 64(4): 820-842 (2002) |
| 68 | | Lenore 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 |
|---|
| 66 | | Jon M. Kleinberg:
Small-World Phenomena and the Dynamics of Information.
NIPS 2001: 431-438 |
| 65 | | David Kempe,
Jon M. Kleinberg,
Alan J. Demers:
Spatial gossip and resource location protocols.
STOC 2001: 163-172 |
| 64 | | 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 |
| 63 | | Avrim Blum,
Adam Kalai,
Jon M. Kleinberg:
Admission Control to Minimize Rejections.
WADS 2001: 155-164 |
| 62 | | Allan Borodin,
Jon M. Kleinberg,
Prabhakar Raghavan,
Madhu Sudan,
David P. Williamson:
Adversarial queuing theory.
J. ACM 48(1): 13-38 (2001) |
| 61 | | 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) |
| 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 |
|---|
| 58 | | David 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 |
| 55 | | Jon M. Kleinberg,
Christos H. Papadimitriou,
Prabhakar Raghavan:
Auditing Boolean Attributes.
PODS 2000: 86-91 |
| 54 | | Jon M. Kleinberg:
The small-world phenomenon: an algorithm perspective.
STOC 2000: 163-170 |
| 53 | | 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 |
| 52 | | David Kempe,
Jon M. Kleinberg,
Amit Kumar:
Connectivity and inference problems for temporal networks.
STOC 2000: 504-513 |
| 51 | | Moses 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) |
| 48 | | David Gibson,
Jon M. Kleinberg,
Prabhakar Raghavan:
Clustering Categorical Data: An Approach Based on Dynamical Systems.
VLDB J. 8(3-4): 222-236 (2000) |
| 1999 |
|---|
| 47 | | Jon M. Kleinberg,
Ravi Kumar,
Prabhakar Raghavan,
Sridhar Rajagopalan,
Andrew Tomkins:
The Web as a Graph: Measurements, Models, and Methods.
COCOON 1999: 1-17 |
| 46 | | Jon M. Kleinberg,
Éva Tardos:
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields.
FOCS 1999: 14-23 |
| 45 | | Jon M. Kleinberg,
Yuval Rabani,
Éva Tardos:
Fairness in Routing and Load Balancing.
FOCS 1999: 568-578 |
| 44 | | Jon M. Kleinberg,
Andrew Tomkins:
Applications of Linear Algebra in Information Retrieval and Hypertext Analysis.
PODS 1999: 185-193 |
| 43 | | L. Paul Chew,
Daniel P. Huttenlocher,
Klara Kedem,
Jon M. Kleinberg:
Fast detection of common geometric substructure in proteins.
RECOMB 1999: 104-114 |
| 42 | | Jon M. Kleinberg:
Efficient algorithms for protein sequence design and the analysis of certain evolutionary fitness landscapes.
RECOMB 1999: 226-237 |
| 41 | | 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 |
| 40 | | Jon M. Kleinberg,
Amit Kumar:
Wavelength Conversion in Optical Networks.
SODA 1999: 566-575 |
| 39 | | Jon 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) |
| 37 | | Bonnie Berger,
Jon M. Kleinberg,
Frank Thomson Leighton:
Reconstructing a Three-Dimensional Model with Arbitrary Errors.
J. ACM 46(2): 212-235 (1999) |
| 36 | | Jon 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 |
|---|
| 33 | | David 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 |
| 31 | | Jon M. Kleinberg,
Christos H. Papadimitriou,
Prabhakar Raghavan:
Segmentation Problems.
STOC 1998: 473-482 |
| 30 | | Jon M. Kleinberg:
Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem.
STOC 1998: 530-539 |
| 29 | | David Gibson,
Jon M. Kleinberg,
Prabhakar Raghavan:
Clustering Categorical Data: An Approach Based on Dynamical Systems.
VLDB 1998: 311-322 |
| 28 | | 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) |
| 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) |
| 24 | | 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) |
| 1997 |
|---|
| 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.
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 |
| 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 |
| 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 |
| 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.
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 |
|---|
| 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.
Inf. Process. Lett. 43(4): 217-223 (1992) |
