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

• 1994
• 
  Ian F. Akyildiz, Horst von Brand:
  Exact Solutions for Networks of Queues with Blocking-After-Service. Theor. Comput. Sci. 125(1): 111-130 (1994)
• 
  François Baccelli, William A. Massey, Paul E. Wright:
  Determining the Exit Time Distribution for a Closed Cyclic Network. Theor. Comput. Sci. 125(1): 149-165 (1994)
• 
  Vineet Bafna, Bala Kalyanasundaram, Kirk Pruhs:
  Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane. Theor. Comput. Sci. 125(2): 345-360 (1994)
• 
  Eric Goles Ch.:
  Lyapunov Operators to Study the Convergence of Extremal Automata. Theor. Comput. Sci. 125(2): 329-337 (1994)
• 
  Ram Chakka, Isi Mitrani:
  Heterogeneous Multiprocessor Systems with Breakdowns: Performance and Optimal Repair Strategies. Theor. Comput. Sci. 125(1): 91-109 (1994)
• 
  Pengyuan Chen:
  The Communication Complexity of Computing Differentiable Functions in a Multicomputer Network. Theor. Comput. Sci. 125(2): 373-383 (1994)
• 
  Edward G. Coffman Jr., Leopold Flatto, Bjorn Poonen, Paul E. Wright:
  The Processor Minimization Problem with Independent Waiting-Time Constraints. Theor. Comput. Sci. 125(1): 3-16 (1994)
• 
  M. B. Combé, Onno J. Boxma:
  Optimization of Static Traffic Allocation Policies. Theor. Comput. Sci. 125(1): 17-43 (1994)
• 
  Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg:
  Properties of Grammatical Codes of Trees. Theor. Comput. Sci. 125(2): 259-293 (1994)
• 
  Paul Gastin, Antoine Petit, Wieslaw Zielonka:
  An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. Theor. Comput. Sci. 125(2): 167-204 (1994)
• 
  Erol Gelenbe, Marisela Hernández:
  Virus Tests to Maximize Availability of Software Systems. Theor. Comput. Sci. 125(1): 131-147 (1994)
• 
  Micha Hofri, Yaakov Kogan:
  Asymptotic Analysis of Product-Form Distributions Related to Large Interconnection Networks. Theor. Comput. Sci. 125(1): 61-90 (1994)
• 
  Tao Jiang, Oscar H. Ibarra, Hui Wang:
  Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata. Theor. Comput. Sci. 125(2): 243-257 (1994)
• 
  Mody Lempel, Azaria Paz:
  An Algorithm for Finding a Shortest Vector in a Two-Dimensional Modular Lattice. Theor. Comput. Sci. 125(2): 229-241 (1994)
• 
  Bruce E. Litow:
  A Context-Free Language Decision Problem. Theor. Comput. Sci. 125(2): 339-343 (1994)
• 
  Graham Louth, Michael Mitzenmacher, Frank Kelly:
  Computational Complexity of Loss Networks. Theor. Comput. Sci. 125(1): 45-59 (1994)
• 
  Alexandru Mateescu:
  Scattered Deletion and Commutativity. Theor. Comput. Sci. 125(2): 361-371 (1994)
• 
  Robert E. Matthews:
  An Inherently Iterative Algorithm for the Grzegorczyk Hierarchy. Theor. Comput. Sci. 125(2): 355-360 (1994)
• 
  Martin Middendorf:
  More on the Complexity of Common Superstring and Supersequence Problems. Theor. Comput. Sci. 125(2): 205-228 (1994)
• 
  Marty J. Wolf:
  Nondeterministic Circuits, Space Complexity and Quasigroups. Theor. Comput. Sci. 125(2): 295-313 (1994)
• 
  Sheng Yu, Qingyu Zhuang, Kai Salomaa:
  The State Complexities of Some Basic Operations on Regular Languages. Theor. Comput. Sci. 125(2): 315-328 (1994)