Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

9781450300506

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Towards polynomial lower bounds for dynamic problems

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 ◽

10.1145/1806689.1806772 ◽

2010 ◽

Cited By ~ 54

Author(s):

Mihai Patrascu

Keyword(s):

Lower Bounds ◽

Dynamic Problems

Download Full-text

Interactive privacy via the median mechanism

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 ◽

10.1145/1806689.1806794 ◽

2010 ◽

Cited By ~ 85

Author(s):

Aaron Roth ◽

Tim Roughgarden

Download Full-text

Sorting under partial information (without the ellipsoid algorithm)

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 ◽

10.1145/1806689.1806740 ◽

2010 ◽

Cited By ~ 2

Author(s):

Jean Cardinal ◽

Samuel Fiorini ◽

Gwenaël Joret ◽

Raphaël M. Jungers ◽

J. Ian Munro

Keyword(s):

Partial Information ◽

Ellipsoid Algorithm

Download Full-text

On the hardness of the noncommutative determinant

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 ◽

10.1145/1806689.1806782 ◽

2010 ◽

Cited By ~ 6

Author(s):

Vikraman Arvind ◽

Srikanth Srinivasan

Keyword(s):

Noncommutative Determinant

Download Full-text

On the structure of cubic and quartic polynomials

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 ◽

10.1145/1806689.1806736 ◽

2010 ◽

Cited By ~ 5

Author(s):

Elad Haramaty ◽

Amir Shpilka

Keyword(s):

Quartic Polynomials

Download Full-text

Bounding the average sensitivity and noise sensitivity of polynomial threshold functions

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 ◽

10.1145/1806689.1806763 ◽

2010 ◽

Cited By ~ 15

Author(s):

Ilias Diakonikolas ◽

Prahladh Harsha ◽

Adam Klivans ◽

Raghu Meka ◽

Prasad Raghavendra ◽

...

Keyword(s):

Noise Sensitivity ◽

Average Sensitivity ◽

Threshold Functions ◽

Polynomial Threshold Functions

Download Full-text

Augmenting undirected node-connectivity by one

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 ◽

10.1145/1806689.1806767 ◽

2010 ◽

Cited By ~ 3

Author(s):

László A. Végh

Keyword(s):

Node Connectivity

Download Full-text

Saving space by algebraization

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 ◽

10.1145/1806689.1806735 ◽

2010 ◽

Cited By ~ 37

Author(s):

Daniel Lokshtanov ◽

Jesper Nederlof

Download Full-text

Optimal bounds for sign-representing the intersection of two halfspaces by polynomials

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 ◽

10.1145/1806689.1806762 ◽

2010 ◽

Cited By ~ 4

Author(s):

Alexander A. Sherstov

Keyword(s):

Optimal Bounds

Download Full-text

On the complexity of #CSP

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10 ◽

10.1145/1806689.1806789 ◽

2010 ◽

Cited By ~ 13

Author(s):

Martin E. Dyer ◽

David M. Richerby

Download Full-text

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Towards polynomial lower bounds for dynamic problems

Interactive privacy via the median mechanism

Sorting under partial information (without the ellipsoid algorithm)

On the hardness of the noncommutative determinant

On the structure of cubic and quartic polynomials

Bounding the average sensitivity and noise sensitivity of polynomial threshold functions

Augmenting undirected node-connectivity by one

Saving space by algebraization

Optimal bounds for sign-representing the intersection of two halfspaces by polynomials

On the complexity of #CSP

Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10
Latest Publications