default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID51st STOC 2019: Phoenix, AZ, USA
- Moses Charikar, Edith Cohen:
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. ACM 2019, ISBN 978-1-4503-6705-9
Award Papers and More
- Nima Anari
, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant:
Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid. 1-12 - Ran Raz, Avishay Tal:
Oracle separation of BQP and PH. 13-23 - Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki:
The reachability problem for Petri nets is not elementary. 24-33 - Lijie Chen, Roei Tell:
Bootstrapping results for threshold circuits "just beyond" known lower bounds. 34-41 - Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
The log-approximate-rank conjecture is false. 42-53 - Jugal Garg, László A. Végh:
A strongly polynomial algorithm for linear exchange markets. 54-65
Discrete Optimization
- Eric Balkanski, Aviad Rubinstein, Yaron Singer:
An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model. 66-77 - Chandra Chekuri, Kent Quanrud:
Parallelizing greedy for submodular set function maximization in matroids and beyond. 78-89 - Alina Ene, Huy L. Nguyen, Adrian Vladu:
Submodular maximization with matroid and packing constraints in parallel. 90-101 - Lin Chen, Moran Feldman, Amin Karbasi:
Unconstrained submodular maximization with constant adaptive complexity. 102-113 - Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni, Debmalya Panigrahi, Barna Saha:
Dynamic set cover: improved algorithms and lower bounds. 114-125 - Deeparnab Chakrabarty, Chaitanya Swamy:
Approximation algorithms for minimum norm and ordered optimization problems. 126-137
Planar Graphs Algorithms
- Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Almost optimal distance oracles for planar graphs. 138-151 - Jason Li, Merav Parter:
Planar diameter via metric compression. 152-163 - Ken-ichi Kawarabayashi, Anastasios Sidiropoulos:
Polylogarithmic approximation for Euler genus on bounded degree graphs. 164-175 - Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt:
Planar graphs of bounded degree have bounded queue number. 176-184
Quantum Computing I
- Justin Holmgren, Lisa Yang:
The parallel repetition of non-signaling games: counterexamples and dichotomy. 185-192 - András Gilyén, Yuan Su, Guang Hao Low, Nathan Wiebe:
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. 193-204 - Atul Singh Arora, Jérémie Roland, Stephan Weis:
Quantum weak coin flipping. 205-216 - Ewin Tang:
A quantum-inspired classical algorithm for recommendation systems. 217-228
Graph Algorithms I
- Anupam Gupta, Euiwoong Lee, Jason Li:
The number of minimum k-cuts: improving the Karger-Stein bound. 229-240 - Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai:
Breaking quadratic time for small vertex connectivity and an approximation scheme. 241-252 - Fabrizio Grandoni, Bundit Laekhanukit, Shi Li:
O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. 253-264
Streaming
- Sepehr Assadi, Yu Chen, Sanjeev Khanna:
Polynomial pass lower bounds for graph streaming algorithms. 265-276 - Michael Kapralov, Dmitry Krachun:
An optimal space lower bound for approximating MAX-CUT. 277-288 - Vasileios Nakos, Zhao Song:
Stronger l2/l2 compressed sensing; without iterating. 289-297
Privacy
- Jingcheng Liu, Kunal Talwar:
Private selection from private candidates. 298-309 - Clément L. Canonne, Gautam Kamath, Audra McMillan, Adam D. Smith, Jonathan R. Ullman:
The structure of optimal private tests for simple hypotheses. 310-321 - Scott Aaronson, Guy N. Rothblum:
Gentle measurement of quantum states and differential privacy. 322-333
Graph Algorithms II Distributed/Dynamic
- Aaron Bernstein, Danupon Nanongkai:
Distributed exact weighted all-pairs shortest paths in near-linear time. 334-342 - Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak:
Distributed edge connectivity in sublinear time. 343-354 - Hsin-Hao Su, Hoa T. Vu:
Towards the locality of Vizing's theorem. 355-364 - Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen:
Decremental strongly-connected components and single-source reachability in near-linear time. 365-376 - Sebastian Forster, Gramoz Goranci:
Dynamic low-stretch trees via dynamic low-diameter decompositions. 377-388 - Julia Chuzhoy, Sanjeev Khanna:
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems. 389-400
Complexity Theory I Circuits
- Alexander A. Sherstov, Pei Wu:
Near-optimal lower bounds on the threshold degree and sign-rank of AC0. 401-412 - Neeraj Kayal, Chandan Saha:
Reconstruction of non-degenerate homogeneous depth three circuits. 413-424 - Amir Yehudayoff:
Separating monotone VP and VNP. 425-429 - Aaron Potechin:
On the approximation resistance of balanced linear threshold functions. 430-441 - Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. 442-453 - Shachar Lovett, Jiapeng Zhang:
DNF sparsification beyond sunflowers. 454-460
Quantum Computation II
- Kun He, Qian Li, Xiaoming Sun, Jiapeng Zhang:
Quantum Lovász local lemma: Shearer's bound is tight. 461-472 - Joseph F. Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen:
Quantum proof systems for iterated exponential time, and beyond. 473-480 - Thomas C. Bohdanowicz, Elizabeth Crosson, Chinmay Nirkhe, Henry Yuen:
Good approximate quantum LDPC codes from spacetime circuit Hamiltonians. 481-490 - Guang Hao Low:
Hamiltonian simulation with nearly optimal dependence on spectral norm. 491-502 - Costin Badescu, Ryan O'Donnell, John Wright:
Quantum state certification. 503-514 - Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal:
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. 515-526
Property Testing
- Oded Goldreich:
Testing graphs in vertex-distribution-free models. 527-534 - Lior Gishboliner, Asaf Shapira:
Testing graphs against an unknown distribution. 535-546 - Xi Chen, Erik Waingarten:
Testing unateness nearly optimally. 547-558 - Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs. 559-567
Constraint Satisfaction
- Joshua Brakensiek, Venkatesan Guruswami:
Bridging between 0/1 and linear programming via random walks. 568-577 - Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick:
Faster k-SAT algorithms using biased-PPSZ. 578-589 - Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
CSPs with global modular constraints: algorithms and hardness via polynomial representations. 590-601 - Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal:
Algebraic approach to promise constraint satisfaction. 602-613
Pseudorandomness / Algorithmic Game Theory
- Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan:
Fooling polytopes. 614-625 - Raghu Meka, Omer Reingold, Avishay Tal:
Pseudorandom generators for width-3 branching programs. 626-637 - Aris Filos-Ratsikas, Paul W. Goldberg:
The complexity of splitting necklaces and bisecting ham sandwiches. 638-649 - Yakov Babichenko, Shahar Dobzinski, Noam Nisan:
The communication complexity of local search. 650-661
EC Joint Session
- Chenghao Guo, Zhiyi Huang, Xinzhi Zhang:
Settling the sample complexity of single-parameter revenue maximization. 662-673 - Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao:
Tight approximation ratio of anonymous pricing. 674-685 - Hedyeh Beyhaghi, S. Matthew Weinberg:
Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items. 686-696
Stringology
- Bernhard Haeupler, Aviad Rubinstein, Amirbehshad Shahrasbi:
Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing. 697-708 - Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin:
1+ε approximation of tree edit distance in quadratic time. 709-720 - Arun Ganesh, Qiuyi (Richard) Zhang:
Optimal sequence length requirements for phylogenetic tree reconstruction with indels. 721-732 - Bartlomiej Dudek, Pawel Gawrychowski:
Computing quartet distance is equivalent to counting 4-cycles. 733-743 - Sandip Sinha, Omri Weinstein:
Local decodability of the Burrows-Wheeler transform. 744-755 - Dominik Kempa, Tomasz Kociumaka:
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. 756-767
Algorithmic Statistics
- André Linhares, Chaitanya Swamy:
Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions. 768-779 - Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
Efficient profile maximum likelihood for universal symmetric property estimation. 780-791 - Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz:
Communication complexity of estimating correlations. 792-803 - Ilias Diakonikolas, Daniel M. Kane:
Degree-푑 chow parameters robustly determine degree-푑 PTFs (and algorithmic applications). 804-815 - Jian Ding, Nike Sun:
Capacity lower bound for the Ising perceptron. 816-827 - Guy Bresler, Frederic Koehler, Ankur Moitra:
Learning restricted Boltzmann machines via influence maximization. 828-839
COLT Sister Session ML Foundations
- Navin Goyal, Abhishek Shetty:
Non-Gaussian component analysis using entropy methods. 840-851 - Noga Alon, Roi Livni, Maryanthe Malliaris, Shay Moran:
Private PAC learning implies finite Littlestone dimension. 852-860 - Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke:
Competitively chasing convex bodies. 861-868 - Sitan Chen, Ankur Moitra:
Beyond the low-degree algorithm: mixtures of subcubes and their applications. 869-880 - Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas:
Regression from dependent observations. 881-889 - Vatsal Sharan, Aaron Sidford, Gregory Valiant:
Memory-sample tradeoffs for linear regression with small error. 890-901
Matrix Methods
- Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang:
Flows in almost linear time via adaptive preconditioning. 902-913 - David Durfee, Yu Gao, Gramoz Goranci, Richard Peng:
Fully dynamic spectral vertex sparsifiers and applications. 914-925 - Ankur Moitra, Alexander S. Wein:
Spectral methods from tensor networks. 926-937 - Michael B. Cohen, Yin Tat Lee, Zhao Song:
Solving linear programs in the current matrix multiplication time. 938-942 - Karl Bringmann, Marvin Künnemann, Karol Wegrzycki:
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. 943-954 - Huacheng Yu:
Optimal succinct rank data structure via approximate nonnegative tensor decomposition. 955-966
Lower Bounds/Metric Algs
- Zeev Dvir, Alexander Golovnev, Omri Weinstein:
Static data structure lower bounds imply rigidity. 967-978 - Omar Alrabiah, Venkatesan Guruswami:
An exponential lower bound on the sub-packetization of MSR codes. 979-985 - Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu:
Why extension-based proofs fail. 986-996 - Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower bounds for external memory integer sorting via network coding. 997-1008 - Tyler Helmuth, Will Perkins, Guus Regts:
Algorithmic Pirogov-Sinai theory. 1009-1020 - Daniel Dadush:
On approximating the covering radius and finding dense lattice subspaces. 1021-1026
ML Foundations II
- Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering. 1027-1038 - Luca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni, Chris Schwiegelshohn:
Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma. 1039-1050 - Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh:
A universal sampling method for reconstructing signals with simple Fourier transforms. 1051-1063 - Shyam Narayanan, Jelani Nelson:
Optimal terminal dimensionality reduction in Euclidean space. 1064-1069 - Weiming Feng, Nisheeth K. Vishnoi, Yitong Yin:
Dynamic sampling from graphical models. 1070-1081
Cryptography
- Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs:
Fiat-Shamir: from practice to theory. 1082-1090 - Nir Bitansky, Dakshita Khurana, Omer Paneth:
Weak zero-knowledge beyond the black-box barrier. 1091-1102 - Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. 1103-1114 - Yael Tauman Kalai, Omer Paneth, Lisa Yang:
How to delegate computations publicly. 1115-1124
Algorithms
- Nikhil Bansal:
On a generalization of iterated and randomized rounding. 1125-1135 - Christian Coester, Elias Koutsoupias:
The online k-taxi problem. 1136-1147 - Michael A. Bender, Martin Farach-Colton, William Kuszmaul:
Achieving optimal backlog in multi-processor cup games. 1148-1157 - János Pach, Natan Rubin, Gábor Tardos:
Planar point sets determine many pairwise crossing segments. 1158-1166
Graph Algorithms III
- Mina Dalirrooyfard, Thuy-Duong Vuong, Virginia Vassilevska Williams:
Graph pattern detection: hardness for all induced patterns and faster non-induced cycles. 1167-1178 - Alessio Conte, Takeaki Uno:
New polynomial delay bounds for maximal subgraph enumeration by proximity search. 1179-1190 - Michael Capalbo:
Explicit N-vertex graphs with maximum degree K and diameter [1+o(1)] logK-1 N for each K-1 a prime power. 1191-1202
Complexity Theory II
- Amir Shpilka:
Sylvester-Gallai type theorems for quadratic polynomials. 1203-1214 - Dylan M. McKay, Cody D. Murray, R. Ryan Williams:
Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. 1215-1225 - Vishesh Jain, Frederic Koehler, Andrej Risteski:
Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective. 1226-1236
Graph Canonization
- László Babai:
Canonical form for graphs in quasipolynomial time: preliminary report. 1237-1246 - Pascal Schweitzer, Daniel Wiebking:
A unifying method for the design of algorithms canonizing combinatorial objects. 1247-1258
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-11-13 23:36 CET 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:
