• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 152 matches

• 2021
• 
  Zachary Chase:
  Separating words and trace reconstruction. STOC 2021: 21-31
• 
  Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran:
  Near-optimal learning of tree-structured distributions by Chow-Liu. STOC 2021: 147-160
• 
  Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
  Almost optimal super-constant-pass streaming lower bounds for reachability. STOC 2021: 570-583
• 
  Lijie Chen, Xin Lyu:
  Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma. STOC 2021: 761-771
• 
  Christopher Jung, Katrina Ligett, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi, Moshe Shenfeld:
  A new analysis of differential privacy's generalization guarantees (invited paper). STOC 2021: 9
• 
  Lijie Chen, Roei Tell:
  Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost. STOC 2021: 283-291
• 
  Marco Bressan:
  Efficient and near-optimal algorithms for sampling connected subgraphs. STOC 2021: 1132-1143
• 
  Krzysztof Nowicki:
  A deterministic algorithm for the MST problem in constant rounds of congested clique. STOC 2021: 1154-1165
• 
  Roy Schwartz, Nitzan Tur:
  The metric relaxation for 0-extension admits an Ω(log^2/3k) gap. STOC 2021: 1601-1614
• 
  Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup:
  Load balancing with dynamic set of balls and bins. STOC 2021: 1262-1275
• 
  Eddie Aamari, Alexander Knop:
  Statistical query complexity of manifold estimation. STOC 2021: 116-122
• 
  Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, Avishay Tal:
  Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem. STOC 2021: 1330-1342
• 
  Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
  Subcubic algorithms for Gomory-Hu tree in unweighted graphs. STOC 2021: 1725-1737
• 
  Alfred V. Aho:
  Computational thinking in programming language and compiler design (keynote). STOC 2021: 1
• 
  Yeganeh Alimohammadi, Nima Anari, Kirankumar Shiragur, Thuy-Duong Vuong:
  Fractionally log-concave and sector-stable polynomials: counting planar matchings and more. STOC 2021: 433-446
• 
  Josh Alman:
  Kronecker products, low-depth circuits, and matrix rigidity. STOC 2021: 772-785
• 
  Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev:
  Adversarial laws of large numbers and optimal regret in online classification. STOC 2021: 447-455
• 
  Noga Alon, Alon Gonen, Elad Hazan, Shay Moran:
  Boosting simple learners. STOC 2021: 481-489
• 
  Ryan Alweiss, Yang P. Liu, Mehtaab Sawhney:
  Discrepancy minimization via a self-balancing walk. STOC 2021: 14-20
• 
  Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant, Thuy-Duong Vuong:
  Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests. STOC 2021: 408-420
• 
  Nima Anari, Cynthia Vinzant:
  Log-concave polynomials in theory and applications (tutorial). STOC 2021: 12
• 
  Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros:
  A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper). STOC 2021: 4
• 
  Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram, Cristian Riveros:
  When is approximate counting for conjunctive queries tractable? STOC 2021: 1015-1027
• 
  C. J. Argue, Anupam Gupta, Guru Guruganesh, Ziye Tang:
  Chasing convex bodies with linear competitive ratio (invited paper). STOC 2021: 5
• 
  Sepehr Assadi, Vishvajeet N:
  Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma. STOC 2021: 612-625
• 
  Yossi Azar, Stefano Leonardi, Noam Touitou:
  Flow time scheduling with uncertain processing time. STOC 2021: 1070-1080
• 
  Yakov Babichenko, Aviad Rubinstein:
  Settling the complexity of Nash equilibrium in congestion games. STOC 2021: 1426-1437
• 
  Costin Badescu, Ryan O'Donnell:
  Improved Quantum data analysis. STOC 2021: 1398-1411
• 
  Mitali Bafna, Boaz Barak, Pravesh K. Kothari, Tselil Schramm, David Steurer:
  Playing unique games on certified small-set expanders. STOC 2021: 1629-1642
• 
  Ainesh Bakshi, Adarsh Prasad:
  Robust linear regression: optimal rates in polynomial time. STOC 2021: 102-115

skipping 122 more matches