default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID60th FOCS 2019: Baltimore, MD, USA
- David Zuckerman:
60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019. IEEE Computer Society 2019, ISBN 978-1-7281-4952-3 - Ilan Reuven Cohen, Binghui Peng, David Wajc
:
Tight Bounds for Online Edge Coloring. 1-25 - Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc:
Online Matching with General Arrivals. 26-37 - Matthias Englert, Harald Räcke, Richard Stotz:
Polylogarithmic Guarantees for Generalized Reordering Buffer Management. 38-59 - Yossi Azar, Noam Touitou:
General Framework for Metric Optimization Problems with Delay or with Deadlines. 60-71 - Seth Neel, Aaron Roth, Zhiwei Steven Wu:
How to Use Heuristics for Differential Privacy. 72-93 - Matthew Joseph, Jieming Mao, Seth Neel, Aaron Roth:
The Role of Interactivity in Local Differential Privacy. 94-105 - Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Learning from Outcomes: Evidence-Based Rankings. 106-125 - Chao Tao, Qin Zhang, Yuan Zhou:
Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-armed Bandits. 126-146 - Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. 147-157 - Michael Chapman, Nati Linial, Yuval Peled:
Expander Graphs - Both Local and Global. 158-170 - Benny Applebaum, Eliran Kachlon:
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error. 171-179 - Vedat Levi Alev, Fernando Granha Jeronimo, Madhur Tulsiani:
Approximating Constraint Satisfaction Problems on High-Dimensional Expanders. 180-201 - Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins:
Adversarial Bandits with Knapsacks. 202-219 - Pravesh Kothari, Sahil Singla, Divyarthi Mohan, Ariel Schvartzman, S. Matthew Weinberg:
Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries. 220-232 - Sepehr Assadi, Sahil Singla:
Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. 233-248 - Tomer Ezra, Michal Feldman, Eric Neyman, Inbal Talgam-Cohen, S. Matthew Weinberg:
Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers. 249-272 - Emmanuel Abbe, Min Ye:
Reed-Muller Codes Polarize. 273-286 - Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
SETH-Hardness of Coding Problems. 287-301 - Jad Silbak, Swastik Kopparty, Ronen Shaltiel:
Quasilinear Time List-Decodable Codes for Space Bounded Channels. 302-333 - Bernhard Haeupler:
Optimal Document Exchange and New Codes for Insertions and Deletions. 334-347 - Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Radio Network Coding Requires Logarithmic Overhead. 348-369 - Shiri Chechik, Tianyi Zhang:
Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. 370-381 - Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. 382-405 - Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. 406-423 - Jan van den Brand, Thatchaphol Saranurak:
Sensitive Distance and Reachability Oracles for Large Batch Updates. 424-435 - Jan van den Brand, Danupon Nanongkai:
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. 436-455 - Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. 456-480 - Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, Jukka Suomela:
Lower Bounds for Maximal Matchings and Maximal Independent Sets. 481-497 - Albert Atserias, Moritz Müller:
Automating Resolution is NP-Hard. 498-509 - Anand Natarajan, John Wright:
NEEXP is Contained in MIP. 510-518 - Vincent Cohen-Addad, Karthik C. S.:
Inapproximability of Clustering in Lp Metrics. 519-539 - David Saulpic, Vincent Cohen-Addad, Andreas Emil Feldmann:
Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. 540-559 - Vincent Cohen-Addad, Michal Pilipczuk, Marcin Pilipczuk:
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. 560-581 - Aditya Bhaskara, Aidao Chen, Aidan Perreault, Aravindan Vijayaraghavan:
Smoothed Analysis in Unsupervised Learning via Decoupling. 582-610 - Alex Bredariol Grilo, William Slofstra, Henry Yuen:
Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs. 611-635 - Ashutosh Kumar, Raghu Meka, Amit Sahai:
Leakage-Resilient Secret Sharing Against Colluding Parties. 636-660 - Nico Döttling, Sanjam Garg, Vipul Goyal, Giulio Malavolta:
Laconic Conditional Disclosure of Secrets and Applications. 661-685 - Vipul Goyal, Silas Richelson:
Non-Malleable Commitments using Goldreich-Levin List Decoding. 686-699 - David G. Harris:
Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs. 700-724 - Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair:
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications. 725-744 - Frank Ban, Xi Chen, Adam Freilich, Rocco A. Servedio, Sandip Sinha:
Beyond Trace Reconstruction: Population Recovery from the Deletion Channel. 745-768 - Moses Charikar, Paris Siminelakis:
Multi-resolution Hashing for Fast Pairwise Summations. 769-792 - Chris Umans:
Fast Generalized DFTs for all Finite Groups. 793-805 - Kevin Pratt:
Waring Rank, Parameterized and Exact Algorithms. 806-823 - Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer. 824-844 - Peter Bürgisser, Cole Franks, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes. 845-861 - Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. 862-875 - Kshitij Gajjar, Jaikumar Radhakrishnan:
Parametric Shortest Paths in Planar Graphs. 876-895 - Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick:
Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges. 896-909 - Nikhil Bansal, Ola Svensson, Luca Trevisan:
New Notions and Constructions of Sparsification for Graphs and Hypergraphs. 910-928 - Luke Postle:
Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces. 929-941 - Scott Aaronson, Daniel Grier, Luke Schaeffer:
A Quantum Query Complexity Trichotomy for Regular Languages. 942-965 - Makrand Sinha, Ronald de Wolf:
Exponential Separation between Quantum Communication and Logarithm of Approximate Rank. 966-981 - Anurag Anshu, Naresh Goud Boddu, Dave Touchette:
Quantum Log-Approximate-Rank Conjecture is Also False. 982-994 - Sergey Bravyi, David Gosset, Robert König, Marco Tomamichel:
Quantum Advantage with Noisy Shallow Circuits in 3D. 995-999 - Dorit Aharonov, Alex Bredariol Grilo:
Stoquastic PCP vs. Randomness. 1000-1023 - Alexandru Gheorghiu, Thomas Vidick:
Computationally-Secure and Composable Remote State Preparation. 1024-1033 - Josh Alman, Lijie Chen:
Efficient Construction of Rigid Matrices Using an NP Oracle. 1034-1055 - Jason Li:
Faster Minimum k-cut of a Simple Graph. 1056-1077 - Hung Le, Shay Solomon:
Truly Optimal Euclidean Spanners. 1078-1100 - Elazar Goldenberg, Robert Krauthgamer, Barna Saha:
Sublinear Algorithms for Gap Edit Distance. 1101-1120 - Aviad Rubinstein, Saeed Seddighin, Zhao Song, Xiaorui Sun:
Approximation Algorithms for LCS and LIS with Truly Improved Running Times. 1121-1145 - Deeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sahil Singla, Sam Chiu-wai Wong:
Faster Matroid Intersection. 1146-1168 - Moses Ganardi, Artur Jez, Markus Lohrey:
Balancing Straight-Line Programs. 1169-1183 - Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran:
Spectral Analysis of Matrix Scaling and Operator Scaling. 1184-1204 - Noam Lifshitz, Dor Minzer:
Noise Sensitivity on the p -Biased Hypercube. 1205-1226 - Andrei A. Krokhin, Jakub Oprsal:
The Complexity of 3-Colouring H-Colourable Graphs. 1227-1239 - Lijie Chen, Ce Jin, R. Ryan Williams:
Hardness Magnification for all Sparse NP Languages. 1240-1255 - Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler:
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs. 1256-1280 - Lijie Chen:
Non-deterministic Quasi-Polynomial Time is Average-Case Hard for ACC Circuits. 1281-1304 - Ján Pich, Rahul Santhanam:
Why are Proof Complexity Lower Bounds Hard? 1305-1324 - Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen:
Polynomial Calculus Space and Resolution Width. 1325-1337 - Oren Mangoubi, Nisheeth K. Vishnoi:
Faster Polytope Rounding, Sampling, and Volume Computation via a Sub-Linear Ball Walk. 1338-1357 - Mary Cryan, Heng Guo, Giorgos Mousa:
Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions. 1358-1370 - Andrii Arman, Pu Gao, Nicholas C. Wormald:
Fast Uniform Generation of Random Graphs with Given Degree Sequences. 1371-1379 - Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
A Deterministic Algorithm for Counting Colorings with 2-Delta Colors. 1380-1404 - Zsolt Bartha, Nike Sun, Yumeng Zhang:
Breaking of 1RSB in Random Regular MAX-NAE-SAT. 1405-1416 - Andrea Montanari:
Optimization of the Sherrington-Kirkpatrick Hamiltonian. 1417-1433 - Nima Anari, Alireza Rezaei:
A Tight Analysis of Bethe Approximation for Permanent. 1434-1445 - Alexander S. Wein, Ahmed El Alaoui, Cristopher Moore:
The Kikuchi Hierarchy and Tensor PCA. 1446-1468 - Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding Monotone Patterns in Sublinear Time. 1469-1494 - Yotam Dikstein, Irit Dinur:
Agreement Testing Theorems on Layered Set Systems. 1495-1524 - Artur Czumaj, Christian Sohler:
A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs). 1525-1548 - Anindya De, Elchanan Mossel, Joe Neeman:
Junta Correlation is Testable. 1549-1563 - Jaroslaw Blasiok, Patrick Lopatto, Kyle Luh, Jake Marcinek, Shravas Rao:
An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices. 1564-1567 - Vasileios Nakos, Zhao Song, Zhengyu Wang:
(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless. 1568-1577 - Vasilis Kontonis, Christos Tzamos, Manolis Zampetakis:
Efficient Truncated Statistics with Unknown Truncation. 1578-1595 - Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam:
Residual Based Sampling for Online Low Rank Approximation. 1596-1614 - Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. 1615-1636 - Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. 1637-1649 - Mohsen Ghaffari, Fabian Kuhn, Jara Uitto:
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds. 1650-1663 - Yang P. Liu, Arun Jambulapati, Aaron Sidford:
Parallel Reachability in Almost Linear Work and Square Root Depth. 1664-1686
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-18 19: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:
