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

• 1997
• 
  Dimitris Achlioptas, Michael S. O. Molloy:
  The Analysis of a List-Coloring Algorithm on a Random Graph. FOCS 1997: 204-212
• 
  Rajeev Alur, Thomas A. Henzinger, Orna Kupferman:
  Alternating-time Temporal Logic. FOCS 1997: 100-109
• 
  Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan:
  Nearly Tight Bounds on the Learnability of Evolution. FOCS 1997: 524-533
• 
  Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
  Pattern Matching with Swaps. FOCS 1997: 144-153
• 
  Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
  Weak Random Sources, Hitting Sets, and BPP Simulations. FOCS 1997: 264-272
• 
  Matthew Andrews, Antonio Fernández, Mor Harchol-Balter, Frank Thomson Leighton, Lisa Zhang:
  General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate). FOCS 1997: 294-302
• 
  Sanjeev Arora:
  Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems. FOCS 1997: 554-563
• 
  Baruch Awerbuch, Yossi Azar:
  Buy-at-Bulk Network Design. FOCS 1997: 542-547
• 
  Jørgen Bang-Jensen, Tibor Jordán:
  Edge-Connectivity Augmentation Preserving Simplicity. FOCS 1997: 486-495
• 
  Yair Bartal, John W. Byers, Danny Raz:
  Global Optimization Using Local Information with Applications to Flow Control. FOCS 1997: 303-312
• 
  Saugata Basu:
  An Improved Algorithm for Quantifier Elimination Over Real Closed Fields. FOCS 1997: 56-65
• 
  Mihir Bellare, Anand Desai, E. Jokipii, Phillip Rogaway:
  A Concrete Security Treatment of Symmetric Encryption. FOCS 1997: 394-403
• 
  Mihir Bellare, Russell Impagliazzo, Moni Naor:
  Does Parallel Repetition Lower the Error in Computationally Sound Protocols? FOCS 1997: 374-383
• 
  Maria Luisa Bonet, Toniann Pitassi, Ran Raz:
  No Feasible Interpolation for TC0-Frege Proofs. FOCS 1997: 254-263
• 
  Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi:
  Parallelizing Elimination Orders with Linear Fill. FOCS 1997: 274-283
• 
  Russ Bubley, Martin E. Dyer:
  Path Coupling: A Technique for Proving Rapid Mixing in Markov Chains. FOCS 1997: 223-231
• 
  Jin-yi Cai, Ajay Nerurkar:
  An Improved Worst-Case to Average-Case Connection for Lattice Problems. FOCS 1997: 468-477
• 
  Jin-yi Cai, D. Sivakumar, Martin Strauss:
  Constant Depth Circuits and the Lutz Hypothesis. FOCS 1997: 595-604
• 
  Bernard Chazelle:
  A Faster Deterministic Algorithm for Minimum Spanning Trees. FOCS 1997: 22-31
• 
  Edith Cohen:
  Learning Noisy Perceptrons by a Perceptron in Polynomial Time. FOCS 1997: 514-523
• 
  Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
  Finding an Even Hole in a Graph. FOCS 1997: 480-485
• 
  Artur Czumaj, Volker Stemann:
  Randomized Allocation Processes. FOCS 1997: 194-203
• 
  Tamal K. Dey:
  Improved Bounds on Planar k-sets and k-levels. FOCS 1997: 156-161
• 
  Martin Farach:
  Optimal Suffix Tree Construction with Large Alphabets. FOCS 1997: 137-143
• 
  Amos Fiat, Manor Mendel:
  Truly Online Paging with Locality of Reference. FOCS 1997: 326-335
• 
  Marc Fischlin:
  Lower Bounds for the Signature Size of Incremental Schemes. FOCS 1997: 438-447
• 
  Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
  Optimal Resilience Proactive Public-Key Cryptosystems. FOCS 1997: 384-393
• 
  Péter Gács:
  Reliable Cellular Automata with Self-Organization. FOCS 1997: 90-99
• 
  Leslie Ann Goldberg, Philip D. MacKenzie:
  Contention Resolution with Guaranteed Constant Expected Delay. FOCS 1997: 213-222
• 
  Andrew V. Goldberg, Satish Rao:
  Beyond the Flow Decomposition Barrier. FOCS 1997: 2-11

skipping 34 more matches