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

• 1987
• 
  Karl R. Abrahamson:
  Generalized String Matching. SIAM J. Comput. 16(6): 1039-1051 (1987)
• 
  Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM J. Comput. 16(5): 808-835 (1987)
• 
  Takao Asano:
  An Application of Duality to Edge-Deletion Problems. SIAM J. Comput. 16(2): 312-331 (1987)
• 
  Franz Aurenhammer:
  Power Diagrams: Properties, Algorithms and Applications. SIAM J. Comput. 16(1): 78-96 (1987)
• 
  Yossi Azar, Uzi Vishkin:
  Tight Comparison Bounds on the Complexity of Parallel Sorting. SIAM J. Comput. 16(3): 458-464 (1987)
• 
  Bernd Becker, Günter Hotz:
  On the Optimal Layout of Planar Graphs with Fixed Boundary. SIAM J. Comput. 16(5): 946-972 (1987)
• 
  Dario Bini, Milvio Capovani:
  Tensor Rank and Border Rank of Band Toeplitz Matrices. SIAM J. Comput. 16(2): 252-258 (1987)
• 
  Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
  A Time-Space Tradeoff for Element Distinctness. SIAM J. Comput. 16(1): 97-99 (1987)
• 
  Jin-yi Cai, Gabriele E. Meyer:
  Graph Minimal Uncolorability is DP-Complete. SIAM J. Comput. 16(2): 259-277 (1987)
• 
  Edward P. F. Chan, Alberto O. Mendelzon:
  Independent and Separable Database Schemes. SIAM J. Comput. 16(5): 841-851 (1987)
• 
  Hyeong-Ah Choi, S. Louis Hakimi:
  Scheduling File Transfers for Trees and Odd Cycles. SIAM J. Comput. 16(1): 162-168 (1987)
• 
  Richard Cole, Micha Sharir, Chee-Keng Yap:
  On k-Hulls and Related Problems. SIAM J. Comput. 16(1): 61-77 (1987)
• 
  Costas Courcoubetis, Martin I. Reiman, Burton Simon:
  Stability of a Queueing System with Concurrent Service and Locking. SIAM J. Comput. 16(1): 169-178 (1987)
• 
  Karel Culík II, Juhani Karhumäki:
  The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable. SIAM J. Comput. 16(2): 221-230 (1987)
• 
  Françoise Fogelman-Soulié, Gérard Weisbuch:
  Random Iterations of Threshold Networks and Associative Memory. SIAM J. Comput. 16(1): 203-220 (1987)
• 
  Greg N. Frederickson:
  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications. SIAM J. Comput. 16(6): 1004-1022 (1987)
• 
  Donald K. Friesen:
  Tighter Bounds for LPT Scheduling on Uniform Processors. SIAM J. Comput. 16(3): 554-560 (1987)
• 
  Alan M. Frieze:
  On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients. SIAM J. Comput. 16(6): 1052-1072 (1987)
• 
  William I. Gasarch:
  Oracles for Deterministic versus Alternating Classes. SIAM J. Comput. 16(4): 613-627 (1987)
• 
  Joachim von zur Gathen:
  Computing Powers in Parallel. SIAM J. Comput. 16(5): 930-945 (1987)
• 
  Teofilo F. Gonzalez, Sing-Ling Lee:
  A 1.6 Approximation Algorithm for Routing Multiterminal Nets. SIAM J. Comput. 16(4): 669-704 (1987)
• 
  Irène Guessarian, José Meseguer:
  On the Axiomatization of "If-Then-Else". SIAM J. Comput. 16(2): 332-357 (1987)
• 
  Yuri Gurevich, Saharon Shelah:
  Expected Computation Time for Hamiltonian Path Problem. SIAM J. Comput. 16(3): 486-502 (1987)
• 
  Dan Gusfield:
  Three Fast Algorithms for Four Problems in Stable Marriage. SIAM J. Comput. 16(1): 111-128 (1987)
• 
  Dan Gusfield:
  Optimal Mixed Graph Augmentation. SIAM J. Comput. 16(4): 599-612 (1987)
• 
  Dan Gusfield, Charles U. Martel, David Fernández-Baca:
  Fast Algorithms for Bipartite Network Flow. SIAM J. Comput. 16(2): 237-251 (1987)
• 
  Friedhelm Meyer auf der Heide, Avi Wigderson:
  The Complexity of Parallel Sorting. SIAM J. Comput. 16(1): 100-107 (1987)
• 
  David P. Helmbold, Ernst W. Mayr:
  Two Processor Scheduling is in NC. SIAM J. Comput. 16(4): 747-759 (1987)
• 
  Daniel S. Hirschberg, Lawrence L. Larmore:
  The Least Weight Subsequence Problem. SIAM J. Comput. 16(4): 628-638 (1987)
• 
  Micha Hofri, Alan G. Konheim:
  Padded Lists Revisited. SIAM J. Comput. 16(6): 1073-1114 (1987)

skipping 43 more matches