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="Paturi, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On threshold circuits for parity
R. Paturi
,
M.E. Saks
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 397-404
Effect of connectivity in associative memory models
J. Komlós
,
R. Paturi
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 138-147
Probabilistic communication complexity
R. Paturi
,
J. Simon
Journal of Computer and System Sciences
33
(1), 1986, August, pp. 106-123
Probabilistic communication complexity
R. Paturi
,
J. Simon
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 118-126
Lower bounds on the time of probabilistic on-line simulations
R. Paturi
,
J. Simon
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 343-350