Digital Symposium Collection 2000  

 
 
 
 
 
 

 














Jon M. Kleinberg

Applications of Linear Algebra in Information Retrieval and Hypertext Analysis

Publications

Note: Links lead to the DBLP on the Web.

Jon M. Kleinberg

38 Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : Auditing Boolean Attributes. PODS 2000 : 0-

37 David Gibson , Jon M. Kleinberg, Prabhakar Raghavan : Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB Journal 8 (3-4): 222-236 (2000)

36 Jon M. Kleinberg, S. Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins : The Web as a Graph: Measurements, Models, and Methods. COCOON 1999 : 1-17

35 Jon M. Kleinberg, Éva Tardos : Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. FOCS 1999 : 14-23

34 Jon M. Kleinberg, Yuval Rabani , Éva Tardos : Fairness in Routing and Load Balancing. FOCS 1999 : 568-578

33 Jon M. Kleinberg, Andrew Tomkins : Applications of Linear Algebra in Information Retrieval and Hypertext Analysis. PODS 1999 : 185-193

32 Moses Charikar , Jon M. Kleinberg, S. Ravi Kumar , Sridhar Rajagopalan , Amit Sahai , Andrew Tomkins : Minimizing Wirelength in Zero and Bounded Skew Clock Trees. SODA 1999 : 177-184

31 Soumen Chakrabarti , Byron Dom , S. 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)

30 Bonnie Berger , Jon M. Kleinberg, Frank Thomson Leighton : Reconstructing a Three-Dimensional Model with Arbitrary Errors. JACM 46 (2): 212-235 (1999)

29 Jon M. Kleinberg: Authoritative Sources in a Hyperlinked Environment. JACM 46 (5): 604-632 (1999)

28 David Gibson , Jon M. Kleinberg, Prabhakar Raghavan : Inferring Web Communities from Link Topology. Hypertext 1998 : 225-234

27 Jon M. Kleinberg: Authoritative Sources in a Hyperlinked Environment. SODA 1998 : 668-677

26 Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : Segmentation Problems. STOC 1998 : 473-482

25 Jon M. Kleinberg: Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem. STOC 1998 : 530-539

24 David Gibson , Jon M. Kleinberg, Prabhakar Raghavan : Clustering Categorical Data: An Approach Based on Dynamical Systems. VLDB 1998 : 311-322

23 Jon M. Kleinberg, Christos H. Papadimitriou , Prabhakar Raghavan : A Microeconomic View of Data Mining. Data Mining and Knowledge Discovery 2 (4): 311-324 (1998)

22 Jon M. Kleinberg, Éva Tardos : Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks. JCSS 57 (1): 61-73 (1998)

21 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)

20 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)

19 Jon M. Kleinberg: Two Algorithms for Nearest-Neighbor Search in High Dimensions. STOC 1997 : 599-608

18 Jon M. Kleinberg, Yuval Rabani , Éva Tardos : Allocating Bandwidth for Bursty Connections. STOC 1997 : 664-673

17 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

16 Jon M. Kleinberg: Single-Source Unsplittable Flow. FOCS 1996 : 68-77

15 Jon M. Kleinberg, Ronitt Rubinfeld : Short Paths in Expander Graphs. FOCS 1996 : 86-95

14 Michel X. Goemans , Jon M. Kleinberg: An Improved Approximation Ratio for the Minimum Latency Problem. SODA 1996 : 152-158

13 Allan Borodin , Jon M. Kleinberg, Prabhakar Raghavan , Madhu Sudan , David P. Williamson : Adversarial Queueing Theory. STOC 1996 : 376-385

12 Bonnie Berger , Jon M. Kleinberg, Frank Thomson Leighton : Reconstructing a Three-Dimensional Model with Arbitrary Errors. STOC 1996 : 449-458

11 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

10 Jon M. Kleinberg, Éva Tardos : Disjoint Paths in Densely Embedded Graphs. FOCS 1995 : 52-61

9 Jon M. Kleinberg, Éva Tardos : Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks. STOC 1995 : 26-35

8 Ran El-Yaniv , Jon M. Kleinberg: Geometric Two-Server Algorithms. IPL 53 (6): 355-358 (1995)

7 Jon M. Kleinberg: The Localization Problem for Mobile Robots. FOCS 1994 : 521-531

6 Daniel P. Huttenlocher , Jon M. Kleinberg: Comparing Point Sets Under Projection. SODA 1994 : 1-7

5 Jon M. Kleinberg: On-line Search in a Simple Polygon. SODA 1994 : 8-15

4 Jon M. Kleinberg: A Lower Bound for Two-Server Balancing Algorithms. IPL 52 (1): 39-43 (1994)

3 Jon M. Kleinberg, Sendhil Mullainathan : Resource Bounds and Combinations of Consensus Objects. PODC 1992 : 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. IPL 43 (4): 217-223 (1992)



























Copyright(C) 2000 ACM