Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
Latest Publications

TOTAL DOCUMENTS

74

(FIVE YEARS 0)

H-INDEX

23

(FIVE YEARS 0)

Published By ACM Press

0897917855

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An O(nlogn)-size fault-tolerant sorting network (extended abstract)

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.237876 ◽

1996 ◽

Author(s):

Yuan Ma

Keyword(s):

Fault Tolerant ◽

Sorting Network

Download Full-text

Generating hard instances of lattice problems (extended abstract)

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.237838 ◽

1996 ◽

Author(s):

M. Ajtai

Download Full-text

Computing roadmaps of semi-algebraic sets (extended abstract)

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.237857 ◽

1996 ◽

Author(s):

S. Basu ◽

R. Pollack ◽

M.-F. Roy

Keyword(s):

Download Full-text

Efficiently four-coloring planar graphs

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.238005 ◽

1996 ◽

Author(s):

Neil Robertson ◽

Daniel P. Sanders ◽

Paul Seymour ◽

Robin Thomas

Keyword(s):

Download Full-text

Approximability and nonapproximability results for minimizing total flow time on a single machine

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.237989 ◽

1996 ◽

Author(s):

Hans Kellerer ◽

Thomas Tautenhahn ◽

Gerhard J. Woeginger

Keyword(s):

Single Machine ◽

Flow Time ◽

Total Flow Time

Download Full-text

On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.237988 ◽

1996 ◽

Author(s):

Saugata Basu

Keyword(s):

Euler Characteristic ◽

Betti Numbers ◽

Download Full-text

Sparsity considerations in Dixon resultants

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.237862 ◽

1996 ◽

Author(s):

Deepak Kapur ◽

Tushar Saxena

Download Full-text

On relationships between statistical zero-knowledge proofs

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.238016 ◽

1996 ◽

Author(s):

Tatsuaki Okamoto

Keyword(s):

Download Full-text

Public vs. private coin flips in one round communication games (extended abstract)

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.238004 ◽

1996 ◽

Author(s):

Ilan Newman ◽

Mario Szegedy

Keyword(s):

Communication Games

Download Full-text

Testing of the long code and hardness for clique

Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 ◽

10.1145/237814.237820 ◽

1996 ◽

Author(s):

Johan Håstad

Download Full-text