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=35
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Structured numbers - Properties of a hierarchy of operations on binary trees
Vincent D. Blondel
Acta Informatica
35
(1), 1998, pp. 1-15
Generating words lexicographically: An average-case analysis
Rainer Kemp
Acta Informatica
35
(1), 1998, pp. 17-89
Data refinement of mixed specifications - A generalization of UNITY
Beverly A. Sanders
Acta Informatica
35
(2), 1998, pp. 91-129
Refinement of fair action systems
Ralph J.R. Back
,
Qiwen Xu
Acta Informatica
35
(2), 1998, pp. 131-165
About the Collatz conjecture
Ştefan Andrei
,
Cristian Masalagiu
Acta Informatica
35
(2), 1998, pp. 167-179
Conceptual classes and system classes in object databases
Elvira Locuratolo
,
Fausto Rabitti
Acta Informatica
35
(3), 1998, pp. 181-210
Average-case complexity for the execution of recursive definitons on relational databases
Wenceslas Fernandez de la Vega
,
Vangelis Th. Paschos
,
Andreas N. Stafylopatis
Acta Informatica
35
(3), 1998, pp. 211-243
Context-free languages over infinite alphabets
Edward Y.C. Cheng
,
Michael Kaminski
Acta Informatica
35
(3), 1998, pp. 245-267
Lattices in machine learning: Complexity issues
Derrick G. Kourie
,
G. Deon Oosthuizen
Acta Informatica
35
(4), 1998, pp. 269-292
Modularity and expressibility for nets of relations
Alexander Rabinovich
Acta Informatica
35
(4), 1998, pp. 293-327
On time computability of functions in one-way cellular automata
Thomas Buchholz
,
Martin Kutrib
Acta Informatica
35
(4), 1998, pp. 329-352
A fully abstract semantics for causality in the
\pi
-calculus
Michele Boreale
,
Davide Sangiorgi
Acta Informatica
35
(5), 1998, pp. 353-400
DNA computing, sticker systems, and universality
Lila Kari
,
Gheorghe Păun
,
Grzegorz Rozenberg
,
Arto Salomaa
,
Sheng Yu
Acta Informatica
35
(5), 1998, pp. 401-420
Partitioning a sequence into few monotone subsequences
Reuven Bar Yehuda
,
Sergio Fogel
Acta Informatica
35
(5), 1998, pp. 421-440
Consistent records in asynchronous computations
Roberto Baldoni
,
Jean-Michel Helary
,
Michel Raynal
Acta Informatica
35
(6), 1998, pp. 441-455
A logic-based approach to program flow analysis
Mooly Sagiv
,
Nissim Francez
,
Michael Rodeh
,
Reinhard Wilhelm
Acta Informatica
35
(6), 1998, pp. 457-504
Nonfinite axiomatizability of the equational theory of shuffle
Zoltán Ésik
,
Michael Bertol
Acta Informatica
35
(6), 1998, pp. 505-539
List ranking on meshes
Jop F. Sibeyn
Acta Informatica
35
(7), 1998, pp. 543-566
Approximating traces
Volker Diekert
,
Paul Gastin
Acta Informatica
35
(7), 1998, pp. 567-593
On finite automata with limited nondeterminism
Hing Leung
Acta Informatica
35
(7), 1998, pp. 595-624
Decision problems concerning thinness and slenderness of formal languages
Juha Honkala
Acta Informatica
35
(7), 1998, pp. 625-636
Converting untyped formulas to typed ones
Jan van den Bussche
,
Luca Cabibbo
Acta Informatica
35
(8), 1998, pp. 637-643
Polytime model checking for timed probabilistic computation tree logic
Danièle Beauquier
,
Anatol Slissenko
Acta Informatica
35
(8), 1998, pp. 645-664
On a relation between uniform coding and problems of the form DTIMEF(
\cal F
)=?DSPACEF(
\cal F
)
Salvatore Caporaso
,
Michele Zito
Acta Informatica
35
(8), 1998, pp. 665-672
Priority conflict-free Petri nets
Hsu-Chun Yen
Acta Informatica
35
(8), 1998, pp. 673-688
Seiten 1
2
>