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 YEAR=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Addendum to: Null values in nested relational databases
Mark A. Roth
,
Henry F. Korth
,
Abraham Silberschatz
Acta Informatica
28
, 1991, pp. 607-610
A fixed point approach to parallel discrete event simulation
Werner Pohlmann
Acta Informatica
28
, 1991, pp. 611-629
The expressive power of the bounded-iteration construct
Xiaolei Qian
Acta Informatica
28
, 1991, pp. 631-656
Resource finding in store-and-forward networks
José M. Bernabéu-Aubán
,
Mustaque Ahamad
,
Mostafa H. Ammar
Acta Informatica
28
, 1991, pp. 657-680
Priority systems with many identical processes
Hsu-Chun Yen
Acta Informatica
28
, 1991, pp. 681-692
On fast multiplication of polynomials over arbitrary algebras
David G. Cantor
,
Erich Kaltofen
Acta Informatica
28
, 1991, pp. 693-701
Postorder trees and Eulerian numbers
Thomas P. Whaley
Acta Informatica
28
, 1991, pp. 703-712
Efficient comparison of program slices
Susan Horwitz
,
Thomas Reps
Acta Informatica
28
, 1991, pp. 713-732
Opportunistic algorithms for eliminating supersets
Paul Pritchard
Acta Informatica
28
, 1991, pp. 733-754
Greed in resource scheduling
Donald W Gillies
,
Jane W.-S. Liu
Acta Informatica
28
, 1991, pp. 755-775
Independent database schemes under functional and inclusion dependencies
Paolo Atzeni
,
Edward P.F. Chan
Acta Informatica
28
, 1991, pp. 777-799
Seiten 1
2
>