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
[1]
Hilfe
Suche: Author="Schmeltz, Bernd"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reliable computation with noisy circuits and decision trees - A general
n\log n
lower bound
Rüdiger Reischuk
,
Bernd Schmeltz
misc, 1992, January
Area efficient methods to increase the reliability of circuits
Rüdiger Reischuk
,
Bernd Schmeltz
Lecture Notes in Computer Science
594
, 1992, pp. 363-389
Learning convex sets under uniform distribution
Bernd Schmeltz
Lecture Notes in Computer Science
594
, 1992, pp. 204-213
Reliable computation with noisy circuits and decision trees-A general
n\log n
lower bound
Rüdiger Reischuk
,
Bernd Schmeltz
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 602-611
Optimal tradeoffs between time and bit complexity in distributed synchronous rings
Bernd Schmeltz
Lecture Notes in Computer Science
480
, 1991, pp. 275-284
Area efficient methods to increase the reliability of combinatorial circuits
Rüdiger Reischuk
,
Bernd Schmeltz
Lecture Notes in Computer Science
349
, 1989, pp. 314-326