Abstract is missing.
- Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroidNima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant. 1-12 [doi]
- Oracle separation of BQP and PHRan Raz, Avishay Tal. 13-23 [doi]
- The reachability problem for Petri nets is not elementaryWojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki. 24-33 [doi]
- Bootstrapping results for threshold circuits "just beyond" known lower boundsLijie Chen, Roei Tell. 34-41 [doi]
- The log-approximate-rank conjecture is falseArkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif. 42-53 [doi]
- A strongly polynomial algorithm for linear exchange marketsJugal Garg, László A. Végh. 54-65 [doi]
- An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity modelEric Balkanski, Aviad Rubinstein, Yaron Singer. 66-77 [doi]
- Parallelizing greedy for submodular set function maximization in matroids and beyondChandra Chekuri, Kent Quanrud. 78-89 [doi]
- Submodular maximization with matroid and packing constraints in parallelAlina Ene, Huy L. Nguyen, Adrian Vladu. 90-101 [doi]
- Unconstrained submodular maximization with constant adaptive complexityLin Chen 0003, Moran Feldman, Amin Karbasi. 102-113 [doi]
- Dynamic set cover: improved algorithms and lower boundsAmir Abboud, Raghavendra Addanki, Fabrizio Grandoni 0001, Debmalya Panigrahi, Barna Saha. 114-125 [doi]
- Approximation algorithms for minimum norm and ordered optimization problemsDeeparnab Chakrabarty, Chaitanya Swamy. 126-137 [doi]
- Almost optimal distance oracles for planar graphsPanagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann. 138-151 [doi]
- Planar diameter via metric compressionJason Li, Merav Parter. 152-163 [doi]
- Polylogarithmic approximation for Euler genus on bounded degree graphsKen-ichi Kawarabayashi, Anastasios Sidiropoulos. 164-175 [doi]
- Planar graphs of bounded degree have bounded queue numberMichael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt. 176-184 [doi]
- The parallel repetition of non-signaling games: counterexamples and dichotomyJustin Holmgren, Lisa Yang. 185-192 [doi]
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmeticsAndrás Gilyén, Yuan Su, Guang Hao Low, Nathan Wiebe. 193-204 [doi]
- Quantum weak coin flippingAtul Singh Arora, Jérémie Roland, Stephan Weis. 205-216 [doi]
- A quantum-inspired classical algorithm for recommendation systemsEwin Tang. 217-228 [doi]
- k-cuts: improving the Karger-Stein boundAnupam Gupta, Euiwoong Lee, Jason Li. 229-240 [doi]
- Breaking quadratic time for small vertex connectivity and an approximation schemeDanupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai. 241-252 [doi]
- k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithmFabrizio Grandoni 0001, Bundit Laekhanukit, Shi Li. 253-264 [doi]
- Polynomial pass lower bounds for graph streaming algorithmsSepehr Assadi, Yu Chen, Sanjeev Khanna. 265-276 [doi]
- An optimal space lower bound for approximating MAX-CUTMichael Kapralov, Dmitry Krachun. 277-288 [doi]
- 2 compressed sensing; without iteratingVasileios Nakos, Zhao Song. 289-297 [doi]
- Private selection from private candidatesJingcheng Liu 0001, Kunal Talwar. 298-309 [doi]
- The structure of optimal private tests for simple hypothesesClément L. Canonne, Gautam Kamath, Audra McMillan, Adam D. Smith, Jonathan Ullman. 310-321 [doi]
- Gentle measurement of quantum states and differential privacyScott Aaronson, Guy N. Rothblum. 322-333 [doi]
- Distributed exact weighted all-pairs shortest paths in near-linear timeAaron Bernstein, Danupon Nanongkai. 334-342 [doi]
- Distributed edge connectivity in sublinear timeMohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak. 343-354 [doi]
- Towards the locality of Vizing's theoremHsin-Hao Su, Hoa T. Vu. 355-364 [doi]
- Decremental strongly-connected components and single-source reachability in near-linear timeAaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen. 365-376 [doi]
- Dynamic low-stretch trees via dynamic low-diameter decompositionsSebastian Forster, Gramoz Goranci. 377-388 [doi]
- A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problemsJulia Chuzhoy, Sanjeev Khanna. 389-400 [doi]
- 0Alexander A. Sherstov, Pei Wu. 401-412 [doi]
- Reconstruction of non-degenerate homogeneous depth three circuitsNeeraj Kayal, Chandan Saha 0001. 413-424 [doi]
- Separating monotone VP and VNPAmir Yehudayoff. 425-429 [doi]
- On the approximation resistance of balanced linear threshold functionsAaron Potechin. 430-441 [doi]
- 0[⊕] via the coin problemNutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan 0001, Utkarsh Tripathi, S. Venkitesh. 442-453 [doi]
- DNF sparsification beyond sunflowersShachar Lovett, Jiapeng Zhang. 454-460 [doi]
- Quantum Lovász local lemma: Shearer's bound is tightKun He 0011, Qian Li, Xiaoming Sun, Jiapeng Zhang. 461-472 [doi]
- Quantum proof systems for iterated exponential time, and beyondJoseph F. Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen. 473-480 [doi]
- Good approximate quantum LDPC codes from spacetime circuit HamiltoniansThomas C. Bohdanowicz, Elizabeth Crosson, Chinmay Nirkhe, Henry Yuen. 481-490 [doi]
- Hamiltonian simulation with nearly optimal dependence on spectral normGuang Hao Low. 491-502 [doi]
- Quantum state certificationCostin Badescu, Ryan O'Donnell, John Wright 0001. 503-514 [doi]
- Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuitsAdam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal. 515-526 [doi]
- Testing graphs in vertex-distribution-free modelsOded Goldreich. 527-534 [doi]
- Testing graphs against an unknown distributionLior Gishboliner, Asaf Shapira. 535-546 [doi]
- Testing unateness nearly optimallyXi Chen, Erik Waingarten. 547-558 [doi]
- -1)-query tester for minor-closed properties of bounded degree graphsAkash Kumar 0003, C. Seshadhri, Andrew Stolman. 559-567 [doi]
- Bridging between 0/1 and linear programming via random walksJoshua Brakensiek, Venkatesan Guruswami. 568-577 [doi]
- k-SAT algorithms using biased-PPSZThomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick. 578-589 [doi]
- CSPs with global modular constraints: algorithms and hardness via polynomial representationsJoshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami. 590-601 [doi]
- Algebraic approach to promise constraint satisfactionJakub Bulín, Andrei A. Krokhin, Jakub Oprsal. 602-613 [doi]
- Fooling polytopesRyan O'Donnell, Rocco A. Servedio, Li-Yang Tan. 614-625 [doi]
- Pseudorandom generators for width-3 branching programsRaghu Meka, Omer Reingold, Avishay Tal. 626-637 [doi]
- The complexity of splitting necklaces and bisecting ham sandwichesAris Filos-Ratsikas, Paul W. Goldberg. 638-649 [doi]
- The communication complexity of local searchYakov Babichenko, Shahar Dobzinski, Noam Nisan. 650-661 [doi]
- Settling the sample complexity of single-parameter revenue maximizationChenghao Guo, Zhiyi Huang, Xinzhi Zhang. 662-673 [doi]
- Tight approximation ratio of anonymous pricingYaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao. 674-685 [doi]
- Optimal (and benchmark-optimal) competition complexity for additive buyers over independent itemsHedyeh Beyhaghi, S. Matthew Weinberg. 686-696 [doi]
- ε)-approximating edit distance via indexingBernhard Haeupler, Aviad Rubinstein, Amirbehshad Shahrasbi. 697-708 [doi]
- ε approximation of tree edit distance in quadratic timeMahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin. 709-720 [doi]
- Optimal sequence length requirements for phylogenetic tree reconstruction with indelsArun Ganesh, Qiuyi (Richard) Zhang. 721-732 [doi]
- Computing quartet distance is equivalent to counting 4-cyclesBartlomiej Dudek, Pawel Gawrychowski. 733-743 [doi]
- Local decodability of the Burrows-Wheeler transformSandip Sinha, Omri Weinstein. 744-755 [doi]
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structureDominik Kempa, Tomasz Kociumaka. 756-767 [doi]
- Approximation algorithms for distributionally-robust stochastic optimization with black-box distributionsAndré Linhares, Chaitanya Swamy. 768-779 [doi]
- Efficient profile maximum likelihood for universal symmetric property estimationMoses Charikar, Kirankumar Shiragur, Aaron Sidford. 780-791 [doi]
- Communication complexity of estimating correlationsUri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz. 792-803 [doi]
- Degree-푑 chow parameters robustly determine degree-푑 PTFs (and algorithmic applications)Ilias Diakonikolas, Daniel M. Kane. 804-815 [doi]
- Capacity lower bound for the Ising perceptronJian Ding, Nike Sun. 816-827 [doi]
- Learning restricted Boltzmann machines via influence maximizationGuy Bresler, Frederic Koehler, Ankur Moitra. 828-839 [doi]
- Non-Gaussian component analysis using entropy methodsNavin Goyal, Abhishek Shetty. 840-851 [doi]
- Private PAC learning implies finite Littlestone dimensionNoga Alon, Roi Livni, Maryanthe Malliaris, Shay Moran. 852-860 [doi]
- Competitively chasing convex bodiesSébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke. 861-868 [doi]
- Beyond the low-degree algorithm: mixtures of subcubes and their applicationsSitan Chen, Ankur Moitra. 869-880 [doi]
- Regression from dependent observationsConstantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas. 881-889 [doi]
- Memory-sample tradeoffs for linear regression with small errorVatsal Sharan, Aaron Sidford, Gregory Valiant. 890-901 [doi]
- Flows in almost linear time via adaptive preconditioningRasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang. 902-913 [doi]
- Fully dynamic spectral vertex sparsifiers and applicationsDavid Durfee, Yu Gao, Gramoz Goranci, Richard Peng. 914-925 [doi]
- Spectral methods from tensor networksAnkur Moitra, Alexander S. Wein. 926-937 [doi]
- Solving linear programs in the current matrix multiplication timeMichael B. Cohen, Yin Tat Lee, Zhao Song. 938-942 [doi]
- Approximating APSP without scaling: equivalence of approximate min-plus and exact min-maxKarl Bringmann, Marvin Künnemann, Karol Wegrzycki. 943-954 [doi]
- Optimal succinct rank data structure via approximate nonnegative tensor decompositionHuacheng Yu. 955-966 [doi]
- Static data structure lower bounds imply rigidityZeev Dvir, Alexander Golovnev, Omri Weinstein. 967-978 [doi]
- An exponential lower bound on the sub-packetization of MSR codesOmar Alrabiah, Venkatesan Guruswami. 979-985 [doi]
- Why extension-based proofs failDan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu. 986-996 [doi]
- Lower bounds for external memory integer sorting via network codingAlireza Farhadi 0001, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi. 997-1008 [doi]
- Algorithmic Pirogov-Sinai theoryTyler Helmuth, Will Perkins, Guus Regts. 1009-1020 [doi]
- On approximating the covering radius and finding dense lattice subspacesDaniel Dadush. 1021-1026 [doi]
- k-medians clusteringKonstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn. 1027-1038 [doi]
- k-means: beyond subspaces and the Johnson-Lindenstrauss lemmaLuca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni 0001, Chris Schwiegelshohn. 1039-1050 [doi]
- A universal sampling method for reconstructing signals with simple Fourier transformsHaim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh. 1051-1063 [doi]
- Optimal terminal dimensionality reduction in Euclidean spaceShyam Narayanan, Jelani Nelson. 1064-1069 [doi]
- Dynamic sampling from graphical modelsWeiming Feng, Nisheeth K. Vishnoi, Yitong Yin. 1070-1081 [doi]
- Fiat-Shamir: from practice to theoryRan Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs. 1082-1090 [doi]
- Weak zero-knowledge beyond the black-box barrierNir Bitansky, Dakshita Khurana, Omer Paneth. 1091-1102 [doi]
- Finding a Nash equilibrium is no easier than breaking Fiat-ShamirArka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum. 1103-1114 [doi]
- How to delegate computations publiclyYael Tauman Kalai, Omer Paneth, Lisa Yang. 1115-1124 [doi]
- On a generalization of iterated and randomized roundingNikhil Bansal. 1125-1135 [doi]
- The online 푘-taxi problemChristian Coester, Elias Koutsoupias. 1136-1147 [doi]
- Achieving optimal backlog in multi-processor cup gamesMichael A. Bender, Martin Farach-Colton, William Kuszmaul. 1148-1157 [doi]
- Planar point sets determine many pairwise crossing segmentsJános Pach, Natan Rubin, Gábor Tardos. 1158-1166 [doi]
- Graph pattern detection: hardness for all induced patterns and faster non-induced cyclesMina Dalirrooyfard, Thuy Duong Vuong, Virginia Vassilevska Williams. 1167-1178 [doi]
- New polynomial delay bounds for maximal subgraph enumeration by proximity searchAlessio Conte, Takeaki Uno. 1179-1190 [doi]
- K-1 N for each K-1 a prime powerMichael Capalbo. 1191-1202 [doi]
- Sylvester-Gallai type theorems for quadratic polynomialsAmir Shpilka. 1203-1214 [doi]
- Weak lower bounds on resource-bounded compression imply strong separations of complexity classesDylan M. McKay, Cody D. Murray, R. Ryan Williams. 1215-1225 [doi]
- Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspectiveVishesh Jain, Frederic Koehler, Andrej Risteski. 1226-1236 [doi]
- Canonical form for graphs in quasipolynomial time: preliminary reportLászló Babai. 1237-1246 [doi]
- A unifying method for the design of algorithms canonizing combinatorial objectsPascal Schweitzer, Daniel Wiebking. 1247-1258 [doi]