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
[3]
Hilfe
Suche: Author="Broder, A.Z."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the problem of approximating the number of bases of a matroid
Y. Azar
,
A.Z. Broder
,
A.M. Frieze
Information Processing Letters
50
, 1994, pp. 9-11
The cost distribution of clustering in random probing
B. Bollobás
,
A.Z. Broder
,
I. Simon
Journal of the ACM
37
(2), 1990, April, pp. 224-237
Bounds on the cover time
A.Z. Broder
,
A.R. Karlin
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 479-487
How hard is it to marry at random? (On the approximation of the permanent)
A.Z. Broder
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 50-58
Flipping coins in many pockets (Byzantine agreement on uniformly random values)
A.Z. Broder
,
D. Dolev
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 157-170