Information Processing Letters, Volume 77

Volume 77, Number 1, 31 January 2001

• Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
  On the evolution of the worst-case OBDD size. 1-7
  Electronic Edition (link) BibTeX
• Andris Ambainis:
  On learning formulas in the limit and with assurance. 9-11
  Electronic Edition (link) BibTeX
• Esther M. Arkin, Refael Hassin, Maxim Sviridenko:
  Approximating the maximum quadratic assignment problem. 13-16
  Electronic Edition (link) BibTeX
• Shyue-Ming Tang, Fu-Long Yeh, Yue-Li Wang:
  An efficient algorithm for solving the homogeneous set sandwich problem. 17-22
  Electronic Edition (link) BibTeX
• Xuehou Tan:
  Shortest zookeeper's routes in simple polygons. 23-26
  Electronic Edition (link) BibTeX
• Xuehou Tan:
  Fast computation of shortest watchman routes in simple polygons. 27-33
  Electronic Edition (link) BibTeX
• Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung:
  The shuffle-cubes and their generalization. 35-41
  Electronic Edition (link) BibTeX
• Jean-Marie Le Bars:
  The 0-1 law fails for monadic existential second-order logic on undirected graphs. 43-48
  Electronic Edition (link) BibTeX

Volume 77, Number 2-4, 28 February 2001

• Vicki L. Almstrum, David Gries:
  From the Editors of this special issue. 49-51
  Electronic Edition (link) BibTeX
• Edsger W. Dijkstra:
  Under the spell of Leibniz's dream. 53-61
  Electronic Edition (link) BibTeX
• James H. Anderson, Mark Moir, Srikanth Ramamurthy:
  A simple proof technique for priority-scheduled systems. 63-70
  Electronic Edition (link) BibTeX
• Roland Carl Backhouse, Maarten M. Fokkinga:
  The associativity of equivalence and the Towers of Hanoi problem. 71-76
  Electronic Edition (link) BibTeX
• Lex Bijlsma:
  Model-based specification. 77-84
  Electronic Edition (link) BibTeX
• D. W. Braben:
  Bucking the trends. 85-87
  Electronic Edition (link) BibTeX
• W. H. J. Feijen:
  The joy of formula manipulation. 89-96
  Electronic Edition (link) BibTeX
• Cormac Flanagan, Rajeev Joshi, K. Rustan M. Leino:
  Annotation inference for modular checkers. 97-108
  Electronic Edition (link) BibTeX
• Mohamed G. Gouda:
  Elements of security: Closure, convergence, and protection. 109-114
  Electronic Edition (link) BibTeX
• Ted Herman, Toshimitsu Masuzawa:
  Available stabilizing heaps. 115-121
  Electronic Edition (link) BibTeX
• C. A. R. Hoare:
  Legacy. 123-129
  Electronic Edition (link) BibTeX
• H. Peter Hofstee, Jun Sawada:
  Derivation of a rotator circuit with homogeneous interconnect. 131-135
  Electronic Edition (link) BibTeX
• Rob R. Hoogerwoord:
  Formality works. 137-142
  Electronic Edition (link) BibTeX
• Jerry James, Ambuj K. Singh:
  Recovering distributed objects. 143-150
  Electronic Edition (link) BibTeX
• Anne Kaldewaij, Laurens de Vries:
  Optimal real-time garbage collection for acyclic pointer structures. 151-157
  Electronic Edition (link) BibTeX
• William Leal, Anish Arora:
  State-level and value-level simulations in data refinement. 159-167
  Electronic Edition (link) BibTeX
• K. Rustan M. Leino:
  Real estate of names. 169-171
  Electronic Edition (link) BibTeX
• Panagiotis Manolios, J. Strother Moore:
  On the desirability of mechanizing calculational proofs. 173-179
  Electronic Edition (link) BibTeX
• Alain J. Martin:
  Towards an energy complexity of computation. 181-187
  Electronic Edition (link) BibTeX
• M. Douglas McIlroy:
  The music of streams. 189-195
  Electronic Edition (link) BibTeX
• Jayadev Misra:
  A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation. 197-200
  Electronic Edition (link) BibTeX
• David A. Naumann:
  Calculating sharp adaptation rules. 201-208
  Electronic Edition (link) BibTeX
• Josyula R. Rao:
  On the role of formal methods in security. 209-212
  Electronic Edition (link) BibTeX
• Beverly A. Sanders:
  The shortest path in parallel. 213-217
  Electronic Edition (link) BibTeX

Volume 77, Number 5-6, 31 March 2001

• Xuandong Li, Johan Lilius:
  Efficient verification of a class of time Petri nets using linear programming. 219-224
  Electronic Edition (link) BibTeX
• Gerhard J. Woeginger:
  The reconstruction of polyominoes from their orthogonal projections. 225-229
  Electronic Edition (link) BibTeX
• Limin Xiang, Kazuo Ushijima, Changjie Tang:
  On generating k-ary trees in computer representation. 231-238
  Electronic Edition (link) BibTeX
• Carlos Martín-Vide, Victor Mitrana:
  Some undecidable problems for parallel communicating finite automata systems. 239-245
  Electronic Edition (link) BibTeX
• Paulo A. S. Veloso, Sheila R. M. Veloso:
  On local modularity variants and -institutions. 247-253
  Electronic Edition (link) BibTeX
• Michelangelo Grigni:
  A Sperner lemma complete for PPA. 255-259
  Electronic Edition (link) BibTeX
• Chinda Wongngamnit, Dana Angluin:
  Robot localization in a grid. 261-267
  Electronic Edition (link) BibTeX
• Hiroyuki Kawai, Naohiro Fujikake, Yukio Shibata:
  Factorization of de Bruijn digraphs by cycle-rooted trees. 269-275
  Electronic Edition (link) BibTeX
• Frank Harary, Vladik Kreinovich, Luc Longpré:
  A new graph characteristic and its application to numerical computability. 277-282
  Electronic Edition (link) BibTeX
• Vicent Cholvi, Pablo Boronat:
  A minimal property for characterizing deadlock-free programs. 283-290
  Electronic Edition (link) BibTeX