2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
Latest Publications

TOTAL DOCUMENTS

125

(FIVE YEARS 125)

H-INDEX

1

(FIVE YEARS 1)

Published By IEEE

9781728196213

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00124 ◽

2020 ◽

Author(s):

Zongchen Chen ◽

Kuikui Liu ◽

Eric Vigoda

Keyword(s):

Glauber Dynamics ◽

Download Full-text

Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00073 ◽

2020 ◽

Author(s):

Thomas D. Ahle ◽

Jakob B. T. Knudsen

Keyword(s):

Similarity Search

Download Full-text

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00040 ◽

2020 ◽

Author(s):

Sepehr Assadi ◽

Ran Raz

Keyword(s):

Lower Bounds ◽

Streaming Algorithms ◽

Graph Streaming

Download Full-text

Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00082 ◽

2020 ◽

Author(s):

Biswaroop Maiti ◽

Rajmohan Rajaraman ◽

David Stalfa ◽

Zoya Svitkina ◽

Aravindan Vijayaraghavan

Keyword(s):

Communication Delay ◽

Related Machines

Download Full-text

Nearly Optimal Pseudorandomness From Hardness

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00102 ◽

2020 ◽

Author(s):

Dean Doron ◽

Dana Moshkovitz ◽

Justin Oh ◽

David Zuckerman

Download Full-text

Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00125 ◽

2020 ◽

Author(s):

Nima Anari ◽

Kuikui Liu ◽

Shayan Oveis Gharan

Keyword(s):

High Dimensional

Download Full-text

A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00031 ◽

2020 ◽

Author(s):

Shalev Ben-David ◽

Eric Blais

Keyword(s):

Query Complexity ◽

Partial Functions ◽

Composition Theorem

Download Full-text

Testing Positive Semi-Definiteness via Random Submatrices

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00114 ◽

2020 ◽

Author(s):

Ainesh Bakshi ◽

Nadiia Chepurko ◽

Rajesh Jayaram

Download Full-text

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00010 ◽

2020 ◽

Author(s):

Lijie Chen ◽

Ron D. Rothblum ◽

Roei Tell ◽

Eylon Yogev

Keyword(s):

Lower Bounds ◽

Exponential Time ◽

Circuit Lower Bounds

Download Full-text

Smoothing the gap between NP and ER

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs46700.2020.00099 ◽

2020 ◽

Author(s):

Jeff Erickson ◽

Ivor van der Hoog ◽

Tillmann Miltzow

Download Full-text