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: Author="Maruoka, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning monotone log-term DNF formulas under the uniform distribution
Y. Sakai
,
A. Maruoka
Theory Comput. Systems
33
, 2000, pp. 17-33
Learning monotone log-term DNF formulas under the uniform distribution
Y. Sakai
,
A. Maruoka
Theory of Computing Systems
33
(1), 2000, pp. 17-33
Expanders obtained from affine transformations
S. Jimbo
,
A. Maruoka
Combinatorica
7
(4), 1987, pp. 343-356
Expanders obtained from affine transformations
S. Jimbo
,
A. Maruoka
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 88-97
Open maps for tessellation automata
A. Maruoka
Theoretical Computer Science
27
(1,2), 1983, pp. 217-224
Strong surjectivity is equivalent to
C
-injectivity
A. Maruoka
,
M. Kimura
Theoretical Computer Science
18
, 1982, pp. 269-277
Pattern decomposition for tessellation automata
A. Maruoka
,
M. Kimura
,
N. Shoji
Theoretical Computer Science
14
, 1981, pp. 211-226
Injectivity and surjectivity of parallel maps for cellular automata
A. Maruoka
,
M. Kimura
Journal of Computer and System Sciences
18
(1), 1979, February, pp. 47-64