Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jon M. Kleinberg
2010 – today
- 2013
[j55]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos: Network Formation in the Presence of Contagious Risk. ACM Trans. Economics and Comput. 1(2): 6 (2013)- [c123]Jon M. Kleinberg: Cascading behavior in social and economic networks. ACM Conference on Electronic Commerce 2013: 1-4
- [c122]Flavio Chierichetti, Jon M. Kleinberg, Sigal Oren: On discrete preferences and coordination. ACM Conference on Electronic Commerce 2013: 233-250
- [c121]Arpita Ghosh, Jon M. Kleinberg: Incentivizing participation in online forums for education. ACM Conference on Electronic Commerce 2013: 525-542
- [c120]David Kempe, Jon M. Kleinberg, Sigal Oren, Aleksandrs Slivkins: Selection and influence in cultural dynamics. ACM Conference on Electronic Commerce 2013: 585-586
- [c119]Lars Backstrom, Jon M. Kleinberg, Lillian Lee, Cristian Danescu-Niculescu-Mizil: Characterizing and curating conversation threads: expansion, focus, volume, re-entry. WSDM 2013: 13-22
- [c118]Ashton Anderson, Daniel P. Huttenlocher, Jon M. Kleinberg, Jure Leskovec: Steering user behavior with badges. WWW 2013: 95-106
- [c117]Johan Ugander, Lars Backstrom, Jon M. Kleinberg: Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. WWW 2013: 1307-1318
- [i16]Johan Ugander, Lars Backstrom, Jon M. Kleinberg: Subgraph Frequencies: Mapping the Empirical and Extremal Geography of Large Graph Collections. CoRR abs/1304.1548 (2013)
- [i15]Lars Backstrom, Jon M. Kleinberg, Lillian Lee, Cristian Danescu-Niculescu-Mizil: Characterizing and curating conversation threads: Expansion, focus, volume, re-entry. CoRR abs/1304.4602 (2013)
- [i14]David Kempe, Jon M. Kleinberg, Sigal Oren, Aleksandrs Slivkins: Selection and Influence in Cultural Dynamics. CoRR abs/1304.7468 (2013)
- [i13]Flavio Chierichetti, Jon M. Kleinberg, Sigal Oren: On Discrete Preferences and Coordination. CoRR abs/1304.8125 (2013)
- [i12]Johan Ugander, Brian Karrer, Lars Backstrom, Jon M. Kleinberg: Graph cluster randomization: network exposure to multiple universes. CoRR abs/1305.6979 (2013)
- 2012
- [c116]Cristian Danescu-Niculescu-Mizil, Justin Cheng, Jon M. Kleinberg, Lillian Lee: You Had Me at Hello: How Phrasing Affects Memorability. ACL (1) 2012: 892-901
- [c115]Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma: Preventing Unraveling in Social Networks: The Anchored k-Core Problem. ICALP (2) 2012: 440-451
- [c114]Ashton Anderson, Daniel P. Huttenlocher, Jon M. Kleinberg, Jure Leskovec: Discovering value from community activity on focused question answering sites: a case study of stack overflow. KDD 2012: 850-858
- [c113]Flavio Chierichetti, Jon M. Kleinberg, Alessandro Panconesi: How to schedule a cascade in an arbitrary graph. ACM Conference on Electronic Commerce 2012: 355-368
- [c112]Flavio Chierichetti, Jon M. Kleinberg: Voting with limited information and many alternatives. SODA 2012: 1036-1055
- [c111]
- [c110]Ashton Anderson, Daniel P. Huttenlocher, Jon M. Kleinberg, Jure Leskovec: Effects of user similarity in social media. WSDM 2012: 703-712
- [c109]Jie Tang, Tiancheng Lou, Jon M. Kleinberg: Inferring social ties across heterogenous networks. WSDM 2012: 743-752
- [c108]Cristian Danescu-Niculescu-Mizil, Lillian Lee, Bo Pang, Jon M. Kleinberg: Echoes of power: language effects and power differences in social interaction. WWW 2012: 699-708
- [i11]David Bindel, Jon M. Kleinberg, Sigal Oren: How Bad is Forming Your Own Opinion? CoRR abs/1203.2973 (2012)
- [i10]Cristian Danescu-Niculescu-Mizil, Justin Cheng, Jon M. Kleinberg, Lillian Lee: You had me at hello: How phrasing affects memorability. CoRR abs/1203.6360 (2012)
- 2011
- [j54]Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg: Wherefore art thou R3579X?: anonymized social networks, hidden patterns, and structural steganography. Commun. ACM 54(12): 133-141 (2011)
- [j53]Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg: Robust sensor placements at informative and communication-efficient locations. TOSN 7(4): 31 (2011)
- [c107]
- [c106]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert Kleinberg, Éva Tardos: Which Networks are Least Susceptible to Cascading Failures? FOCS 2011: 393-402
- [c105]Lars Backstrom, Eytan Bakshy, Jon M. Kleinberg, Thomas M. Lento, Itamar Rosenn: Center of Attention: How Facebook Users Allocate Attention across Friends. ICWSM 2011
- [c104]Daniel Mauricio Romero, Brendan Meeder, Vladimir Barash, Jon M. Kleinberg: Maintaining Ties on Social Media Sites: The Competing Effects of Balance, Exchange, and Betweenness. ICWSM 2011
- [c103]Shaomei Wu, Chenhao Tan, Jon M. Kleinberg, Michael W. Macy: Does Bad News Go Away Faster? ICWSM 2011
- [c102]Flavio Chierichetti, Jon M. Kleinberg, David Liben-Nowell: Reconstructing Patterns of Information Diffusion from Incomplete Observations. NIPS 2011: 792-800
- [c101]Larry Blume, David A. Easley, Jon M. Kleinberg, Robert D. Kleinberg, Éva Tardos: Network formation in the presence of contagious risk. ACM Conference on Electronic Commerce 2011: 1-10
- [c100]Justin Cheng, Daniel Mauricio Romero, Brendan Meeder, Jon M. Kleinberg: Predicting Reciprocity in Social Networks. SocialCom/PASSAT 2011: 49-56
- [c99]
- [c98]
- [c97]Daniel M. Romero, Brendan Meeder, Jon M. Kleinberg: Differences in the mechanics of information diffusion across topics: idioms, political hashtags, and complex contagion on twitter. WWW 2011: 695-704
- [i9]Flavio Chierichetti, Jon M. Kleinberg: Voting with Limited Information and Many Alternatives. CoRR abs/1110.1785 (2011)
- [i8]Cristian Danescu-Niculescu-Mizil, Lillian Lee, Bo Pang, Jon M. Kleinberg: Echoes of power: Language effects and power differences in social interaction. CoRR abs/1112.3670 (2011)
- 2010
- [b2]David A. Easley, Jon M. Kleinberg: Networks, Crowds, and Markets - Reasoning About a Highly Connected World. Cambridge University Press 2010, ISBN 978-0-521-19533-1, pp. I-XV, 1-727
- [j52]Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos, Zoubin Ghahramani: Kronecker Graphs: An Approach to Modeling Networks. Journal of Machine Learning Research 11: 985-1042 (2010)
- [c96]Jure Leskovec, Daniel P. Huttenlocher, Jon M. Kleinberg: Signed networks in social media. CHI 2010: 1361-1370
- [c95]Dan Cosley, Daniel P. Huttenlocher, Jon M. Kleinberg, Xiangyang Lan, Siddharth Suri: Sequential Influence Models in Social Networks. ICWSM 2010
- [c94]Jure Leskovec, Daniel P. Huttenlocher, Jon M. Kleinberg: Governance in Social Media: A Case Study of the Wikipedia Promotion Process. ICWSM 2010
- [c93]Daniel Mauricio Romero, Jon M. Kleinberg: The Directed Closure Process in Hybrid Social-Information Networks, with an Analysis of Link Formation on Twitter. ICWSM 2010
- [c92]
- [c91]Sihem Amer-Yahia, AnHai Doan, Jon M. Kleinberg, Nick Koudas, Michael J. Franklin: Crowds, clouds, and algorithms: exploring the human side of "big data" applications. SIGMOD Conference 2010: 1259-1260
- [c90]Jure Leskovec, Daniel P. Huttenlocher, Jon M. Kleinberg: Predicting positive and negative links in online social networks. WWW 2010: 641-650
- [i7]Jon M. Kleinberg, Katrina Ligett: Information-Sharing and Privacy in Social Networks. CoRR abs/1003.0469 (2010)
- [i6]Jure Leskovec, Daniel P. Huttenlocher, Jon M. Kleinberg: Signed Networks in Social Media. CoRR abs/1003.2424 (2010)
- [i5]Jure Leskovec, Daniel P. Huttenlocher, Jon M. Kleinberg: Predicting Positive and Negative Links in Online Social Networks. CoRR abs/1003.2429 (2010)
- [i4]Daniel M. Romero, Jon M. Kleinberg: The Directed Closure Process in Hybrid Social-Information Networks, with an Analysis of Link Formation on Twitter. CoRR abs/1003.2469 (2010)
- [i3]Jure Leskovec, Daniel P. Huttenlocher, Jon M. Kleinberg: Governance in Social Media: A case study of the Wikipedia promotion process. CoRR abs/1004.3547 (2010)
2000 – 2009
- 2009
- [j51]Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany: Line-of-Sight Networks. Combinatorics, Probability & Computing 18(1-2): 145-163 (2009)
- [j50]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)
- [j49]Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos: Trading networks with price-setting agents. Games and Economic Behavior 67(1): 36-50 (2009)
- [j48]Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler: Triangulation and embedding using small sets of beacons. J. ACM 56(6) (2009)
- [j47]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)
- [j46]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)
- [c89]Lars Backstrom, Jon M. Kleinberg, Ravi Kumar: Optimizing web traffic via the media scheduling problem. KDD 2009: 89-98
- [c88]Jure Leskovec, Lars Backstrom, Jon M. Kleinberg: Meme-tracking and the dynamics of the news cycle. KDD 2009: 497-506
- [c87]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
- [c86]David J. Crandall, Lars Backstrom, Daniel P. Huttenlocher, Jon M. Kleinberg: Mapping the world's photos. WWW 2009: 761-770
- [i2]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)
- 2008
- [j45]Jon M. Kleinberg: The convergence of social and technological networks. Commun. ACM 51(11): 66-72 (2008)
- [j44]Jon M. Kleinberg, Mark Sandler: Using mixture models for collaborative filtering. J. Comput. Syst. Sci. 74(1): 49-69 (2008)
- [j43]Elliot Anshelevich, David Kempe, Jon M. Kleinberg: Stability of Load Balancing Algorithms in Dynamic Adversarial Systems. SIAM J. Comput. 37(5): 1656-1673 (2008)
- [j42]Jon M. Kleinberg, Mark Sandler, Aleksandrs Slivkins: Network Failure Detection and Graph Connectivity. SIAM J. Comput. 38(4): 1330-1346 (2008)
- [j41]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)
- [j40]Jon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler: Strategic network formation with structural holes. SIGecom Exchanges 7(3) (2008)
- [c85]Eric Breck, David A. Easley, K.-Y. Daisy Fan, Jon M. Kleinberg, Lillian Lee, Jennifer Wofford, Ramin Zabih: A New Start: Innovative Introductory AI-Centered Courses at Cornell. AAAI Spring Symposium: Using AI to Motivate Greater Participation in Computer Science 2008: 8-13
- [c84]
- [c83]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
- [c82]Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Watts: The structure of information pathways in a social communication network. KDD 2008: 435-443
- [c81]Jon M. Kleinberg, Siddharth Suri, Éva Tardos, Tom Wexler: Strategic network formation with structural holes. ACM Conference on Electronic Commerce 2008: 284-293
- [c80]
- [c79]Lars Backstrom, Jon M. Kleinberg, Ravi Kumar, Jasmine Novak: Spatial variation in search engine queries. WWW 2008: 357-366
- [i1]Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Watts: The Structure of Information Pathways in a Social Communication Network. CoRR abs/0806.3201 (2008)
- 2007
- [j39]David Liben-Nowell, Jon M. Kleinberg: The link-prediction problem for social networks. JASIST 58(7): 1019-1031 (2007)
- [j38]Jure Leskovec, Jon M. Kleinberg, Christos Faloutsos: Graph evolution: Densification and shrinking diameters. TKDD 1(1) (2007)
- [c78]Jon M. Kleinberg: Challenges in mining social network data: processes, privacy, and paradoxes. KDD 2007: 4-5
- [c77]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
- [c76]Larry Blume, David A. Easley, Jon M. Kleinberg, Éva Tardos: Trading networks with price-setting agents. ACM Conference on Electronic Commerce 2007: 143-151
- [c75]Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany: Line-of-sight networks. SODA 2007: 968-977
- [c74]Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg: Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. WWW 2007: 181-190
- 2006
- [b1]Jon M. Kleinberg, Éva Tardos: Algorithm design. Addison-Wesley 2006, ISBN 978-0-321-37291-8, pp. I-XXIII, 1-838
- [j37]Amit Kumar, Jon M. Kleinberg: Fairness Measures for Resource Allocation. SIAM J. Comput. 36(3): 657-680 (2006)
- [c73]Andreas Krause, Carlos Guestrin, Anupam Gupta, Jon M. Kleinberg: Near-optimal sensor placements: maximizing information while minimizing communication cost. IPSN 2006: 2-10
- [c72]Lars Backstrom, Daniel P. Huttenlocher, Jon M. Kleinberg, Xiangyang Lan: Group formation in large social networks: membership, growth, and evolution. KDD 2006: 44-54
- [c71]Jure Leskovec, Ajit Singh, Jon M. Kleinberg: Patterns of Influence in a Recommendation Network. PAKDD 2006: 380-389
- [c70]
- [c69]
- [e1]Jon M. Kleinberg (Ed.): Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006. ACM 2006, ISBN 1-59593-134-1
- 2005
- [c68]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
- [c67]
- [c66]Anirban Dasgupta, John E. Hopcroft, Jon M. Kleinberg, Mark Sandler: On Learning Mixtures of Heavy-Tailed Distributions. FOCS 2005: 491-500
- [c65]Jon M. Kleinberg: An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs. FOCS 2005: 627-636
- [c64]David Kempe, Jon M. Kleinberg, Éva Tardos: Influential Nodes in a Diffusion Model for Social Networks. ICALP 2005: 1127-1138
- [c63]Jure Leskovec, Jon M. Kleinberg, Christos Faloutsos: Graphs over time: densification laws, shrinking diameters and possible explanations. KDD 2005: 177-187
- [c62]Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinberg, Christos Faloutsos: Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication. PKDD 2005: 133-145
- [c61]Robert D. Kleinberg, Jon M. Kleinberg: Isomorphism and embedding problems for infinite limits of scale-free graphs. SODA 2005: 277-286
- 2004
- [j36]Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: Segmentation problems. J. ACM 51(2): 263-280 (2004)
- [j35]David Kempe, Jon M. Kleinberg, Alan J. Demers: Spatial gossip and resource location protocols. J. ACM 51(6): 943-967 (2004)
- [j34]David Liben-Nowell, Jon M. Kleinberg: Structural properties and tractability results for linear synteny. J. Discrete Algorithms 2(2): 207-228 (2004)
- [j33]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)
- [c60]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
- [c59]Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler: Triangulation and Embedding Using Small Sets of Beacons. FOCS 2004: 444-453
- [c58]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
- [c57]Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ron Elber: The evolutionary capacity of protein structures. RECOMB 2004: 290-297
- [c56]Jon M. Kleinberg, Mark Sandler, Aleksandrs Slivkins: Network failure detection and graph connectivity. SODA 2004: 76-85
- [c55]Jon M. Kleinberg, Mark Sandler: Using mixture models for collaborative filtering. STOC 2004: 569-578
- 2003
- [j32]Jon M. Kleinberg: Bursty and Hierarchical Structure in Streams. Data Min. Knowl. Discov. 7(4): 373-397 (2003)
- [j31]
- [j30]Avrim Blum, Adam Tauman Kalai, Jon M. Kleinberg: Admission Control to Minimize Rejections. Internet Mathematics 1(2): 165-176 (2003)
- [j29]Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: Auditing Boolean attributes. J. Comput. Syst. Sci. 66(1): 244-253 (2003)
- [j28]Johannes Gehrke, Paul Ginsparg, Jon M. Kleinberg: Overview of the 2003 KDD Cup. SIGKDD Explorations 5(2): 149-151 (2003)
- [c54]David Liben-Nowell, Jon M. Kleinberg: The link prediction problem for social networks. CIKM 2003: 556-559
- [c53]David Kempe, Jon M. Kleinberg, Éva Tardos: Maximizing the spread of influence through a social network. KDD 2003: 137-146
- [c52]Pedro F. Felzenszwalb, Daniel P. Huttenlocher, Jon M. Kleinberg: Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis. NIPS 2003
- [c51]Jon M. Kleinberg, Mark Sandler: Convergent algorithms for collaborative filtering. ACM Conference on Electronic Commerce 2003: 1-10
- 2002
- [j27]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)
- [j26]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)
- [j25]David Kempe, Jon M. Kleinberg, Amit Kumar: Connectivity and Inference Problems for Temporal Networks. J. Comput. Syst. Sci. 64(4): 820-842 (2002)
- [j24]Lenore Cowen, Ronald Fagin, Joe Kilian, Jon M. Kleinberg: Guest Editor's Foreword. J. Comput. Syst. Sci. 65(1): 1 (2002)
- [j23]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)
- [c50]David Kempe, Jon M. Kleinberg: Protocols and Impossibility Results for Gossip-Based Communication Mechanisms. FOCS 2002: 471-480
- [c49]
- [c48]
- [c47]
- [c46]Debra Goldberg, Susan McCouch, Jon M. Kleinberg: Constructing Comparative Genome Maps with Unresolved Marker Order. Pacific Symposium on Biocomputing 2002: 139-150
- [c45]Elliot Anshelevich, David Kempe, Jon M. Kleinberg: Stability of load balancing algorithms in dynamic adversarial systems. STOC 2002: 399-406
- 2001
- [j22]Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson: Adversarial queuing theory. J. ACM 48(1): 13-38 (2001)
- [j21]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)
- [j20]Jon M. Kleinberg, Amit Kumar: Wavelength Conversion in Optical Networks. J. Algorithms 38(1): 25-50 (2001)
- [j19]Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Fairness in Routing and Load Balancing. J. Comput. Syst. Sci. 63(1): 2-20 (2001)
- [c44]
- [c43]David Kempe, Jon M. Kleinberg, Alan J. Demers: Spatial gossip and resource location protocols. STOC 2001: 163-172
- [c42]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
- [c41]Avrim Blum, Adam Kalai, Jon M. Kleinberg: Admission Control to Minimize Rejections. WADS 2001: 155-164
- 2000
- [j18]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)
- [j17]Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Allocating Bandwidth for Bursty Connections. SIAM J. Comput. 30(1): 191-217 (2000)
- [j16]David Gibson, Jon M. Kleinberg, Prabhakar Raghavan: Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB J. 8(3-4): 222-236 (2000)
- [c40]David Liben-Nowell, Jon M. Kleinberg: Structural Properties and Tractability Results for Linear Synteny. CPM 2000: 248-263
- [c39]
- [c38]
- [c37]Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: Auditing Boolean Attributes. PODS 2000: 86-91
- [c36]
- [c35]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
- [c34]David Kempe, Jon M. Kleinberg, Amit Kumar: Connectivity and inference problems for temporal networks. STOC 2000: 504-513
- [c33]Moses Charikar, Ronald Fagin, Venkatesan Guruswami, Jon M. Kleinberg, Prabhakar Raghavan, Amit Sahai: Query strategies for priced information (extended abstract). STOC 2000: 582-591
1990 – 1999
- 1999
- [j15]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)
- [j14]
- [j13]Bonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton: Reconstructing a Three-Dimensional Model with Arbitrary Errors. J. ACM 46(2): 212-235 (1999)
- [j12]
- [j11]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): 313-325 (1999)
- [j10]Jon M. Kleinberg: Efficient Algorithms for Protein Sequence Design and the Analysis of Certain Evolutionary Fitness Landscapes. Journal of Computational Biology 6(3/4): 387-404 (1999)
- [c32]Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins: The Web as a Graph: Measurements, Models, and Methods. COCOON 1999: 1-17
- [c31]Jon M. Kleinberg, Éva Tardos: Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. FOCS 1999: 14-23
- [c30]Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Fairness in Routing and Load Balancing. FOCS 1999: 568-578
- [c29]Jon M. Kleinberg, Andrew Tomkins: Applications of Linear Algebra in Information Retrieval and Hypertext Analysis. PODS 1999: 185-193
- [c28]L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: Fast detection of common geometric substructure in proteins. RECOMB 1999: 104-114
- [c27]Jon M. Kleinberg: Efficient algorithms for protein sequence design and the analysis of certain evolutionary fitness landscapes. RECOMB 1999: 226-237
- [c26]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
- [c25]
- 1998
- [j9]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)
- [j8]Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: A Microeconomic View of Data Mining. Data Min. Knowl. Discov. 2(4): 311-324 (1998)
- [j7]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)
- [j6]Michel X. Goemans, Jon M. Kleinberg: An improved approximation ratio for the minimum latency problem. Math. Program. 82: 111-124 (1998)
- [j5]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)
- [c24]David Gibson, Jon M. Kleinberg, Prabhakar Raghavan: Inferring Web Communities from Link Topology. Hypertext 1998: 225-234
- [c23]
- [c22]Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan: Segmentation Problems. STOC 1998: 473-482
- [c21]Jon M. Kleinberg: Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem. STOC 1998: 530-539
- [c20]David Gibson, Jon M. Kleinberg, Prabhakar Raghavan: Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB 1998: 311-322
- 1997
- [j4]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)
- [c19]Jon M. Kleinberg, Rajeev Motwani, Prabhakar Raghavan, Suresh Venkatasubramanian: Storage Management for Evolving Databases. FOCS 1997: 353-362
- [c18]
- [c17]Jon M. Kleinberg, Yuval Rabani, Éva Tardos: Allocating Bandwidth for Bursty Connections. STOC 1997: 664-673
- 1996
- [c16]
- [c15]
- [c14]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
- [c13]Michel X. Goemans, Jon M. Kleinberg: An Improved Approximation Ratio for the Minimum Latency Problem. SODA 1996: 152-158
- [c12]Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson: Adversarial Queueing Theory. STOC 1996: 376-385
- [c11]Bonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton: Reconstructing a Three-Dimensional Model with Arbitrary Errors. STOC 1996: 449-458
- [c10]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
- [j3]Ran El-Yaniv, Jon M. Kleinberg: Geometric Two-Server Algorithms. Inf. Process. Lett. 53(6): 355-358 (1995)
- [c9]
- [c8]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
- [c7]Jon M. Kleinberg, Éva Tardos: Approximations for the disjoint paths problem in high-diameter planar networks. STOC 1995: 26-35
- 1994
- [j2]Jon M. Kleinberg: A Lower Bound for Two-Server Balancing Algorithms. Inf. Process. Lett. 52(1): 39-43 (1994)
- [c6]
- [c5]
- [c4]
- 1993
- [c3]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
- [c2]Jon M. Kleinberg, Sendhil Mullainathan: Resource Bounds and Combinations of Consensus Objects. PODC 1993: 133-143
- 1992
- [j1]Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg: Voronoi Diagrams of Rigidly Moving Sets of Points. Inf. Process. Lett. 43(4): 217-223 (1992)
- [c1]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
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 10:00 CEST by the dblp team