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=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nested satisfiability
Donald E. Knuth
Acta Informatica
28
, 1990, pp. 1-6
Proof theory for exception handling in a tasking environment
K. Lodaya
,
R.K. Shyamasundar
Acta Informatica
28
, 1990, pp. 7-41
Efficient memo-table management strategies
Hessam Khoshnevisan
Acta Informatica
28
, 1990, pp. 43-81
A characterization of set representable labeled partial 2-structures through decompositions
A. Ehrenfeucht
,
G. Rozenberg
Acta Informatica
28
, 1990, pp. 83-94
Automating the Knuth Bendix ordering
Jeremy Dick
,
John Kalmus
,
Ursula Martin
Acta Informatica
28
, 1990, pp. 95-119
Properties of data flow frameworks. A unified model
T.J. Marlowe
,
B.G. Ryder
Acta Informatica
28
, 1990, pp. 121-163
Binary search trees of almost optimal height
Arne Andersson
,
Christian Icking
,
Rolf Klein
,
Thomas Ottmann
Acta Informatica
28
, 1990, pp. 165-178
On characterizations of recursively enumerable languages
Michel Latteux
,
Paavo Turakainen
Acta Informatica
28
, 1990, pp. 179-186
Observational implementation of algebraic specifications
R. Hennicker
Acta Informatica
28
, 1990, pp. 187-230
Concurrent bisimulations in Petri nets
E. Best
,
R. Devillers
,
A. Kiehn
,
L. Pomello
Acta Informatica
28
, 1990, pp. 231-264
MRE hierarchical decomposition of general queueing network models
P.J. Tomaras
,
D.D. Kouvatsos
Acta Informatica
28
, 1990, pp. 265-295
A new explanation of the glitch phenomenon
J.H. Anderson
,
M.G. Gouda
Acta Informatica
28
, 1991, pp. 297-309
Sufficient-completeness, ground-reducibility and their complexity
Deepak Kapur
,
Paliat Narendran
,
Daniel J. Rosenkrantz
,
Hantao Zhang
Acta Informatica
28
, 1991, pp. 311-350
Effective construction of the syntactic algebra of a recognizable series on trees
Symeon Bozapalidis
Acta Informatica
28
, 1991, pp. 351-363
Theoretical foundations of handling large substitution sets in temporal integrity monitoring
K. Hülsmann
,
G. Saake
Acta Informatica
28
, 1991, pp. 365-407
The calculus of context relations
Gregor Snelting
Acta Informatica
28
, 1991, pp. 411-445
The expressive power of delay operators in SCCS
Carol Critchlow
,
Prakash Panangaden
Acta Informatica
28
, 1991, pp. 447-452
Minimum-delay schedules in layered networks
Daniel P. Bovet
,
Pierluigi Crescenzi
Acta Informatica
28
, 1991, pp. 453-461
The virtual feedback problem in hierarchical representations of combinational circuits
Reiner Kolla
,
Bernd Serf
Acta Informatica
28
, 1991, pp. 463-476
Decision problems for finite special string-rewriting systems that are confluent on some congruence class
Friedrich Otto
,
Louxin Zhang
Acta Informatica
28
, 1991, pp. 477-510
PROCOL. A concurrent object-oriented language with protocols delegation and constraints
Jan van den Bos
,
Chris Laffra
Acta Informatica
28
, 1991, pp. 511-538
An abstract data type for name analysis
U. Kastens
,
W.M. Waite
Acta Informatica
28
, 1991, pp. 539-558
On the expansion of non-linear functions
Peter G. Harrison
Acta Informatica
28
, 1991, pp. 559-574
Branching processes of Petri nets
Joost Engelfriet
Acta Informatica
28
, 1991, pp. 575-591
Some order dimension bounds for communication complexity problems
U. Faigle
,
W. Kern
Acta Informatica
28
, 1991, pp. 593-601
Seiten 1
2
>