2015 IEEE 56th Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

9781467381918

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Three-Source Extractors for Polylogarithmic Min-Entropy

2015 IEEE 56th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2015.58 ◽

2015 ◽

Cited By ~ 16

Author(s):

Xin Li

Get full-text (via PubEx)

No Small Linear Program Approximates Vertex Cover within a Factor 2 -- e

2015 IEEE 56th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2015.73 ◽

2015 ◽

Cited By ~ 9

Author(s):

Abbas Bazzi ◽

Samuel Fiorini ◽

Sebastian Pokutta ◽

Ola Svensson

Keyword(s):

Vertex Cover ◽

Linear Program

Get full-text (via PubEx)

[Publisher's information]

2015 IEEE 56th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2015.97 ◽

2015 ◽

Get full-text (via PubEx)

Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness

2015 IEEE 56th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2015.53 ◽

2015 ◽

Cited By ~ 6

Author(s):

Mark Braverman ◽

Ankit Garg ◽

Young Kun Ko ◽

Jieming Mao ◽

Dave Touchette

Keyword(s):

Communication Complexity ◽

Quantum Communication ◽

Quantum Communication Complexity ◽

Optimal Bounds

Get full-text (via PubEx)

Awards

2015 IEEE 56th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2015.9 ◽

2015 ◽

Get full-text (via PubEx)

Incidences between Points and Lines in R^4

2015 IEEE 56th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2015.88 ◽

2015 ◽

Author(s):

Micha Sharir ◽

Noam Solomon

Get full-text (via PubEx)

Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!

2015 IEEE 56th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2015.41 ◽

2015 ◽

Cited By ~ 13

Author(s):

Divesh Aggarwal ◽

Daniel Dadush ◽

Noah Stephens-Davidowitz

Keyword(s):

Closest Vector Problem ◽

Vector Problem

Get full-text (via PubEx)

External Reviewers

2015 IEEE 56th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2015.8 ◽

2015 ◽

Get full-text (via PubEx)

Tight Hardness of the Non-commutative Grothendieck Problem

2015 IEEE 56th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2015.72 ◽

2015 ◽

Cited By ~ 1

Author(s):

Jop Briot ◽

Oded Regev ◽

Rishi Saket

Get full-text (via PubEx)

Approximating ATSP by Relaxing Connectivity

2015 IEEE 56th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2015.10 ◽

2015 ◽

Cited By ~ 9

Author(s):

Ola Svensson

Get full-text (via PubEx)

2015 IEEE 56th Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Three-Source Extractors for Polylogarithmic Min-Entropy

No Small Linear Program Approximates Vertex Cover within a Factor 2 -- e

[Publisher's information]

Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness

Awards

Incidences between Points and Lines in R^4

Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!

External Reviewers

Tight Hardness of the Non-commutative Grothendieck Problem

Approximating ATSP by Relaxing Connectivity

2015 IEEE 56th Annual Symposium on Foundations of Computer Science
Latest Publications