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

• 2000
• 
  Anna Accornero, Massimo Ancona, Sonia Varini:
  All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time. Int. J. Found. Comput. Sci. 11(3): 405-421 (2000)
• 
  Anne Berry, Jean Paul Bordat, Olivier Cogis:
  Generating All the Minimal Separators of a Graph. Int. J. Found. Comput. Sci. 11(3): 397-403 (2000)
• 
  Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri:
  Approximating the Maximum Isomorphic Agreement Subtree is Hard. Int. J. Found. Comput. Sci. 11(4): 579-590 (2000)
• 
  Anu G. Bourgeois, Jerry L. Trahan:
  Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined Buses. Int. J. Found. Comput. Sci. 11(4): 553-571 (2000)
• 
  Seonghun Cho, Sartaj Sahni:
  A New Weight Balanced Binary Search Tree. Int. J. Found. Comput. Sci. 11(3): 485-513 (2000)
• 
  Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Victor Mitrana, György Vaszil:
  Parallel Communicating Pushdown Automata Systems. Int. J. Found. Comput. Sci. 11(4): 633-650 (2000)
• 
  Guozhu Dong, Louxin Zhang:
  Separating Auxiliary Arity Hierarchy of First-Order Incremental Evaluation Systems Using (3k+1)-ary Input Relations. Int. J. Found. Comput. Sci. 11(4): 573-578 (2000)
• 
  Harald Ganzinger, Florent Jacquemard, Margus Veanes:
  Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification. Int. J. Found. Comput. Sci. 11(1): 3-27 (2000)
• 
  Martin Charles Golumbic, Udi Rotics:
  On the Clique-Width of Some Perfect Graph Classes. Int. J. Found. Comput. Sci. 11(3): 423-443 (2000)
• 
  Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
  Mod-2 Independence and Domination in Graphs. Int. J. Found. Comput. Sci. 11(3): 355-363 (2000)
• 
  Masatomo Hashimoto:
  First-Class Contexts in ML. Int. J. Found. Comput. Sci. 11(1): 65-87 (2000)
• 
  Harald Hempel, Gerd Wechsung:
  The Operators min and max on the Polynomial Hierarchy. Int. J. Found. Comput. Sci. 11(2): 315-342 (2000)
• 
  Öjvind Johansson:
  NLC₂-Decomposition in Polynomial Time. Int. J. Found. Comput. Sci. 11(3): 373-395 (2000)
• 
  Johannes Köbler, Wolfgang Lindner:
  Oracles in S^p₂ are Sufficient for Exact Learning. Int. J. Found. Comput. Sci. 11(4): 615-632 (2000)
• 
  Sven Kosub, Heinz Schmitz, Heribert Vollmer:
  Uniform Characterizations of Complexity Classes of Functions. Int. J. Found. Comput. Sci. 11(4): 525-551 (2000)
• 
  Keqin Li:
  A Method for Evaluating the Expected Load of Dynamic Tree Embeddings in Hypercubes. Int. J. Found. Comput. Sci. 11(2): 207-230 (2000)
• 
  Annegret Liebers, Dorothea Wagner, Karsten Weihe:
  On the Hardness of Recognizing Bundles in Time Table Graphs. Int. J. Found. Comput. Sci. 11(3): 467-484 (2000)
• 
  Nihar R. Mahapatra, Shantanu Dutt:
  Random Seeking: A General, Efficient, and Informed Randomized Scheme for Dynamic Load Balancing. Int. J. Found. Comput. Sci. 11(2): 231-246 (2000)
• 
  Ron van der Meyden:
  Predicate Boundedness of Linear Monadic Datalog is in PSPACE. Int. J. Found. Comput. Sci. 11(4): 591-612 (2000)
• 
  Martin Müller, Susumu Nishimura:
  Type Inference for First-Class Messages with Feature Constraints. Int. J. Found. Comput. Sci. 11(1): 29-63 (2000)
• 
  Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung:
  Connectivity Properties in Random Regular Graphs with Edge Faults. Int. J. Found. Comput. Sci. 11(2): 247-262 (2000)
• 
  Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
  Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. 11(3): 445-465 (2000)
• 
  Ichiro Ogata:
  Constructive Classical Logic as CPS-Calculus. Int. J. Found. Comput. Sci. 11(1): 89-112 (2000)
• 
  Takeshi Okadome:
  Some Sufficient Conditions of Learnability in the Limit From Positive Data. Int. J. Found. Comput. Sci. 11(3): 515-524 (2000)
• 
  Gheorghe Paun:
  Computing with Membranes (P Systems): A Variant. Int. J. Found. Comput. Sci. 11(1): 167-181 (2000)
• 
  Ljubomir Perkovic, Bruce A. Reed:
  An Improved Algorithm for Finding Tree Decompositions of Small Width. Int. J. Found. Comput. Sci. 11(3): 365-371 (2000)
• 
  Sanguthevar Rajasekaran, Sartaj Sahni:
  Special Issue on Randomized Computing. Int. J. Found. Comput. Sci. 11(2): 205 (2000)
• 
  Arnold L. Rosenberg:
  Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output. Int. J. Found. Comput. Sci. 11(1): 183-204 (2000)
• 
  Luca Roversi:
  Light Affine Logic as a Programming Language: A First Contribution. Int. J. Found. Comput. Sci. 11(1): 113-152 (2000)
• 
  R. K. Shyamasundar, S. Ramesh:
  Languages for Reactive Specifications: Synchrony Vs Asynchrony. Int. J. Found. Comput. Sci. 11(2): 283-314 (2000)

skipping 3 more matches