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

• 2002
• 
  James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook:
  A Functional Approach to External Graph Algorithms. Algorithmica 32(3): 437-458 (2002)
• 
  Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen:
  Improved Algorithms for Uniform Partitions of Points. Algorithmica 32(4): 521-539 (2002)
• 
  Susanne Albers, Klaus Kursawe, Sven Schuierer:
  Exploring Unknown Environments with Obstacles. Algorithmica 32(1): 123-143 (2002)
• 
  Noga Alon, Ayal Zaks:
  Algorithmic Aspects of Acyclic Edge Colorings. Algorithmica 32(4): 611-614 (2002)
• 
  Andris Ambainis, Stephen A. Bloch, David L. Schweizer:
  Delayed Binary Search, or Playing Twenty Questions with a Procrastinator. Algorithmica 32(4): 641-651 (2002)
• 
  Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis:
  Scheduling Independent Multiprocessor Tasks. Algorithmica 32(2): 247-261 (2002)
• 
  Matthew Andrews, Michael A. Bender, Lisa Zhang:
  New Algorithms for Disk Scheduling. Algorithmica 32(2): 277-301 (2002)
• 
  Baruch Awerbuch, Tripurari Singh:
  An Online Algorithm for the Dynamic Maximal Dense Tree Problem. Algorithmica 32(4): 540-553 (2002)
• 
  Ran Bachrach, Ran El-Yaniv, M. Reinstadtler:
  On the Competitive Theory and Practice of Online List Accessing Algorithms. Algorithmica 32(2): 201-245 (2002)
• 
  Eric T. Bax, Joel Franklin:
  A Permanent Algorithm with exp[Omega (n^1/3/2 ln n )] Expected Speedup for 0-1 Matrices. Algorithmica 32(1): 157-162 (2002)
• 
  Amir M. Ben-Amram, Zvi Galil:
  Lower Bounds for Dynamic Data Structures on Algebraic RAMs. Algorithmica 32(3): 364-395 (2002)
• 
  Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo:
  Quasi-Upward Planarity. Algorithmica 32(3): 474-506 (2002)
• 
  Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
  A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. Algorithmica 32(4): 594-610 (2002)
• 
  Edith Cohen, Haim Kaplan:
  Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach. Algorithmica 32(3): 459-466 (2002)
• 
  Andreas Crauser, Paolo Ferragina:
  A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory. Algorithmica 32(1): 1-35 (2002)
• 
  David Eppstein, Marshall W. Bern, Brad L. Hutchings:
  Algorithms for Coloring Quadtrees. Algorithmica 32(1): 87-94 (2002)
• 
  Thomas Erlebach, Torben Hagerup:
  Routing Flow Through a Strongly Connected Graph. Algorithmica 32(3): 467-473 (2002)
• 
  Esteban Feuerstein, Alejandro Strejilevich de Loma:
  On-Line Multi-Threaded Paging. Algorithmica 32(1): 36-60 (2002)
• 
  Dimitris Fotakis, Paul G. Spirakis:
  Minimum Congestion Redundant Assignments to Tolerate Random Faults. Algorithmica 32(3): 396-422 (2002)
• 
  Oded Goldreich, Dana Ron:
  Property Testing in Bounded Degree Graphs. Algorithmica 32(2): 302-343 (2002)
• 
  John G. Del Greco, Chandra N. Sekharan, R. Sridhar:
  Fast Parallel Reordering and Isomorphism Testing of k-Trees. Algorithmica 32(1): 61-72 (2002)
• 
  Dan Gusfield, Charles U. Martel:
  The Structure and Complexity of Sports Elimination Numbers. Algorithmica 32(1): 73-86 (2002)
• 
  Sandy Irani:
  Randomized Weighted Caching with Two Page Weights. Algorithmica 32(4): 624-640 (2002)
• 
  Klaus Jansen, Lorant Porkolab:
  Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. Algorithmica 32(3): 507-520 (2002)
• 
  Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida:
  A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. Algorithmica 32(2): 262-276 (2002)
• 
  Tracy Kimbrel:
  Interleaved Prefetching. Algorithmica 32(1): 107-122 (2002)
• 
  Susan Landau, Neil Immerman:
  Embedding Linkages on an Integer Lattice. Algorithmica 32(3): 423-436 (2002)
• 
  Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid:
  Improved Algorithms for Constructing Fault-Tolerant Spanners. Algorithmica 32(1): 144-156 (2002)
• 
  Yin Li, William F. Smyth:
  Computing the Cover Array in Linear Time. Algorithmica 32(1): 95-106 (2002)
• 
  Lata Narayanan, Sunil M. Shende:
  Corrigendum: Static Frequency Assignment in Cellular Networks. Algorithmica 32(4): 679 (2002)

skipping 6 more matches