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=138
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of parallel prefix problems on small domains
Shiva P. Chaudhuri
,
Jaikumar Radhakrishnan
Information and Computation
138
(1), 1997, pp. 1-22
Efficient learning of typical finite automata from random walks
Yoav Freund
,
Michael Kearns
,
Dana Ron
,
Ronitt Rubinfeld
,
Robert E. Schapire
Information and Computation
138
(1), 1997, pp. 23-48
On schematological equivalence of partially interpreted dataflow networks
Alexander Rabinovich
Information and Computation
138
(1), 1997, pp. 49-87
Separating the power of EREW and CREW PRAMs with small communication width
Paul Beame
,
Faith E. Fich
,
Rakesh K. Sinha
Information and Computation
138
(1), 1997, pp. 89-99
On the Jacopini technique
Jan Kuper
Information and Computation
138
(2), 1997, pp. 101-123
A complete axiomatization of finite-state ACSR processes
Patrice Brémond-Grégoire
,
Jin-Young Choi
,
Insup Lee
Information and Computation
138
(2), 1997, pp. 124-159
Context-sensitive string languages and recognizable picture languages
M. Latteux
,
D. Simplot
Information and Computation
138
(2), 1997, pp. 160-169
On the complexity of learning from drifting distributions
Rakesh D. Barve
,
Philip M. Long
Information and Computation
138
(2), 1997, pp. 170-193
Quiescence, fairness, testing, and the notion of implementation
Roberto Segala
Information and Computation
138
(2), 1997, pp. 194-210