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

• 1992
• 
  Tatsuya Akutsu:
  Algorithms for Determining the Geometrical Congruity in Two and Three Dimensions. ISAAC 1992: 279-288
• 
  Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
  Lowness and the Complexity of Sparse and Tally Descriptions. ISAAC 1992: 249-258
• 
  Richard Beigel, Jun Tarui, Seinosuke Toda:
  On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. ISAAC 1992: 420-429
• 
  Omer Berkman, Yossi Matias, Uzi Vishkin:
  Randomized Range-Maxima inNearly-Constant Parallel Time. ISAAC 1992: 135-144
• 
  Dominique Bolignano, Mourad Debbabi:
  Higher Order Communication Processes with Value-Passing, Assignment and Return of Results. ISAAC 1992: 319-331
• 
  Ronald V. Book:
  Relativizations of the P =?NP and other Problems: Some Developments in Structural Complexity Theory. ISAAC 1992: 175-186
• 
  W. S. Chan, F. Chin:
  Approximation of Polygonal Curves with Minimum Number of Line Segments. ISAAC 1992: 378-387
• 
  Maw-Hwa Chen, Sing-Ling Lee:
  Linear Time Algorithms for k-cutwidth Problem. ISAAC 1992: 21-30
• 
  Been-Chian Chien, Rong-Jaye Chen, Wei-Pang Yang:
  Competitive Analysis of the On-line Algorithms for Multiple Stacks Sysytems. ISAAC 1992: 78-87
• 
  Seung-Hak Choi, Sung Yong Shin, Kyung-Yong Chwa:
  Characterizing and Recognizing Visibility Graphs of Funnel-Shaped Polygons. ISAAC 1992: 219-228
• 
  Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis:
  An Efficient Parallel Algorithm for Geometrically Characterising Drawings of a Class of 3-D Objects. ISAAC 1992: 198-208
• 
  Bin Fu, Hong-Zhou Li:
  On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets. ISAAC 1992: 439-448
• 
  Teofilo F. Gonzalez, Toshio Murayama:
  Alhorithms for a Class of Min-Cut and Max-Cut Problem. ISAAC 1992: 97-105
• 
  Eric Guévremont, Jack Snoeyink:
  Recognizing an Envelope of Lines in Linear Time. ISAAC 1992: 370-377
• 
  Koji Hakata, Hiroshi Imai:
  The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. ISAAC 1992: 469-478
• 
  Magnús M. Halldórsson:
  Parallel and On-line Graph Coloring Algorithms. ISAAC 1992: 61-70
• 
  Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura:
  Fault-Tolerant Broadcasting in Binary Jumping Networks. ISAAC 1992: 145-154
• 
  Jan-Ming Ho, Ming-Tat Ko, Tze-Heng Ma, Ting-Yi Sung:
  Algorithms for Rectilinear Optimal Multicast Tree Problem. ISAAC 1992: 106-115
• 
  Wen-Lian Hsu:
  A Simple Test for the Consecutive Ones Property. ISAAC 1992: 459-468
• 
  R. Z. Hwang, Richard C. T. Lee:
  The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs. ISAAC 1992: 51-60
• 
  Masao Iri:
  How to Generate Realistic Sample Problems for Network Optimization. ISAAC 1992: 342-350
• 
  Toshiya Itoh, Kenji Horikawa:
  On the Complexity of Composite Numbers. ISAAC 1992: 229-238
• 
  Kazuo Iwama, Eiji Miyano:
  Routing Problems on the Mesh of Buses. ISAAC 1992: 155-164
• 
  Esther Jennings, Andrzej Lingas:
  On the Relationship among Constrained Geometric Structures. ISAAC 1992: 289-298
• 
  Shuji Jimbo, Akira Maruoka:
  Selection Networks with 8n log₂n Size and O(log n) Depth. ISAAC 1992: 165-174
• 
  Ton Kloks, Hans L. Bodlaender:
  Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. ISAAC 1992: 116-125
• 
  Kojiro Kobayashi:
  On Malign Input Distributions for Algorithms. ISAAC 1992: 239-248
• 
  Kaoru Kurosawa, Osamu Watanabe:
  Computational and Statistical Indistinguishabilities. ISAAC 1992: 430-438
• 
  Tak Wah Lam, Ka Hing Lee:
  The Implicit Dictionary Problem Revisited. ISAAC 1992: 479-488
• 
  Tony W. Lau:
  Self-Adjusting Augmented Search Trees. ISAAC 1992: 88-96

skipping 22 more matches