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

• 2016
• 
  Nikhil Bansal, Bouke Cloostermans:
  Minimizing Maximum Flow-Time on Related Machines. Theory Comput. 12(1): 1-14 (2016)
• 
  Amos Beimel, Kobbi Nissim, Uri Stemmer:
  Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. Theory Comput. 12(1): 1-61 (2016)
• 
  Mark Bun, Justin Thaler:
  Dual Polynomials for Collision and Element Distinctness. Theory Comput. 12(1): 1-34 (2016)
• 
  Amit Chakrabarti, Graham Cormode, Andrew McGregor:
  Robust Lower Bounds for Communication and Stream Computation. Theory Comput. 12(1): 1-35 (2016)
• 
  Deeparnab Chakrabarty, David J. Galvin:
  Special Issue: APPROX-RANDOM 2014: Guest Editors' Foreword. Theory Comput. 12(1): 1-3 (2016)
• 
  Eden Chlamtác, Michael Dinitz:
  Lowest-Degree k-Spanner: Approximation and Hardness. Theory Comput. 12(1): 1-29 (2016)
• 
  Daniel Dadush, Gábor Kun:
  Lattice Sparsification and the Approximate Closest Vector Problem. Theory Comput. 12(1): 1-34 (2016)
• 
  Anindya De, Elchanan Mossel, Joe Neeman:
  Majority is Stablest: Discrete and SoS. Theory Comput. 12(1): 1-50 (2016)
• 
  Jugal Garg, Ruta Mehta, Vijay V. Vazirani:
  Dichotomies in Equilibrium Computation and Membership of PLC Markets in FIXP. Theory Comput. 12(1): 1-25 (2016)
• 
  Mika Göös, Thomas Watson:
  Communication Complexity of Set-Disjointness for All Probabilities. Theory Comput. 12(1): 1-23 (2016)
• 
  Mika Göös, Jukka Suomela:
  Locally Checkable Proofs in Distributed Computing. Theory Comput. 12(1): 1-33 (2016)
• 
  Venkatesan Guruswami, Euiwoong Lee:
  Simple Proof of Hardness of Feedback Vertex Set. Theory Comput. 12(1): 1-11 (2016)
• 
  Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
  Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. Theory Comput. 12(1): 1-27 (2016)
• 
  Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
  Lower Bounds for Non-Commutative Skew Circuits. Theory Comput. 12(1): 1-38 (2016)
• 
  Cedric Yen-Yu Lin, Han-Hsuan Lin:
  Upper Bounds on Quantum Query Complexity Inspired by the Elitzur--Vaidman Bomb Tester. Theory Comput. 12(1): 1-35 (2016)
• 
  Anand Louis, Yury Makarychev:
  Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion. Theory Comput. 12(1): 1-25 (2016)
• 
  Matthew McKague:
  Interactive Proofs for BQP via Self-Tested Graph States. Theory Comput. 12(1): 1-42 (2016)
• 
  Nicole Megow, Mary Wootters:
  Special Issue: APPROX-RANDOM 2015: Guest Editors' Foreword. Theory Comput. 12(1): 1-3 (2016)
• 
  Raghu Meka, Oanh Nguyen, Van Vu:
  Anti-concentration for Polynomials of Independent Random Variables. Theory Comput. 12(1): 1-17 (2016)
• 
  Neil Thapen:
  A Tradeoff Between Length and Width in Resolution. Theory Comput. 12(1): 1-14 (2016)