Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

1595931341

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Lattice problems and norm embeddings

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 ◽

10.1145/1132516.1132581 ◽

2006 ◽

Cited By ~ 17

Author(s):

Oded Regev ◽

Ricky Rosen

Download Full-text

Bounded-error quantum state identification and exponential separations in communication complexity

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 ◽

10.1145/1132516.1132602 ◽

2006 ◽

Cited By ~ 7

Author(s):

Dmitry Gavinsky ◽

Julia Kempe ◽

Oded Regev ◽

Ronald de Wolf

Keyword(s):

Quantum State ◽

Communication Complexity ◽

State Identification ◽

Bounded Error ◽

Quantum State Identification

Download Full-text

Building triangulations using ε-nets

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 ◽

10.1145/1132516.1132564 ◽

2006 ◽

Cited By ~ 16

Author(s):

Kenneth L. Clarkson

Download Full-text

Logarithmic hardness of the directed congestion minimization problem

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 ◽

10.1145/1132516.1132592 ◽

2006 ◽

Cited By ~ 8

Author(s):

Matthew Andrews ◽

Lisa Zhang

Keyword(s):

Minimization Problem

Download Full-text

Narrow proofs may be spacious

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 ◽

10.1145/1132516.1132590 ◽

2006 ◽

Cited By ~ 6

Author(s):

Jakob Nordström

Download Full-text

A quasi-PTAS for unsplittable flow on line graphs

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 ◽

10.1145/1132516.1132617 ◽

2006 ◽

Cited By ~ 45

Author(s):

Nikhil Bansal ◽

Amit Chakrabarti ◽

Amir Epstein ◽

Baruch Schieber

Keyword(s):

Line Graphs ◽

On Line ◽

Unsplittable Flow

Download Full-text

Minimizing average flow time on related machines

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 ◽

10.1145/1132516.1132618 ◽

2006 ◽

Cited By ~ 9

Author(s):

Naveen Garg ◽

Amit Kumar

Keyword(s):

Flow Time ◽

Average Flow ◽

Related Machines

Download Full-text

Edge-disjoint paths in Planar graphs with constant congestion

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 ◽

10.1145/1132516.1132621 ◽

2006 ◽

Cited By ~ 17

Author(s):

Chandra Chekuri ◽

Sanjeev Khanna ◽

F. Bruce Shepherd

Keyword(s):

Planar Graphs ◽

Disjoint Paths ◽

Edge Disjoint

Download Full-text

The distance trisector curve

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 ◽

10.1145/1132516.1132565 ◽

2006 ◽

Cited By ~ 3

Author(s):

Tetsuo Asano ◽

Jiří Matoušek ◽

Takeshi Tokuyama

Download Full-text

Limitations of quantum coset states for graph isomorphism

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 ◽

10.1145/1132516.1132603 ◽

2006 ◽

Cited By ~ 15

Author(s):

Sean Hallgren ◽

Cristopher Moore ◽

Martin Rötteler ◽

Alexander Russell ◽

Pranab Sen

Keyword(s):

Graph Isomorphism

Download Full-text

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Lattice problems and norm embeddings

Bounded-error quantum state identification and exponential separations in communication complexity

Building triangulations using ε-nets

Logarithmic hardness of the directed congestion minimization problem

Narrow proofs may be spacious

A quasi-PTAS for unsplittable flow on line graphs

Minimizing average flow time on related machines

Edge-disjoint paths in Planar graphs with constant congestion

The distance trisector curve

Limitations of quantum coset states for graph isomorphism

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06
Latest Publications