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=108
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decidability of the existential theory of infinite terms with subterm relation
Sauro Tulipani
Information and Computation
108
(1), 1994, January, pp. 1-33
The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
Hans L. Bodlaender
,
Shlomo Moran
,
Manfred K. Warmuth
Information and Computation
108
(1), 1994, January, pp. 34-50
Lambda-calculi for (strict) parallel functions
Gérard Boudol
Information and Computation
108
(1), 1994, January, pp. 51-127
Embedding as a tool for language comparison
Frank S. de Boer
,
Catuscia Palamidessi
Information and Computation
108
(1), 1994, January, pp. 128-157
Occam's razor, partially specified boolean functions, string matching, and independent sets
Rafail E. Krichevsky
Information and Computation
108
(1), 1994, January, pp. 158-174
Rich classes inferable from positive data: Length-bounded elementary formal systems
Takeshi Shinohara
Information and Computation
108
(2), 1994, February, pp. 175-186
Fast string matching with mismatches
Ricardo A. Baeza-Yates
,
Gaston H. Gonnet
Information and Computation
108
(2), 1994, February, pp. 187-199
Optimal depth, very small size circuits for symmetric functions in
AC^0
Johan Håstad
,
Ingo Wegener
,
Norbert Wurm
,
Sang-Zin Yi
Information and Computation
108
(2), 1994, February, pp. 200-211
The weighted majority algorithm
Nick Littlestone
,
Manfred K. Warmuth
Information and Computation
108
(2), 1994, February, pp. 212-261
On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
Danilo Bruschi
,
Giovanni Pighizzini
,
Nicoletta Sabadini
Information and Computation
108
(2), 1994, February, pp. 262-285