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.~Comput. AND YEAR=1987
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The fault tolerance of NP-hard problems
Christian Glaßer
,
A. Pavan
,
Stephen Travers
Information and Computation
209
(3), 2011, pp. 443-455
Time-space efficient algorithms for computing convolutions and related problems
David A. Carlson
Information and Computation
75
(1), 1987, pp. 1-14
Parallel recognition and decomposition of two terminal series parallel graphs
Xin He
,
Yaacov Yesha
Information and Computation
75
(1), 1987, pp. 15-38
Towards optimal parallel bucket sorting
Torben Hagerup
Information and Computation
75
(1), 1987, pp. 39-51
Efficient fault-tolerant routings in networks
Andrei Broder
,
Danny Dolev
,
Michael Fischer
,
Barbara Simons
Information and Computation
75
(1), 1987, pp. 52-64
The hierarchical structure of graph searches
Stefan Waner
,
Yihren Wu
Information and Computation
75
(1), 1987, pp. 65-85
Needed reduction and spine strategies for the lambda calculus
H.P. Barendregt
,
J.R. Kennaway
,
J.W. Klop
,
M.R. Sleep
Information and Computation
75
(3), 1987, pp. 191-231
Safe states in banker-like resource allocation problems
Dirk Hauschildt
,
Rüdiger Valk
Information and Computation
75
(3), 1987, pp. 232-263
Fixed point equations with parameters in the projective model
Evangelos Kranakis
Information and Computation
75
(3), 1987, pp. 264-288
The pursuit of deadlock freedom
A.W. Roscoe
,
Naiem Dathi
Information and Computation
75
(3), 1987, pp. 289-327
Information compression and Varshamov-Gilbert bound
R.E. Krichevsky
Information and Computation
74
(1), 1987, pp. 1-14
On the recursion depth of special tree traversal algorithms
Peter Kirschenhofer
,
Helmut Prodinger
Information and Computation
74
(1), 1987, pp. 15-32
On fault tolerant routings in general networks
David Peleg
,
Barbara Simons
Information and Computation
74
(1), 1987, pp. 33-49
An efficient algorithm for multiprocessor fault diagnosis using the comparison approach
Che-Liang Yang
,
Gerald M. Masson
Information and Computation
74
(1), 1987, pp. 50-63
The Dyck language
{D'1}^*
is not generated by any matrix grammar of finite index
Brigitte Rozoy
Information and Computation
74
(1), 1987, pp. 64-89
Identification of pattern languages from examples and queries
Assaf Marron
,
Ker-I Ko
Information and Computation
74
(2), 1987, pp. 91-112
On-line updating of solutions to a class of matroid intersection problems
Greg N. Frederickson
,
Mandayam A. Srinivas
Information and Computation
74
(2), 1987, pp. 113-139
Finding the minimum bandwidth of an interval graph
Dieter Kratsch
Information and Computation
74
(2), 1987, pp. 140-158
Simulating synchronous processors
Jennifer Lundelius Welch
Information and Computation
74
(2), 1987, pp. 159-170
Lower bounds on communication complexity
P. Durivs
,
Z. Galil
,
G. Schnitger
Information and Computation
73
(1), 1987, pp. 1-22
The decentralized Wald problem
D. Teneketzis
,
Y.-C. Ho
Information and Computation
73
(1), 1987, pp. 23-44
Layouts with wires of balanced length
B. Becker
,
H.G. Osthof
Information and Computation
73
(1), 1987, pp. 45-58
Semi-commutations
M. Clerbout
,
M. Latteux
Information and Computation
73
(1), 1987, pp. 59-74
Parallel time
O(\log n)
recognition of unambiguous context-free languages
W. Rytter
Information and Computation
73
(1), 1987, pp. 75-86
Semantics of production systems
G. Pacini
,
F. Turini
Information and Computation
73
(2), 1987, pp. 87-101
Seiten 1
2
>