 |
|
Online DBLP entries are available for Jon M. Kleinberg and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
-
David Gibson
,
Jon M. Kleinberg,
Prabhakar Raghavan
:
Inferring Web Communities from Link Topology.
Hypertext 1998
: 225-234
- 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
- Jon M. Kleinberg,
Éva Tardos
:
Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks.
JCSS 57
(1): 61-73 (1998)
- 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
-
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,
É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.
IPL 53
(6): 355-358 (1995)
- Jon M. Kleinberg:
The Localization Problem for Mobile Robots.
FOCS 1994
: 521-531
- Jon M. Kleinberg:
A Lower Bound for Two-Server Balancing Algorithms.
IPL 52
(1): 39-43 (1994)
- Jon M. Kleinberg,
Sendhil Mullainathan
:
Resource Bounds and Combinations of Consensus Objects.
PODC 1992
: 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.
IPL 43
(4): 217-223 (1992)
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
