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

TOTAL DOCUMENTS

98

(FIVE YEARS 0)

H-INDEX

17

(FIVE YEARS 0)

Published By IEEE

9781467381918

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

External Reviewers

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

10.1109/focs.2015.8 ◽

2015 ◽

Download Full-text

Tight Hardness of the Non-commutative Grothendieck Problem

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

10.1109/focs.2015.72 ◽

2015 ◽

Author(s):

Jop Briot ◽

Oded Regev ◽

Rishi Saket

Download Full-text

Approximating ATSP by Relaxing Connectivity

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

10.1109/focs.2015.10 ◽

2015 ◽

Author(s):

Ola Svensson

Download Full-text

Black-Box Garbled RAM

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

10.1109/focs.2015.22 ◽

2015 ◽

Author(s):

Sanjam Garg ◽

Steve Lu ◽

Rafail Ostrovsky

Keyword(s):

Download Full-text

An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles

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

10.1109/focs.2015.85 ◽

2015 ◽

Author(s):

Nicholas J.A. Harvey ◽

Jan Vondrak

Keyword(s):

Lovász Local Lemma ◽

Local Lemma ◽

Lovasz Local Lemma

Download Full-text

Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption

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

10.1109/focs.2015.19 ◽

2015 ◽

Author(s):

Craig Gentry ◽

Allison Bishop Lewko ◽

Amit Sahai ◽

Brent Waters

Keyword(s):

Indistinguishability Obfuscation

Download Full-text

Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery

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

10.1109/focs.2015.47 ◽

2015 ◽

Author(s):

Emmanuel Abbe ◽

Colin Sandon

Keyword(s):

Community Detection ◽

Efficient Algorithms ◽

Fundamental Limits ◽

Block Models ◽

General Stochastic

Download Full-text

[Publisher's information]

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

10.1109/focs.2015.97 ◽

2015 ◽

Download Full-text

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 ◽

Author(s):

Mark Braverman ◽

Ankit Garg ◽

Young Kun Ko ◽

Jieming Mao ◽

Dave Touchette

Keyword(s):

Communication Complexity ◽

Quantum Communication ◽

Quantum Communication Complexity ◽

Download Full-text

Awards

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

10.1109/focs.2015.9 ◽

2015 ◽

Download Full-text