45th Annual IEEE Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0769522289

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Triangulation and Embedding Using Small Sets of Beacons

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.70 ◽

2004 ◽

Cited By ~ 35

Author(s):

J. Kleinberg ◽

A. Slivkins ◽

T. Wexler

Download Full-text

Private Codes or Succinct Random Codes That Are (Almost) Perfect

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.51 ◽

2004 ◽

Cited By ~ 36

Author(s):

M. Langberg

Keyword(s):

Random Codes

Download Full-text

0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n²) Time

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.1 ◽

2004 ◽

Cited By ~ 15

Author(s):

S. Arora ◽

E. Hazan ◽

S. Kale

Keyword(s):

Sparsest Cut

Download Full-text

Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.26 ◽

2004 ◽

Cited By ~ 59

Author(s):

G. Karakostas ◽

S.G. Kolliopoulos

Keyword(s):

Multicommodity Networks ◽

Selfish Users

Download Full-text

Edge-Disjoint Paths in Planar Graphs

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.27 ◽

2004 ◽

Cited By ~ 22

Author(s):

C. Chekuri ◽

S. Khanna ◽

F.B. Shepherd

Keyword(s):

Planar Graphs ◽

Disjoint Paths ◽

Edge Disjoint

Download Full-text

Quantum Walk Algorithm for Element Distinctness

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.54 ◽

2004 ◽

Cited By ~ 52

Author(s):

A. Ambainis

Keyword(s):

Quantum Walk ◽

Walk Algorithm

Download Full-text

Approximating Edit Distance Efficiently

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.14 ◽

2004 ◽

Cited By ~ 35

Author(s):

Z. Bar-Yossef ◽

T.S. Jayram ◽

R. Krauthgamer ◽

R. Kumar

Keyword(s):

Edit Distance

Download Full-text

Hardness of Approximating the Shortest Vector Problem in Lattices

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.31 ◽

2004 ◽

Cited By ~ 20

Author(s):

S. Khot

Keyword(s):

Vector Problem ◽

Shortest Vector Problem

Download Full-text

Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.15 ◽

2004 ◽

Cited By ~ 54

Author(s):

B.C. Dean ◽

M.X. Goemans ◽

J. Vondrak

Keyword(s):

Knapsack Problem ◽

Stochastic Knapsack ◽

Stochastic Knapsack Problem

Download Full-text

Dynamic Speed Scaling to Manage Energy and Temperature

45th Annual IEEE Symposium on Foundations of Computer Science ◽

10.1109/focs.2004.24 ◽

2004 ◽

Cited By ~ 92

Author(s):

N. Bansal ◽

T. Kimbrel ◽

K. Pruhs

Keyword(s):

Speed Scaling ◽

Dynamic Speed Scaling

Download Full-text

45th Annual IEEE Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Triangulation and Embedding Using Small Sets of Beacons

Private Codes or Succinct Random Codes That Are (Almost) Perfect

0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n²) Time

Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users

Edge-Disjoint Paths in Planar Graphs

Quantum Walk Algorithm for Element Distinctness

Approximating Edit Distance Efficiently

Hardness of Approximating the Shortest Vector Problem in Lattices

Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

Dynamic Speed Scaling to Manage Energy and Temperature

45th Annual IEEE Symposium on Foundations of Computer Science
Latest Publications