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="Aiello, William"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hamming codes, hypercube embeddings, and fault tolerance
William Aiello
,
F.T. Leighton
SIAM Journal on Computing
37
(3), 2007, pp. 783-803
Competitive queue policies for differentiated services
William A. Aiello
,
Yishay Mansour
,
S. Rajagopolan
,
Adi Rosén
Journal of Algorithms
55
(2), 2005, pp. 113-141
Augmented ring networks
William Aiello
,
Sandeep N. Bhatt
,
Fan R.K. Chung
,
Arnold L. Rosenberg
,
Ramesh K. Sitaraman
IEEE Transactions on Parallel and Distributed Systems
12
(6), 2001, pp. 598-609
Tree search on an atomic model for message passing
Pangfeng Liu
,
William Aiello
,
Sandeep Bhatt
SIAM Journal on Computing
31
(1), 2001, pp. 67-85
Fast verification of any remote procedure call: Short witness-indistinguishable one-round proofs for
NP
William Aiello
,
Sandeep Bhatt
,
Rafail Ostrovsky
,
S.Raj. Rajagopalan
Lecture Notes in Computer Science
1853
, 2000, pp. 463-474
A random graph model for massive graphs
William Aiello
,
Fan Chung
,
Linyuan Lu
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 171-180
Adaptive packet routing for bursty adversarial traffic
William Aiello
,
Eyal Kushilevitz
,
Rafail Ostrovsky
,
Adi Rosén
Journal of Computer and System Sciences
60
(3), 2000, pp. 482-509
Supporting increment and decrement operations in balancing networks
William Aiello
,
Costas Busch
,
Maurice Herlihy
,
Marios Mavronicolas
,
Nir Shavit
,
Dan Touitou
Lecture Notes in Computer Science
1563
, 1999, pp. 393-403
A random graph model for massive graphs
William Aiello
,
Fan Chung
,
Linyuan Lu
misc, 1999
Adaptive packet routing for bursty adversarial traffic
William Aiello
,
Eyal Kushilevitz
,
Rafail Ostrovsky
,
Adi Rosén
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 359-368
Design of practical and provably good random number generators
William Aiello
,
S. Raj Rajagopalan
,
Ramarathnam Venkatesan
Journal of Algorithms
29
(2), 1998, pp. 358-389
Knowledge on the average-Perfect, statistical and logarithmic
William Aiello
,
Mihir Bellare
,
Ramarathnam Venkatesan
Proceedings of the 27th Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, May 29 - June 1, 1995)
, 1995, pp. 469-478
Design of practical and provably good random number generators
William Aiello
,
Sivaramakrishnan Rajagopalan
,
Ramarathnam Venkatesan
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisco, California, January 22-24, 1995)
, 1995, pp. 1-9
Approximate load balancing on dynamic and asynchronous networks
William Aiello
,
Baruch Awerbuch
,
Bruce Maggs
,
Satish Rao
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 632-641
An atomic model for message-passing
Pangfeng Liu
,
William Aiello
,
Sandeep Bhatt
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'93 (Velen, Germany, June 30 - July 2, 1993)
, 1993, pp. 154-163
Relativized perfect zero knowledge is not BPP
William Aiello
,
Johan Håstad
Information and Computation
93
(2), 1991, August, pp. 223-240
Statistical zero-knowledge languages can be recognized in two rounds
William Aiello
,
Johan Håstad
Journal of Computer and System Sciences
42
, 1991, pp. 327-345
Fast algorithms for bit-serial routing on a hypercube
William A. Aiello
,
F.T. Leighton
,
Bruce M. Maggs
,
Mark Newman
Math. Systems Theory
24
, 1991, pp. 253-271
Learning the Fourier spectrum of probabilistic lists and trees
William Aiello
,
Milena Mihail
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91 (San Francisco, California, January 28-30, 1991)
, 1991, pp. 291-299