2013 IEEE 54th Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

9780769551357

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Improved Average-Case Lower Bounds for DeMorgan Formula Size

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.69 ◽

2013 ◽

Cited By ~ 19

Author(s):

Ilan Komargodski ◽

Ran Raz ◽

Avishay Tal

Keyword(s):

Lower Bounds ◽

Average Case

Download Full-text

Strong Backdoors to Bounded Treewidth SAT

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.59 ◽

2013 ◽

Cited By ~ 12

Author(s):

Serge Gaspers ◽

Stefan Szeider

Keyword(s):

Bounded Treewidth

Download Full-text

Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.32 ◽

2013 ◽

Cited By ~ 11

Author(s):

Vitaly Feldman ◽

Jan Vondrak

Keyword(s):

Optimal Bounds

Download Full-text

Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.84 ◽

2013 ◽

Cited By ~ 2

Author(s):

Andrew Drucker

Keyword(s):

Direct Product ◽

Success Probability ◽

Sat Solvers

Download Full-text

Online Node-Weighted Steiner Forest and Extensions via Disk Paintings

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.66 ◽

2013 ◽

Cited By ~ 8

Author(s):

Mohammad Taghi Hajiaghayi ◽

Vahid Liaghat ◽

Debmalya Panigrahi

Keyword(s):

Steiner Forest

Download Full-text

Title Page iii

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.2 ◽

2013 ◽

Keyword(s):

Title Page

Download Full-text

Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.24 ◽

2013 ◽

Cited By ~ 32

Author(s):

Yin Tat Lee ◽

Aaron Sidford

Keyword(s):

Linear Systems ◽

Coordinate Descent ◽

Descent Methods

Download Full-text

The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.29 ◽

2013 ◽

Cited By ~ 15

Author(s):

Marek Cygan ◽

Daniel Marx ◽

Marcin Pilipczuk ◽

Michal Pilipczuk

Keyword(s):

Disjoint Paths ◽

Fixed Parameter Tractable ◽

Fixed Parameter ◽

Vertex Disjoint

Download Full-text

Awards: FOCS 2013 [2 awards]

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.88 ◽

2013 ◽

Download Full-text

Learning Sums of Independent Integer Random Variables

2013 IEEE 54th Annual Symposium on Foundations of Computer Science ◽

10.1109/focs.2013.31 ◽

2013 ◽

Cited By ~ 14

Author(s):

Constantinos Daskalakis ◽

Ilias Diakonikolas ◽

Ryan ODonnell ◽

Rocco A. Servedio ◽

Li-Yang Tan

Keyword(s):

Random Variables

Download Full-text

2013 IEEE 54th Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Improved Average-Case Lower Bounds for DeMorgan Formula Size

Strong Backdoors to Bounded Treewidth SAT

Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas

Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers

Online Node-Weighted Steiner Forest and Extensions via Disk Paintings

Title Page iii

Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems

The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable

Awards: FOCS 2013 [2 awards]

Learning Sums of Independent Integer Random Variables

2013 IEEE 54th Annual Symposium on Foundations of Computer Science
Latest Publications