1. Home
  2. Proceedings
  3. FOCS
  4. FOCS 2015
Default Cover Image

2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)

Oct. 17 2015 to Oct. 20 2015

Berkeley, CA, USA

Table of Contents

[Title page i]Freely available from IEEE.pp. i-i
[Title page iii]Freely available from IEEE.pp. iii-iii
[Copyright notice]Freely available from IEEE.pp. iv-iv
Table of contentsFreely available from IEEE.pp. v-xi
PrefaceFreely available from IEEE.pp. xii-xii
Organizing Committee and SponsorsFreely available from IEEE.pp. xiii-xiii
Program CommitteeFreely available from IEEE.pp. xiv-xiv
External ReviewersFreely available from IEEE.pp. xv-xx
AwardsFreely available from IEEE.pp. xxi-xxi
Approximating ATSP by Relaxing ConnectivityFull-text access may be available. Sign in or learn about subscription options.pp. 1-19
by Ola Svensson
Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSPFull-text access may be available. Sign in or learn about subscription options.pp. 20-39
by Nima Anari, Shayan Oveis Gharan
Compressing and Teaching for Low VC-DimensionFull-text access may be available. Sign in or learn about subscription options.pp. 40-51
by Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff
On Monotonicity Testing and Boolean Isoperimetric Type TheoremsFull-text access may be available. Sign in or learn about subscription options.pp. 52-58
by Subhash Khot, Dor Minzer, Muli Safra
Tight Hardness Results for LCS and Other Sequence Similarity MeasuresFull-text access may be available. Sign in or learn about subscription options.pp. 59-78
by Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time WarpingFull-text access may be available. Sign in or learn about subscription options.pp. 79-97
by Karl Bringmann, Marvin Kunnemann
If the Current Clique Algorithms are Optimal, So is Valiant's ParserFull-text access may be available. Sign in or learn about subscription options.pp. 98-117
by Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams
Language Edit Distance and Maximum Likelihood Parsing of Stochastic Grammars: Faster Algorithms and Connection to Fundamental Graph ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 118-135
by Barna Saha
Probabilistic Polynomials and Hamming Nearest NeighborsFull-text access may be available. Sign in or learn about subscription options.pp. 136-150
by Josh Alman, Ryan Williams
Indistinguishability Obfuscation from the Multilinear Subgroup Elimination AssumptionFull-text access may be available. Sign in or learn about subscription options.pp. 151-170
by Craig Gentry, Allison Bishop Lewko, Amit Sahai, Brent Waters
Indistinguishability Obfuscation from Functional EncryptionFull-text access may be available. Sign in or learn about subscription options.pp. 171-190
by Nir Bitansky, Vinod Vaikuntanathan
Limits on the Power of Indistinguishability Obfuscation and Functional EncryptionFull-text access may be available. Sign in or learn about subscription options.pp. 191-209
by Gilad Asharov, Gil Segev
Black-Box Garbled RAMFull-text access may be available. Sign in or learn about subscription options.pp. 210-229
by Sanjam Garg, Steve Lu, Rafail Ostrovsky
Efficient Inverse Maintenance and Faster Algorithms for Linear ProgrammingFull-text access may be available. Sign in or learn about subscription options.pp. 230-249
by Yin Tat Lee, Aaron Sidford
Constructing Linear-Sized Spectral Sparsification in Almost-Linear TimeFull-text access may be available. Sign in or learn about subscription options.pp. 250-269
by Yin Tat Lee, He Sun
Guaranteed Matrix Completion via Nonconvex FactorizationFull-text access may be available. Sign in or learn about subscription options.pp. 270-289
by Ruoyu Sun, Zhi-Quan Luo
Heavy-Tailed Independent Component AnalysisFull-text access may be available. Sign in or learn about subscription options.pp. 290-309
by Joseph Anderson, Navin Goyal, Anupama Nandi, Luis Rademacher
Input Sparsity and Hardness for Robust Subspace ApproximationFull-text access may be available. Sign in or learn about subscription options.pp. 310-329
by Kenneth L. Clarkson, David P. Woodruff
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless CommunicationFull-text access may be available. Sign in or learn about subscription options.pp. 330-349
by Erez Kantor, Zvi Lotker, Merav Parter, David Peleg
Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer NetworksFull-text access may be available. Sign in or learn about subscription options.pp. 350-369
by John Augustine, Gopal Pandurangan, Peter Robinson, Scott Roche, Eli Upfal
Planar Reachability in Linear Space and Constant TimeFull-text access may be available. Sign in or learn about subscription options.pp. 370-389
by Jacob Holm, Eva Rotenberg, Mikkel Thorup
Towards an Optimal Method for Dynamic Planar Point LocationFull-text access may be available. Sign in or learn about subscription options.pp. 390-409
by Timothy M. Chan, Yakov Nekrich
Pattern-Avoiding Access in Binary Search TreesFull-text access may be available. Sign in or learn about subscription options.pp. 410-423
by Parinya Chalermsook, Mayank Goswami, Laszlo Kozma, Kurt Mehlhorn, Thatchaphol Saranurak
The Average Sensitivity of Bounded-Depth FormulasFull-text access may be available. Sign in or learn about subscription options.pp. 424-430
by Benjamin Rossman
The Power of Asymmetry in Constant-Depth CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 431-450
by Alexander A. Sherstov
Deterministic Divisibility Testing via Shifted Partial DerivativesFull-text access may be available. Sign in or learn about subscription options.pp. 451-465
by Michael A. Forbes
Hardness of Approximation in PSPACE and Separation Results for Pebble GamesFull-text access may be available. Sign in or learn about subscription options.pp. 466-485
by Siu Man Chan, Massimo Lauria, Jakob Nordstrom, Marc Vinyals
The Submodular Secretary Problem Goes LinearFull-text access may be available. Sign in or learn about subscription options.pp. 486-505
by Moran Feldman, Rico Zenklusen
Competitive Flow Time Algorithms for Polyhedral SchedulingFull-text access may be available. Sign in or learn about subscription options.pp. 506-524
by Sungjin Im, Janardhan Kulkarni, Kamesh Munagala
Tight Bounds for Online Vector SchedulingFull-text access may be available. Sign in or learn about subscription options.pp. 525-544
by Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi
Online Buy-at-Bulk Network DesignFull-text access may be available. Sign in or learn about subscription options.pp. 545-562
by Alina Ene, Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Debmalya Panigrahi
Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!Full-text access may be available. Sign in or learn about subscription options.pp. 563-582
by Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz
A Robust Sparse Fourier Transform in the Continuous SettingFull-text access may be available. Sign in or learn about subscription options.pp. 583-600
by Eric Price, Zhao Song
Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per AlignmentFull-text access may be available. Sign in or learn about subscription options.pp. 601-613
by Tsvi Kopelowitz, Ely Porat
Approximately Counting Triangles in Sublinear TimeFull-text access may be available. Sign in or learn about subscription options.pp. 614-633
by Talya Eden, Amit Levi, Dana Ron, C. Seshadhri
Differentially Private Release and Learning of Threshold FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 634-649
by Mark Bun, Kobbi Nissim, Uri Stemmer, Salil Vadhan
Robust Traceability from Trace AmountsFull-text access may be available. Sign in or learn about subscription options.pp. 650-669
by Cynthia Dwork, Adam Smith, Thomas Steinke, Jonathan Ullman, Salil Vadhan
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for RecoveryFull-text access may be available. Sign in or learn about subscription options.pp. 670-688
by Emmanuel Abbe, Colin Sandon
How to Refute a Random CSPFull-text access may be available. Sign in or learn about subscription options.pp. 689-708
by Sarah R. Allen, Ryan O'Donnell, David Witmer
An O(1)-Approximation for Minimum Spanning Tree InterdictionFull-text access may be available. Sign in or learn about subscription options.pp. 709-728
by Rico Zenklusen
Reality Distortion: Exact and Approximate Algorithms for Embedding into the LineFull-text access may be available. Sign in or learn about subscription options.pp. 729-747
by Amir Nayyeri, Benjamin Raichel
Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 748-758
by F.B. Shepherd, Adrian Vetta, Gordon T. Wilfong
A Light Metric SpannerFull-text access may be available. Sign in or learn about subscription options.pp. 759-772
by Lee-Ad Gottlieb
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of DisjointnessFull-text access may be available. Sign in or learn about subscription options.pp. 773-791
by Mark Braverman, Ankit Garg, Young Kun Ko, Jieming Mao, Dave Touchette
Hamiltonian Simulation with Nearly Optimal Dependence on all ParametersFull-text access may be available. Sign in or learn about subscription options.pp. 792-809
by Dominic W. Berry, Andrew M. Childs, Robin Kothari
Quantum Expander CodesFull-text access may be available. Sign in or learn about subscription options.pp. 810-824
by Anthony Leverrier, Jean-Pierre Tillich, Gilles Zemor
Robust Testing of Lifted Codes with Applications to Low-Degree TestingFull-text access may be available. Sign in or learn about subscription options.pp. 825-844
by Alan Guo, Elad Haramaty, Madhu Sudan
Local Correlation Breakers and Applications to Three-Source Extractors and MergersFull-text access may be available. Sign in or learn about subscription options.pp. 845-862
by Gil Cohen
Three-Source Extractors for Polylogarithmic Min-EntropyFull-text access may be available. Sign in or learn about subscription options.pp. 863-882
by Xin Li
Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness for Combinatorial SumsFull-text access may be available. Sign in or learn about subscription options.pp. 883-902
by Anindya De
Pseudorandomness via the Discrete Fourier TransformFull-text access may be available. Sign in or learn about subscription options.pp. 903-922
by Parikshit Gopalan, Daniek Kane, Raghu Meka
Tight Bounds on Low-Degree Spectral Concentration of Submodular and XOS FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 923-942
by Vitaly Feldman, Jan Vondrak
Equivalence of Deterministic Top-Down Tree-to-String Transducers is DecidableFull-text access may be available. Sign in or learn about subscription options.pp. 943-962
by Helmut Seidl, Sebastian Maneth, Gregor Kemper
FO Model Checking on Posets of Bounded WidthFull-text access may be available. Sign in or learn about subscription options.pp. 963-974
by Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrálek, Sebastian Ordyniak, M.S. Ramanujan, Saket Saurabh
Satisfiability of Ordering CSPs above Average is Fixed-Parameter TractableFull-text access may be available. Sign in or learn about subscription options.pp. 975-993
by Konstantin Makarychev, Yury Makarychev, Yuan Zhou
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2kFull-text access may be available. Sign in or learn about subscription options.pp. 994-1009
by Radu Curticapean, Mingji Xia
Isomorphism Testing for Graphs of Bounded Rank WidthFull-text access may be available. Sign in or learn about subscription options.pp. 1010-1029
by Martin Grohe, Pascal Schweitzer
An Average-Case Depth Hierarchy Theorem for Boolean CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 1030-1048
by Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex OptimizationFull-text access may be available. Sign in or learn about subscription options.pp. 1049-1065
by Yin Tat Lee, Aaron Sidford, Sam Chiu-Wai Wong
Lower Bounds for Clique vs. Independent SetFull-text access may be available. Sign in or learn about subscription options.pp. 1066-1076
by Mika Goos
Deterministic Communication vs. Partition NumberFull-text access may be available. Sign in or learn about subscription options.pp. 1077-1088
by Mika Goos, Toniann Pitassi, Thomas Watson
New Unconditional Hardness Results for Dynamic and Online ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 1089-1107
by Raphael Clifford. Allan Gronlund, Kasper Green Larsen
Tight Hardness of the Non-commutative Grothendieck ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 1108-1122
by Jop Briot, Oded Regev, Rishi Saket
No Small Linear Program Approximates Vertex Cover within a Factor 2 -- eFull-text access may be available. Sign in or learn about subscription options.pp. 1123-1142
by Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson
Approximate ModularityFull-text access may be available. Sign in or learn about subscription options.pp. 1143-1162
by Flavio Chierichetti, Abhimanyu Das, Anirban Dasgupta, Ravi Kumar
Trading Query Complexity for Sample-Based Testing and Multi-testing ScalabilityFull-text access may be available. Sign in or learn about subscription options.pp. 1163-1182
by Eldar Fischer, Oded Lachish, Yadu Vasudev
Optimal Algorithms and Lower Bounds for Testing Closeness of Structured DistributionsFull-text access may be available. Sign in or learn about subscription options.pp. 1183-1202
by Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin
On the Structure, Covering, and Learning of Poisson Multinomial DistributionsFull-text access may be available. Sign in or learn about subscription options.pp. 1203-1217
by Constantinos Daskalakis, Gautam Kamath, Christos Tzamos
Uniform Generation of Random Regular GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 1218-1230
by Pu Gao, Nicholas Wormald
Symbolic Integration and the Complexity of Computing AveragesFull-text access may be available. Sign in or learn about subscription options.pp. 1231-1245
by Leonard J. Schulman, Alistair Sinclair, Piyush Srivastava
The Complexity of General-Valued CSPsFull-text access may be available. Sign in or learn about subscription options.pp. 1246-1258
by Vladimir Kolmogorov, Andrei Krokhin, Michal Rolinek
A Holant Dichotomy: Is the FKT Algorithm Universal?Full-text access may be available. Sign in or learn about subscription options.pp. 1259-1276
by Jin-Yi Cai, Zhiguo Fu, Heng Guo, Tyson Williams
Sample (x) = (a*x<=t) is a Distinguisher with Probability 1/8Full-text access may be available. Sign in or learn about subscription options.pp. 1277-1291
by Mikkel Thorup
Hashing for Statistics over K-PartitionsFull-text access may be available. Sign in or learn about subscription options.pp. 1292-1310
by Soren Dahlgaard, Mathias Baek Tejs Knudsen, Eva Rotenberg, Mikkel Thorup
Optimal Induced Universal Graphs and Adjacency Labeling for TreesFull-text access may be available. Sign in or learn about subscription options.pp. 1311-1326
by Stephen Alstrup, Soren Dahlgaard, Mathias Baek Tejs Knudsen
An Algorithmic Proof of the Lovasz Local Lemma via Resampling OraclesFull-text access may be available. Sign in or learn about subscription options.pp. 1327-1346
by Nicholas J.A. Harvey, Jan Vondrak
Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan GraphsFull-text access may be available. Sign in or learn about subscription options.pp. 1347-1357
by Charles Bordenave, Marc Lelarge, Laurent Massoulie
Interlacing Families IV: Bipartite Ramanujan Graphs of All SizesFull-text access may be available. Sign in or learn about subscription options.pp. 1358-1377
by Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava
Incidences between Points and Lines in R^4Full-text access may be available. Sign in or learn about subscription options.pp. 1378-1394
by Micha Sharir, Noam Solomon
Talagrand's Convolution Conjecture on Gaussian SpaceFull-text access may be available. Sign in or learn about subscription options.pp. 1395-1408
by Ronen Eldan, James R. Lee
Random Matrices: l1 Concentration and Dictionary Learning with Few SamplesFull-text access may be available. Sign in or learn about subscription options.pp. 1409-1425
by Kyle Luh, Van Vu
Mixture Selection, Mechanism Design, and SignalingFull-text access may be available. Sign in or learn about subscription options.pp. 1426-1445
by Yu Cheng, Ho Yee Cheung, Shaddin Dughmi, Ehsan Emamjomeh-Zadeh, Li Han, Shang-Hua Teng
Optimal Auctions vs. Anonymous PricingFull-text access may be available. Sign in or learn about subscription options.pp. 1446-1463
by Saeed Alaei, Jason Hartline, Rad Niazadeh, Emmanouil Pountourakis, Yang Yuan
On the Complexity of Optimal Lottery Pricing and Randomized MechanismsFull-text access may be available. Sign in or learn about subscription options.pp. 1464-1479
by Xi Chen, Ilias Diakonikolas, Anthi Orfanou, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis
On the Cryptographic Hardness of Finding a Nash EquilibriumFull-text access may be available. Sign in or learn about subscription options.pp. 1480-1498
by Nir Bitansky, Omer Paneth, Alon Rosen
Welfare Maximization with Limited InteractionFull-text access may be available. Sign in or learn about subscription options.pp. 1499-1512
by Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
Author indexFreely available from IEEE.pp. 1513-1515
[Publisher's information]Freely available from IEEE.pp. 1516-1516
Showing 97 out of 97