default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 45
Volume 45, Number 1, 2016
- Albert Gu, Anupam Gupta, Amit Kumar
:
The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online. 1-28 - Michal Feldman, Nick Gravin, Brendan Lucier:
Combinatorial Walrasian Equilibrium. 29-48 - Matthew Andrews, Spyridon Antonakopoulos, Lisa Zhang:
Minimum-Cost Network Design with (Dis)economies of Scale. 49-66 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk:
Known Algorithms for Edge Clique Cover are Probably Optimal. 67-83 - Esther Ezra:
A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension. 84-101 - Maria-Florina Balcan, Yingyu Liang:
Clustering under Perturbation Resilience. 102-155 - Ankur Moitra:
An Almost Optimal Algorithm for Computing Nonnegative Rank. 156-173 - Jeff M. Phillips, Elad Verbin, Qin Zhang:
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy. 174-196
Volume 45, Number 2, 2016
- Rishi Gupta, Tim Roughgarden, C. Seshadhri:
Decompositions of Triangle-Dense Graphs. 197-215 - Fabrizio Grandoni, Thomas Rothvoß:
Pricing on Paths: A PTAS for the Highway Problem. 216-231 - Roee Engelberg, Joseph Naor:
Equilibria in Online Games. 232-267 - Toby S. Cubitt, Ashley Montanaro:
Complexity Classification of Local Hamiltonian Problems. 268-316 - Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
A ck n 5-Approximation Algorithm for Treewidth. 317-378 - Armando Castañeda, Damien Imbs, Sergio Rajsbaum, Michel Raynal:
Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects. 379-414 - Kai-Min Chung, Rafael Pass, Karn Seth:
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security. 415-458
- James Aspnes, Yuval Ishai, Peter Bro Miltersen:
Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013). 459-460 - Deeparnab Chakrabarty, C. Seshadhri:
An o(n) Monotonicity Tester for Boolean Functions over the Hypercube. 461-472 - Jonathan R. Ullman:
Answering n2+o(1) Counting Queries with Differential Privacy is Hard. 473-496 - R. Ryan Williams:
Natural Proofs versus Derandomization. 497-529 - Shi Li, Ola Svensson:
Approximating k-Median via Pseudo-Approximation. 530-547 - Aaron Bernstein:
Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs. 548-574 - Aleksandar Nikolov, Kunal Talwar, Li Zhang:
The Geometry of Differential Privacy: The Small Database and Approximate Cases. 575-616 - Andris Ambainis:
Superlinear Advantage for Exact Quantum Algorithms. 617-631
Volume 45, Number 3, 2016
- Dorit Aharonov, André Chailloux, Maor Ganz, Iordanis Kerenidis, Loïck Magnin:
A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias. 633-679 - Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum:
Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard. 680-711 - Liam Roditty, Uri Zwick:
A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time. 712-733 - James Aspnes, Keren Censor-Hillel, Hagit Attiya, Danny Hendler:
Lower Bounds for Restricted-Use Objects. 734-762 - Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff:
The Fast Cauchy Transform and Faster Robust Linear Regression. 763-810 - Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis:
How Good is the Chord Algorithm? 811-858 - Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese:
The Power of Recourse for Online MST and TSP. 859-880
- Moritz Hardt, Yuval Ishai, Raghu Meka, Virginia Vassilevska Williams:
Special Section on the Fifty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013). 881 - Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, Brent Waters:
Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits. 882-929 - Thomas Rothvoss:
Better Bin Packing Approximations via Discrepancy Theory. 930-946 - Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. 947-1006 - Thomas Vidick:
Three-Player Entangled XOR Games are NP-Hard to Approximate. 1007-1063 - Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi:
Arithmetic Circuits: A Chasm at Depth 3. 1064-1079 - David Gosset, Daniel Nagaj:
Quantum 3-SAT Is QMA1-Complete. 1080-1128 - Vitaly Feldman, Jan Vondrák:
Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas. 1129-1170
Volume 45, Number 4, 2016
- Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk:
Designing FPT Algorithms for Cut Problems Using Randomized Contractions. 1171-1229 - Carles Creus, Adrià Gascón, Guillem Godoy, Lander Ramos:
The HOM Problem is EXPTIME-Complete. 1230-1260 - Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the Power of Conditional Samples in Distribution Testing. 1261-1296 - Gil Cohen:
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers. 1297-1338 - Pablo Barceló, Miguel Romero, Moshe Y. Vardi:
Semantic Acyclicity on Graph Databases. 1339-1376 - Yoichi Iwata, Magnus Wahlström, Yuichi Yoshida:
Half-integrality, LP-branching, and FPT Algorithms. 1377-1411 - Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi:
Upper and Lower Bounds on the Power of Advice. 1412-1432 - Jingguo Bi, Qi Cheng, J. Maurice Rojas:
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields. 1433-1447
- Andrew McGregor, Rahul Santhanam:
Special Section on the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012). 1448-1449 - Alexander A. Sherstov:
The Multiparty Communication Complexity of Set Disjointness. 1450-1489 - Julia Chuzhoy:
Routing in Undirected Graphs with Constant Congestion. 1490-1532 - Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. 1533-1562 - Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer:
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme. 1563-1581 - Sanjeev Arora, Rong Ge, Ravi Kannan, Ankur Moitra:
Computing a Nonnegative Matrix Factorization - Provably. 1582-1611 - Paul Beame, Chris Beck, Russell Impagliazzo:
Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space. 1612-1645 - Libor Barto, Marcin Kozik:
Robustly Solvable Constraint Satisfaction Problems. 1646-1669
Volume 45, Number 5, 2016
- Jin-Yi Cai, Heng Guo, Tyson Williams:
A Complete Dichotomy Rises from the Capture of Vanishing Signatures. 1671-1728 - László A. Végh:
A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives. 1729-1761 - Mina Ghashami, Edo Liberty, Jeff M. Phillips, David P. Woodruff:
Frequent Directions: Simple and Deterministic Matrix Sketching. 1762-1792 - Ran Canetti, Huijia Lin, Rafael Pass:
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions. 1793-1834 - Mika Göös, Shachar Lovett, Raghu Meka, Thomas Watson, David Zuckerman:
Rectangles Are Nonnegative Juntas. 1835-1869 - William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals:
Minimizing Co-location Potential of Moving Entities. 1870-1893 - Ilario Bonacina, Nicola Galesi, Neil Thapen:
Total Space in Resolution. 1894-1909 - Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the Existence of Extractable One-Way Functions. 1910-1952
Volume 45, Number 6, 2016
- Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, Zhiwei Steven Wu:
Private Matchings and Allocations. 1953-1984 - Jens M. Schmidt:
Mondshein Sequences (a.k.a. (2, 1)-Orders). 1985-2003 - Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. 2004-2065 - Hubie Chen, Víctor Dalmau:
Decomposing Quantified Conjunctive (or Disjunctive) Formulas. 2066-2086 - Charilaos Efthymiou:
A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs Uniqueness Threshold. 2087-2116 - Gilad Asharov, Gil Segev:
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. 2117-2176 - Jin-Yi Cai, Xi Chen, Pinyan Lu:
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy. 2177-2198 - Jacob Fox, János Pach, Andrew Suk:
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing. 2199-2223
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-14 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
