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

• 2002
• 
  Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe:
  The Data Locality of Work Stealing. Theory Comput. Syst. 35(3): 321-347 (2002)
• 
  Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, Walter Unger:
  Scheduling Time-Constrained Communication in Linear Networks. Theory Comput. Syst. 35(6): 599-623 (2002)
• 
  Ole Agesen, David Detlefs, Christine H. Flood, Alexander T. Garthwaite, Paul Alan Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.:
  DCAS-Based Concurrent Deques. Theory Comput. Syst. 35(3): 349-386 (2002)
• 
  Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe:
  The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. Theory Comput. Syst. 35(4): 449-463 (2002)
• 
  Susanne Albers:
  On Generalized Connection Caching. Theory Comput. Syst. 35(3): 251-267 (2002)
• 
  Rakesh D. Barve, Jeffrey Scott Vitter:
  A Simple and Efficient Parallel Disk Mergesort. Theory Comput. Syst. 35(2): 189-215 (2002)
• 
  Amir M. Ben-Amram, Holger Petersen:
  Improved Bounds for Functions Related to Busy Beavers. Theory Comput. Syst. 35(1): 1-11 (2002)
• 
  Michael A. Bender, Michael O. Rabin:
  Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk. Theory Comput. Syst. 35(3): 289-304 (2002)
• 
  Olivier Bournez, Michael S. Branicky:
  The Mortality Problem for Matrices of Low Dimensions. Theory Comput. Syst. 35(4): 433-448 (2002)
• 
  Costas Busch, Maurice Herlihy:
  Sorting and Counting Networks of Arbitrary Width and Small Depth. Theory Comput. Syst. 35(2): 99-128 (2002)
• 
  Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
  Efficient On-Line Frequency Allocation and Call Control in Cellular Networks. Theory Comput. Syst. 35(5): 521-543 (2002)
• 
  Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana:
  Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees. Theory Comput. Syst. 35(6): 641-665 (2002)
• 
  Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
  Bulk Synchronous Parallel Algorithms for the External Memory Model. Theory Comput. Syst. 35(6): 567-597 (2002)
• 
  Andrzej Ehrenfeucht, Tero Harju, Ion Petre, Grzegorz Rozenberg:
  Characterizing the Micronuclear Gene Patterns in Ciliates. Theory Comput. Syst. 35(5): 501-519 (2002)
• 
  Robert Elsässer, Burkhard Monien, Robert Preis:
  Diffusion Schemes for Load Balancing on Heterogeneous Networks. Theory Comput. Syst. 35(3): 305-320 (2002)
• 
  Shimon Even, Roni Kupershtok:
  Laying Out the Interconnection Network of the Transpose Bijection. Theory Comput. Syst. 35(5): 545-558 (2002)
• 
  Jung-Sheng Fu, Gen-Huey Chen:
  Hamiltonicity of the Hierarchical Cubic Network. Theory Comput. Syst. 35(1): 59-79 (2002)
• 
  Phillip B. Gibbons, John L. Bruno, Steven Phillips:
  Black-Box Correctness Tests for Basic Parallel Data Structures. Theory Comput. Syst. 35(4): 391-432 (2002)
• 
  André Große, Jörg Rothe, Gerd Wechsung:
  Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. Theory Comput. Syst. 35(1): 81-93 (2002)
• 
  Julia Khodor, David K. Gifford:
  Programmed Mutagenesis Is Universal. Theory Comput. Syst. 35(5): 483-500 (2002)
• 
  Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann:
  Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory Comput. Syst. 35(2): 217-245 (2002)
• 
  Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh:
  A Comparison of Asymptotically Scalable Superscalar Processors. Theory Comput. Syst. 35(2): 129-150 (2002)
• 
  An-Chow Lai, Babak Falsafi:
  Optimizing Traffic in DSM Clusters: Fine-Grain Memory Caching versus Page Migration/Replication. Theory Comput. Syst. 35(3): 269-287 (2002)
• 
  Pierre B. A. Lecomte, Michel Rigo:
  On the Representation of Real Numbers Using Regular Languages. Theory Comput. Syst. 35(1): 13-38 (2002)
• 
  Yingjie Liu:
  The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem. Theory Comput. Syst. 35(5): 559-564 (2002)
• 
  Zvi Lotker, Boaz Patt-Shamir:
  Average-Case Analysis of Greedy Packet Scheduling. Theory Comput. Syst. 35(6): 667-683 (2002)
• 
  Girija J. Narlikar:
  Scheduling Threads for Low Space Requirement and Good Locality. Theory Comput. Syst. 35(2): 151-187 (2002)
• 
  Mitsunori Ogihara, Anne Condon:
  Guest Editors' Foreword. Theory Comput. Syst. 35(5): 469 (2002)
• 
  Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis:
  Competitive Call Control in Mobile Networks. Theory Comput. Syst. 35(6): 625-639 (2002)
• 
  Andrei Paun:
  P Systems with Global Rules. Theory Comput. Syst. 35(5): 471-481 (2002)

skipping 5 more matches