|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1771 occurrences of 757 keywords
|
|
|
|
|
Results
Found 4006 publication records. Showing 4006 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yuzhou Gu, Yinzhan Xu |
Optimal Bounds for Noisy Sorting.  |
STOC  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif |
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Vladu |
Interior Point Methods with a Gradient Oracle. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hu Fu 0001, Jiawei Li, Daogao Liu |
Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | William Swartworth, David P. Woodruff |
Optimal Eigenvalue Approximation via Sketching. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Blanc |
Subsampling Suffices for Adaptive Data Analysis. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang 0002 |
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Parker Newton, Silas Richelson, Chase Wilson |
A High Dimensional Goldreich-Levin Theorem. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Étienne Bamas, Lars Rohwedder |
Better Trees for Santa Claus. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab |
Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hamed Hatami, Kaave Hosseini, Xiang Meng |
A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel B. Hopkins, Gautam Kamath 0001, Mahbod Majid, Shyam Narayanan |
Robustness Implies Privacy in Statistical Estimation. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Golowich |
A New Berry-Esseen Theorem for Expander Walks. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang 0001 |
Quantum Advantage from Any Non-local Game. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Blasiok, Parikshit Gopalan, Lunjia Hu, Preetum Nakkiran |
A Unifying Theory of Distance from Calibration. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Sam Buss, Moritz Müller |
On the Consistency of Circuit Lower Bounds for Non-deterministic Time. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gil Cohen, Gal Maor |
Random Walks on Rotating Expanders. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Vera Traub, Rico Zenklusen |
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | André Lieutier, Mathijs Wintraecken |
Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Qinghua Liu, Praneeth Netrapalli, Csaba Szepesvári, Chi Jin 0001 |
Optimistic MLE: A Generic Model-Based Algorithm for Partially Observable Sequential Decision Making. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jugal Garg, Edin Husic, Wenzheng Li, László A. Végh, Jan Vondrák |
Approximating Nash Social Welfare by Matching and Local Search. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, Umesh V. Vazirani |
A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shay Solomon, Amitai Uzrad |
Dynamic ((1+ε) ln n)-Approximation Algorithms for Minimum Set Cover and Dominating Set. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma |
Approximating Iterated Multiplication of Stochastic Matrices in Small Space. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Janani Sundaresan |
(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Armbruster, Lars Rohwedder, Andreas Wiese |
A PTAS for Minimizing Weighted Flow Time on a Single Machine. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena |
The Rate of Interactive Codes Is Bounded Away from 1. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tuukka Korhonen, Daniel Lokshtanov |
An Improved Parameterized Algorithm for Treewidth. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Bressan 0002, Matthias Lanzinger, Marc Roth |
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Fernando Granha Jeronimo, Pei Wu |
The Power of Unentangled Quantum Proofs with Non-negative Amplitudes. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Siqi Liu 0005, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang |
Local and Global Expansion in Random Geometric Graphs. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudatta Bhattacharya, Michal Koucký 0001 |
Locally Consistent Decomposition of Strings with Applications to Edit Distance Sketching. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick |
Good Quantum LDPC Codes with Linear Time Decoders. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Christos Tzamos, Daniel M. Kane |
A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Paták, Martin Tancer |
Shellability Is Hard Even for Balls. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Jones, Aaron Potechin, Goutham Rajendran, Jeff Xu |
Sum-of-Squares Lower Bounds for Densest k-Subgraph. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hariharan Narayanan, Amit Rajaraman, Piyush Srivastava 0001 |
Sampling from Convex Sets with a Cold Start using Multiscale Decompositions. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Allan Sly, Youngtak Sohn |
Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Eldan, Dan Mikulincer, Prasad Raghavendra |
Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ainesh Bakshi, Allen Liu, Ankur Moitra, Morris Yau |
A New Approach to Learning Linear Dynamical Systems. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty |
New Algorithms for All Pairs Approximate Shortest Paths. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander S. Wein |
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Salil P. Vadhan, Wanrong Zhang 0001 |
Concurrent Composition Theorems for Differential Privacy. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hedyeh Beyhaghi, Linda Cai |
Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-Yi Cai, Ashwin Maran |
The Complexity of Counting Planar Graph Homomorphisms of Domain Size 3. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhiyi Huang, Yaowei Long, Thatchaphol Saranurak, Benyu Wang |
Tight Conditional Lower Bounds for Vertex Connectivity Problems. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff, Taisuke Yasuda 0002 |
New Subset Selection Algorithms for Low Rank Approximation: Offline and Online. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksander Bjørn Grodt Christiansen |
The Power of Multi-step Vizing Chains. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Qipeng Liu 0001, Ran Raz, Wei Zhan |
Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron (Louie) Putterman, Edward Pyne |
Near-Optimal Derandomization of Medium-Width Branching Programs. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao |
Nearly All k-SAT Functions Are Unate. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Amey Bhangale, Subhash Khot, Dor Minzer |
On Approximability of Satisfiable k-CSPs: III. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Casper Moldrup Rysgaard, Rolf Svenning |
External Memory Fully Persistent Search Trees. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Shih-Han Hung |
Certified Randomness from Quantum Supremacy. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich |
Linear Independence, Alternants, and Applications. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
Sublinear Algorithms for (1.5+ε)-Approximate Matching. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Debarati Das 0001, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha |
Weighted Edit Distance Computation: Strings, Trees, and Dyck. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Arun Jambulapati, Yang P. Liu, Aaron Sidford |
Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | James R. Lee |
Spectral Hypergraph Sparsification via Chaining. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Blanc, Jane Lange, Ali Malik, Li-Yang Tan |
Lifting Uniform Learners via Distributional Decomposition. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | David Ellis, Guy Kindler, Noam Lifshitz |
An Analogue of Bonami's Lemma for Functions on Spaces of Linear Maps, and 2-2 Games. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Aravind Gollakota, Adam R. Klivans, Pravesh K. Kothari |
A Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Miranda Christ, Mihalis Yannakakis |
The Smoothed Complexity of Policy Iteration for Markov Decision Processes. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal |
Quantum Cryptography in Algorithmica. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yang Cai 0001, Jinzhao Wu |
On the Optimal Fixed-Price Mechanism in Bilateral Trade. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ce Jin 0001, Yinzhan Xu |
Removing Additive Structure in 3SUM-Based Reductions. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Ruimin Zhang |
A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Stacey Jeffery, Sebastian Zur |
Multidimensional Quantum Walks. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nima Anari, Yizhi Huang, Tianyu Liu, Thuy-Duong Vuong, Brian Xu, Katherine Yu |
Parallel Discrete Sampling via Continuous Walks. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | José Correa 0001, Andrés Cristi |
A Constant Factor Prophet Inequality for Online Combinatorial Auctions. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuichi Hirahara, Nobutaka Shimizu |
Hardness Self-Amplification: Simplified, Optimized, and Unified. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung Le 0001, Shay Solomon |
A Unified Framework for Light Spanners. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Arturo I. Merino, Torsten Mütze, Namrata |
Kneser Graphs Are Hamiltonian. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Arsen Vasilyan |
Testing Distributional Assumptions of Learning Algorithms. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Xin Lyu 0002, Jelani Nelson, Tamás Sarlós, Uri Stemmer |
Optimal Differentially Private Learning of Thresholds and Quasi-Concave Optimization. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs |
Boosting Batch Arguments and RAM Delegation. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Zihan Tan, Tianyi Zhang 0008 |
Almost-Optimal Sublinear Additive Spanners. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander M. Dalzell, Nicola Pancotti, Earl T. Campbell, Fernando G. S. L. Brandão |
Mind the Gap: Achieving a Super-Grover Quantum Speedup by Jumping to the End. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Yogesh Dahiya, Nikhil S. Mande, Jaikumar Radhakrishnan, Swagato Sanyal |
Randomized versus Deterministic Decision Tree Size. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Bubeck, Christian Coester, Yuval Rabani |
The Randomized k-Server Conjecture Is False! |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar 0002, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan |
Lattice Problems beyond Polynomial Time. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuichi Hirahara |
Capturing One-Way Functions via NP-Hardness of Meta-Complexity. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Matheus Venturyne Xavier Ferreira, David C. Parkes |
Credible Decentralized Exchange Design via Verifiable Sequencing Rules. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell |
Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brakensiek, Sivakanth Gopi, Visu Makam |
Generic Reed-Solomon Codes Achieve List-Decoding Capacity. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li 0002 |
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijie Chen 0001, Roei Tell |
When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim |
Multi-agent Contracts. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Chirag Pabbaraju |
A Characterization of List Learnability. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Wei-Kai Lin, Ethan Mook, Daniel Wichs |
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal 0001, Haotian Jiang, Raghu Meka |
Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
Algorithms Approaching the Threshold for Semi-random Planted Clique. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Barna Saha, Rocco A. Servedio (eds.) |
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023 |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich 0001, Simon Krogmann, Martin Schirneck |
Approximate Distance Sensitivity Oracles in Subquadratic Space. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Eliran Kachlon, Arpita Patra |
The Round Complexity of Statistical MPC with Optimal Resiliency. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksander Bjørn Grodt Christiansen, Krzysztof Nowicki 0002, Eva Rotenberg |
Improved Dynamic Colouring of Sparse Graphs. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Ilango, Jiatu Li, R. Ryan Williams |
Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri 0001 |
Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein |
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan |
Succinct Computational Secret Sharing. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 4006 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license