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="Maass, Wolfgang"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Energy complexity and entropy of threshold circuits
Kei Uchizawa
,
Rodney Douglas
,
Wolfgang Maass
Lecture Notes in Computer Science
4051
, 2006, pp. 631-642
Wire length as a circuit complexity measure
Robert A. Legenstein
,
Wolfgang Maass
Journal of Computer and System Sciences
70
(1), 2005, pp. 53-72
On the computational power of circuits of spiking neurons
Wolfgang Maass
,
Henry Markram
Journal of Computer and System Sciences
69
(4), 2004, pp. 593-616
Neural circuits for pattern recognition with small total wire length
Robert A. Legenstein
,
Wolfgang Maass
Theoretical Computer Science
287
(1), 2002, pp. 239-249
Spiking neurons and the induction of finite state machines
Thomas Natschläger
,
Wolfgang Maass
Theoretical Computer Science
287
(1), 2002, pp. 251-265
Optimizing the layout of a balanced tree
Robert Albin Legenstein
,
Wolfgang Maass
Technical Report (TR01-069), 2001
On the relevance of time in neural computation and learning
Wolfgang Maass
Theoretical Computer Science
261
(1), 2001, pp. 157-178
On computation with pulses
Wolfgang Maass
,
Berthold Ruf
Information and Computation
148
(2), 1999, pp. 202-218
On the complexity of learning for spiking neurons with temporal coding
Wolfgang Maass
,
Michael Schmitt
Information and Computation
153
(1), 1999, pp. 26-46
Efficient learning with virtual threshold gates
Wolfgang Maass
,
Manfred K. Warmuth
Information and Computation
141
(1), 1998, pp. 66-83
On the role of time and space in neural computation
Wolfgang Maass
Lecture Notes in Computer Science
1450
, 1998, pp. 72-83
Bounds for the computational power and learning complexity of analog neural nets
Wolfgang Maass
SIAM Journal on Computing
26
(3), 1997, pp. 708-732
Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
David P. Dobkin
,
Dimitrios Gunopulos
,
Wolfgang Maass
Journal of Computer and System Sciences
52
(3), 1996, pp. 453-470
Fast identification of geometric objects with membership queries
William J. Bultman
,
Wolfgang Maass
Information and Computation
118
(1), 1995, pp. 48-64
The complexity of matrix transposition on one-tape off-line Turing machines with output tape
Martin Dietzfelbinger
,
Wolfgang Maass
Theoretical Computer Science
108
, 1993, pp. 271-290
Threshold circuits of bounded depth
András Hajnal
,
Wolfgang Maass
,
Pavel Pudlák
,
Márió Szegedy
,
György Turán
Journal of Computer and System Sciences
46
(2), 1993, pp. 129-154
Bounds for the computational power and learning complexity of analog neural nets (extended abstract)
Wolfgang Maass
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 335-344
The complexity types of computable sets
Wolfgang Maass
,
Theodore A. Slaman
Journal of Computer and System Sciences
44
, 1992, pp. 168-192
The complexity of matrix transposition on one-tape off-line Turing machines
Martin Dietzfelbinger
,
Wolfgang Maass
,
Georg Schnitger
Theoretical Computer Science
82
, 1991, pp. 113-129
On the computational power of Sigmoid versus Booelean threshold circuits
Wolfgang Maass
,
Georg Schnitger
,
Eduardo D. Sontag
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 767-776
Meanders and their applications in lower bounds arguments
Noga Alon
,
Wolfgang Maass
Journal of Computer and System Sciences
37
, 1988, pp. 118-129
Lower bounds arguments with ``inaccessible'' numbers
Martin Dietzfelbinger
,
Wolfgang Maass
Journal of Computer and System Sciences
36
, 1988, pp. 313-335
On the communication complexity of graph properties
András Hajnal
,
Wolfgang Maass
,
Gyŏrgy Turán
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC'88 (Chicago, IL, May 2-4, 1988)
, 1988, pp. 186-191