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=37
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Semantics analysis through elementary meanings - Theoretical foundatioon for generalized thesaurus construction
Youichi Kobuchi
,
Takashi Saito
,
Hidenobu Nunome
Acta Informatica
37
(1), 2000, pp. 1-19
Data structures for order-sensitive predicates in parallel nondeterministic systems
Desh Ranjan
,
Enrico Pontelli
,
Gopal Gupta
Acta Informatica
37
(1), 2000, pp. 21-43
Accepting Zeno words: A way toward timed refinements
Béatrice Bérard
,
Claudine Picaronny
Acta Informatica
37
(1), 2000, pp. 45-81
Computational complexity via programming languages: Constant factors do matter
Amir M. Ben-Amram
,
Neil D. Jones
Acta Informatica
37
(2), 2000, pp. 83-120
Efficiently building a parse tree from a regular expression
Danny Dubé
,
Marc Feeley
Acta Informatica
37
(2), 2000, pp. 121-144
Some results on the Collatz problem
S̑tefan Andrei
,
Manfred Kudlek
,
Radu S̑tefan Niculescu
Acta Informatica
37
(2), 2000, pp. 145-160
One-write algorithms for multivalued regular and atomic registers
Soma Chaudhuri
,
Martha J. Kosa
,
Jennifer L. Welch
Acta Informatica
37
(3), 2000, pp. 161-192
The class Steiner minimal tree problem: A lower bound and test problem generation
Boting Yang
,
Paul Gillard
Acta Informatica
37
(3), 2000, pp. 193-211
Fair sticker languages
Hendrik Jan Hoogeboom
,
Nikè van Vugt
Acta Informatica
37
(3), 2000, pp. 213-225
Refinement of actions and equivalence notions for concurrent systems
Rob van Glabbeek
,
Ursula Goltz
Acta Informatica
37
(4-5), 2001, pp. 229-327
Demonic, angelic and unbounded probabilistic choices in sequential programs
A.K. McIver
,
C. Morgan
Acta Informatica
37
(4-5), 2001, pp. 329-354
Analysis of range search for random
k-d
trees
Philippe Chanzy
,
Luc Devroye
,
Carlos Zamora-Cura
Acta Informatica
37
(4-5), 2001, pp. 355-383
A sequential real-time refinement calculus
Ian J. Hayes
,
Mark Utting
Acta Informatica
37
(6), 2001, pp. 385-448
Synchronized extension systems
Ferucio Laurenţiu Ţiplea
,
Erkki Mäkinen
,
Corina Apachite
Acta Informatica
37
(6), 2001, pp. 449-465
`Closed interval process algebra' versus `Interval process algebra'
Flavio Corradini
,
Marco Pistore
Acta Informatica
37
(7), 2001, pp. 467-510
Parallel communicating grammar systems with terminal transmission
Henning Fernau
Acta Informatica
37
(7), 2001, pp. 511-540
A theory of bunches
Joseph M. Morris
,
Alexander Bunkenburg
Acta Informatica
37
(8), 2001, pp. 541-561
A construction of distributed reference counting
Luc Moreau
,
Jean Duprat
Acta Informatica
37
(8), 2001, pp. 563-595
Periodic-like words, periodicity, and boxes
Arturo Carpi
,
Aldo de Luca
Acta Informatica
37
(8), 2001, pp. 597-618
Efficient recognition algorithms for boundary and linear eNCE graph languages
Changwook Kim
Acta Informatica
37
(9), 2001, pp. 619-632
Even faster generalized LR parsing
John Aycock
,
Nigel Horspool
,
Jan Janous̑ek
,
Boȓivoj Melichar
Acta Informatica
37
(9), 2001, pp. 633-651
On the tree inclusion problem
Laurent Alonso
,
René Schott
Acta Informatica
37
(9), 2001, pp. 653-670
Yet another generation of LALR parsers for regular right part grammars
Shin-ichi Morimoto
,
Masataka Sassa
Acta Informatica
37
(9), 2001, pp. 671-697
Extending stratified Datalog to capture complexity classes ranging from
P
to
QH
Sergio Greco
,
Domenico Saccà
,
Carlo Zaniolo
Acta Informatica
37
(10), 2001, pp. 699-725
Running a job on a collection of partly available machines, with on-line restarts
Rob van Stee
,
Han la Poutré
Acta Informatica
37
(10), 2001, pp. 727-742
Seiten 1
2
>