The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jon M. Kleinberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  115. Signed networks in social media. [Citation Graph (, )][DBLP]


  116. Link structures, information flow, and social processes. [Citation Graph (, )][DBLP]


  117. The structure of information pathways in a social communication network. [Citation Graph (, )][DBLP]


  118. Feedback effects between similarity and social influence in online communities. [Citation Graph (, )][DBLP]


  119. Meme-tracking and the dynamics of the news cycle. [Citation Graph (, )][DBLP]


  120. Optimizing web traffic via the media scheduling problem. [Citation Graph (, )][DBLP]


  121. Strategic network formation with structural holes. [Citation Graph (, )][DBLP]


  122. Crowds, clouds, and algorithms: exploring the human side of "big data" applications. [Citation Graph (, )][DBLP]


  123. The flow of on-line information in global networks. [Citation Graph (, )][DBLP]


  124. Balanced outcomes in social exchange networks. [Citation Graph (, )][DBLP]


  125. Spatial variation in search engine queries. [Citation Graph (, )][DBLP]


  126. Mapping the world's photos. [Citation Graph (, )][DBLP]


  127. How opinions are received by online communities: a case study on amazon.com helpfulness votes. [Citation Graph (, )][DBLP]


  128. Predicting positive and negative links in online social networks. [Citation Graph (, )][DBLP]


  129. Sequential Influence Models in Social Networks. [Citation Graph (, )][DBLP]


  130. Governance in Social Media: A Case Study of the Wikipedia Promotion Process. [Citation Graph (, )][DBLP]


  131. The Directed Closure Process in Hybrid Social-Information Networks, with an Analysis of Link Formation on Twitter. [Citation Graph (, )][DBLP]


  132. The convergence of social and technological networks. [Citation Graph (, )][DBLP]


  133. The Structure of Information Pathways in a Social Communication Network [Citation Graph (, )][DBLP]


  134. How opinions are received by online communities: A case study on Amazon.com helpfulness votes [Citation Graph (, )][DBLP]


  135. Information-Sharing and Privacy in Social Networks [Citation Graph (, )][DBLP]


  136. Signed Networks in Social Media [Citation Graph (, )][DBLP]


  137. Predicting Positive and Negative Links in Online Social Networks [Citation Graph (, )][DBLP]


  138. The Directed Closure Process in Hybrid Social-Information Networks, with an Analysis of Link Formation on Twitter [Citation Graph (, )][DBLP]


  139. Governance in Social Media: A case study of the Wikipedia promotion process [Citation Graph (, )][DBLP]


  140. Line-of-Sight Networks. [Citation Graph (, )][DBLP]


Search in 0.039secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002