Jon Kleinberg's Homepage
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Jon Kleinberg, Department of Computer Science, Cornell University|
|Read Kleinberg's research on algorithms that exploit the combinatorial structure of networks and information. His work includes techniques for analyzing and modeling link structure in the World Wide Web and related information networks; discrete optimization and network algorithms; and algorithmic approaches to clustering, indexing, and data mining. Papers in Postscript format include "Bursty and Hierarchical Structure in Streams"; "Clustering categorical data: An approach based on dynamical systems"; "Spatial gossip and resource location protocols"; "Inferring Web communities from link topology"; "The Web as a graph: Measurements, models and methods"; "Random Walks with 'Back Buttons'"; "Stability of Load Balancing Algorithms in Dynamic Adversarial Systems"; "Algorithms for Constructing Comparative Maps"; "An improved approximation ratio for the minimum latency problem"; "Comparing point sets under projection"; and "On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane."|
|Math Topics:||Patterns/Relationships, Algorithms, Graph Theory, Topology|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.