|
|
|
|
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 | Alexander A. Sherstov |
The approximate degree of DNF and CNF formulas.  |
STOC  |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amey Bhangale, Subhash Khot, Dor Minzer |
On approximability of satisfiable k-CSPs: I. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Filtser, Hung Le 0001 |
Locality-sensitive orderings and applications to reliable spanners. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ce Jin 0001, Yinzhan Xu |
Tight dynamic problem lower bounds from generalized BMM and OMv. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Akbar Rafiey |
On the complexity of CSP-based ideal membership problems. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Zihan Tan |
A subpolynomial approximation algorithm for graph crossing number in low-degree graphs. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shang-En Huang, Seth Pettie, Leqi Zhu |
Byzantine agreement in polynomial time with near-optimal resilience. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sam Coy, Artur Czumaj |
Deterministic massively parallel connectivity. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar |
Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh |
Approximate polymorphisms. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Eshan Chattopadhyay, Jyun-Jie Liao |
Extractors for sum of two sources. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan, Xinzhi Zhang 0002 |
An improved approximation algorithm for the minimum k-edge connected multi-subgraph problem. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan van den Brand, Yu Gao 0001, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford |
Faster maxflow via improved dynamic spectral vertex sparsifiers. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar |
Rate one-third non-malleable codes. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Focke, Marc Roth |
Counting small induced subgraphs with hereditary properties. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal 0001, Lars Rohwedder, Ola Svensson |
Flow time scheduling and prefix Beck-Fiala. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitay Kamber, Tali Kaufman |
Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes |
Locally testable codes with constant rate, distance, and locality. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vaidehi Srinivas, David P. Woodruff, Ziyu Xu, Samson Zhou |
Memory bounds for the experts problem. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer |
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Allen Liu, Jerry Li 0001 |
Clustering mixtures with almost optimal separation in polynomial time. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Blanc, Caleb Koch, Jane Lange, Li-Yang Tan |
The query complexity of certification. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Daniel M. Kane, Vasilis Kontonis, Christos Tzamos, Nikos Zarifis |
Learning general halfspaces with general Massart noise under the Gaussian distribution. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie, Thatchaphol Saranurak, Longhui Yin |
Optimal vertex connectivity oracles. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, Tigran Tonoyan |
Near-optimal distributed degree+1 coloring. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Rex Lei, Toniann Pitassi, Jessica Sorrell |
Reproducibility in learning. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Misha Ivkov, Pravesh K. Kothari |
List-decodable covariance estimation. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
Constant inapproximability for PPA. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, Tuomas Sandholm |
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao |
Deterministic, near-linear ε-approximation algorithm for geometric bipartite matching. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruoxu Cen, Jason Li 0006, Debmalya Panigrahi |
Edge connectivity augmentation in near-linear time. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiatu Li, Tianqi Yang 0001 |
3.1n - o(n) circuit lower bounds for explicit functions. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Omri Shmueli |
Public-key Quantum money with a classical bank. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos |
Almost-optimal sublinear-time edit distance in the low distance regime. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn |
Towards optimal lower bounds for k-median and k-means coresets. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongyang Liu, Yitong Yin |
Simple parallel algorithms for single-site dynamics. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Kempa, Tomasz Kociumaka |
Dynamic suffix array with polylogarithmic queries and updates. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Euiwoong Lee, Suprovat Ghoshal |
A characterization of approximability for biased CSPs. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvika Brakerski, Henry Yuen |
Quantum garbled circuits. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yeshwanth Cherapanamjeri, Jelani Nelson |
Uniform approximations for Randomized Hadamard Transforms with applications. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Duan, Hanlin Ren |
Maintaining exact distances under multiple edge failures. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Jan Olkowski |
Improved communication complexity of fault-tolerant consensus. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Eun Jung Kim 0002, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström |
Directed flow-augmentation. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ainesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane, Pravesh K. Kothari, Santosh S. Vempala |
Robustly learning mixtures of k arbitrary Gaussians. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ainesh Bakshi, Kenneth L. Clarkson, David P. Woodruff |
Low-rank approximation with 1/ε1/3 matrix-vector products. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Englert, Nicolaos Matsakis, Pavel Veselý 0001 |
Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhiyi Huang 0002, Xinkai Shu, Shuyi Yan |
The power of multiple choices in online stochastic matching. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 |
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena |
Circuits resilient to short-circuit errors. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Tuukka Korhonen |
Fast FPT-approximation of branchwidth. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar |
Worst-case to average-case reductions via additive combinatorics. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuan Deng, Jieming Mao, Balasubramanian Sivan, Kangning Wang |
Approximately efficient bilateral trade. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu |
On the optimal time/space tradeoff for hash tables. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li 0006 |
Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhiyang He, Jason Li 0006 |
Breaking the nk barrier for minimum k-cut on simple graphs. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefano Leonardi 0001, Anupam Gupta 0001 (eds.) |
STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022 |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vishesh Jain, Will Perkins 0001, Ashwin Sah, Mehtaab Sawhney |
Approximate counting and sampling via local central limit theorems. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Amirhossein Kazeminia |
Complexity classification of counting graph homomorphisms modulo a prime number. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Cohen-Addad, Hossein Esfandiari, Vahab S. Mirrokni, Shyam Narayanan |
Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Zipei Nie |
Matrix anti-concentration inequalities with applications. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen |
Nonlocal games, compression theorems, and the arithmetical hierarchy. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Xi Chen 0001, Binghui Peng |
On the complexity of dynamic submodular maximization. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Merav Parter |
Nearly optimal vertex fault-tolerant spanners in optimal time: sequential, distributed, and parallel. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Aharonov, Sandy Irani |
Hamiltonian complexity in the thermodynamic limit. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz |
Explicit binary tree codes with sub-logarithmic size alphabet. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Panteleev, Gleb Kalachev |
Asymptotically good Quantum and locally testable classical LDPC codes. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathaniel Harms, Sebastian Wild, Viktor Zamaraev |
Randomized communication and implicit graph representations. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Reza Gheissari, Alistair Sinclair |
Low-temperature Ising dynamics with random initializations. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Andrews 0003, Michael A. Forbes 0001 |
Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | James D. Watson, Toby S. Cubitt |
Computational complexity of the ground state energy density problem. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Meghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang |
Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhiyuan Fan, Jiatu Li, Tianqi Yang 0001 |
The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Srinivasan Arunachalam, Penghui Yao |
Positive spectrahedra: invariance principles and pseudorandom generators. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Makarychev, Liren Shan |
Explainable k-means: don't be greedy, plant bigger trees! |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yang Cai 0001, Argyris Oikonomou, Mingfei Zhao |
Computing simple mechanisms: Lift-and-round over marginal reduced forms. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Braverman, Aditya Krishnan 0001, Christopher Musco |
Sublinear time spectral density estimation. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Ilango, Hanlin Ren, Rahul Santhanam |
Robustness of average-case meta-complexity via pseudorandomness. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Amir, Tegan Wilson, Vishal Shrivastav, Hakim Weatherspoon, Robert Kleinberg, Rachit Agarwal 0001 |
Optimal oblivious reconfigurable networks. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar 0001, Chandra Kanta Mohapatra |
Fast, algebraic multivariate multipoint evaluation in small characteristic and applications. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Tavenas, Nutan Limaye, Srikanth Srinivasan 0001 |
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuchi Chawla 0001, Rojin Rezvan, Yifeng Teng, Christos Tzamos |
Pricing ordered items. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shucheng Chi, Ran Duan, Tianle Xie, Tianyi Zhang 0008 |
Faster min-plus product for monotone instances. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Ron-Zewi, Ron D. Rothblum |
Proving as fast as computing: succinct arguments with constant prover overhead. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anurag Anshu, Zeph Landau, Yunchao Liu |
Distributed Quantum inner product estimation. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins 0001 |
Computational thresholds for the fixed-magnetization Ising model. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal 0001, Ohad N. Feldheim |
The power of two choices in graphical allocation. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir |
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari 0001 |
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | George Giakkoupis |
Expanders via local edge flips in quasilinear time. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Tetek, Mikkel Thorup |
Edge sampling and graph parameter estimation via vertex neighborhood accesses. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuela Fischer, Slobodan Mitrovic, Jara Uitto |
Deterministic (1+ε)-approximate maximum matching with poly(1/ε) passes in the semi-streaming model and beyond. |
STOC |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Sendhil Mullainathan |
Simplicity creates inequity: implications for fairness, stereotypes, and interpretability (invited paper). |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel, Jad Silbak |
Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhiyi Huang 0002, Xinkai Shu |
Online stochastic matching, poisson arrivals, and the natural linear program. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yeganeh Alimohammadi, Nima Anari, Kirankumar Shiragur, Thuy-Duong Vuong |
Fractionally log-concave and sector-stable polynomials: counting planar matchings and more. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Anindya De, Elchanan Mossel, Joe Neeman |
Robust testing of low dimensional functions. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Costin Badescu, Ryan O'Donnell |
Improved Quantum data analysis. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yufei Ruan, Jiaqi Yang 0001, Yuan Zhou 0007 |
Linear bandits with limited adaptivity and learning distributional optimal design. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott |
Optimal labelling schemes for adjacency, comparability, and reachability. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, Amir Yehudayoff |
Learnability can be independent of set theory (invited paper). |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #300 of 4006 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license