Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

9781595936318

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Eisenberg-Gale markets

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250845 ◽

2007 ◽

Cited By ~ 20

Author(s):

Kamal Jain ◽

Vijay V. Vazirani

Download Full-text

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250837 ◽

2007 ◽

Cited By ~ 7

Author(s):

Stefan S. Dantchev

Keyword(s):

Proof Systems

Download Full-text

Smooth sensitivity and sampling in private data analysis

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250803 ◽

2007 ◽

Cited By ~ 265

Author(s):

Kobbi Nissim ◽

Sofya Raskhodnikova ◽

Adam Smith

Keyword(s):

Data Analysis ◽

Private Data

Download Full-text

Interpolation of depth-3 arithmetic circuits with two multiplication gates

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250833 ◽

2007 ◽

Cited By ~ 4

Author(s):

Amir Shpilka

Keyword(s):

Arithmetic Circuits

Download Full-text

Survivable network design with degree or order constraints

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250886 ◽

2007 ◽

Cited By ~ 27

Author(s):

Lap Chi Lau ◽

Joseph (Seffi) Naor ◽

Mohammad R. Salavatipour ◽

Mohit Singh

Keyword(s):

Network Design ◽

Survivable Network Design ◽

Survivable Network ◽

Order Constraints

Download Full-text

Interval completion with few edges

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250847 ◽

2007 ◽

Cited By ~ 14

Author(s):

Pinar Heggernes ◽

Christophe Paul ◽

Jan Arne Telle ◽

Yngve Villanger

Download Full-text

Lower bounds in communication complexity based on factorization norms

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250892 ◽

2007 ◽

Cited By ~ 15

Author(s):

Nati Linial ◽

Adi Shraibman

Keyword(s):

Lower Bounds ◽

Communication Complexity

Download Full-text

All-pairs bottleneck paths for general graphs in truly sub-cubic time

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250876 ◽

2007 ◽

Cited By ~ 10

Author(s):

Virginia Vassilevska ◽

Ryan Williams ◽

Raphael Yuster

Keyword(s):

Bottleneck Paths ◽

General Graphs

Download Full-text

Local embeddings of metric spaces

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250883 ◽

2007 ◽

Cited By ~ 7

Author(s):

Ittai Abraham ◽

Yair Bartal ◽

Ofer Neiman

Keyword(s):

Metric Spaces

Download Full-text

On achieving the "best of both worlds" in secure multiparty computation

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07 ◽

10.1145/1250790.1250793 ◽

2007 ◽

Cited By ~ 24

Author(s):

Jonathan Katz

Keyword(s):

Secure Multiparty Computation ◽

Multiparty Computation

Download Full-text

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Eisenberg-Gale markets

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems

Smooth sensitivity and sampling in private data analysis

Interpolation of depth-3 arithmetic circuits with two multiplication gates

Survivable network design with degree or order constraints

Interval completion with few edges

Lower bounds in communication complexity based on factorization norms

All-pairs bottleneck paths for general graphs in truly sub-cubic time

Local embeddings of metric spaces

On achieving the "best of both worlds" in secure multiparty computation

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07
Latest Publications