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

• 1994
• 
  Diab Abuaiadh, Jeffrey H. Kingston:
  Are Fibonacci Heaps Optimal? ISAAC 1994: 442-450
• 
  Tatsuya Akutsu:
  On Determining the Congruity of Point Sets in Higher Dimensions. ISAAC 1994: 38-46
• 
  Tatsuya Akutsu, Magnús M. Halldórsson:
  On the Approximation of Largest Common Subtrees and Largest Common Point Sets. ISAAC 1994: 405-413
• 
  Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng:
  Resource Bounded Randomness and Weakly Complete Problems. ISAAC 1994: 369-377
• 
  Srinivasa Rao Arikati, Anil Maheshwari:
  Realizing Degree Sequences in Parallel. ISAAC 1994: 261-269
• 
  Vikraman Arvind, Johannes Köbler, Rainer Schuler:
  On Helping and Interactive Proof Systems. ISAAC 1994: 137-145
• 
  Tetsuo Asano:
  Reporting and Counting Intersections of Lines within a Polygon. ISAAC 1994: 652-659
• 
  Feng Bao, Yoshihide Igarashi:
  A Randomized Algorithm to Finite Automata Public Key Cryptosystem. ISAAC 1994: 678-686
• 
  Ingrid Biehl:
  Definition and Existence of Super Complexity Cores. ISAAC 1994: 600-606
• 
  Ronald V. Book, Osamu Watanabe:
  On Random Hard Sets for NP. ISAAC 1994: 47-55
• 
  Prosenjit Bose, Michael E. Houle, Godfried T. Toussaint:
  Every Set of Disjoint Line Segments Admits a Binary Tree. ISAAC 1994: 20-28
• 
  Jin-yi Cai, Michael D. Hirsch:
  Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry. ISAAC 1994: 172-180
• 
  Svante Carlsson, Jingsen Chen, Christer Mattsson:
  Heaps with Bits. ISAAC 1994: 288-296
• 
  Jingsen Chen:
  Average Cost to Produce Partial Orders. ISAAC 1994: 155-163
• 
  Lin Chen:
  Revisiting Circular Arc Graphs. ISAAC 1994: 559-566
• 
  Danny Z. Chen, Xiaobo Hu:
  Fast and Efficient Operations on Parallel Priority Queues. ISAAC 1994: 279-287
• 
  Yongmao Chen, Terence R. Smith:
  Finitely Representables Spatial Objects and Efficient Computation. ISAAC 1994: 181-189
• 
  Francis Y. L. Chin, Cao An Wang:
  On Greedy Tetrahedralization of Points in 3D. ISAAC 1994: 532-540
• 
  Xiaotie Deng:
  A Convex Hull Algorithm on Coarse-Grained Multiprocessors. ISAAC 1994: 634-64
• 
  Jiyu Ding:
  The Generating Algorithm for Quasi-Full Steiner Trees. ISAAC 1994: 428-432
• 
  Lance Fortnow, John D. Rogers:
  Separability and One-Way Functions. ISAAC 1994: 396-404
• 
  Kunihiro Fujiyoshi, Yoji Kajitani, Hiroshi Niitsu:
  The Totally-Perfect Bipartite Graph and Its Construction. ISAAC 1994: 541-549
• 
  Joachim von zur Gathen, Igor E. Shparlinski:
  Components and Projections of Curves over Finite Fields. ISAAC 1994: 297-305
• 
  C. P. Gopalakrishnan, C. Pandu Rangan:
  Edge-Disjoint Paths in Permutation Graphs. ISAAC 1994: 208-216
• 
  Ronald L. Graham:
  Quasi-Random Combinatorial Structures (Abstract). ISAAC 1994: 10
• 
  Jun Gu:
  Multispace Search: A New Optimization Approach. ISAAC 1994: 252-260
• 
  Jun Gu, Qian-Ping Gu:
  Average Time Complexity of the SAT 1.2 Algorithm. ISAAC 1994: 146-154
• 
  Qian-Ping Gu, Shietung Peng:
  k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. ISAAC 1994: 342-350
• 
  George Havas, Jin Xian Lian:
  A New Problem in String Searching. ISAAC 1994: 660-668
• 
  Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
  Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC 1994: 56-64

skipping 50 more matches