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="Vadhan, Salil P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An unconditional study of computational zero knowledge
Salil P. Vadhan
SIAM Journal on Computing
36
(4), 2006, pp. 1160-1214
Randomness extractors and their many guises
Salil P. Vadhan
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 9-9
The complexity of counting in sparse, regular, and planar graphs
Salil P. Vadhan
SIAM Journal on Computing
31
(2), 2001, pp. 398-427
A complete promise problem for statistical zero-knowledge
Amit Sahai
,
Salil P. Vadhan
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 448-457