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

• 1992
• 
  Stefan Arnborg, Andrzej Proskurowski:
  Canonical Representations of Partial 2- and 3-Trees. BIT 32(2): 197-214 (1992)
• 
  Ricardo A. Baeza-Yates, Gaston H. Gonnet, Nivio Ziviani:
  Improved Bounds for the Expected Behaviour of AVL Trees. BIT 32(2): 297-315 (1992)
• 
  Johann Blieberger, Ulrich Schmid:
  FCFS-Scheduling in a Hard Real-Time Environment Under Rush-Hour Conditions. BIT 32(3): 370-383 (1992)
• 
  Ravi B. Boppana, Magnús M. Halldórsson:
  Approximating Maximum Independent Sets by Excluding Subgraphs. BIT 32(2): 180-196 (1992)
• 
  Tung-Shou Chen, Wei-Pang Yang, Richard C. T. Lee:
  Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN, and N-Step SCAN. BIT 32(4): 546-558 (1992)
• 
  Loïc Colson:
  On List Primitive Recursion and the Complexity of Computing inf. BIT 32(1): 5-9 (1992)
• 
  Kris Coolsaet, Hans E. De Meyer, Veerle Fack:
  Optimal Algorithms for Total Exchange without Buffering on the Hypercube. BIT 32(4): 559-569 (1992)
• 
  Thierry Coquand:
  The Paradox of Trees in Type Theory. BIT 32(1): 10-14 (1992)
• 
  Joëlle Despeyroux:
  Theo: An Interactive Proof Development System. BIT 32(1): 15-29 (1992)
• 
  David Eppstein:
  Finding the k Smallest Spanning Trees. BIT 32(2): 237-248 (1992)
• 
  Daniel Fredholm, Svetozar Serafimovski:
  Partial Inductive Definitions as Type-Systems for lambda-Terms. BIT 32(1): 30-44 (1992)
• 
  Jeannette M. de Graaf, Walter A. Kosters:
  Expected Heights in Heaps. BIT 32(4): 570-579 (1992)
• 
  Lars Hallnäs:
  On Systems of Definitions, Induction and Recursion. BIT 32(1): 45-63 (1992)
• 
  John Hershberger, Subhash Suri:
  Applications of a Semi-Dynamic Convex Hull Algorithm. BIT 32(2): 249-267 (1992)
• 
  Mamoru Hoshi, Philippe Flajolet:
  Page Usage in a Quadtree Index. BIT 32(3): 384-402 (1992)
• 
  Rong-Hong Jan, Lih-Hsing Hsu, Yueh-Ying Lee:
  The Most Vital Edges with Respect to the Number of Spanning Trees in Two-Terminal Series-Parallel Graphs. BIT 32(3): 403-412 (1992)
• 
  Jyrki Katajainen, Tomi Pasanen:
  Stable Minimum Space Partitioning in Linear Time. BIT 32(4): 580-585 (1992)
• 
  Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal:
  Intersection Queries in Sets of Disks. BIT 32(2): 268-279 (1992)
• 
  Christos Levcopoulos, Andrzej Lingas:
  Fast Algorithms for Greedy Triangulation. BIT 32(2): 280-296 (1992)
• 
  Mark Levene, George Loizou:
  Inferring Null Join Dependencies in Relational Databases. BIT 32(3): 413-429 (1992)
• 
  Harry G. Mairson:
  The Effect of Table Expansion on the Program Complexity of Perfect Hash Funtions. BIT 32(3): 430-440 (1992)
• 
  Grigori Mints:
  Complexity of Subclasses of the Intuitionistic Propositional Calculus. BIT 32(1): 64-69 (1992)
• 
  Stephan Olariu, James L. Schwing, Jingyuan Zhang:
  A Constant-Time Channel-Assignment Algorithm on Reconfigurable Meshes. BIT 32(4): 586-597 (1992)
• 
  Erik Palmgren, Viggo Stoltenberg-Hansen:
  Remarks on Martin-Löf's Partial Type Theory. BIT 32(1): 70-83 (1992)
• 
  Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
  Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs. BIT 32(2): 215-236 (1992)
• 
  Thomas Papadakis, J. Ian Munro, Patricio V. Poblete:
  Average Search and Update Costs in Skip Lists. BIT 32(2): 316-332 (1992)
• 
  A. Louise Perkins:
  A Mixed Directed-Undirected Data Structure for a Parallel Implementation of a Domain Decomposition Algorithm. BIT 32(4): 598-608 (1992)
• 
  Anne Salvesen:
  On Specifications, Subset Types and Interpretation of Proposition in Type Theory. BIT 32(1): 84-101 (1992)
• 
  Chang-Wu Yu, Gen-Huey Chen:
  The Weighted Maximum Independent Set Problem in Permutation Graphs. BIT 32(4): 609-618 (1992)