• 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

• 1985
• 
  Jonathan R. Agre, Satish K. Tripathi:
  Approximate Solution to Multichain Queueing Networks with State Dependent Service Rates. Perform. Evaluation 5(1): 45-55 (1985)
• 
  Mostafa H. Ammar, Johnny W. Wong:
  The Design of Teletext Broadcast Cycles. Perform. Evaluation 5(4): 235-242 (1985)
• 
  Alexandre Brandwajn:
  Equivalence and Decomposition in Queueing Systems - A Unified Approach. Perform. Evaluation 5(3): 175-186 (1985)
• 
  Gary J. Chastek, John P. Kearns:
  Efficient Computation of Optimal Space-Time Performance Curves for Memory Hierarchies. Perform. Evaluation 5(4): 215-223 (1985)
• 
  Ora Ganz, Imrich Chlamtac:
  Analysis of Multiple-Bus Synchronous and Asynchronous Communication Systems. Perform. Evaluation 5(1): 1-13 (1985)
• 
  Oliver C. Ibe, Kiyoshi Maruyama:
  An Approximation Method for a Class of Queueing Systems. Perform. Evaluation 5(1): 15-27 (1985)
• 
  Yakov A. Kogan II, Leonid B. Boguslavsky:
  Asymptotic Analysis of Memory Interference in Multiprocessors with Private Cache Memories. Perform. Evaluation 5(2): 97-104 (1985)
• 
  Yakov A. Kogan II, Eugene A. Fainberg, Aleksey N. Smirnov:
  Optimal Control by the Retransmission Probability in Slotted ALOHA Systems. Perform. Evaluation 5(2): 85-96 (1985)
• 
  Ton de Kok, Henk C. Tijms:
  A Two-Moment Approximation for a Buffer Design Problem Requiring a Small Rejection Probability. Perform. Evaluation 5(2): 77-84 (1985)
• 
  Janina Mincer-Daszkiewicz, Zbigniew Weiss:
  A Reference String Sampling Method with Dynamically Changing Parameters. Perform. Evaluation 5(4): 257-269 (1985)
• 
  Robert J. T. Morris, Wing Shing Wong:
  Performance Analysis of Locking and Optimistic Concurrency Control Algorithms. Perform. Evaluation 5(2): 105-118 (1985)
• 
  Randolph D. Nelson, Balakrishna R. Iyer:
  Analysis of a Replicated Data Base. Perform. Evaluation 5(3): 133-148 (1985)
• 
  Marcel F. Neuts:
  A Queueing Model for a Storage Buffer in Which the Arrival Rate is Controlled by a Switch with a Random Delay. Perform. Evaluation 5(4): 243-256 (1985)
• 
  Thomas G. Robertazzi, Aurel A. Lazar:
  On the Modeling and Optimal Flow Control of the Jacksonian Network. Perform. Evaluation 5(1): 29-43 (1985)
• 
  Jeffrey R. Spirn, Shalom Tsur:
  Memory Management for B-Trees. Perform. Evaluation 5(3): 159-174 (1985)
• 
  Constantine D. Spyropoulos, David J. Evans:
  Generalized Worst-Case Bounds for an Homogeneous Multiprocessor Model with Independent Memories - Completion Time Performance Criterion. Perform. Evaluation 5(4): 225-234 (1985)
• 
  Hideaki Takagi:
  On the Analysis of a Symmetric Polling System with Single-Message Buffers. Perform. Evaluation 5(3): 149-157 (1985)
• 
  Hideaki Takagi:
  Analysis of a Finite-Capacity M/G/1 Queue with a Resume Level. Perform. Evaluation 5(3): 197-203 (1985)
• 
  Hideaki Takagi:
  Mean Message Waiting Times in Symmetric Multi-Queue Systems with Cyclic Service. Perform. Evaluation 5(4): 271-277 (1985)
• 
  Salvatore Tucci, Charles H. Sauer:
  The Tree MVA Algorithm. Perform. Evaluation 5(3): 187-196 (1985)