Information Processing Letters, Volume 74

Volume 74, Numbers 1-2, April 2000

• Johan Håstad:
  On bounded occurrence constraint satisfaction. 1-6
  Electronic Edition (link) BibTeX
• François Bertault:
  A force-directed algorithm that preserves edge-crossing properties. 7-13
  Electronic Edition (link) BibTeX
• Manfred Göbel:
  Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order. 15-18
  Electronic Edition (link) BibTeX
• Alok Baveja, Aravind Srinivasan:
  Approximating low-congestion routing and column-restricted packing problems. 19-25
  Electronic Edition (link) BibTeX
• Jean-Marc Talbot:
  The forall-exists² fragment of the first-order theory of atomic set constraints is Pi⁰₁-hard. 27-33
  Electronic Edition (link) BibTeX
• Joachim Niehren, Sophie Tison, Ralf Treinen:
  On rewrite constraints and context unification. 35-40
  Electronic Edition (link) BibTeX
• Arnold Schönhage:
  Variations on computing reciprocals of power series. 41-46
  Electronic Edition (link) BibTeX
• Margus Veanes:
  Farmer's Theorem revisited. 47-53
  Electronic Edition (link) BibTeX
• Carlos H. C. Duarte, T. S. E. Maibaum:
  A rely-guarantee discipline for open distributed systems design. 55-63
  Electronic Edition (link) BibTeX
• Theodosis Dimitrakos, T. S. E. Maibaum:
  On a generalized modularization theorem. 65-71
  Electronic Edition (link) BibTeX
• Wolfgang W. Bein, Lawrence L. Larmore:
  Trackless online algorithms for the server problem. 73-79
  Electronic Edition (link) BibTeX
• Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li:
  An algorithm for finding a k-median in a directed tree. 81-88
  Electronic Edition (link) BibTeX
• Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe:
  Corrigendum to "Upward separation for FewP and related classes". 89
  Electronic Edition (link) BibTeX

Volume 74, Numbers 3-4, 31 May 2000

• Ingo Wegener:
  Worst case examples for operations on OBDDs. 91-96
  Electronic Edition (link) BibTeX
• Sarnath Ramnath, Peiyi Zhao:
  On the isomorphism of expressions. 97-102
  Electronic Edition (link) BibTeX
• Kuo-Liang Chung:
  On finding medians of weighted discrete points. 103-106
  Electronic Edition (link) BibTeX
• Harold N. Gabow:
  Path-based depth-first search for strong and biconnected components. 107-114
  Electronic Edition (link) BibTeX
• Ton Kloks, Dieter Kratsch, Haiko Müller:
  Finding and counting small induced subgraphs efficiently. 115-121
  Electronic Edition (link) BibTeX
• Satoru Iwata, S. Thomas McCormick, Maiko Shigeno:
  A fast cost scaling algorithm for submodular flow. 123-128
  Electronic Edition (link) BibTeX
• Stavros D. Nikolopoulos:
  Recognizing cographs and threshold graphs through a classification of their edges. 129-139
  Electronic Edition (link) BibTeX
• Laurent Granvilliers, Gaétan Hains:
  A conservative scheme for parallel interval narrowing. 141-146
  Electronic Edition (link) BibTeX
• Agostino Dovier, Enrico Pontelli, Gianfranco Rossi:
  A necessary condition for Constructive Negation in Constraint Logic Programming. 147-156
  Electronic Edition (link) BibTeX
• Dimitris J. Kavvadias, Martha Sideri, Elias C. Stavropoulos:
  Generating all maximal models of a Boolean expression. 157-162
  Electronic Edition (link) BibTeX
• Joseph Kee-Yin Ng, Shibin Song, Wei Zhao:
  Statistical delay analysis on an ATM switch with self-similar input traffic. 163-173
  Electronic Edition (link) BibTeX
• Markus Schneider II:
  On distribution properties of sequences with perfect linear complexity profile. 175-182
  Electronic Edition (link) BibTeX

Volume 74, Numbers 5-6, 30 June 2000

• Cao An Wang, Francis Y. L. Chin, Boting Yang:
  Triangulations without minimum-weight drawing. 183-189
  Electronic Edition (link) BibTeX
• Palash Sarkar:
  A note on the spectral characterization of correlation immune Boolean functions. 191-195
  Electronic Edition (link) BibTeX
• Pavel Pudlák:
  A note on the use of determinant for proving lower bounds on the size of linear circuits. 197-201
  Electronic Edition (link) BibTeX
• Jérôme Olivier Durand-Lose:
  Randomized uniform self-stabilizing mutual exclusion. 203-207
  Electronic Edition (link) BibTeX
• Jae Dong Yang:
  A concept-based query evaluation with indefinite fuzzy triples. 209-214
  Electronic Edition (link) BibTeX
• Sukhamay Kundu:
  An optimal O(N²) algorithm for computing the min-transitive closure of a weighted graph. 215-220
  Electronic Edition (link) BibTeX
• Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper:
  An efficient automata approach to some problems on context-free grammars. 221-227
  Electronic Edition (link) BibTeX
• Weimin Chen:
  Multi-subsequence searching. 229-233
  Electronic Edition (link) BibTeX
• Byoung Mo Im, Myoung-Ho Kim, Hyung-Il Kang, Jae Soo Yoo:
  Declustering signature files based on a dynamic measure. 235-241
  Electronic Edition (link) BibTeX
• Alfredo De Santis, Barbara Masucci:
  On secret set schemes. 243-251
  Electronic Edition (link) BibTeX
• Gautam Das, Michiel H. M. Smid:
  A lower bound for approximating the geometric minimum weight matching. 253-255
  Electronic Edition (link) BibTeX
• Jenn-Wei Lin, Sy-Yen Kuo:
  Resolving error propagation in distributed systems. 257-262
  Electronic Edition (link) BibTeX
• Samir Khuller:
  Addendum to "An O(|V|²) algorithm for single connectedness". 263
  Electronic Edition (link) BibTeX