Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897919629

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A framework for fast quantum mechanical algorithms

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 ◽

10.1145/276698.276712 ◽

1998 ◽

Cited By ~ 60

Author(s):

Lov K. Grover

Keyword(s):

Quantum Mechanical

Download Full-text

Decision algorithms for unsplittable flow and the half-disjoint paths problem

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 ◽

10.1145/276698.276867 ◽

1998 ◽

Cited By ~ 16

Author(s):

Jon M. Kleinberg

Keyword(s):

Disjoint Paths ◽

Unsplittable Flow ◽

Decision Algorithms

Download Full-text

Quantum vs. classical communication and computation

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 ◽

10.1145/276698.276713 ◽

1998 ◽

Cited By ~ 110

Author(s):

Harry Buhrman ◽

Richard Cleve ◽

Avi Wigderson

Keyword(s):

Classical Communication

Download Full-text

The power of a pebble

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 ◽

10.1145/276698.276759 ◽

1998 ◽

Cited By ~ 71

Author(s):

Michael A. Bender ◽

Antonio Fernández ◽

Dana Ron ◽

Amit Sahai ◽

Salil Vadhan

Download Full-text

Segmentation problems

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 ◽

10.1145/276698.276860 ◽

1998 ◽

Cited By ~ 31

Author(s):

Jon Kleinberg ◽

Christos Papadimitriou ◽

Prabhakar Raghavan

Download Full-text

Random generation of embedded graphs and an extension to Dobrushin uniqueness (extended abstract)

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 ◽

10.1145/276698.276729 ◽

1998 ◽

Cited By ~ 1

Author(s):

Marcus Peinado ◽

Thomas Lengauer

Keyword(s):

Random Generation ◽

Embedded Graphs ◽

Dobrushin Uniqueness

Download Full-text

An exponential lower bound for depth 3 arithmetic circuits

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 ◽

10.1145/276698.276872 ◽

1998 ◽

Cited By ~ 37

Author(s):

Dima Grigoriev ◽

Marek Karpinski

Keyword(s):

Lower Bound ◽

Arithmetic Circuits ◽

Exponential Lower Bound

Download Full-text

Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 ◽

10.1145/276698.276852 ◽

1998 ◽

Cited By ~ 47

Author(s):

Oded Goldreich ◽

Amit Sahai ◽

Salil Vadhan

Keyword(s):

Zero Knowledge ◽

General Statistical

Download Full-text

Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 ◽

10.1145/276698.276764 ◽

1998 ◽

Cited By ~ 18

Author(s):

Adam L. Buchsbaum ◽

Haim Kaplan ◽

Anne Rogers ◽

Jeffery R. Westbrook

Keyword(s):

Linear Time ◽

Common Ancestors

Download Full-text

An improved approximation algorithm for multiway cut

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 ◽

10.1145/276698.276711 ◽

1998 ◽

Cited By ~ 36

Author(s):

Gruia Călinescu ◽

Howard Karloff ◽

Yuval Rabani

Keyword(s):

Approximation Algorithm ◽

Multiway Cut

Download Full-text

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

A framework for fast quantum mechanical algorithms

Decision algorithms for unsplittable flow and the half-disjoint paths problem

Quantum vs. classical communication and computation

The power of a pebble

Segmentation problems

Random generation of embedded graphs and an extension to Dobrushin uniqueness (extended abstract)

An exponential lower bound for depth 3 arithmetic circuits

Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge

Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators

An improved approximation algorithm for multiway cut

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
Latest Publications