Abstract is missing.
- A PRG for lipschitz functions of polynomials with applications to sparsest cutDaniel M. Kane, Raghu Meka. 1-10 [doi]
- Improved Cheeger's inequality: analysis of spectral partitioning algorithms through higher order spectral gapTsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Shayan Oveis Gharan, Luca Trevisan. 11-20 [doi]
- Natural proofs versus derandomizationRyan Williams. 21-30 [doi]
- On the complexity of trial and errorXiaohui Bei, Ning Chen, Shengyu Zhang. 31-40 [doi]
- Coevolutionary opinion formation gamesKshipra Bhawalkar, Sreenivas Gollapudi, Kamesh Munagala. 41-50 [doi]
- Prior-independent mechanisms for schedulingShuchi Chawla, Jason D. Hartline, David L. Malec, Balasubramanian Sivan. 51-60 [doi]
- Combinatorial walrasian equilibriumMichal Feldman, Nick Gravin, Brendan Lucier. 61-70 [doi]
- Efficient rounding for the noncommutative grothendieck inequalityAssaf Naor, Oded Regev, Thomas Vidick. 71-80 [doi]
- Low rank approximation and regression in input sparsity timeKenneth L. Clarkson, David P. Woodruff. 81-90 [doi]
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regressionXiangrui Meng, Michael W. Mahoney. 91-100 [doi]
- Sparsity lower bounds for dimensionality reducing mapsJelani Nelson, Huy L. Nguyen. 101-110 [doi]
- Recursive composition and bootstrapping for SNARKS and proof-carrying dataNir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer. 111-120 [doi]
- How robust are linear sketches to adaptive inputs?Moritz Hardt, David P. Woodruff. 121-130 [doi]
- Equivalence of deterministic one-counter automata is NL-completeStanislav Böhm, Stefan Göller, Petr Jancar. 131-140 [doi]
- Explicit lower bounds via geometric complexity theoryPeter Bürgisser, Christian Ikenmeyer. 141-150 [doi]
- From information to exact communicationMark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein. 151-160 [doi]
- An information complexity approach to extended formulationsMark Braverman, Ankur Moitra. 161-170 [doi]
- Average-case lower bounds for formula sizeIlan Komargodski, Ran Raz. 171-180 [doi]
- The complexity of non-monotone marketsXi Chen, Dimitris Paparas, Mihalis Yannakakis. 181-190 [doi]
- Tatonnement beyond gross substitutes?: gradient descent to the rescueYun Kuen Cheung, Richard Cole, Nikhil R. Devanur. 191-200 [doi]
- Simultaneous auctions are (almost) efficientMichal Feldman, Hu Fu, Nick Gravin, Brendan Lucier. 201-210 [doi]
- Composable and efficient mechanismsVasilis Syrgkanis, Éva Tardos. 211-220 [doi]
- Non-black-box simulation in the fully concurrent settingVipul Goyal. 221-230 [doi]
- Non-black-box simulation from one-way functions and applications to resettable securityKai-Min Chung, Rafael Pass, Karn Seth. 231-240 [doi]
- On the impossibility of approximate obfuscation and applications to resettable cryptographyNir Bitansky, Omer Paneth. 241-250 [doi]
- Shielding circuits with groupsEric Miles, Emanuele Viola. 251-260 [doi]
- Quasipolynomial-time canonical form for steiner designsLászló Babai, John Wilmes. 261-270 [doi]
- Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systemsXi Chen, Xiaorui Sun, Shang-Hua Teng. 271-280 [doi]
- Sparsest cut on bounded treewidth graphs: algorithms and hardness resultsAnupam Gupta, Kunal Talwar, David Witmer. 281-290 [doi]
- Large-treewidth graph decompositions and applicationsChandra Chekuri, Julia Chuzhoy. 291-300 [doi]
- Fast hamiltonicity checking via bases of perfect matchingsMarek Cygan, Stefan Kratsch, Jesper Nederlof. 301-310 [doi]
- Polynomial-time perfect matchings in dense hypergraphsPeter Keevash, Fiachra Knox, Richard Mycroft. 311-320 [doi]
- Quasi-polynomial hitting-set for set-depth-Δ formulasManindra Agrawal, Chandan Saha, Nitin Saxena. 321-330 [doi]
- Beyond worst-case analysis in private singular vector computationMoritz Hardt, Aaron Roth. 331-340 [doi]
- Differential privacy for the analyst via private equilibrium computationJustin Hsu, Aaron Roth, Jonathan Ullman. 341-350 [doi]
- The geometry of differential privacy: the sparse and approximate casesAleksandar Nikolov, Kunal Talwar, Li Zhang. 351-360 [doi]
- {2+o(1)} counting queries with differential privacy is hardJonathan Ullman. 361-370 [doi]
- Bottom-k and priority sampling, set similarity and subset sums with minimal independenceMikkel Thorup. 371-380 [doi]
- Fast routing table construction using small messages: extended abstractChristoph Lenzen, Boaz Patt-Shamir. 381-390 [doi]
- Multidimensional approximate agreement in Byzantine asynchronous systemsHammurabi Mendes, Maurice Herlihy. 391-400 [doi]
- Byzantine agreement in polynomial expected time: [extended abstract]Valerie King, Jared Saia. 401-410 [doi]
- A o(n) monotonicity tester for boolean functions over the hypercubeDeeparnab Chakrabarty, C. Seshadhri. 411-418 [doi]
- Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergridsDeeparnab Chakrabarty, C. Seshadhri. 419-428 [doi]
- Every locally characterized affine-invariant property is testableArnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett. 429-436 [doi]
- Testing subdivision-freeness: property testing meets structural graph theoryKen-ichi Kawarabayashi, Yuichi Yoshida. 437-446 [doi]
- Approximation resistance from pairwise independent subgroupsSiu On Chan. 447-456 [doi]
- Approximation resistance on satisfiable instances for predicates with few accepting inputsSangxia Huang. 457-466 [doi]
- Witness encryption and its applicationsSanjam Garg, Craig Gentry, Amit Sahai, Brent Waters. 467-476 [doi]
- Majority is stablest: discrete and SoSAnindya De, Elchanan Mossel, Joe Neeman. 477-486 [doi]
- Strong ETH holds for regular resolutionChristopher Beck, Russell Impagliazzo. 487-494 [doi]
- A node-capacitated okamura-seymour theoremJames R. Lee, Manor Mendel, Mohammad Moharrami. 495-504 [doi]
- Structured recursive separator decompositions for planar graphs in linear timePhilip N. Klein, Shay Mozes, Christian Sommer. 505-514 [doi]
- Fast approximation algorithms for the diameter and radius of sparse graphsLiam Roditty, Virginia Vassilevska Williams. 515-524 [doi]
- The power of deferral: maintaining a constant-competitive steiner tree onlineAlbert Gu, Anupam Gupta, Amit Kumar. 525-534 [doi]
- Simplex partitioning via exponential clocks and the multiway cut problemNiv Buchbinder, Joseph Naor, Roy Schwartz. 535-544 [doi]
- Attribute-based encryption for circuitsSergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee. 545-554 [doi]
- Reusable garbled circuits and succinct functional encryptionShafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, Nickolai Zeldovich. 555-564 [doi]
- Delegation for bounded spaceYael Tauman Kalai, Ran Raz, Ron D. Rothblum. 565-574 [doi]
- Classical hardness of learning with errorsZvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé. 575-584 [doi]
- On the concrete efficiency of probabilistically-checkable proofsEli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer. 585-594 [doi]
- Extending continuous maps: polynomiality and undecidabilityMartin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner. 595-604 [doi]
- Net and prune: a linear time algorithm for euclidean distance problemsSariel Har-Peled, Benjamin Adam Raichel. 605-614 [doi]
- Random lattice triangulations: structure and algorithmsPietro Caputo, Fabio Martinelli, Alistair Sinclair, Alexandre Stauffer. 615-624 [doi]
- Lee-Yang theorems and the complexity of computing averagesAlistair Sinclair, Piyush Srivastava. 625-634 [doi]
- A complete dichotomy rises from the capture of vanishing signatures: extended abstractJin-yi Cai, Heng Guo, Tyson Williams. 635-644 [doi]
- Optimal euclidean spanners: really short, thin and lankyMichael Elkin, Shay Solomon. 645-654 [doi]
- Statistical algorithms and a lower bound for detecting planted cliquesVitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao. 655-664 [doi]
- Low-rank matrix completion using alternating minimizationPrateek Jain 0002, Praneeth Netrapalli, Sujay Sanghavi. 665-674 [doi]
- The approximate rank of a matrix and its algorithmic applications: approximate rankNoga Alon, Troy Lee, Adi Shraibman, Santosh Vempala. 675-684 [doi]
- Constraint satisfaction, packet routing, and the lovasz local lemmaDavid G. Harris, Aravind Srinivasan. 685-694 [doi]
- The complexity of finite-valued CSPsJohan Thapper, Stanislav Zivny. 695-704 [doi]
- Going after the k-SAT thresholdAmin Coja-Oghlan, Konstantinos Panagiotou. 705-714 [doi]
- Interactive channel capacityGillat Kol, Ran Raz. 715-724 [doi]
- Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]Aaron Bernstein. 725-734 [doi]
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphsDavid Eisenstat, Philip N. Klein. 735-744 [doi]
- Simple deterministic algorithms for fully dynamic maximal matchingOfer Neiman, Shay Solomon. 745-754 [doi]
- A new approach to computing maximum flows using electrical flowsYin Tat Lee, Satish Rao, Nikhil Srivastava. 755-764 [doi]
- Max flows in O(nm) time, or betterJames B. Orlin. 765-774 [doi]
- Succinct sampling from discrete distributionsKarl Bringmann, Kasper Green Larsen. 775-782 [doi]
- New independent source extractors with exponential improvementXin Li. 783-792 [doi]
- Interactive proofs of proximity: delegating computation in sublinear timeGuy N. Rothblum, Salil P. Vadhan, Avi Wigderson. 793-802 [doi]
- Lower bounds for RAMs and quantifier eliminationMiklós Ajtai. 803-812 [doi]
- Some trade-off results for polynomial calculus: extended abstractChris Beck, Jakob Nordström, Bangsheng Tang. 813-822 [doi]
- New bounds for matching vector familiesAbhishek Bhowmick, Zeev Dvir, Shachar Lovett. 823-832 [doi]
- A new family of locally correctable codes based on degree-lifted algebraic geometry codesEli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf. 833-842 [doi]
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton boundVenkatesan Guruswami, Chaoping Xing. 843-852 [doi]
- On the list decodability of random linear codes with large error ratesMary Wootters. 853-860 [doi]
- Quantum de finetti theorems under local measurements with applicationsFernando G. S. L. Brandão, Aram Wettroth Harrow. 861-870 [doi]
- Product-state approximations to quantum ground statesFernando G. S. L. Brandão, Aram Wettroth Harrow. 871-880 [doi]
- Inverting well conditioned matrices in quantum logspaceAmnon Ta-Shma. 881-890 [doi]
- Superlinear advantage for exact quantum algorithmsAndris Ambainis. 891-900 [doi]
- Approximating k-median via pseudo-approximationShi Li, Ola Svensson. 901-910 [doi]
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear timeJonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, Zeyuan Allen Zhu. 911-920 [doi]
- Communication lower bounds using directional derivativesAlexander A. Sherstov. 921-930 [doi]
- Homomorphic fingerprints under misalignments: sketching edit and shift distancesAlexandr Andoni, Assaf Goldberger, Andrew McGregor, Ely Porat. 931-940 [doi]
- The orbit problem in higher dimensionsVentsislav Chonev, Joël Ouaknine, James Worrell. 941-950 [doi]
- The loss of serving in the darkYossi Azar, Ilan Reuven Cohen, Iftah Gamzu. 951-960 [doi]
- Tight bounds for online vector bin packingYossi Azar, Ilan Reuven Cohen, Seny Kamara, Bruce Shepherd. 961-970 [doi]
- Stochastic combinatorial optimization via poisson approximationJian Li, Wen Yuan. 971-980 [doi]
- Solving large optimization problems using spectral graph theoryGary L. Miller. 981 [doi]