• 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 87 matches

• 2016
• 
  Amir Abboud, Søren Dahlgaard:
  Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms. FOCS 2016: 477-486
• 
  Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng:
  On Fully Dynamic Graph Sparsifiers. FOCS 2016: 335-344
• 
  Josh Alman, Timothy M. Chan, R. Ryan Williams:
  Polynomial Representations of Threshold Functions and Algorithmic Applications. FOCS 2016: 467-476
• 
  Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
  Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS 2016: 555-564
• 
  Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi:
  Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS 2016: 148-157
• 
  Haris Aziz, Simon Mackenzie:
  A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. FOCS 2016: 416-427
• 
  Arturs Backurs, Piotr Indyk:
  Which Regular Expression Patterns Are Hard to Match? FOCS 2016: 457-466
• 
  Nikhil Bansal, Daniel Dadush, Shashwat Garg:
  An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. FOCS 2016: 788-799
• 
  Boaz Barak, Samuel B. Hopkins, Jonathan A. Kelner, Pravesh Kothari, Ankur Moitra, Aaron Potechin:
  A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem. FOCS 2016: 428-437
• 
  Rafael da Ponte Barbosa, Alina Ene, Huy L. Nguyen, Justin Ward:
  A New Framework for Distributed Submodular Maximization. FOCS 2016: 645-654
• 
  Djamal Belazzougui, Qin Zhang:
  Edit Distance: Sketching, Streaming, and Document Exchange. FOCS 2016: 51-60
• 
  Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams:
  Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. FOCS 2016: 375-384
• 
  Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous:
  Zero-Knowledge Proof Systems for QMA. FOCS 2016: 31-40
• 
  Peter Bürgisser, Christian Ikenmeyer, Greta Panova:
  No Occurrence Obstructions in Geometric Complexity Theory. FOCS 2016: 386-395
• 
  Amit Chakrabarti, Sagar Kale:
  Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream Statistics. FOCS 2016: 41-50
• 
  T.-H. Hubert Chan, Shuguang Hu, Shaofeng H.-C. Jiang:
  A PTAS for the Steiner Forest Problem in Doubling Metrics. FOCS 2016: 810-819
• 
  Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
  An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. FOCS 2016: 615-624
• 
  Eshan Chattopadhyay, Xin Li:
  Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols. FOCS 2016: 158-167
• 
  Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis:
  Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS 2016: 315-324
• 
  Xue Chen, Daniel M. Kane, Eric Price, Zhao Song:
  Fourier-Sparse Interpolation without a Frequency Gap. FOCS 2016: 741-750
• 
  Yijia Chen, Bingkai Lin:
  The Constant Inapproximability of the Parameterized Dominating Set Problem. FOCS 2016: 505-514
• 
  Shiteng Chen, Periklis A. Papakonstantinou:
  Depth-Reduction for Composites. FOCS 2016: 99-108
• 
  Hubie Chen, Matthew Valeriote, Yuichi Yoshida:
  Testing Assignments to Constraint Satisfaction Problems. FOCS 2016: 525-534
• 
  Yiling Chen, Bo Waggoner:
  Informational Substitutes. FOCS 2016: 239-247
• 
  Julia Chuzhoy, Alina Ene:
  On Approximating Maximum Independent Set of Rectangles. FOCS 2016: 820-829
• 
  Vincent Cohen-Addad, Philip N. Klein, Claire Mathieu:
  Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics. FOCS 2016: 353-364
• 
  Gil Cohen:
  Making the Most of Advice: New Correlation Breakers and Their Applications. FOCS 2016: 188-196
• 
  Michael B. Cohen:
  Ramanujan Graphs in Polynomial Time. FOCS 2016: 276-281
• 
  Michael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Aaron Sidford, Adrian Vladu:
  Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More. FOCS 2016: 583-592
• 
  Gil Cohen, Leonard J. Schulman:
  Extractors for Near Logarithmic Min-Entropy. FOCS 2016: 178-187

skipping 57 more matches