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=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A satisfiability tester for non-clausal propositional calculus
Allen van Gelder
Information and Computation
79
(1), 1988, pp. 1-21
Some general incompleteness results for partial correctness logics
M. Teresa Hortalá-González
,
Francisca Lucio-Carrasco
,
Mario Rodríguez-Artalejo
Information and Computation
79
(1), 1988, pp. 22-42
The multi-tree approach to reliability in distributed networks
Alon Itai
,
Michael Rodeh
Information and Computation
79
(1), 1988, pp. 43-59
Bisimulation of automata
David B. Benson
,
Ofer Ben-Shachar
Information and Computation
79
(1), 1988, pp. 60-83
Membership testing in commutative transformation semigroups
Martin Beaudry
Information and Computation
79
(1), 1988, pp. 84-94
Categories of partial maps
E. Robinson
,
G. Rosolini
Information and Computation
79
(2), 1988, pp. 95-130
Infinite trees, markings, and well-foundedness
Ran Rinat
,
Nissim Francez
,
Orna Grumbert
Information and Computation
79
(2), 1988, pp. 131-154
A trade-off between page number and page width of book embeddings of graphs
Elena Stöhr
Information and Computation
79
(2), 1988, pp. 155-162
Outlier resistant filtering and smoothing
Haralampos Tsaknakis
,
P. Papantoni-Kazakos
Information and Computation
79
(2), 1988, pp. 163-192
Saving the phenomena: Requirements that inductive inference machines not contradict known data
Mark A. Fulk
Information and Computation
79
(3), 1988, pp. 193-209
Compositional semantics for real-time distributed computing
R. Koymans
,
R.K. Shyamasundar
,
W.P. de Roever
,
R. Gerth
,
S. Arun-Kumar
Information and Computation
79
(3), 1988, pp. 210-256
Fault tolerant computing and reliable communication: A unified approach
E.A. Trachtenberg
Information and Computation
79
(3), 1988, pp. 257-279
Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
B. Courcelle
,
P. Deransart
Information and Computation
78
(1), 1988, pp. 1-55
Tape versus queue and stacks: The lower bounds
Ming Li
,
Paul M. Vitányi
Information and Computation
78
(1), 1988, pp. 56-85
Promise problems complete for complexity classes
Alan L. Selman
Information and Computation
78
(2), 1988, pp. 87-98
On the limits of computations with the floor function
László Babai
,
Bettina Just
,
Friedhelm Meyer auf der Heide
Information and Computation
78
(2), 1988, pp. 99-107
The computational complexity of asymptotic problems I: Partial Orders
Kevin J. Compton
Information and Computation
78
(2), 1988, pp. 108-123
Algorithms for determining relative star height and star height
Kosaburo Hashiguchi
Information and Computation
78
(2), 1988, pp. 124-169
A fast algorithm for computing multiplicative inverses in GF(
2^m
) using normal bases
Toshiya Itoh
,
Shigeo Tsujii
Information and Computation
78
(3), 1988, pp. 171-177
Complexity characterizations of attribute grammar languages
Sophocles Efremidis
,
Christos H. Papadimitriou
,
Martha Sideris
Information and Computation
78
(3), 1988, pp. 178-186
The OI-hierarchy is closed under control
Heiko Vogler
Information and Computation
78
(3), 1988, pp. 187-204
Global renaming operators in concrete process algebra
J.C.M. Baeten
,
J.A. Bergstra
Information and Computation
78
(3), 1988, pp. 205-245
Some remarks on computing the square parts of integers
Susan Landau
Information and Computation
78
(3), 1988, pp. 246-253
A new fault-tolerant algorithm for clock synchronization
Jennifer Lundelius Welch
,
Nancy Lynch
Information and Computation
77
(1), 1988, pp. 1-36
Polynomial terse sets
Amihood Amir
,
William I. Gasarch
Information and Computation
77
(1), 1988, pp. 37-56
Seiten 1
2
>