Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
From the editors of this special issue
Vicki L. Almstrum
,
David Gries
Information Processing Letters
77
(2-4), 2001, pp. 49-51
Under the spell of Leibniz's dream
Edsger W. Dijkstra
Information Processing Letters
77
(2-4), 2001, pp. 53-61
A simple proof technique for priority-scheduled systems
James H. Anderson
,
Mark Moir
,
Srikanth Ramamurthy
Information Processing Letters
77
(2-4), 2001, pp. 63-70
The associativity of equivalence and the towers of Hanoi problem
Roland Backhouse
,
Maarten Fokkinga
Information Processing Letters
77
(2-4), 2001, pp. 71-76
Model-based specification
Lex Bijlsma
Information Processing Letters
77
(2-4), 2001, pp. 77-84
Bucking the trends
D.W. Braben
Information Processing Letters
77
(2-4), 2001, pp. 85-87
The joy of formula manipulation
W.H.J. Feijen
Information Processing Letters
77
(2-4), 2001, pp. 89-96
Annotation inferene for modular checkers
Cormac Flanagan
,
Rajeev Joshi
,
K. Rustan M. Leino
Information Processing Letters
77
(2-4), 2001, pp. 97-108
Elements of security: Closure, convergence, and protection
Mohamed G. Gouda
Information Processing Letters
77
(2-4), 2001, pp. 109-114
Available stabilizing heaps
Ted Herman
,
Toshimitsu Masuzawa
Information Processing Letters
77
(2-4), 2001, pp. 115-121
Legacy
Tony Hoare
Information Processing Letters
77
(2-4), 2001, pp. 123-129
Derivation of a rotator circuit with homogeneous interconnect
H. Peter Hofstee
,
Jun Sawada
Information Processing Letters
77
(2-4), 2001, pp. 131-135
Formality works
Rob R. Hoogerwoord
Information Processing Letters
77
(2-4), 2001, pp. 137-142
Recovering distributed objects
Jerry James
,
Ambuj K. Singh
Information Processing Letters
77
(2-4), 2001, pp. 143-150
Optimal real-time garbage collection for acyclic pointer structures
Anne Kaldewaij
,
Laurens de Vries
Information Processing Letters
77
(2-4), 2001, pp. 151-157
State-level and value-level simulations in data refinement
William Leal
,
Anish Arora
Information Processing Letters
77
(2-4), 2001, pp. 159-167
Real estate of names
K. Rustan M. Leino
Information Processing Letters
77
(2-4), 2001, pp. 169-171
On the desirability of mechanizing calculational proofs
Panagiotis Manolios
,
J Strother Moore
Information Processing Letters
77
(2-4), 2001, pp. 173-179
Towards an energy complexity of computation
Alain J. Martin
Information Processing Letters
77
(2-4), 2001, pp. 181-187
The music of streams
M. Douglas McIlroy
Information Processing Letters
77
(2-4), 2001, pp. 189-195
A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation
Jayadev Misra
Information Processing Letters
77
(2-4), 2001, pp. 197-200
Calculating sharp adaptation rules
David A. Naumann
Information Processing Letters
77
(2-4), 2001, pp. 201-208
On the role of formal methods in security
Josyula R. Rao
Information Processing Letters
77
(2-4), 2001, pp. 209-212
The shortest path in parallel
Beverly A. Sanders
Information Processing Letters
77
(2-4), 2001, pp. 213-217
Efficient verification of a class of time Petri nets using linear programming
Xuandong Li
,
Johan Lilius
Information Processing Letters
77
(5-6), 2001, pp. 219-224
Seiten
<
1
2
3
4
5
6
>