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

• 1987
• 
  Mostafa A. Bassiouni, U. Khamare:
  Algorithms for Reducing Rollbacks in Concurrency Control by Certification. BIT 27(4): 441-457 (1987)
• 
  Ferenc Belik:
  Deadlock Avoidance with a Modified Banker's Algorithm. BIT 27(3): 290-305 (1987)
• 
  H. A. Burgdorff, Sushil Jajodia, Frederick N. Springsteel, Yechezkel Zalcstein:
  Alternative Methods for the Reconstruction of Trees from Their Traversals. BIT 27(2): 133-140 (1987)
• 
  Svante Carlsson:
  Average-Case Results on Heapsort. BIT 27(1): 2-17 (1987)
• 
  Chin-Chen Chang, C. Y. Chen:
  Performance of Two-Disk Partition Data Allocations. BIT 27(3): 306-314 (1987)
• 
  Gen-Huey Chen, Maw-Sheng Chern, Richard C. T. Lee:
  A New Systolic Architecture for Convex Hull and Half-Plane Intersection Problems. BIT 27(2): 141-147 (1987)
• 
  Rade Doroslovacki, Ivan Stojmenovic, Ratko Tosic:
  Generating and Counting Triangular Systems. BIT 27(1): 18-24 (1987)
• 
  Donald K. Friesen, Michael A. Langston:
  Bin Packing: On Optimizing the Number of Pieces Packed. BIT 27(2): 148-156 (1987)
• 
  A. Hasham, Jörg-Rüdiger Sack:
  Bounds for Min-Max Heaps. BIT 27(3): 315-323 (1987)
• 
  Barry Joe, R. B. Simpson:
  Corrections to Lee's Visibility Polygon Algorithm. BIT 27(4): 458-473 (1987)
• 
  Jan van Leeuwen, Jirí Wiedermann:
  Array Processing Machines: An Abstract Model. BIT 27(1): 25-43 (1987)
• 
  Andrzej Lingas, Christos Levcopoulos, Jörg-Rüdiger Sack:
  Algorithms for Minimum Length Partitions of Polygons. BIT 27(4): 474-479 (1987)
• 
  George Loizou, Peter Thanisch:
  On Finding a Worst-Case Optimal Fourth Normal Form Database Decomposition. BIT 27(2): 157-162 (1987)
• 
  Erkki Mäkinen:
  Left Distance Binary Tree Representations. BIT 27(2): 163-169 (1987)
• 
  Erkki Mäkinen:
  On Top-Down Splaying. BIT 27(3): 330-339 (1987)
• 
  Rami G. Melhem:
  Verification of a Class of Self-Timed Computational Networks. BIT 27(4): 480-500 (1987)
• 
  J. Ian Munro, Patricio V. Poblete:
  Searchability in Merging and Implicit Data Structures. BIT 27(3): 324-329 (1987)
• 
  Mark T. Noga:
  Sorting in Parallel by Double Distributive Partitioning. BIT 27(3): 340-348 (1987)
• 
  Shaunak Pawagi:
  Maximum Weight Independent Set in Trees. BIT 27(2): 170-180 (1987)
• 
  Lutz M. Wegner:
  A Generalized, One-Way, Stackless Quicksort. BIT 27(1): 44-48 (1987)