2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
Latest Publications

TOTAL DOCUMENTS

98

(FIVE YEARS 0)

H-INDEX

15

(FIVE YEARS 0)

Published By IEEE

9781509039333

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.68 ◽

2016 ◽

Author(s):

Rasmus Kyng ◽

Sushant Sachdeva

Keyword(s):

Gaussian Elimination

Download Full-text

Online Algorithms for Covering and Packing Problems with Convex Objectives

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.24 ◽

2016 ◽

Author(s):

Yossi Azar ◽

Niv Buchbinder ◽

T-H. Hubert Chan ◽

Shahar Chen ◽

Ilan Reuven Cohen ◽

...

Keyword(s):

Online Algorithms ◽

Packing Problems

Download Full-text

Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.11 ◽

2016 ◽

Author(s):

Huijia Lin ◽

Vinod Vaikuntanathan

Keyword(s):

Constant Degree ◽

Indistinguishability Obfuscation

Download Full-text

Extension Complexity of Independent Set Polytopes

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.67 ◽

2016 ◽

Author(s):

Mika Goos ◽

Rahul Jain ◽

Thomas Watson

Keyword(s):

Independent Set ◽

Extension Complexity

Download Full-text

How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.79 ◽

2016 ◽

Author(s):

Felix Joos ◽

Guillem Perarnau ◽

Dieter Rautenbach ◽

Bruce Reed

Keyword(s):

Random Graph ◽

Degree Sequence ◽

Giant Component ◽

Download Full-text

A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.19 ◽

2016 ◽

Author(s):

Magnus Gausdal Find ◽

Alexander Golovnev ◽

Edward A. Hirsch ◽

Alexander S. Kulikov

Keyword(s):

Lower Bound ◽

Circuit Complexity ◽

Explicit Function ◽

Download Full-text

Publisher's Information

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.94 ◽

2016 ◽

Download Full-text

Extractors for Near Logarithmic Min-Entropy

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.27 ◽

2016 ◽

Author(s):

Gil Cohen ◽

Leonard J. Schulman

Download Full-text

Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.22 ◽

2016 ◽

Author(s):

Michael Elkin ◽

Ofer Neiman

Keyword(s):

Download Full-text

Exponential Lower Bounds for Monotone Span Programs

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2016.51 ◽

2016 ◽

Author(s):

Robert Robere ◽

Toniann Pitassi ◽

Benjamin Rossman ◽

Stephen A. Cook

Keyword(s):

Lower Bounds ◽

Monotone Span Programs ◽

Download Full-text