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

• 1986
• 
  Alfs T. Berztiss:
  A Taxonomy of Binary Tree Traversals. BIT 26(3): 266-276 (1986)
• 
  Keith Brinck:
  Computing Parent Nodes in Threaded Binary Trees. BIT 26(4): 401-409 (1986)
• 
  Becky Chan, Selim G. Akl:
  Generating Combinations in Parallel. BIT 26(1): 1-6 (1986)
• 
  Chin-Chen Chang:
  On the Design of a Key-Lock-Pair Mechanism in Information Protection Systems. BIT 26(4): 410-417 (1986)
• 
  R. C. Chang, Richard C. T. Lee:
  An O(N log N) Minimal Spanning Tree Algorithm for N Points in the Plane. BIT 26(1): 7-16 (1986)
• 
  Pranay Chaudhuri, Ratan K. Ghosh:
  Parallel Algorithms for Analyzing Activity Networks. BIT 26(4): 418-429 (1986)
• 
  Gen-Huey Chen, Maw-Sheng Chern:
  Parallel Generation of Permutations and Conbinations. BIT 26(3): 277-283 (1986)
• 
  Hung-Chang Du:
  Disk Allocation Methods for Binary Cartesian Product Files. BIT 26(2): 138-147 (1986)
• 
  Anders Edenbrandt:
  Quotient Tree Partitioning of Undirected Graphs. BIT 26(2): 148-155 (1986)
• 
  Wm. Randolph Franklin, Varol Akman:
  Reconstructing Visible Regions from Visible Segments. BIT 26(4): 430-441 (1986)
• 
  Shou-Hsuan Stephen Huang:
  Ordered Priority Queues. BIT 26(4): 442-450 (1986)
• 
  Jeffrey H. Kingston:
  The Amortized Complexity of Henriksen's Algorithm. BIT 26(2): 156-163 (1986)
• 
  Jakob Krarup, Peter M. Pruzan:
  Assessment of Approximate Algorithms: The Error Measure's Crucial Role. BIT 26(3): 284-294 (1986)
• 
  Guy Louchard:
  Brownian Motion and Algorithm Complexity. BIT 26(1): 17-34 (1986)
• 
  Sigurd Meldal:
  An Axiomatic Semantics for Nested Concurrency. BIT 26(2): 164-174 (1986)
• 
  Sigurd Meldal:
  Partial Correctness of Exits from Concurrent Structures. BIT 26(3): 295-302 (1986)
• 
  Peter Naur:
  Thinking and Turing's Test. BIT 26(2): 175-187 (1986)
• 
  Michael J. Quinn, Narsingh Deo:
  An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound Algorithms. BIT 26(1): 35-43 (1986)
• 
  Heikki Saikkonen, Stefan Rönn:
  Distributed Termination on a Ring. BIT 26(2): 188-194 (1986)
• 
  Robert Schreiber:
  On Systolic Array Methods for Band Matrix Factorizations. BIT 26(3): 303-316 (1986)
• 
  Robert Schreiber, Wei-Pai Tang:
  On On Systolic Arrays for Updating the Cholesky Factorization. BIT 26(4): 451-466 (1986)
• 
  Pawel Winter:
  An Algorithm for the Enumeration of Spanning Trees. BIT 26(1): 44-62 (1986)
• 
  D. Yun Yeh:
  A Dynamic Programming Approach to the Complete Set Partitioning Problem. BIT 26(4): 467-474 (1986)
• 
  Yixin Zhang:
  A Note on Parallel Depth First Search. BIT 26(2): 195-198 (1986)