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- Andris Ambainis: On learning formulas in the limit and with assurance. 9-11
- Esther M. Arkin, Refael Hassin, Maxim Sviridenko: Approximating the maximum quadratic assignment problem. 13-16
- Shyue-Ming Tang, Fu-Long Yeh, Yue-Li Wang: An efficient algorithm for solving the homogeneous set sandwich problem. 17-22
- Xuehou Tan: Shortest zookeeper's routes in simple polygons. 23-26
- Xuehou Tan: Fast computation of shortest watchman routes in simple polygons. 27-33
- Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu, Ting-Yi Sung: The shuffle-cubes and their generalization. 35-41
- Jean-Marie Le Bars: The 0-1 law fails for monadic existential second-order logic on undirected graphs. 43-48
Volume 77, Number 2-4, 28 February 2001
- Edsger W. Dijkstra: Under the spell of Leibniz's dream. 53-61
- James H. Anderson, Mark Moir, Srikanth Ramamurthy: A simple proof technique for priority-scheduled systems. 63-70
- Roland Carl Backhouse, Maarten M. Fokkinga: The associativity of equivalence and the Towers of Hanoi problem. 71-76
- Lex Bijlsma: Model-based specification. 77-84
- D. W. Braben: Bucking the trends. 85-87
- W. H. J. Feijen: The joy of formula manipulation. 89-96
- Cormac Flanagan, Rajeev Joshi, K. Rustan M. Leino: Annotation inference for modular checkers. 97-108
- Mohamed G. Gouda: Elements of security: Closure, convergence, and protection. 109-114
- C. A. R. Hoare: Legacy. 123-129
- H. Peter Hofstee, Jun Sawada: Derivation of a rotator circuit with homogeneous interconnect. 131-135
- Rob R. Hoogerwoord: Formality works. 137-142
- Anne Kaldewaij, Laurens de Vries: Optimal real-time garbage collection for acyclic pointer structures. 151-157
- K. Rustan M. Leino: Real estate of names. 169-171
- Panagiotis Manolios, J. Strother Moore: On the desirability of mechanizing calculational proofs. 173-179
- Alain J. Martin: Towards an energy complexity of computation. 181-187
- M. Douglas McIlroy: The music of streams. 189-195
- Jayadev Misra: A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation. 197-200
- David A. Naumann: Calculating sharp adaptation rules. 201-208
- Josyula R. Rao: On the role of formal methods in security. 209-212
- Beverly A. Sanders: The shortest path in parallel. 213-217
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
- Gerhard J. Woeginger: The reconstruction of polyominoes from their orthogonal projections. 225-229
- Limin Xiang, Kazuo Ushijima, Changjie Tang: On generating k-ary trees in computer representation. 231-238
- Carlos Martín-Vide, Victor Mitrana: Some undecidable problems for parallel communicating finite automata systems. 239-245
- Michelangelo Grigni: A Sperner lemma complete for PPA. 255-259
- Hiroyuki Kawai, Naohiro Fujikake, Yukio Shibata: Factorization of de Bruijn digraphs by cycle-rooted trees. 269-275
- Frank Harary, Vladik Kreinovich, Luc Longpré: A new graph characteristic and its application to numerical computability. 277-282
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17T203624 by the dblp team