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=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Plain CHOCS: A second generation calculus for higher order processes
Bent Thomsen
Acta Informatica
30
, 1993, pp. 1-59
Logical and schematic characterization of complexity classes
Iain A. Stewart
Acta Informatica
30
, 1993, pp. 61-87
Recognizable trace languages, distributed automata and the distribution problem
Antoine Petit
Acta Informatica
30
, 1993, pp. 89-101
Frameworks for abstract interpretation
Kim Marriott
Acta Informatica
30
, 1993, pp. 103-129
Performance and reliability improvement by using asynchronous algorithms in disk buffer cache memory
Anna Hać
Acta Informatica
30
, 1993, pp. 131-146
Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
Marisa Navarro
,
Fernando Orejas
,
Jean-Luc Remy
Acta Informatica
30
, 1993, pp. 147-180
From ATP to timed graphs and hybrid systems
Xavier Nicollin
,
Joseph Sifakis
,
Sergio Yovine
Acta Informatica
30
, 1993, pp. 181-202
On efficient entreeings
Paul S. Amerins
,
Ricardo A. Baeza-Yates
,
Derick Wood
Acta Informatica
30
, 1993, pp. 203-213
The relaxed min-max heap. A mergeable double-ended priority queue
Yuzheng Ding
,
Mark Allen Weiss
Acta Informatica
30
, 1993, pp. 215-231
The analysis of heuristics for search trees
Patricio V. Poblete
Acta Informatica
30
, 1993, pp. 233-248
A fine-grained solution to the mutual exclusion problem
James H. Anderson
Acta Informatica
30
, 1993, pp. 249-265
Relations among simultaneous complexity classes of nondeterministic and alternating Turing machines
Shigeki Iwata
,
Takumi Kasai
,
Etsuro Moriya
Acta Informatica
30
, 1993, pp. 267-278
L-systems and mutually recursive function systems
Karel Culik II
,
Simant Dube
Acta Informatica
30
, 1993, pp. 279-302
OBSCURE: A specification language for abstract data types
Thomas Lehmann
,
Jacques Loeckx
Acta Informatica
30
, 1993, pp. 303-350
On the synchronization in parallel communicating grammar systems
Gheorghe Păun
Acta Informatica
30
, 1993, pp. 351-367
Speeding up dynamic transitive closure for bounded degree graphs
Daniel M. Yellin
Acta Informatica
30
, 1993, pp. 369-384
Unavoidable binary patterns
Julien Cassaigne
Acta Informatica
30
, 1993, pp. 385-395
Satisfiability of co-nested formulas
Jan KratochvIl
,
Mirko Kȓivánek
Acta Informatica
30
, 1993, pp. 397-403
The optimal binary search tree for Andersson's search algorithm
David Spuler
Acta Informatica
30
, 1993, pp. 405-407
Scheduling saves in fault-tolerant computations
E.G., Jr. Coffman
,
Leopold Flatto
,
A.Y. Kreinin
Acta Informatica
30
, 1993, pp. 409-423
Decomposing a window into maximal quadtree blocks
Walid G. Aref
,
Hanan Samet
Acta Informatica
30
, 1993, pp. 425-439
On simplest possible solutions for Post Correspondence Problems
Alexandru Mateescu
,
Arto Salomaa
Acta Informatica
30
, 1993, pp. 441-457
On the expected height of fringe-balanced trees
Luc Devroye
Acta Informatica
30
, 1993, pp. 459-466
Infinitary parallelism without unbounded nondeterminism in CSP
K. Narayan Kumar
,
Paritosh K. Pandya
Acta Informatica
30
, 1993, pp. 467-487
On minimizing the
\forall-\neg
degree of a connective-free formula
Jan Van den Bussche
Acta Informatica
30
, 1993, pp. 489-502
Seiten 1
2
>