Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

9781605585062

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Random graphs and the parity quantifier

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 ◽

10.1145/1536414.1536510 ◽

2009 ◽

Cited By ~ 2

Author(s):

Phokion G. Kolaitis ◽

Swastik Kopparty

Keyword(s):

Random Graphs

Download Full-text

Private coresets

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 ◽

10.1145/1536414.1536465 ◽

2009 ◽

Cited By ~ 31

Author(s):

Dan Feldman ◽

Amos Fiat ◽

Haim Kaplan ◽

Kobbi Nissim

Download Full-text

Finding sparse cuts locally using evolving sets

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 ◽

10.1145/1536414.1536449 ◽

2009 ◽

Cited By ~ 43

Author(s):

Reid Andersen ◽

Yuval Peres

Download Full-text

Max cut and the smallest eigenvalue

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 ◽

10.1145/1536414.1536452 ◽

2009 ◽

Cited By ~ 16

Author(s):

Luca Trevisan

Keyword(s):

Smallest Eigenvalue

Download Full-text

On cryptography with auxiliary input

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 ◽

10.1145/1536414.1536498 ◽

2009 ◽

Cited By ~ 103

Author(s):

Yevgeniy Dodis ◽

Yael Tauman Kalai ◽

Shachar Lovett

Keyword(s):

Auxiliary Input

Download Full-text

Mixing time for the solid-on-solid model

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 ◽

10.1145/1536414.1536492 ◽

2009 ◽

Cited By ~ 4

Author(s):

Fabio Martinelli ◽

Alistair Sinclair

Keyword(s):

Mixing Time ◽

Solid Model

Download Full-text

Near-perfect load balancing by randomized rounding

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 ◽

10.1145/1536414.1536433 ◽

2009 ◽

Cited By ~ 14

Author(s):

Tobias Friedrich ◽

Thomas Sauerwald

Keyword(s):

Load Balancing ◽

Randomized Rounding

Download Full-text

Exact learning of random DNF over the uniform distribution

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 ◽

10.1145/1536414.1536424 ◽

2009 ◽

Cited By ~ 8

Author(s):

Linda Sellie

Keyword(s):

Uniform Distribution ◽

Exact Learning

Download Full-text

Small-size ε-nets for axis-parallel rectangles and boxes

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 ◽

10.1145/1536414.1536501 ◽

2009 ◽

Cited By ~ 4

Author(s):

Boris Aronov ◽

Esther Ezra ◽

Micha Shair

Keyword(s):

Axis Parallel

Download Full-text

Fault-tolerant spanners for general graphs

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09 ◽

10.1145/1536414.1536475 ◽

2009 ◽

Cited By ~ 21

Author(s):

S. Chechik ◽

M. Langberg ◽

David Peleg ◽

L. Roditty

Keyword(s):

Fault Tolerant ◽

General Graphs

Download Full-text

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Random graphs and the parity quantifier

Private coresets

Finding sparse cuts locally using evolving sets

Max cut and the smallest eigenvalue

On cryptography with auxiliary input

Mixing time for the solid-on-solid model

Near-perfect load balancing by randomized rounding

Exact learning of random DNF over the uniform distribution

Small-size ε-nets for axis-parallel rectangles and boxes

Fault-tolerant spanners for general graphs

Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09
Latest Publications