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=Acta Inf. AND Volume=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Termination conventions and comparative semantics
E.C.R. Hehner
,
A.J. Malton
Acta Informatica
25
(1), 1988, pp. 1-14
Fifo nets without order deadlock
Alain Finkel
,
Annie Choquet
Acta Informatica
25
(1), 1988, pp. 15-36
The nearest common ancestor in a dynamic tree
A.K. Tsakalidis
Acta Informatica
25
(1), 1988, pp. 37-54
Database survivability under dynamic constraints
V. Vianu
Acta Informatica
25
(1), 1988, pp. 55-84
Integrating code generation and peephole optimization
M. Ganapathi
,
C.N. Fischer
Acta Informatica
25
(1), 1988, pp. 85-109
Crypt-equivalent algebraic specifications
F.L. Bauer
,
M. Wirsing
Acta Informatica
25
(2), 1988, pp. 111-153
Incremental evaluation for attribute grammars with unrestricted movement between tree modifications
T. Reps
Acta Informatica
25
(2), 1988, pp. 155-178
On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
L. Bougé
Acta Informatica
25
(2), 1988, pp. 179-201
Recording the use of memory in right-boundary grammars and push-down automata
A. Ehrenfeucht
,
H.J. Hoogeboom
,
G. Rozenberg
Acta Informatica
25
(2), 1988, pp. 203-231
Toward formal development of programs from algebraic specifictions: implementations revisited
D. Sannella
,
A. Tarlecki
Acta Informatica
25
(3), 1988, pp. 233-281
A second order theory of data types
Ming-Hua Zhang
Acta Informatica
25
(3), 1988, pp. 283-303
A proof system for distributed Processes
A.E.K. Sobel
,
N. Soundararajan
Acta Informatica
25
(3), 1988, pp. 305-332
The complexity of reachability in distributed communicating processes
J.H. Reif
,
S.A. Smolka
Acta Informatica
25
(3), 1988, pp. 333-354
Composition and evaluation of attribute coupled grammars
R. Giegerich
Acta Informatica
25
(4), 1988, pp. 355-423
Resolution on formula-trees
U.R. Schmerl
Acta Informatica
25
(4), 1988, pp. 425-438
Program-substitution and admissibility of rules in algorithmic logic
A. Biela
Acta Informatica
25
(4), 1988, pp. 439-473
On generating database schemes bounded or constant-time maintainable by extensibility
Edward P.F. Chan
,
Héctor J. Hernández
Acta Informatica
25
, 1988, pp. 475-496
Inductive completion with retracts
William P.R. Mitchell
Acta Informatica
25
, 1988, pp. 497-514
Graph complexity
Pavel Pudlák
,
Vojtȇch Rödl
,
Petr Savický
Acta Informatica
25
, 1988, pp. 515-535
Apex graph grammars and attribute grammars
Joost Engelfriet
,
George Leih
,
Grzegorz Rozenberg
Acta Informatica
25
, 1988, pp. 537-571
Elements of finite order for finite weight-reducing and confluent Thue systems
Paliath Narendran
,
Friedrich Otto
Acta Informatica
25
, 1988, pp. 573-591
A calculus of refinements for program derivations
R.J.R. Back
Acta Informatica
25
, 1988, pp. 593-624
Specification and verification of database dynamics
José Fiadeiro
,
Amílcar Sernadas
Acta Informatica
25
, 1988, pp. 625-661
Cooperative distributed dynamic load balancing
Sheldon Shen
Acta Informatica
25
, 1988, pp. 663-676
Load sharing in distributed systems with failures
Satish K. Tripathi
,
David Finkel
,
Erol Gelenbe
Acta Informatica
25
, 1988, pp. 677-689
Seiten 1
2
>