|
|
|
|
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 | Fabrizio Grandoni 0001, Christos Kalaitzis, Rico Zenklusen |
Improved approximation for tree augmentation: saving by rewiring.  |
STOC  |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi |
On the parameterized complexity of approximating dominating set. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Toniann Pitassi, Robert Robere |
Lifting nullstellensatz to monotone span programs over any field. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
Data-dependent hashing via nonlinear spectral gaps. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, James R. Lee, Aleksander Madry |
k-server via multiscale entropic regularization. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra |
Towards a proof of the 2-to-1 games conjecture? |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Izhar Oppenheim |
Construction of new local spectral high dimensional expanders. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart |
Testing conditional independence of discrete distributions. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohsen Ghaffari 0001, Jason Li 0006 |
Improved distributed algorithms for exact shortest paths. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Alman, Joshua R. Wang, Huacheng Yu |
Cell-probe lower bounds from online communication complexity. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof |
More consequences of falsifying SETH and the orthogonal vectors conjecture. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov |
Clique is hard on average for regular resolution. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi |
Approximating generalized network design under (dis)economies of scale with applications to energy efficiency. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal 0001, Daniel Dadush, Shashwat Garg, Shachar Lovett |
The gram-schmidt walk: a cure for the Banaszczyk blues. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Debbie W. Leung, Ashwin Nayak 0001, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu |
Capacity approaching coding for low noise interactive quantum communication. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov |
Generalized matrix completion and algebraic natural proofs. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Irene Lo |
Dynamic matching in school choice: efficient seat reassignment after late cancellations (invited talk). |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson |
Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon |
Fully dynamic maximal independent set with sublinear update time. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Udit Agarwal, Vijaya Ramachandran |
Fine-grained complexity for sparse graphs. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
Inapproximability of the independent set polynomial in the complex plane. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Aris Filos-Ratsikas, Paul W. Goldberg |
Consensus halving is PPA-complete. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel B. Hopkins, Jerry Li 0001 |
Mixture models, robustness, and sum of squares proofs. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow |
The art gallery problem is ∃ ℝ-complete. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhiyi Huang 0002, Ning Kang 0001, Zhihao Gavin Tang, Xiaowei Wu 0001, Yuhao Zhang 0001, Xue Zhu |
How to match when all vertices arrive online. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna R. Karlin, Shayan Oveis Gharan, Robbie Weber |
A simply exponential upper bound on the maximum number of stable matchings. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Kasper Green Larsen, Omri Weinstein, Huacheng Yu |
Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Erickson 0001, Kyle Fox, Luvsandondov Lkhamsuren |
Holiest minimum-cost paths and flows in surface graphs. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Tianren Liu, Vinod Vaikuntanathan |
Breaking the circuit-size barrier in secret sharing. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Byrka, Krzysztof Sornat, Joachim Spoerhase |
Constant-factor approximation for ordered k-median. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Cliff Stein 0001 |
Fast algorithms for knapsack via convolution and prediction. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Bun, Robin Kothari, Justin Thaler |
The polynomial method strikes back: tight quantum query bounds via dual polynomials. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis |
A converse to Banach's fixed point theorem and its CLS-completeness. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang 0052 |
Incomplete nested dissection. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy T. Fineman |
Nearly work-efficient parallel algorithm for digraph reachability. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein |
Towards tight approximation bounds for graph diameter and eccentricities. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Lior Gishboliner, Asaf Shapira |
A generalized Turán problem and its applications. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Akshay Ramachandran |
The Paulsen problem, continuous operator scaling, and smoothed analysis. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, David Kempe 0001, Monika Henzinger (eds.) |
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018 |
STOC |
2018 |
DBLP BibTeX RDF |
|
| 1 | Scott Aaronson |
Shadow tomography of quantum states. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ola Svensson, Jakub Tarnawski, László A. Végh |
A constant-factor approximation algorithm for the asymmetric traveling salesman problem. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Divesh Aggarwal, Noah Stephens-Davidowitz |
(Gap/S)ETH hardness of SVP. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Dadush, Sophie Huiberts |
A friendly smoothed analysis of the simplex method. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov 0001 |
Monotone circuit lower bounds from resolution. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart |
List-decodable robust mean estimation and learning mixtures of spherical gaussians. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Gillat Kol |
Interactive compression to external information. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Roei Tell |
Quantified derandomization of linear threshold circuits. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup |
Fast fencing. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Christandl, Péter Vrana, Jeroen Zuiddam |
Universal points in the asymptotic spectrum of tensors. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel M. Kane, Shachar Lovett, Shay Moran |
Near-optimal linear decision trees for k-SUM and related problems. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sungjin Im, Nathaniel Kell, Debmalya Panigrahi, Maryam Shadloo |
Online load balancing on related machines. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi-Jun Chang, Wenzheng Li, Seth Pettie |
An optimal distributed (Δ+1)-coloring algorithm? |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Talya Eden, Dana Ron, C. Seshadhri 0001 |
On approximating the number of k-cliques in sublinear time. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, David H. K. Kim, Rachit Nimavat |
Almost polynomial hardness of node-disjoint paths in grids. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohsen Ghaffari 0001, Fabian Kuhn, Yannic Maus, Jara Uitto |
Deterministic distributed edge-coloring with fewer colors. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Klim Efremenko, Gillat Kol, Raghuvansh Saxena |
Interactive coding over the noisy broadcast channel. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski |
Round compression for parallel matching algorithms. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Gil Cohen, Bernhard Haeupler, Leonard J. Schulman |
Explicit binary tree codes with polylogarithmic size alphabet. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Kempa, Nicola Prezza |
At the roots of dictionary compression: string attractors. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Michal Koucký 0001, Bruno Loff, Sagnik Mukhopadhyay |
Simulation beats richness: new data-structure lower bounds. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Rishab Goyal, Venkata Koppula, Brent Waters |
Collusion resistant traitor tracing from learning with errors. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Cornelius Brand, Holger Dell, Thore Husfeldt |
Extensor-coding. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart |
Learning geometric concepts with nasty noise. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Simchowitz, Ahmed El Alaoui, Benjamin Recht |
Tight query complexity lower bounds for PCA via finite sample deformed wigner law. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ravishankar Krishnaswamy, Shi Li 0001, Sai Sandeep |
Constant approximation for k-median and k-means with outliers via iterative rounding. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yin Tat Lee, Santosh S. Vempala |
Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Saikrishna Badrinarayanan, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs |
Succinct delegation for low-space non-deterministic computation. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Neuen, Pascal Schweitzer |
An exponential lower bound for individualization-refinement algorithms for graph isomorphism. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranjal Dutta, Nitin Saxena 0001, Amit Sinhababu |
Discovering the roots: uniform closure results for algebraic classes under factoring. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ittai Abraham, Arnold Filtser, Anupam Gupta 0001, Ofer Neiman |
Metric embedding via shortest path decompositions. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Aviad Rubinstein |
Hardness of approximate nearest neighbor search. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Tengyu Ma 0001 |
Generalization and equilibrium in generative adversarial nets (GANs) (invited talk). |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen 0001, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah |
On the complexity of hazard-free circuits. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengyang Liu 0002, Xi Chen 0001, Rocco A. Servedio, Ying Sheng 0004, Jinyu Xie |
Distribution-free junta testing. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Dell, John Lapinskas |
Fine-grained reductions from approximate counting to decision. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | László Kozma 0002, Thatchaphol Saranurak |
Smooth heaps and a dual view of self-adjusting data structures. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Hamed Omidvar, Massimo Franceschetti |
Shape of diffusion and size of monochromatic region of a two-dimensional spin system. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme |
Stochastic bandits robust to adversarial corruptions. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pravesh K. Kothari, Ruta Mehta |
Sum-of-squares meets nash: lower bounds for finding any equilibrium. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Bun, Cynthia Dwork, Guy N. Rothblum, Thomas Steinke 0002 |
Composable and versatile privacy via truncated CDP. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, Yuanzhi Li |
An homotopy method for lp regression provably beyond self-concordance and in input-sparsity time. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Haeupler, Amirbehshad Shahrasbi |
Synchronization strings: explicit constructions, local decoding, and applications. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen |
Tight cell probe bounds for succinct Boolean matrix-vector multiplication. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Cole Franks |
Operator scaling with specified marginals. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yannai A. Gonczarowski |
Bounding the menu-size of approximately optimal auctions via optimal-transport duality. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yang Cai 0001, Mingfei Zhao |
Simple mechanisms for subadditive buyers via duality. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Regev 0001, Noah Stephens-Davidowitz |
A reverse Minkowski theorem. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Avishay Tal |
Formula lower bounds via the quantum method. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | William M. Hoza, Chris Umans |
Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Alman, R. Ryan Williams |
Probabilistic rank and matrix rigidity. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Bavarian, Thomas Vidick, Henry Yuen |
Hardness amplification for entangled games via anchoring. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Assaf Naor, Robert Young |
The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Pravesh K. Kothari, David Steurer |
Quantum entanglement, sum of squares, and the log rank conjecture. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta 0001, Ravishankar Krishnaswamy, Amit Kumar 0001, Debmalya Panigrahi |
Online and dynamic algorithms for set cover. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva |
Sampling random spanning trees faster than matrix multiplication. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma |
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Wulff-Nilsen |
Fully-dynamic minimum spanning forest with improved worst-case update time. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Atri Rudra |
Answering FAQs in CSPs, probabilistic graphical models, databases, logic and matrix operations (invited talk). |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Jacob Steinhardt, Gregory Valiant |
Learning from untrusted data. |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim Martens |
Optimizing tree pattern queries: why cutting is not enough (invited talk). |
STOC |
2017 |
DBLP DOI BibTeX RDF |
|
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license