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 Volume=77
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the evolution of the worst-case OBDD size
Clemens Gröpl
,
Hans Jürgen Prömel
,
Anand Srivastav
Information Processing Letters
77
(1), 2001, pp. 1-7
On learning formulas in the limit and with assurance
Andris Ambainis
Information Processing Letters
77
(1), 2001, pp. 9-11
Approximating the maximum quadratic assignment problem
Esther M. Arkin
,
Refael Hassin
,
Maxim Sviridenko
Information Processing Letters
77
(1), 2001, pp. 13-16
An efficient algorithm for solving the homogeneous set sandwich problem
Shyue-Ming Tang
,
Fu-Long Yeh
,
Yue-Li Wang
Information Processing Letters
77
(1), 2001, pp. 17-22
Shortest zookeeper's routes in simple polygons
Xuehou Tan
Information Processing Letters
77
(1), 2001, pp. 23-26
Fast computation of shortest watchman routes in simple polygons
Xuehou Tan
Information Processing Letters
77
(1), 2001, pp. 27-33
The shuffle-cubes and their generalization
Tseng-Kuei Li
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
,
Ting-Yi Sung
Information Processing Letters
77
(1), 2001, pp. 35-41
The 0-1 law fails for monadic existential second-order logic on undirected graphs
Jean-Marie Le Bars
Information Processing Letters
77
(1), 2001, pp. 43-48
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
Seiten 1
2
>