STOC - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 4064

2023

Near-Optimal Derandomization of Medium-Width Branching ProgramsAaron (Louie) Putterman, Edward Pyne. stoc 2023: 23-34 [doi]

A Proof of the Nisan-Ronen ConjectureGeorge Christodoulou 0001, Elias Koutsoupias, Annamária Kovács. stoc 2023: 672-685 [doi]

Optimal Explicit Small-Depth Formulas for the Coin ProblemSrikanth Srinivasan 0001, Utkarsh Tripathi. stoc 2023: 881-894 [doi]

When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof SystemsLijie Chen 0001, Roei Tell. stoc 2023: 60-69 [doi]

Resolving Matrix Spencer Conjecture Up to Poly-logarithmic RankNikhil Bansal 0001, Haotian Jiang, Raghu Meka. stoc 2023: 1814-1819 [doi]

The Complexity of Pattern Counting in Directed Graphs, Parameterised by the OutdegreeMarco Bressan 0002, Matthias Lanzinger, Marc Roth. stoc 2023: 542-552 [doi]

Local and Global Expansion in Random Geometric GraphsSiqi Liu 0005, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang. stoc 2023: 817-825 [doi]

Certified Randomness from Quantum SupremacyScott Aaronson, Shih-Han Hung. stoc 2023: 933-944 [doi]

Privately Estimating a Gaussian: Efficient, Robust, and OptimalDaniel Alabi, Pravesh K. Kothari, Pranay Tankala, Prayaag Venkat, Fred Zhang. stoc 2023: 483-496 [doi]

Faster Walsh-Hadamard and Discrete Fourier Transforms from Matrix Non-rigidityJosh Alman, Kevin Rao. stoc 2023: 455-462 [doi]

A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP RefutationOmar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar. stoc 2023: 1438-1448 [doi]

Constant-Round Arguments from One-Way FunctionsNoga Amit, Guy N. Rothblum. stoc 2023: 1537-1544 [doi]

NLTS Hamiltonians from Good Quantum CodesAnurag Anshu, Nikolas P. Breuckmann, Chinmay Nirkhe. stoc 2023: 1090-1096 [doi]

A New Approach to Learning Linear Dynamical SystemsAinesh Bakshi, Allen Liu, Ankur Moitra, Morris Yau. stoc 2023: 335-348 [doi]

Nearly All k-SAT Functions Are UnateJózsef Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao. stoc 2023: 958-962 [doi]

Obfuscation of Pseudo-Deterministic Quantum CircuitsJames Bartusek, Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa. stoc 2023: 1567-1578 [doi]

Sublinear Time Algorithms and Complexity of Approximate Maximum MatchingSoheil Behnezhad, Mohammad Roghani, Aviad Rubinstein. stoc 2023: 267-280 [doi]

p NormsHuck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro 0002. stoc 2023: 553-566 [doi]

Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTASHedyeh Beyhaghi, Linda Cai. stoc 2023: 803-816 [doi]

Linear Independence, Alternants, and ApplicationsVishwas Bhargava, Shubhangi Saraf, Ilya Volkovich. stoc 2023: 441-454 [doi]

Locally Consistent Decomposition of Strings with Applications to Edit Distance SketchingSudatta Bhattacharya, Michal Koucký 0001. stoc 2023: 219-232 [doi]

Subsampling Suffices for Adaptive Data AnalysisGuy Blanc. stoc 2023: 999-1012 [doi]

Lifting Uniform Learners via Distributional DecompositionGuy Blanc, Jane Lange, Ali Malik, Li-Yang Tan. stoc 2023: 1755-1767 [doi]

A Unifying Theory of Distance from CalibrationJaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran. stoc 2023: 1727-1740 [doi]

An Improved Approximation Guarantee for Prize-Collecting TSPJannis Blauth, Martin Nägele. stoc 2023: 1848-1861 [doi]

Generic Reed-Solomon Codes Achieve List-Decoding CapacityJoshua Brakensiek, Sivakanth Gopi, Visu Makam. stoc 2023: 1488-1501 [doi]

SDPs and Robust Satisfiability of Promise CSPJoshua Brakensiek, Venkatesan Guruswami, Sai Sandeep. stoc 2023: 609-622 [doi]

External Memory Fully Persistent Search TreesGerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning. stoc 2023: 1410-1423 [doi]

The Randomized k-Server Conjecture Is False!Sébastien Bubeck, Christian Coester, Yuval Rabani. stoc 2023: 581-594 [doi]

Towards the Erdős-Gallai Cycle Decomposition ConjectureMatija Bucic, Richard Montgomery 0001. stoc 2023: 839-852 [doi]

Algorithms Approaching the Threshold for Semi-random Planted CliqueRares-Darius Buhai, Pravesh K. Kothari, David Steurer. stoc 2023: 1918-1926 [doi]

Stability Is Stable: Connections between Replicability, Privacy, and Adaptive GeneralizationMark Bun, Marco Gaboardi, Max Hopkins, Russell Impagliazzo, Rex Lei, Toniann Pitassi, Satchit Sivakumar, Jessica Sorrell. stoc 2023: 520-527 [doi]

The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3Jin-yi Cai, Ashwin Maran. stoc 2023: 1285-1297 [doi]

On the Optimal Fixed-Price Mechanism in Bilateral TradeYang Cai, Jinzhao Wu. stoc 2023: 737-750 [doi]

A Characterization of List LearnabilityMoses Charikar, Chirag Pabbaraju. stoc 2023: 1713-1726 [doi]

Randomized versus Deterministic Decision Tree SizeArkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal. stoc 2023: 867-880 [doi]

Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs AlgorithmsYeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren. stoc 2023: 1058-1066 [doi]

Learning Polynomial Transformations via Generalized Tensor DecompositionsSitan Chen, Jerry Li 0001, Yuanzhi Li, Anru R. Zhang. stoc 2023: 1671-1684 [doi]

What Makes a Good Fisherman? Linear Regression under Self-Selection BiasYeshwanth Cherapanamjeri, Constantinos Daskalakis, Andrew Ilyas, Manolis Zampetakis. stoc 2023: 1699-1712 [doi]

The Power of Multi-step Vizing ChainsAleksander Bjørn Grodt Christiansen. stoc 2023: 1013-1026 [doi]

Improved Dynamic Colouring of Sparse GraphsAleksander Bjørn Grodt Christiansen, Krzysztof Nowicki 0002, Eva Rotenberg. stoc 2023: 1201-1214 [doi]

A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest PathsJulia Chuzhoy, Ruimin Zhang. stoc 2023: 1159-1172 [doi]

Approximate Graph Colouring and the Hollow ShadowLorenzo Ciardo, Stanislav Zivný. stoc 2023: 623-631 [doi]

Approximating Iterated Multiplication of Stochastic Matrices in Small SpaceGil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma. stoc 2023: 35-45 [doi]

Random Walks on Rotating ExpandersGil Cohen, Gal Maor. stoc 2023: 971-984 [doi]

Optimal Differentially Private Learning of Thresholds and Quasi-Concave OptimizationEdith Cohen, Xin Lyu 0002, Jelani Nelson, Tamás Sarlós, Uri Stemmer. stoc 2023: 472-482 [doi]

A Constant Factor Prophet Inequality for Online Combinatorial AuctionsJosé R. Correa, Andrés Cristi. stoc 2023: 686-697 [doi]

Mind the Gap: Achieving a Super-Grover Quantum Speedup by Jumping to the EndAlexander M. Dalzell, Nicola Pancotti, Earl T. Campbell, Fernando G. S. L. Brandão. stoc 2023: 1131-1144 [doi]

Stochastic Minimum Vertex Cover in General Graphs: A 3/2-ApproximationMahsa Derakhshan, Naveen Durvasula, Nika Haghtalab. stoc 2023: 242-253 [doi]

A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace LearningIlias Diakonikolas, Christos Tzamos, Daniel M. Kane. stoc 2023: 1741-1754 [doi]

New High Dimensional Expanders from CoversYotam Dikstein. stoc 2023: 826-838 [doi]

Good Quantum LDPC Codes with Linear Time DecodersIrit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick. stoc 2023: 905-918 [doi]

Almost Chor-Goldreich Sources and Adversarial Random WalksDean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman. stoc 2023: 1-9 [doi]

First-Order Model Checking on Structurally Sparse Graph ClassesJan Dreier, Nikolas Mählmann, Sebastian Siebertz. stoc 2023: 567-580 [doi]

The Rate of Interactive Codes Is Bounded Away from 1Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena. stoc 2023: 1424-1437 [doi]

Noise Stability on the Boolean Hypercube via a Renormalized Brownian MotionRonen Eldan, Dan Mikulincer, Prasad Raghavendra. stoc 2023: 661-671 [doi]

An Optimal "It Ain't Over Till It's Over" TheoremRonen Eldan, Avi Wigderson, Pei Wu. stoc 2023: 853-866 [doi]

An Analogue of Bonami's Lemma for Functions on Spaces of Linear Maps, and 2-2 GamesDavid Ellis, Guy Kindler, Noam Lifshitz. stoc 2023: 656-660 [doi]

Credible Decentralized Exchange Design via Verifiable Sequencing RulesMatheus Venturyne Xavier Ferreira, David C. Parkes. stoc 2023: 723-736 [doi]

Planning and Learning in Partially Observable Systems via Filter StabilityNoah Golowich, Ankur Moitra, Dhruv Rohatgi. stoc 2023: 349-362 [doi]

A New Berry-Esseen Theorem for Expander WalksLouis Golowich. stoc 2023: 10-22 [doi]

An Efficient Decoder for a Linear Distance Quantum LDPC CodeShouzhen Gu, Christopher A. Pattison, Eugene Tang. stoc 2023: 919-932 [doi]

Efficient Interactive Coding Achieving Optimal Error Resilience over the Binary ChannelMeghal Gupta, Rachel Yun Zhang. stoc 2023: 1449-1462 [doi]

Binary Error-Correcting Codes with Minimal Noiseless FeedbackMeghal Gupta, Venkatesan Guruswami, Rachel Yun Zhang. stoc 2023: 1475-1487 [doi]

A Borsuk-Ulam Lower Bound for Sign-Rank and Its ApplicationsHamed Hatami, Kaave Hosseini, Xiang Meng. stoc 2023: 463-471 [doi]

A Duality between One-Way Functions and Average-Case Symmetry of InformationShuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor Carboni Oliveira. stoc 2023: 1039-1050 [doi]

Capturing One-Way Functions via NP-Hardness of Meta-ComplexityShuichi Hirahara. stoc 2023: 1027-1038 [doi]

Hardness Self-Amplification: Simplified, Optimized, and UnifiedShuichi Hirahara, Nobutaka Shimizu. stoc 2023: 70-83 [doi]

Robustness Implies Privacy in Statistical EstimationSamuel B. Hopkins, Gautam Kamath 0001, Mahbod Majid, Shyam Narayanan. stoc 2023: 497-506 [doi]

NP-Hardness of Approximating Meta-Complexity: A Cryptographic ApproachYizhi Huang, Rahul Ilango, Hanlin Ren. stoc 2023: 1067-1075 [doi]

Upper and Lower Bounds on the Smoothed Complexity of the Simplex MethodSophie Huiberts, Yin Tat Lee, Xinzhi Zhang 0002. stoc 2023: 1904-1917 [doi]

Uniformly Random Colourings of Sparse GraphsEoin Hurley, François Pirot. stoc 2023: 1357-1370 [doi]

Indistinguishability Obfuscation, Range Avoidance, and Bounded ArithmeticRahul Ilango, Jiatu Li, R. Ryan Williams. stoc 2023: 1076-1089 [doi]

Multidimensional Quantum WalksStacey Jeffery, Sebastian Zur. stoc 2023: 1125-1130 [doi]

The Power of Unentangled Quantum Proofs with Non-negative AmplitudesFernando Granha Jeronimo, Pei Wu. stoc 2023: 1629-1642 [doi]

Finding a Small Vertex Cut on Distributed NetworksYonggang Jiang, Sagnik Mukhopadhyay. stoc 2023: 1791-1801 [doi]

Sum-of-Squares Lower Bounds for Densest k-SubgraphChris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu. stoc 2023: 84-95 [doi]

Online Unrelated-Machine Load Balancing and Generalized Flow with RecourseRavishankar Krishnaswamy, Shi Li 0001, Varun Suriyanarayana. stoc 2023: 775-788 [doi]

Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted EigenvaluesLap Chi Lau, Kam Chuen Tung, Robert Wang. stoc 2023: 1834-1847 [doi]

Spectral Hypergraph Sparsification via ChainingJames R. Lee. stoc 2023: 207-218 [doi]

Unprovability of Strong Complexity Lower Bounds in Bounded ArithmeticJiatu Li, Igor C. Oliveira. stoc 2023: 1051-1057 [doi]

Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial AxisAndré Lieutier, Mathijs Wintraecken. stoc 2023: 1768-1776 [doi]

Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWEWei-Kai Lin, Ethan Mook, Daniel Wichs. stoc 2023: 595-608 [doi]

Optimistic MLE: A Generic Model-Based Algorithm for Partially Observable Sequential Decision MakingQinghua Liu, Praneeth Netrapalli, Csaba Szepesvári, Chi Jin 0001. stoc 2023: 363-376 [doi]

Improved Approximation Ratios of Fixed-Price Mechanisms in Bilateral TradesZhengyang Liu, Zeyu Ren, Zihe Wang 0001. stoc 2023: 751-760 [doi]

Random Graph Matching at Otter's Threshold via Counting ChandeliersCheng Mao, Yihong Wu 0001, Jiaming Xu, Sophie H. Yu. stoc 2023: 1345-1356 [doi]

Kneser Graphs Are HamiltonianArturo I. Merino, Torsten Mütze, Namrata. stoc 2023: 963-970 [doi]

Sampling from Convex Sets with a Cold Start using Multiscale DecompositionsHariharan Narayanan, Amit Rajaraman, Piyush Srivastava 0001. stoc 2023: 117-130 [doi]

A High Dimensional Goldreich-Levin TheoremParker Newton, Silas Richelson, Chase Wilson. stoc 2023: 1463-1474 [doi]

Testing Distributional Assumptions of Learning AlgorithmsRonitt Rubinfeld, Arsen Vasilyan. stoc 2023: 1643-1656 [doi]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023Barna Saha, Rocco A. Servedio, editors, ACM, 2023. [doi]

Dynamic ((1+ε) ln n)-Approximation Algorithms for Minimum Set Cover and Dominating SetShay Solomon, Amitai Uzrad. stoc 2023: 1187-1200 [doi]

Optimal Eigenvalue Approximation via SketchingWilliam Swartworth, David P. Woodruff. stoc 2023: 145-155 [doi]

Improved and Deterministic Online Service with Deadlines or DelayNoam Touitou. stoc 2023: 761-774 [doi]

Concurrent Composition Theorems for Differential PrivacySalil P. Vadhan, Wanrong Zhang 0001. stoc 2023: 507-519 [doi]

Dynamic Maxflow via Dynamic Interior Point MethodsJan van den Brand, Yang P. Liu, Aaron Sidford. stoc 2023: 1215-1228 [doi]

Interior Point Methods with a Gradient OracleAdrian Vladu. stoc 2023: 1876-1889 [doi]

Average-Case Complexity of Tensor Decomposition for Low-Degree PolynomialsAlexander S. Wein. stoc 2023: 1685-1698 [doi]

New Subset Selection Algorithms for Low Rank Approximation: Offline and OnlineDavid P. Woodruff, Taisuke Yasuda 0002. stoc 2023: 1802-1813 [doi]

Algorithmic Applications of Hypergraph and Partition ContainersOr Zamir. stoc 2023: 985-998 [doi]

Links

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

STOC (stoc)

Viewing Publication 1 - 100 from 4064

2023

Links

Filter by Year [-]OR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

STOC (stoc)

Viewing Publication 1 - 100 from 4064

2023

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1