Prabhakar Raghavan

Proceedings of the Scalable Uncertainty Management, Second International Conference, 2008

The Changing Face of Web Search.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Introduction to information retrieval.

[BibT_eX]

[DOI]

Christopher D. Manning

Hinrich Schütze

Cambridge University Press, ISBN: 978-0-521-86571-5, 2008

2007

Visualizing tags over time.

[BibT_eX]

[DOI]

ACM Trans. Web, 2007

Finding near neighbors through cluster pruning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Web Search: Bridging Information Retrieval and Microeconomic Modeling.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 2007

Web search: from information retrieval to microeconomic modeling.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

2006

Guest Editors' Introduction.

[BibT_eX]

[DOI]

Fred Douglis

World Wide Web, 2006

Core algorithms in the CLEVER system.

[BibT_eX]

[DOI]

ACM Trans. Internet Techn., 2006

Using PageRank to Characterize Web Structure.

[BibT_eX]

[DOI]

Gopal Pandurangan

Internet Math., 2006

The changing face of web search: algorithms, auctions and advertising.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005

On the Bursty Evolution of Blogspace.

[BibT_eX]

[DOI]

World Wide Web, 2005

Geographic routing in social networks.

[BibT_eX]

[DOI]

Proc. Natl. Acad. Sci. USA, 2005

Automatic Subspace Clustering of High Dimensional Data.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2005

Current trends in the integration of searching and browsing.

[BibT_eX]

[DOI]

Proceedings of the 14th international conference on World Wide Web, 2005

Incentive Networks.

[BibT_eX]

[DOI]

Proceedings of the Third Latin American Web Congress (LA-Web 2005), 1 October, 2005

Variable latent semantic indexing.

[BibT_eX]

[DOI]

Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005

Query Incentive Networks.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Encoding XML in Vector Spaces.

[BibT_eX]

[DOI]

Vinay Kakade

Proceedings of the Advances in Information Retrieval, 2005

Query Incentive Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Science, 2005

2004

Segmentation problems.

[BibT_eX]

[DOI]

J. ACM, 2004

Structure and evolution of blogspace.

[BibT_eX]

[DOI]

Commun. ACM, 2004

Multidimensional Cube Packing.

[BibT_eX]

[DOI]

Yoshiharu Kohayakawa

Flávio Keidi Miyazawa

Yoshiko Wakabayashi

Algorithmica, 2004

Anti-aliasing on the web.

[BibT_eX]

[DOI]

Jasmine Novak

Andrew Tomkins

Proceedings of the 13th international conference on World Wide Web, 2004

Propagation of trust and distrust.

[BibT_eX]

[DOI]

Proceedings of the 13th international conference on World Wide Web, 2004

Text Centric Structure Extraction and Exploitation (abstract only).

[BibT_eX]

[DOI]

Proceedings of the Seventh International Workshop on the Web and Databases, 2004

Efficiency-Quality Tradeoffs for Vector Score Aggregation.

[BibT_eX]

[DOI]

Pavan Kumar C. Singitham

Mahathi S. Mahabhashyam

Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

Data Mining: The Next Generation.

[BibT_eX]

[DOI]

Proceedings of the Perspectives Workshop: Data Mining: The Next Generation, 11.07., 2004

Social Networks and the Web.

[BibT_eX]

[DOI]

Proceedings of the Advances in Web Intelligence, 2004

2003

Dynamic schemes for speculative execution of code.

[BibT_eX]

[DOI]

Hadas Shachnai

Mira Yaniv

Perform. Evaluation, 2003

Building low-diameter peer-to-peer networks.

[BibT_eX]

[DOI]

Gopal Pandurangan

IEEE J. Sel. Areas Commun., 2003

Auditing Boolean attributes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

Editorial: Preserving excellence through change.

[BibT_eX]

[DOI]

J. ACM, 2003

Symphony: Distributed Hashing in a Small World.

[BibT_eX]

[DOI]

Gurmeet Singh Manku

Mayank Bawa

Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003

Extracting and Exploiting Structure in Text Search.

[BibT_eX]

[DOI]

Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

SETS: search enhanced by topic segmentation.

[BibT_eX]

[DOI]

Mayank Bawa

Gurmeet Singh Manku

Proceedings of the SIGIR 2003: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 28, 2003

2002

A deterministic (2-2/(k+1))<sup>n</sup> algorithm for k-SAT based on local search.

[BibT_eX]

[DOI]

Uwe Schöning

Theor. Comput. Sci., 2002

Query Strategies for Priced Information.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

More on random walks, electrical networks, and the harmonic k-server algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Social Networks: From the Web to the Enterprise.

[BibT_eX]

[DOI]

IEEE Internet Comput., 2002

The Web and Social Networks.

[BibT_eX]

[DOI]

Computer, 2002

Competitive recommendation systems.

[BibT_eX]

[DOI]

Petros Drineas

Iordanis Kerenidis

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Mining Significant Associations in Large Scale Text Corpora.

[BibT_eX]

[DOI]

Panayiotis Tsaparas

Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 2002

Thematic mapping - from unstructured documents to taxonomies.

[BibT_eX]

[DOI]

Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, 2002

2001

Recommendation Systems: A Probabilistic Analysis.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

Adversarial queuing theory.

[BibT_eX]

[DOI]

J. ACM, 2001

Structured and Unstructured Search in Enterprises.

[BibT_eX]

[DOI]

IEEE Data Eng. Bull., 2001

Social Networks on the Web and in the Enterprise.

[BibT_eX]

[DOI]

Proceedings of the Web Intelligence: Research and Development, 2001

On Semi-Automated Web Taxonomy Construction.

[BibT_eX]

Proceedings of the Fourth International Workshop on the Web and Databases, 2001

Navigating large-scale semi-structured data in business portals.

[BibT_eX]

[DOI]

Proceedings of the VLDB 2001, 2001

Building Low-Diameter P2P Networks.

[BibT_eX]

[DOI]

Gopal Pandurangan

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

Clustering Categorical Data: An Approach Based on Dynamical Systems.

[BibT_eX]

[DOI]

David Gibson

VLDB J., 2000

Markov Paging.

[BibT_eX]

[DOI]

Anna R. Karlin

Steven J. Phillips

SIAM J. Comput., 2000

Latent Semantic Indexing: A Probabilistic Analysis.

[BibT_eX]

[DOI]

Santosh S. Vempala

J. Comput. Syst. Sci., 2000

Graph structure in the Web.

[BibT_eX]

[DOI]

Comput. Networks, 2000

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Algorithmica, 2000

Random walks with "back buttons" (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Query strategies for priced information (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

The Web as a Graph.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

Graph Structure of the Web: A Survey.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Random graph models for the web graph.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Mining the Web's Link Structure.

[BibT_eX]

[DOI]

Computer, 1999

Combinatorial and experimental results for randomized point matching algorithms.

[BibT_eX]

[DOI]

Sandy Irani

Comput. Geom., 1999

Trawling the Web for Emerging Cyber-Communities.

[BibT_eX]

[DOI]

Comput. Networks, 1999

Topic Distillation and Spectral Filtering.

[BibT_eX]

[DOI]

Artif. Intell. Rev., 1999

Extracting Large-Scale Knowledge Bases from the Web.

[BibT_eX]

[DOI]

Proceedings of the VLDB'99, 1999

On targeting Markov segments.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

The Web as a Graph: Measurements, Models, and Methods.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

Randomized Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Scalable Feature Selection, Classification and Signature Generation for Organizing Large Text Databases into Hierarchical Topic Taxonomies.

[BibT_eX]

[DOI]

VLDB J., 1998

On a theory of computing symposia.

[BibT_eX]

[DOI]

SIGACT News, 1998

Stochastic Contention Resolution With Short Delays.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Randomized Query Processing in Robot Path Planning.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

A Microeconomic View of Data Mining.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 1998

Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text.

[BibT_eX]

[DOI]

Comput. Networks, 1998

Approximation Schemes for Euclidean <i>k</i>-Medians and Related Problems.

[BibT_eX]

[DOI]

Sanjeev Arora

Satish Rao

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD 1998, 1998

Inferring Web Communities from Link Topology.

[BibT_eX]

[DOI]

David Gibson

Proceedings of the HYPERTEXT '98. Proceedings of the Ninth ACM Conference on Hypertext and Hypermedia: Links, Objects, Time and Space, 1998

Computing on data streams.

[BibT_eX]

[DOI]

Monika Rauch Henzinger

Sridhar Rajagopalan

Proceedings of the External Memory Algorithms, 1998

1997

Strategic directions in research in theory of computing.

[BibT_eX]

[DOI]

SIGACT News, 1997

The Robot Localization Problem.

[BibT_eX]

[DOI]

Leonidas J. Guibas

SIAM J. Comput., 1997

Navigating in Unfamiliar Geometric Terrain.

[BibT_eX]

[DOI]

Baruch Schieber

SIAM J. Comput., 1997

How much can hardware help routing?

[BibT_eX]

[DOI]

J. ACM, 1997

A Random Sampling Scheme for Path Planning.

[BibT_eX]

[DOI]

Int. J. Robotics Res., 1997

The Electrical Resistance of a Graph Captures its Commute and Cover Times.

[BibT_eX]

[DOI]

Comput. Complex., 1997

Constrained TSP and Low-Power Computing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases.

[BibT_eX]

[DOI]

Proceedings of the VLDB'97, 1997

Locality-Preserving Hashing in Multidimensional Spaces.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Information Retrieval Algorithms: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Nonholonomic path planning for pushing a disk among obstacles.

[BibT_eX]

[DOI]

Proceedings of the 1997 IEEE International Conference on Robotics and Automation, 1997

Storage Management for Evolving Databases.

[BibT_eX]

[DOI]

Suresh Venkatasubramanian

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Randomized Algorithms.

[BibT_eX]

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

A Theory of Wormhole Routing in Parallel Computers.

[BibT_eX]

[DOI]

Sergio A. Felperin

IEEE Trans. Computers, 1996

Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Adversarial Queueing Theory.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

A Linear Method for Deviation Detection in Large Databases.

[BibT_eX]

[DOI]

Andreas Arning

Rakesh Agrawal

Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), 1996

Computational Geometry Impact Potential: A Business and Industrial Perspective.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Randomized Algorithms.

[BibT_eX]

[DOI]

SIGACT News, 1995

Robust Algorithms for Packet Routing in a Mesh.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1995

Competitive Paging with Locality of Reference.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Randomized query processing in robot path planning (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Motion planning for a steering-constrained robot through moderate obstacles.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Randomized Algorithms.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 9780511814075, 1995

1994

Computing with Noisy Information.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Trading Space for Time in Undirected s-t Connectivity.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Memory versus randomization in on-line algorithms.

[BibT_eX]

[DOI]

Marc Snir

IBM J. Res. Dev., 1994

Guest Editor's Foreword: Special Issue on On-Line Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 1994

Efficient routing in all-optical networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

The minimum latency problem.

[BibT_eX]

[DOI]

Prasad Chalasani

Don Coppersmith

William R. Pulleyblank

Madhu Sudan

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection.

[BibT_eX]

[DOI]

Kazuo Iwano

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Randomized Approximation Algorithms in Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Motion Planning on a Graph (Extended Abstract)

[BibT_eX]

[DOI]

Madhu Sudan

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Randomized Algorithms and Pseudorandom Numbers.

[BibT_eX]

[DOI]

Howard J. Karloff

J. ACM, 1993

Random Walks on Weighted Graphs and Applications to On-line Algorithms.

[BibT_eX]

[DOI]

J. ACM, 1993

Fast Deflection Routing for Packets and Worms (Extended Summary).

[BibT_eX]

[DOI]

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992

Fast Geometric Approximation Techniques and Geometric Embedding Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Optimal Time Bounds for Some Proximity Problems in the Plane.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Integer Programming in VLSI Design.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

The Robot Localization Problem in Two Dimensions.

[BibT_eX]

[DOI]

Leonidas J. Guibas

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

An Experimental Study of Wormhole Routing in Parallel Computers.

[BibT_eX]

[DOI]

Sergio A. Felperin

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Markov Paging (Extended Abstract)

[BibT_eX]

[DOI]

Anna R. Karlin

Steven J. Phillips

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

A Theory of Wormhole Routing in Parallel Computers (Extended Abstract)

[BibT_eX]

[DOI]

Sergio A. Felperin

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Exact Analysis of Hot-Potato Routing (Extended Abstract)

[BibT_eX]

[DOI]

Uriel Feige

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Deferred Data Structure for the Nearest Neighbor Problem.

[BibT_eX]

[DOI]

Alok Aggarwal

Inf. Process. Lett., 1991

Multiterminal Global Routing: A Deterministic Approximation Scheme.

[BibT_eX]

[DOI]

Algorithmica, 1991

Competitive Paging with Locality of Reference (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Navigating in Unfamiliar Geometric Terrain (Preliminary Version)

[BibT_eX]

[DOI]

Baruch Schieber

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

On the Parallel Complexity of Evaluating Game Trees.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

A Statistical Adversary for On-line Algorithms.

[BibT_eX]

[DOI]

Proceedings of the On-Line Algorithms, 1991

Competitive Paging with Locality of Reference (Brief Summary).

[BibT_eX]

[DOI]

Proceedings of the On-Line Algorithms, 1991

Navigating in Unfamiliar Geometric Terrain (Extended Summary).

[BibT_eX]

[DOI]

Baruch Schieber

Proceedings of the On-Line Algorithms, 1991

1990

Randomized Broadcast in Networks.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Computing with Unreliable Information (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)

[BibT_eX]

[DOI]

Christos Kaklamanis

Anna R. Karlin

Frank Thomson Leighton

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Time-Space Tradeoffs for Undirected Graph Traversal

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

Parallel Graph Algorithms That Are Efficient on Average

[BibT_eX]

[DOI]

Don Coppersmith

Martin Tompa

Inf. Comput., June, 1989

The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Program Correctness: Can One Test For It?

[BibT_eX]

Manuel Blum

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

Memory Versus Randomization in On-line Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Marc Snir

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988

Deferred Data Structuring.

[BibT_eX]

[DOI]

Richard M. Karp

SIAM J. Comput., 1988

Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1988

Energy Consumption in VLSI Circuits (Preliminary Version)

[BibT_eX]

[DOI]

Alok Aggarwal

Ashok K. Chandra

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987

Randomized rounding: a technique for provably good algorithms and algorithmic proofs.

[BibT_eX]

[DOI]

Comb., 1987

1986

A language for describing rectilinear Steiner tree configurations.

[BibT_eX]

[DOI]

Antony P.-C. Ng

Proceedings of the 23rd ACM/IEEE Design Automation Conference. Las Vegas, 1986

Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

Provably Good Routing in Graphs: Regular Arrays

[BibT_eX]

[DOI]