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=Inf.~Comput. AND Volume=165
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
How hard is computing the edit distance?
Giovanni Pighizzini
Information and Computation
165
(1), 2001, pp. 1-13
Linear concurrent constraint programming: Operational and phase semantics
François Fages
,
Paul Ruet
,
Sylvain Soliman
Information and Computation
165
(1), 2001, pp. 14-41
Optimal pebble motion on a tree
Vincenzo Auletta
,
Pino Persiano
Information and Computation
165
(1), 2001, pp. 42-68
Pushdown tree automata, algebraic tree systems, and algebraic tree series
Werner Kuich
Information and Computation
165
(1), 2001, pp. 69-99
How to sign digital streams
Rosario Gennaro
,
Pankaj Rohatgi
Information and Computation
165
(1), 2001, pp. 100-116
Erratum to ''A domain equation for bisimulation''
Luca Aceto
,
Anna Ingólfsdóttir
Information and Computation
165
(2), 2001, pp. 119-122
Implementing shared memory on mesh-connected computers and on the fat-tree
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Information and Computation
165
(2), 2001, pp. 123-143
Rollback-dependency trackability: A minimal characterization and its protocol
Roberto Baldoni
,
Jean-Michel Hélary
,
Michel Raynal
Information and Computation
165
(2), 2001, pp. 144-173
Regular languages accepted by quantum automata
Alberto Bertoni
,
Marco Carpentieri
Information and Computation
165
(2), 2001, pp. 174-182
Working with ARMs: Complexity results on atomic representations of Herbrand models
Georg Gottlob
,
Reinhard Pichler
Information and Computation
165
(2), 2001, pp. 183-207