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

• 1992
• 
  Pankaj K. Agarwal, David Eppstein, Jirí Matousek:
  Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees. FOCS 1992: 80-89
• 
  Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber:
  Efficient Minimum Cost Matching Using Quadrangle Inequality. FOCS 1992: 583-592
• 
  Howard Aizenstein, Lisa Hellerstein, Leonard Pitt:
  Read-Thrice DNF Is Hard to Learn With Membership and Equivalence Queries. FOCS 1992: 523-532
• 
  Miklós Ajtai, Noga Alon, Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, Moni Naor, Endre Szemerédi:
  Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths. FOCS 1992: 693-702
• 
  Miklós Ajtai, János Komlós, Endre Szemerédi:
  Halvers and Expanders. FOCS 1992: 686-692
• 
  Noga Alon, Richard A. Duke, Hanno Lefmann, Vojtech Rödl, Raphael Yuster:
  The Algorithmic Aspects of the Regularity Lemma (Extended Abstract). FOCS 1992: 473-481
• 
  Noga Alon, Zvi Galil, Oded Margalit, Moni Naor:
  Witnesses for Boolean Matrix Multiplication and for Shortest Paths. FOCS 1992: 417-426
• 
  Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer:
  Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract). FOCS 1992: 334-343
• 
  Rajeev Alur, Thomas A. Henzinger:
  Back to the Future: Towards a Theory of Timed Regular Languages. FOCS 1992: 177-186
• 
  Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan:
  Reconstructing Algebraic Functions from Mixed Data. FOCS 1992: 503-512
• 
  Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy:
  Proof Verification and Hardness of Approximation Problems. FOCS 1992: 14-23
• 
  Sanjeev Arora, Shmuel Safra:
  Probabilistic Checking of Proofs; A New Characterization of NP. FOCS 1992: 2-13
• 
  James Aspnes, Orli Waarts:
  Randomized Consensus in Expected O(n log 2 n) Operations Per Processor. FOCS 1992: 137-146
• 
  Yonatan Aumann, Michael O. Rabin:
  Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract). FOCS 1992: 147-156
• 
  Yossi Azar, Andrei Z. Broder, Anna R. Karlin:
  On-line Load Balancing (Extended Abstract). FOCS 1992: 218-225
• 
  Yair Bartal, Adi Rosén:
  The Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms. FOCS 1992: 344-353
• 
  Dario Bini, Victor Y. Pan:
  Improved Parallel Polynomial Division and Its Extensions. FOCS 1992: 131-136
• 
  Johannes Blömer:
  How to Denest Ramanujan's Nested Radicals. FOCS 1992: 447-456
• 
  Manuel Blum, Oded Goldreich:
  Towards a Computational Theory of Statistical Tests (Extended Abstract). FOCS 1992: 406-416
• 
  Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks:
  A Decomposition Theorem and Bounds for Randomized Server Problems. FOCS 1992: 197-207
• 
  Nader H. Bshouty, Richard Cleve:
  On the Exact Learning of Formulas in Parallel (Extended Abstract). FOCS 1992: 513-522
• 
  Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan:
  Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues. FOCS 1992: 40-49
• 
  Jan Van den Bussche, Dirk Van Gucht, Marc Andries, Marc Gyssens:
  On the Completeness of Object-Creating Query Languages (Extended Abstract). FOCS 1992: 372-379
• 
  Shiva Chaudhuri, Jaikumar Radhakrishnan:
  The Complexity of Parallel Prefix Problems on Small Domains. FOCS 1992: 638-647
• 
  Vasek Chvátal, Bruce A. Reed:
  Mick Gets Some (the Odds Are on His Side). FOCS 1992: 620-627
• 
  Kenneth L. Clarkson:
  Safe and Effective Determinant Evaluation. FOCS 1992: 387-395
• 
  Edith Cohen:
  Approximate Max Flow on Small Depth Networks. FOCS 1992: 648-658
• 
  Richard Cole, Ramesh Hariharan:
  Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract). FOCS 1992: 600-609
• 
  Michele Conforti, Gérard Cornuéjols:
  A Class of Logic Problems Solvable by Linear Programming. FOCS 1992: 670-675
• 
  Don Coppersmith, Baruch Schieber:
  Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary). FOCS 1992: 288-295

skipping 48 more matches