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

• 2001
• 
  Alessandro Agnetis, Paolo Detti, Carlo Meloni, Dario Pacciarelli:
  A linear algorithm for the Hamiltonian completion number of the line graph of a tree. Inf. Process. Lett. 79(1): 17-24 (2001)
• 
  Neil C. Audsley:
  On priority assignment in fixed priority scheduling. Inf. Process. Lett. 79(1): 39-44 (2001)
• 
  Valmir Carneiro Barbosa, Mario R. F. Benevides, Ayru L. Oliveira Filho:
  A priority dynamics for generalized drinking philosophers. Inf. Process. Lett. 79(4): 189-195 (2001)
• 
  József Békési, Gábor Galambos:
  Worst-case analysis of the Iterated Longest Fragment algorithm. Inf. Process. Lett. 79(3): 147-153 (2001)
• 
  Binay K. Bhattacharya, Robert Benkoczi:
  On computing the optimal bridge between two convex polygons. Inf. Process. Lett. 79(5): 215-221 (2001)
• 
  Paola Bonizzoni, Claudio Ferretti, Giancarlo Mauri, Rosalba Zizza:
  Separating some splicing models. Inf. Process. Lett. 79(6): 255-259 (2001)
• 
  Brona Brejová:
  Analyzing variants of Shellsort. Inf. Process. Lett. 79(5): 223-227 (2001)
• 
  Jochen Burghardt, Florian Kammüller, Jeff W. Sanders:
  On the antisymmetry of Galois embeddings. Inf. Process. Lett. 79(2): 57-63 (2001)
• 
  Jan Van den Bussche:
  Rewriting queries using views over monadic database schemas. Inf. Process. Lett. 79(3): 111-114 (2001)
• 
  Yu-Wei Chen, Kuo-Liang Chung:
  Fault-tolerant algorithm for Fast Fourier Transform on hypercubes. Inf. Process. Lett. 79(1): 11-16 (2001)
• 
  Lusheng Chen, Fang-Wei Fu, Victor K. Wei:
  On the constructions of highly nonlinear zigzag functions and unbiased functions. Inf. Process. Lett. 79(3): 135-140 (2001)
• 
  Kien-Weh Chin, Hsu-Chun Yen:
  The symmetry number problem for trees. Inf. Process. Lett. 79(2): 73-79 (2001)
• 
  Piotr Chrzastowski-Wachtel, Jerzy Tyszkiewicz, Achim G. Hoffmann, Arthur Ramer:
  Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker. Inf. Process. Lett. 79(4): 155-160 (2001)
• 
  Kuo-Liang Chung, Wen-Ming Yan:
  An efficient algorithm for the Fourier transform on a compressed image in restricted quadtree and shading format. Inf. Process. Lett. 79(1): 1-5 (2001)
• 
  Stavros S. Cosmadakis, Gabriel M. Kuper, Leonid Libkin:
  On the orthographic dimension of definable sets. Inf. Process. Lett. 79(3): 141-145 (2001)
• 
  Adrian Dumitrescu, William L. Steiger:
  Space-time trade-offs for some ranking and searching queries. Inf. Process. Lett. 79(5): 237-241 (2001)
• 
  Friedrich Eisenbrand:
  Short vectors of planar lattices via continued fractions. Inf. Process. Lett. 79(3): 121-126 (2001)
• 
  Uriel Feige, Marek Karpinski, Michael Langberg:
  A note on approximating Max-Bisection on regular graphs. Inf. Process. Lett. 79(4): 181-188 (2001)
• 
  Robert Fidytek, Andrzej Wlodzimierz Mostowski, Rafal Somla, Andrzej Szepietowski:
  Algorithms counting monotone Boolean functions. Inf. Process. Lett. 79(5): 203-209 (2001)
• 
  Toshihiro Fujito:
  On approximability of the independent/connected edge dominating set problems. Inf. Process. Lett. 79(6): 261-266 (2001)
• 
  Alex de V. Garcia, Edward Hermann Haeusler:
  Code migration and program maintainability A categorical perspective. Inf. Process. Lett. 79(5): 249-254 (2001)
• 
  Rachid Guerraoui:
  On the hardness of failure-sensitive agreement problems. Inf. Process. Lett. 79(2): 99-104 (2001)
• 
  Eric C. R. Hehner:
  Variables and scopes considered formally. Inf. Process. Lett. 79(1): 33-38 (2001)
• 
  Jaap-Henk Hoepman:
  Can an operation both update the state and return a meaningful value in the asynchronous PRAM model? Inf. Process. Lett. 79(4): 161-166 (2001)
• 
  Graham Hutton, Jeremy Gibbons:
  The generic approximation lemma. Inf. Process. Lett. 79(4): 197-201 (2001)
• 
  Kil-Hyun Jeong, Jong-Kyu Lee, Hee-Kuck Oh:
  Performance analysis of a multicasting protocol with contention-less minislots. Inf. Process. Lett. 79(3): 127-133 (2001)
• 
  Emanuel Knill, Raymond Laflamme:
  Quantum computing and quadratically signed weight enumerators. Inf. Process. Lett. 79(4): 173-179 (2001)
• 
  Svetlana A. Kravchenko, Frank Werner:
  A heuristic algorithm for minimizing mean flow time with unit setups. Inf. Process. Lett. 79(6): 291-296 (2001)
• 
  Christof Löding:
  Efficient minimization of deterministic weak omega-automata. Inf. Process. Lett. 79(3): 105-109 (2001)
• 
  Gianluca De Marco, Andrzej Pelc:
  Faster broadcasting in unknown radio networks. Inf. Process. Lett. 79(2): 53-56 (2001)

skipping 17 more matches