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

• 1988
• 
  Ingo Althöfer:
  On the Complexity of Searching Game Trees and Other Recursion Trees. J. Algorithms 9(4): 538-567 (1988)
• 
  Franz Aurenhammer:
  Improved Algorithms for Discs and Balls Using Power Diagrams. J. Algorithms 9(2): 151-161 (1988)
• 
  Reuven Bar-Yehuda, Shay Kutten:
  Fault Tolerant Distributed Majority Commitment. J. Algorithms 9(4): 568-582 (1988)
• 
  Binay K. Bhattacharya, J. Zorbas:
  Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot. J. Algorithms 9(4): 449-469 (1988)
• 
  Ying Cheng, Frank K. Hwang:
  Diameters of Weighted Double Loop Networks. J. Algorithms 9(3): 401-410 (1988)
• 
  Joseph Cheriyan, S. N. Maheshwari:
  Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. J. Algorithms 9(4): 507-537 (1988)
• 
  Alan M. Frieze:
  An Algorithm for Finding Hamilton Cycles in Random Directed Graphs. J. Algorithms 9(2): 181-204 (1988)
• 
  Harold N. Gabow, Robert Endre Tarjan:
  Algorithms for Two Bottleneck Optimization Problems. J. Algorithms 9(3): 411-417 (1988)
• 
  Martin Charles Golumbic, Peter L. Hammer:
  Stability in Circular Arc Graphs. J. Algorithms 9(3): 314-320 (1988)
• 
  Harold Greenberg:
  Solution to a Linear Diophantine Equation for Nonnegative Integers. J. Algorithms 9(3): 343-353 (1988)
• 
  Xin He, Yaacov Yesha:
  Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs. J. Algorithms 9(1): 92-113 (1988)
• 
  John Hershberger, Leonidas J. Guibas:
  An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body. J. Algorithms 9(1): 18-46 (1988)
• 
  James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore:
  Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. J. Algorithms 9(2): 245-253 (1988)
• 
  David S. Johnson:
  The NP-Completeness Column: An Ongoing Guide. J. Algorithms 9(3): 426-444 (1988)
• 
  Michael Kaminski:
  An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants. J. Algorithms 9(1): 137-147 (1988)
• 
  Michael Kaminski, David G. Kirkpatrick, Nader H. Bshouty:
  Addition Requirements for Matrix and Transposed Matrix Products. J. Algorithms 9(3): 354-364 (1988)
• 
  William M. Kantor, Donald E. Taylor:
  Polynomial-Time Versions of Sylow's Theorem. J. Algorithms 9(1): 1-17 (1988)
• 
  Mauricio Karchmer, Joseph Naor:
  A Fast Parallel Algorithm to Color a Graph with Delta Colors. J. Algorithms 9(1): 83-91 (1988)
• 
  Jeffrey H. Kingston:
  A New Proof of the Garsia-Wachs Algorithm. J. Algorithms 9(1): 129-136 (1988)
• 
  Manfred Kunde, Michael A. Langston, Jin-Ming Liu:
  On a Special Case of Uniform Processor Scheduling. J. Algorithms 9(2): 287-296 (1988)
• 
  Charles E. Leiserson, James B. Saxe:
  A Mixed-Integer Linear Programming Problem which is Efficiently Solvable. J. Algorithms 9(1): 114-128 (1988)
• 
  Hanoch Levy, David W. Low:
  A Contraction Algorithm for Finding Small Cycle Cutsets. J. Algorithms 9(4): 470-493 (1988)
• 
  Oded Maimon:
  An Algorithm for the Lorenz Measure in Locational Decisions on Trees. J. Algorithms 9(4): 583-596 (1988)
• 
  Stephan Olariu, S. Toida, M. Zubair:
  On a Conjecture by Plaisted and Hong. J. Algorithms 9(4): 597-598 (1988)
• 
  Mark H. Overmars:
  Efficient Data Structures for Range Searching on a Grid. J. Algorithms 9(2): 254-275 (1988)
• 
  Mark H. Overmars, Derick Wood:
  On Rectangular Visibility. J. Algorithms 9(3): 372-390 (1988)
• 
  Vijaya Ramachandran:
  Finding a Minimum Feedback Arc Set in Reducible Flow Graphs. J. Algorithms 9(3): 299-313 (1988)
• 
  Lajos Rónyai:
  Factoring Polynomials Over Finite Fields. J. Algorithms 9(3): 391-400 (1988)
• 
  Lajos Rónyai:
  Zero Divisors in Quaternion Algebras. J. Algorithms 9(4): 494-506 (1988)
• 
  Frank Ruskey:
  Adjacent Interchange Generation of Combinations. J. Algorithms 9(2): 162-180 (1988)

skipping 8 more matches