Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

1581136749

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Touring a sequence of polygons

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780612 ◽

2003 ◽

Cited By ~ 35

Author(s):

Moshe Dror ◽

Alon Efrat ◽

Anna Lubiw ◽

Joseph S. B. Mitchell

Download Full-text

New degree bounds for polynomial threshold functions

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780592 ◽

2003 ◽

Cited By ~ 16

Author(s):

Ryan O'Donnell ◽

Rocco A. Servedio

Keyword(s):

Threshold Functions ◽

Degree Bounds ◽

Polynomial Threshold Functions

Download Full-text

Polylogarithmic inapproximability

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780628 ◽

2003 ◽

Cited By ~ 73

Author(s):

Eran Halperin ◽

Robert Krauthgamer

Download Full-text

Simpler and better approximation algorithms for network design

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780597 ◽

2003 ◽

Cited By ~ 60

Author(s):

Anupam Gupta ◽

Amit Kumar ◽

Tim Roughgarden

Keyword(s):

Approximation Algorithms ◽

Network Design

Download Full-text

Random knapsack in expected polynomial time

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780578 ◽

2003 ◽

Cited By ~ 19

Author(s):

Rene Beier ◽

Berthold Vöcking

Keyword(s):

Polynomial Time

Download Full-text

The online set cover problem

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780558 ◽

2003 ◽

Cited By ~ 26

Author(s):

Noga Alon ◽

Baruch Awerbuch ◽

Yossi Azar

Keyword(s):

Set Cover ◽

Set Cover Problem ◽

Cover Problem

Download Full-text

Testing subgraphs in directed graphs

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780644 ◽

2003 ◽

Cited By ~ 5

Author(s):

Noga Alon ◽

Asaf Shapira

Keyword(s):

Directed Graphs

Download Full-text

Integer priority queues with decrease key in constant time and the single source shortest paths problem

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780566 ◽

2003 ◽

Cited By ~ 16

Author(s):

Mikkel Thorup

Keyword(s):

Shortest Paths ◽

Priority Queues ◽

Constant Time ◽

Single Source

Download Full-text

Constant factor approximation of vertex-cuts in planar graphs

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780557 ◽

2003 ◽

Cited By ~ 6

Author(s):

Eyal Amir ◽

Robert Krauthgamer ◽

Satish Rao

Keyword(s):

Planar Graphs ◽

Constant Factor

Download Full-text

Space efficient dynamic stabbing with fast queries

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 ◽

10.1145/780542.780636 ◽

2003 ◽

Cited By ~ 8

Author(s):

Mikkel Thorup

Download Full-text

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Touring a sequence of polygons

New degree bounds for polynomial threshold functions

Polylogarithmic inapproximability

Simpler and better approximation algorithms for network design

Random knapsack in expected polynomial time

The online set cover problem

Testing subgraphs in directed graphs

Integer priority queues with decrease key in constant time and the single source shortest paths problem

Constant factor approximation of vertex-cuts in planar graphs

Space efficient dynamic stabbing with fast queries

Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03
Latest Publications