Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

1581130678

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Embedding tree metrics into low dimensional Euclidean spaces

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 ◽

10.1145/301250.301434 ◽

1999 ◽

Cited By ~ 11

Author(s):

Anupam Gupta

Keyword(s):

Euclidean Spaces ◽

Tree Metrics ◽

Low Dimensional

Download Full-text

Majorizing estimators and the approximation of #P-complete problems

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 ◽

10.1145/301250.301320 ◽

1999 ◽

Cited By ~ 1

Author(s):

Leonard J. Schulman ◽

Vijay V. Vazirani

Keyword(s):

Complete Problems

Download Full-text

Computational sample complexity and attribute-efficient learning

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 ◽

10.1145/301250.301437 ◽

1999 ◽

Cited By ~ 2

Author(s):

Rocco A. Servedio

Keyword(s):

Sample Complexity ◽

Efficient Learning

Download Full-text

A displacement approach to efficient decoding of algebraic-geometric codes

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 ◽

10.1145/301250.301311 ◽

1999 ◽

Cited By ~ 10

Author(s):

Vadim Olshevsky ◽

M. Amin Shokrollahi

Keyword(s):

Algebraic Geometric Codes ◽

Displacement Approach ◽

Geometric Codes ◽

Efficient Decoding

Download Full-text

Design networks with bounded pairwise distance

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 ◽

10.1145/301250.301447 ◽

1999 ◽

Cited By ~ 50

Author(s):

Yevgeniy Dodis ◽

Sanjeev Khanna

Keyword(s):

Pairwise Distance

Download Full-text

A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 ◽

10.1145/301250.301325 ◽

1999 ◽

Cited By ~ 18

Author(s):

Amit Chakrabarti ◽

Bernard Chazelle ◽

Benjamin Gum ◽

Alexey Lvov

Keyword(s):

Lower Bound ◽

Nearest Neighbor ◽

Approximate Nearest Neighbor ◽

Nearest Neighbor Searching

Download Full-text

Determinism versus non-determinism for linear time RAMs (extended abstract)

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 ◽

10.1145/301250.301424 ◽

1999 ◽

Cited By ~ 14

Author(s):

Miklós Ajtai

Keyword(s):

Linear Time

Download Full-text

Efficient computation of geodesic shortest paths

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 ◽

10.1145/301250.301449 ◽

1999 ◽

Cited By ~ 41

Author(s):

Sanjiv Kapoor

Keyword(s):

Shortest Paths ◽

Efficient Computation

Download Full-text

Molecular scale heat engines and scalable quantum computation

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 ◽

10.1145/301250.301332 ◽

1999 ◽

Cited By ~ 18

Author(s):

Leonard J. Schulman ◽

Umesh V. Vazirani

Keyword(s):

Quantum Computation ◽

Heat Engines ◽

Molecular Scale

Download Full-text

Extracting all the randomness and reducing the error in Trevisan's extractors

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 ◽

10.1145/301250.301292 ◽

1999 ◽

Cited By ~ 37

Author(s):

Ran Raz ◽

Omer Reingold ◽

Salil Vadhan

Download Full-text

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Embedding tree metrics into low dimensional Euclidean spaces

Majorizing estimators and the approximation of #P-complete problems

Computational sample complexity and attribute-efficient learning

A displacement approach to efficient decoding of algebraic-geometric codes

Design networks with bounded pairwise distance

A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube

Determinism versus non-determinism for linear time RAMs (extended abstract)

Efficient computation of geodesic shortest paths

Molecular scale heat engines and scalable quantum computation

Extracting all the randomness and reducing the error in Trevisan's extractors

Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99
Latest Publications