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=131
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Symbol-relation grammars: A formalism for graphical languages
F. Ferrucci
,
G. Pacini
,
G. Satta
,
M.I. Sessa
,
G. Tortora
,
M. Tucci
,
G. Vitiello
Information and Computation
131
(1), 1996, pp. 1-46
Contextual insertions/deletions and computability
Lila Kari
,
Gabriel Thierrin
Information and Computation
131
(1), 1996, pp. 47-61
Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
Ming-Yang Kao
,
John H. Reif
,
Stephen R. Tate
Information and Computation
131
(1), 1996, pp. 63-79
Multiple product modulo arbitrary numbers
Claudia Bertram-Kretzberg
,
Thomas Hofmeister
Information and Computation
131
(1), 1996, pp. 81-93
On the power of DNA-computing
Diana Rooß
,
Klaus W. Wagner
Information and Computation
131
(2), 1996, pp. 95-109
Randomness in distribution protocols
Carlo Blundo
,
Alfredo de Santis
,
Ugo Vaccaro
Information and Computation
131
(2), 1996, pp. 111-139
Bisimulation for higher-order process calculi
Davide Sangiorgi
Information and Computation
131
(2), 1996, pp. 141-178
A note on decision versus search for graph automorphism
M. Agrawal
,
V. Arvind
Information and Computation
131
(2), 1996, pp. 179-189