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

• 1975
• 
  Leonard M. Adleman, Kenneth L. Manders:
  Computational Complexity of Decision Procedures for Polynomials (Extended Abstract). FOCS 1975: 169-177
• 
  Eshrat Arjomandi, Derek G. Corneil:
  Parallel Computations in Graph Theory. FOCS 1975: 13-18
• 
  J. W. de Bakker:
  Flow of Control in the Proof Theory of Structured Programming. FOCS 1975: 29-33
• 
  Catriel Beeri:
  An Improvement of Valiant's Decision Procedure for Equivalence of Deterministic Finite-Turn Pushdown Automata. FOCS 1975: 128-134
• 
  Peter van Emde Boas:
  Preserving Order in a Forest in less than Logarithmic Time. FOCS 1975: 75-84
• 
  L. Csanky:
  Fast Parallel Matrix Inversion Algorithms. FOCS 1975: 11-12
• 
  Peter J. Downey, Ravi Sethi:
  Correct Computation Rules for Recursive Languages (Extended Abstract). FOCS 1975: 48-56
• 
  Shimon Even, Alon Itai, Adi Shamir:
  On the Complexity of Timetable and Multi-Commodity Flow Problems. FOCS 1975: 184-193
• 
  Shimon Even, Oded Kariv:
  An O(n2.5) Algorithm for Maximum Matching in General Graphs. FOCS 1975: 100-112
• 
  Robert W. Floyd:
  The Exact Time Required to Perform Generalized Addition. FOCS 1975: 3-5
• 
  Michael L. Fredman:
  On the Decision Tree Complexity of the Shortest Path Problems. FOCS 1975: 98-99
• 
  M. R. Garey, David S. Johnson, H. C. So:
  An Application of Graph Coloring to Printed Circuit Testing (Working Paper). FOCS 1975: 178-183
• 
  Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
  Economy of Descriptions by Parsers, DPDA's, and PDA's. FOCS 1975: 122-127
• 
  Juris Hartmanis, Leonard Berman:
  A Note on Tape Bounds for SLA Language Processing. FOCS 1975: 65-70
• 
  John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant:
  On Time versus Space and Related Problems. FOCS 1975: 57-64
• 
  Harry B. Hunt III, J. L. Rangel:
  Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract). FOCS 1975: 144-150
• 
  Daniel J. Kleitman, Michael M. Krieger:
  An Optimal Bound for Two Dimensional Bin Packing. FOCS 1975: 163-168
• 
  Richard J. Lipton:
  Polynomials with 0-1 Coefficients that Are Hard to Evaluate. FOCS 1975: 6-10
• 
  Richard J. Lipton, Raymond E. Miller, Lawrence Snyder:
  Synchronization and Computing Capabilities of Linear Asynchronous Structures. FOCS 1975: 19-28
• 
  George Markowsky, Barry K. Rosen:
  Bases for Chain-Complete Posets. FOCS 1975: 34-47
• 
  Nicholas Pippenger:
  Information Theory and the Complexity of Switching Networks (Preliminary Version). FOCS 1975: 113-118
• 
  Ira Pohl:
  Minimean Optimality in Sorting Algorithms. FOCS 1975: 71-74
• 
  Vaughan R. Pratt:
  The Effect of Basis on Size of Boolean Expressions. FOCS 1975: 119-121
• 
  William C. Rounds:
  A Grammatical Characterization of Exponential-Time Languages. FOCS 1975: 135-143
• 
  Michael Ian Shamos, Dan Hoey:
  Closest-Point Problems. FOCS 1975: 151-162
• 
  Thomas G. Szymanski, Jeffrey D. Ullman:
  Evaluating Relational Expressions with Dense and Sparse Arguments. FOCS 1975: 90-97
• 
  Shmuel Winograd:
  The Effect of the Field of Constants on the Number of Multiplication. FOCS 1975: 1-2
• 
  Andrew Chi-Chih Yao:
  On the Complexity of Comparison Problems using Linear Functions (Preliminary Report). FOCS 1975: 85-89
• 
  16th Annual Symposium on Foundations of Computer Science, Berkeley, California, USA, October 13-15, 1975. IEEE Computer Society 1975 [contents]