Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

1581139608

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Undirected ST-connectivity in log-space

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060647 ◽

2005 ◽

Cited By ~ 96

Author(s):

Omer Reingold

Download Full-text

Low distortion embeddings for edit distance

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060623 ◽

2005 ◽

Cited By ~ 8

Author(s):

Rafail Ostrovsky ◽

Yuval Rabani

Keyword(s):

Edit Distance ◽

Low Distortion

Download Full-text

Convex programming for scheduling unrelated parallel machines

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060639 ◽

2005 ◽

Cited By ~ 35

Author(s):

Yossi Azar ◽

Amir Epstein

Keyword(s):

Convex Programming ◽

Parallel Machines ◽

Unrelated Parallel Machines

Download Full-text

Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060637 ◽

2005 ◽

Cited By ~ 2

Author(s):

Saugata Basu

Keyword(s):

Polynomial Time ◽

Betti Numbers ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Algebraic Sets ◽

Quadratic Inequalities

Download Full-text

On obfuscating point functions

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060669 ◽

2005 ◽

Cited By ~ 124

Author(s):

Hoeteck Wee

Download Full-text

The mixing time of the thorp shuffle

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060651 ◽

2005 ◽

Cited By ~ 3

Author(s):

Ben Morris

Keyword(s):

Mixing Time

Download Full-text

Improved approximation algorithms for minimum-weight vertex separators

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060674 ◽

2005 ◽

Cited By ~ 38

Author(s):

Uriel Feige ◽

MohammadTaghi Hajiaghayi ◽

James R. Lee

Keyword(s):

Approximation Algorithms ◽

Minimum Weight ◽

Vertex Separators

Download Full-text

Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060678 ◽

2005 ◽

Cited By ~ 11

Author(s):

Zeev Dvir ◽

Amir Shpilka

Keyword(s):

Polynomial Identity ◽

Polynomial Identity Testing ◽

Identity Testing ◽

Locally Decodable Codes ◽

Locally Decodable

Download Full-text

Approximation techniques for utilitarian mechanism design

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060597 ◽

2005 ◽

Cited By ~ 70

Author(s):

Patrick Briest ◽

Piotr Krysta ◽

Berthold Vöcking

Keyword(s):

Mechanism Design ◽

Approximation Techniques

Download Full-text

Key agreement from weak bit agreement

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05 ◽

10.1145/1060590.1060689 ◽

2005 ◽

Cited By ~ 34

Author(s):

Thomas Holenstein

Keyword(s):

Key Agreement

Download Full-text

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Undirected ST-connectivity in log-space

Low distortion embeddings for edit distance

Convex programming for scheduling unrelated parallel machines

Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities

On obfuscating point functions

The mixing time of the thorp shuffle

Improved approximation algorithms for minimum-weight vertex separators

Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits

Approximation techniques for utilitarian mechanism design

Key agreement from weak bit agreement

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05
Latest Publications