2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0769527205

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Accidental Algorthims

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) ◽

10.1109/focs.2006.7 ◽

2006 ◽

Cited By ~ 46

Author(s):

Leslie G. Valiant

Download Full-text

Fault-Tolerant Distributed Computing in Full-Information Networks

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) ◽

10.1109/focs.2006.30 ◽

2006 ◽

Cited By ~ 10

Author(s):

Shafi Goldwasser ◽

Elan Pavlov ◽

Vinod Vaikuntanathan

Keyword(s):

Distributed Computing ◽

Fault Tolerant ◽

Information Networks ◽

Full Information

Download Full-text

On the Quantum Query Complexity of Local Search in Two and Three Dimensions

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) ◽

10.1109/focs.2006.57 ◽

2006 ◽

Cited By ~ 6

Author(s):

Xiaoming Sun ◽

Andrew C. Yao

Keyword(s):

Local Search ◽

Three Dimensions ◽

Query Complexity ◽

Quantum Query Complexity ◽

Quantum Query

Download Full-text

Planar Point Location in Sublogarithmic Time

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) ◽

10.1109/focs.2006.61 ◽

2006 ◽

Cited By ~ 5

Author(s):

Mihai Patrascu

Keyword(s):

Point Location ◽

Planar Point ◽

Planar Point Location

Download Full-text

Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) ◽

10.1109/focs.2006.19 ◽

2006 ◽

Cited By ~ 9

Author(s):

Roman Vershynin

Keyword(s):

Simplex Method ◽

Hirsch Conjecture ◽

Random Polytopes

Download Full-text

Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) ◽

10.1109/focs.2006.29 ◽

2006 ◽

Cited By ~ 37

Author(s):

Surender Baswana ◽

Telikepalli Kavitha

Keyword(s):

Distance Oracles ◽

Approximate Distance

Download Full-text

On the Compressibility of NP Instances and Cryptographic Applications

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) ◽

10.1109/focs.2006.54 ◽

2006 ◽

Cited By ~ 22

Author(s):

Danny Harnik ◽

Moni Naor

Download Full-text

SDP gaps and UGC-hardness for MAXCUTGAIN

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) ◽

10.1109/focs.2006.67 ◽

2006 ◽

Cited By ~ 10

Author(s):

Subhash Khot ◽

Ryan O'Donnell

Download Full-text

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) ◽

10.1109/focs.2006.15 ◽

2006 ◽

Cited By ~ 26

Author(s):

C. Chekuri ◽

M. T. Hajiaghayi ◽

G. Kortsarz ◽

M. R. Salavatipour

Keyword(s):

Approximation Algorithms ◽

Network Design

Download Full-text

Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) ◽

10.1109/focs.2006.79 ◽

2006 ◽

Cited By ~ 20

Author(s):

David Arthur ◽

Sergei Vassilvitskii

Keyword(s):

Worst Case ◽

Icp Algorithm ◽

Smoothed Analysis

Download Full-text

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Accidental Algorthims

Fault-Tolerant Distributed Computing in Full-Information Networks

On the Quantum Query Complexity of Local Search in Two and Three Dimensions

Planar Point Location in Sublogarithmic Time

Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method

Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths

On the Compressibility of NP Instances and Cryptographic Applications

SDP gaps and UGC-hardness for MAXCUTGAIN

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design

Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
Latest Publications