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

• 1987
• 
  Varol Akman:
  An Algorithm for Determining an Opaque Minimal Forest of a Convex Polygon. Inf. Process. Lett. 24(3): 193-198 (1987)
• 
  Athanasios Alexandrakis, Symeon Bozapalidis:
  Weighted Grammars and Kleene's Theorem. Inf. Process. Lett. 24(1): 1-4 (1987)
• 
  Richard J. Anderson, Ernst W. Mayr:
  Parallelism and the Maximal Path Problem. Inf. Process. Lett. 24(2): 121-126 (1987)
• 
  Richard P. Anstee:
  A Polynomial Algorithm for b-Matchings: An Alternative Approach. Inf. Process. Lett. 24(3): 153-157 (1987)
• 
  Vikraman Arvind, Somenath Biswas:
  An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences. Inf. Process. Lett. 24(1): 67-69 (1987)
• 
  Takao Asano, Tetsuo Asano, Hiroshi Imai:
  Shortest Path Between Two Simple Polygons. Inf. Process. Lett. 24(5): 285-288 (1987)
• 
  M. D. Atkinson, H. W. Chang:
  Computing the Number of Mergings with Constraints. Inf. Process. Lett. 24(5): 289-292 (1987)
• 
  M. Bajantri, David B. Skillicorn:
  A Fast Multiprocessor Message Passing Implementation. Inf. Process. Lett. 24(6): 381-389 (1987)
• 
  Arthur J. Bernstein:
  Predicate Transfer and Timeout in Message Passing Systems. Inf. Process. Lett. 24(1): 43-52 (1987)
• 
  Dario Bini, Victor Y. Pan:
  A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division. Inf. Process. Lett. 24(4): 233-237 (1987)
• 
  Richard S. Bird, John Hughes:
  The alpha-beta Algorithm: An Exercise in Program Transformation. Inf. Process. Lett. 24(1): 53-57 (1987)
• 
  Jacek Blazewicz, Gerd Finke:
  Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors. Inf. Process. Lett. 24(4): 259-263 (1987)
• 
  Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth:
  Occam's Razor. Inf. Process. Lett. 24(6): 377-380 (1987)
• 
  Svante Carlsson:
  A Variant of Heapsort with Almost Optimal Number of Comparisons. Inf. Process. Lett. 24(4): 247-250 (1987)
• 
  Michel Castan, M.-H. Durand, Michel Lemaître:
  A Set of Combinators for Abstraction in Linear Space. Inf. Process. Lett. 24(3): 183-188 (1987)
• 
  Ernest J. H. Chang, Gaston H. Gonnet, Doron Rotem:
  On the Costs of Self-Stabilization. Inf. Process. Lett. 24(5): 311-316 (1987)
• 
  Marek Chrobak, Wojciech Rytter:
  Remarks on String-Matching and One-Way Multihead Automata. Inf. Process. Lett. 24(5): 325-329 (1987)
• 
  Michael B. Dillencourt:
  Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations. Inf. Process. Lett. 24(5): 339-342 (1987)
• 
  Herbert Edelsbrunner, Mark H. Overmars:
  Zooming by Repeated Range Detection. Inf. Process. Lett. 24(6): 413-417 (1987)
• 
  Anders Edenbrandt:
  Chordal Graph Recognition is in NC. Inf. Process. Lett. 24(4): 239-241 (1987)
• 
  E. Allen Emerson:
  Uniform Inevitability is Tree Automaton Ineffable. Inf. Process. Lett. 24(2): 77-79 (1987)
• 
  David J. Evans, W. S. Yousif:
  Explicit Solution of Block Tridiagonal Systems of Linear Equations. Inf. Process. Lett. 24(3): 207-209 (1987)
• 
  W. H. J. Feijen, A. J. M. van Gasteren, David Gries:
  In-situ Inversion of a Cyclic Permutation. Inf. Process. Lett. 24(1): 11-14 (1987)
• 
  Dan Field:
  A Note on a New Data Structure for in-the-Past Queries. Inf. Process. Lett. 24(2): 95-96 (1987)
• 
  Raphael A. Finkel, Hari Madduri:
  An Efficient Deadlock Avoidance Algorithm. Inf. Process. Lett. 24(1): 25-30 (1987)
• 
  Christopher W. Fraser, David R. Hanson:
  Optimization of Argument Evaluation Order. Inf. Process. Lett. 24(6): 391-395 (1987)
• 
  Martin Charles Golumbic:
  A General Method for Avoiding Cycling in a Network. Inf. Process. Lett. 24(4): 251-253 (1987)
• 
  Georg Gottlob:
  Subsumption and Implication. Inf. Process. Lett. 24(2): 109-111 (1987)
• 
  Georg Gottlob:
  On the Size of Nonredundant FD-Covers. Inf. Process. Lett. 24(6): 355-360 (1987)
• 
  Anne Grazon:
  An Infinite Word Language Which is Not co-CFL. Inf. Process. Lett. 24(2): 81-85 (1987)

skipping 45 more matches