48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
Latest Publications

TOTAL DOCUMENTS

140

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0769530109, 9780769530109

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Lower Bounds on Signatures From Symmetric Primitives

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.4389536 ◽

2007 ◽

Cited By ~ 5

Author(s):

Boaz Barak ◽

Mohammad Mahmoody-Ghidary

Keyword(s):

Lower Bounds

Download Full-text

Simulating Quantum Correlations with Finite Communication

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.31 ◽

2007 ◽

Cited By ~ 3

Author(s):

Oded Regev ◽

Ben Toner

Keyword(s):

Quantum Correlations

Download Full-text

Reviewers

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.5 ◽

2007 ◽

Cited By ~ 1

Download Full-text

Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.35 ◽

2007 ◽

Cited By ~ 21

Author(s):

Konstantinos Georgiou ◽

Avner Magen ◽

Toniann Pitassi ◽

Iannis Tourlakis

Keyword(s):

Vertex Cover ◽

Integrality Gaps

Download Full-text

Parameterized Proof Complexity

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.4389488 ◽

2007 ◽

Cited By ~ 1

Author(s):

Stefan Dantchev ◽

Barnaby Martin ◽

Stefan Szeider

Keyword(s):

Proof Complexity

Download Full-text

Planning for Fast Connectivity Updates

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.59 ◽

2007 ◽

Cited By ~ 12

Author(s):

Mihai Patrascu ◽

Mikkel Thorup

Download Full-text

Derandomization of Sparse Cyclotomic Integer Zero Testing

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.15 ◽

2007 ◽

Cited By ~ 2

Author(s):

Qi Cheng

Download Full-text

On the Advantage over Random for Maximum Acyclic Subgraph

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.65 ◽

2007 ◽

Cited By ~ 6

Author(s):

Moses Charikar ◽

Konstantin Makarychev ◽

Yury Maka

Keyword(s):

Acyclic Subgraph

Download Full-text

Non-Preemptive Min-Sum Scheduling with Resource Augmentation

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.4389530 ◽

2007 ◽

Author(s):

Nikhil Bansal ◽

Ho-Leung Chan ◽

Rohit Khandekar ◽

Kirk Pruhs ◽

Cliff Stein ◽

...

Keyword(s):

Resource Augmentation

Download Full-text

Minimizing Average Flow-time : Upper and Lower Bounds

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) ◽

10.1109/focs.2007.52 ◽

2007 ◽

Cited By ~ 15

Author(s):

Naveen Garg ◽

Amit Kumar

Keyword(s):

Lower Bounds ◽

Flow Time ◽

Upper And Lower Bounds ◽

Average Flow

Download Full-text

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Lower Bounds on Signatures From Symmetric Primitives

Simulating Quantum Correlations with Finite Communication

Reviewers

Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy

Parameterized Proof Complexity

Planning for Fast Connectivity Updates

Derandomization of Sparse Cyclotomic Integer Zero Testing

On the Advantage over Random for Maximum Acyclic Subgraph

Non-Preemptive Min-Sum Scheduling with Resource Augmentation

Minimizing Average Flow-time : Upper and Lower Bounds

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
Latest Publications