default search action
William Aiello
Person information
- affiliation: University of British Columbia, Vancouver, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [i3]José Carlos Pazos, Jean-Sébastien Légaré, Ivan Beschastnikh, William Aiello:
Precise XSS detection and mitigation with Client-side Templates. CoRR abs/2005.07826 (2020)
2010 – 2019
- 2016
- [j20]Jean-Sébastien Légaré, Róbert Sumi, William Aiello:
Beeswax: a platform for private web apps. Proc. Priv. Enhancing Technol. 2016(3): 24-40 (2016) - [c45]Celina G. Val, Michael A. Enescu, Sam Bayless, William Aiello, Alan J. Hu:
Precisely Measuring Quantitative Information Flow: 10K Lines of Code and Beyond. EuroS&P 2016: 31-46 - [c44]David Williams-King, Graham Gobieski, Kent Williams-King
, James P. Blake, Xinhao Yuan, Patrick Colp, Michelle Zheng, Vasileios P. Kemerlis, Junfeng Yang, William Aiello:
Shuffler: Fast and Deployable Continuous Code Re-Randomization. OSDI 2016: 367-382 - 2014
- [j19]Mihir Nanavati, Patrick Colp, Bill Aiello, Andrew Warfield:
Cloud security: a gathering storm. Commun. ACM 57(5): 70-79 (2014) - 2013
- [c43]Jean-Sébastien Légaré, Dutch T. Meyer, Mark Spear, Alexandru Totolici, Sara Bainbridge, Kalan MacRow, Róbert Sumi, Quinlan Jung, Dennis Tjandra, David Williams-King, William Aiello, Andrew Warfield:
Tolerating business failures in hosted applications. SoCC 2013: 22:1-22:16 - [c42]Mihir Nanavati, Mark Spear, Nathan Taylor, Shriram Rajagopalan, Dutch T. Meyer, William Aiello, Andrew Warfield:
Whose cache line is it anyway?: operating system support for live detection and repair of false sharing. EuroSys 2013: 141-154 - 2011
- [c41]Stephen E. McLaughlin, Patrick D. McDaniel, William Aiello:
Protecting consumer privacy from electric load monitoring. CCS 2011: 87-98 - [c40]Patrick Colp, Mihir Nanavati, Jun Zhu, William Aiello, George Coker, Tim Deegan, Peter A. Loscocco, Andrew Warfield:
Breaking up is hard to do: security and functionality in a commodity hypervisor. SOSP 2011: 189-202 - [c39]Mihir Nanavati, Nathan Taylor, William Aiello, Andrew Warfield:
Herbert West - Deanonymizer. HotSec 2011
2000 – 2009
- 2009
- [j18]William Enck, Thomas Moyer, Patrick D. McDaniel, Subhabrata Sen, Panagiotis Sebos, Sylke Spoerel, Albert G. Greenberg, Yu-Wei Eric Sung, Sanjay G. Rao, William Aiello:
Configuration management at massive scale: system design and experience. IEEE J. Sel. Areas Commun. 27(3): 323-335 (2009) - 2008
- [j17]William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen
A Spatial Web Graph Model with Local Influence Regions. Internet Math. 5(1): 175-196 (2008) - [j16]William Aiello, Alexander Kesselman, Yishay Mansour:
Competitive buffer management for shared-memory switches. ACM Trans. Algorithms 5(1): 3:1-3:16 (2008) - [e1]William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen
Algorithms and Models for the Web-Graph, Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers. Lecture Notes in Computer Science 4936, Springer 2008, ISBN 978-3-540-78807-2 [contents] - 2007
- [j15]William Aiello, Frank Thomson Leighton:
Hamming Codes, Hypercube Embeddings, and Fault Tolerance. SIAM J. Comput. 37(3): 783-803 (2007) - [c38]William Enck, Patrick D. McDaniel, Subhabrata Sen, Panagiotis Sebos, Sylke Spoerel, Albert G. Greenberg, Sanjay G. Rao, William Aiello:
Configuration Management at Massive Scale: System Design and Experience. USENIX ATC 2007: 73-86 - [c37]William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen
A Spatial Web Graph Model with Local Influence Regions. WAW 2007: 96-107 - 2006
- [j14]Patrick D. McDaniel, William Aiello, Kevin R. B. Butler
Origin authentication in interdomain routing. Comput. Networks 50(16): 2953-2980 (2006) - [c36]Kevin R. B. Butler
Optimizing BGP security by exploiting path stability. CCS 2006: 298-310 - [c35]Patrick D. McDaniel, Subhabrata Sen, Oliver Spatscheck, Jacobus E. van der Merwe, William Aiello, Charles R. Kalmanek:
Enterprise Security: A Community of Interest Based Approach. NDSS 2006 - [c34]William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen
Modelling and Mining of Networked Information Spaces. WAW 2006: 1-17 - [c33]William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen
Workshop on Algorithms and Models for the Web Graph. WAW 2006: 18-23 - [c32]John Healy, Jeannette C. M. Janssen
Characterization of Graphs Using Degree Cores. WAW 2006: 137-148 - 2005
- [j13]William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén:
Competitive queue policies for differentiated services. J. Algorithms 55(2): 113-141 (2005) - [c31]William Aiello, Anna C. Gilbert, Brian Rexroad, Vyas Sekar:
Sparse Approximations for High Fidelity Compression of Network Traffic Data. Internet Measurement Conference 2005: 253-266 - [c30]William Aiello, Charles R. Kalmanek, Patrick D. McDaniel, Subhabrata Sen, Oliver Spatscheck, Jacobus E. van der Merwe:
Analysis of Communities of Interest in Data Networks. PAM 2005: 83-96 - 2004
- [j12]William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold:
Just fast keying: Key agreement in a hostile internet. ACM Trans. Inf. Syst. Secur. 7(2): 242-273 (2004) - 2003
- [c29]William Aiello, John Ioannidis, Patrick D. McDaniel:
Origin authentication in interdomain routing. CCS 2003: 165-178 - [c28]Geoffrey Goodell, William Aiello, Timothy Griffin, John Ioannidis, Patrick D. McDaniel, Aviel D. Rubin:
Working around BGP: An Incremental Approach to Improving Security and Accuracy in Interdomain Routing. NDSS 2003 - [c27]William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén:
Dynamic routing on networks with fixed-size buffers. SODA 2003: 771-780 - 2002
- [c26]William Aiello, Steven M. Bellovin, Matt Blaze, John Ioannidis, Omer Reingold, Ran Canetti, Angelos D. Keromytis:
Efficient, DoS-resistant, secure key exchange for internet protocols. CCS 2002: 48-58 - 2001
- [j11]William Aiello, Fan Chung Graham, Linyuan Lu:
A Random Graph Model for Power Law Graphs. Exp. Math. 10(1): 53-66 (2001) - [j10]Pangfeng Liu, William Aiello, Sandeep N. Bhatt:
Tree Search on an Atomic Model for Message Passing. SIAM J. Comput. 31(1): 67-85 (2001) - [j9]William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman
Augmented Ring Networks. IEEE Trans. Parallel Distributed Syst. 12(6): 598-609 (2001) - [c25]William Aiello, Yuval Ishai, Omer Reingold:
Priced Oblivious Transfer: How to Sell Digital Goods. EUROCRYPT 2001: 119-135 - [c24]William Aiello, Fan R. K. Chung, Linyuan Lu:
Random Evolution in Massive Graphs. FOCS 2001: 510-519 - [c23]William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold:
Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols. Security Protocols Workshop 2001: 27-39 - 2000
- [j8]William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou:
Supporting Increment and Decrement Operations in Balancing Networks. Chic. J. Theor. Comput. Sci. 2000 (2000) - [j7]William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Adaptive Packet Routing for Bursty Adversarial Traffic. J. Comput. Syst. Sci. 60(3): 482-509 (2000) - [c22]William Aiello, Sandeep N. Bhatt, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan:
Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP. ICALP 2000: 463-474 - [c21]William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén:
Competitive Queue Policies for Differentiated Services. INFOCOM 2000: 431-440 - [c20]William Aiello, Fan R. K. Chung, Linyuan Lu:
A random graph model for massive graphs. STOC 2000: 171-180
1990 – 1999
- 1999
- [c19]William Aiello, Aviel D. Rubin, Martin Strauss:
Using Smartcards to Secure a Personalized Gambling Device. CCS 1999: 128-137 - [c18]William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan:
High-Speed Pseudorandom Number Generation with Small Memory. FSE 1999: 290-304 - [c17]William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman:
Augmented Ring Networks. SIROCCO 1999: 1-16 - [c16]William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas
Supporting Increment and Decrement Operations in Balancing Networks. STACS 1999: 393-403 - 1998
- [j6]William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan:
Design of Practical and Provably Good Random Number Generators. J. Algorithms 29(2): 358-389 (1998) - [c15]William Aiello, Sachin Lodha, Rafail Ostrovsky:
Fast Digital Identity Revocation (Extended Abstract). CRYPTO 1998: 137-152 - [c14]William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan:
Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers. CRYPTO 1998: 390-407 - [c13]William Aiello, Stuart Haber, Ramarathnam Venkatesan:
New Constructions for Secure Hash Functions. FSE 1998: 150-167 - [c12]William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
Adaptive Packet Routing for Bursty Adversarial Traffic. STOC 1998: 359-368 - [i2]William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan:
Security amplification by composition: The case of doubly-iterated ideal ciphers. CoRR cs.CR/9809031 (1998) - [i1]William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan:
Security amplification by composition: The case of doubly-iterated, ideal ciphers. IACR Cryptol. ePrint Arch. 1998: 23 (1998) - 1996
- [c11]William Aiello, Ramarathnam Venkatesan:
Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel. EUROCRYPT 1996: 307-320 - 1995
- [c10]William Aiello, Sivaramakrishnan Rajagopalan, Ramarathnam Venkatesan:
Design of Practical and Provably Good Random Number Generators (Extended Abstract). SODA 1995: 1-9 - [c9]William Aiello, Mihir Bellare, Ramarathnam Venkatesan:
Knowledge on the average-perfect, statistical and logarithmic. STOC 1995: 469-478 - 1994
- [c8]William Aiello, Ramarathnam Venkatesan, Moti Yung:
Coins, Weights and Contention in Balancing Networks. PODC 1994: 193-205 - 1993
- [j5]Andrew T. Ogielski, William Aiello:
Sparse Matrix Computations on Parallel Processor Arrays. SIAM J. Sci. Comput. 14(3): 519-530 (1993) - [c7]Pangfeng Liu, William Aiello, Sandeep N. Bhatt:
An Atomic Model for Message-Passing. SPAA 1993: 154-163 - [c6]William Aiello, Baruch Awerbuch, Bruce M. Maggs, Satish Rao:
Approximate load balancing on dynamic and asynchronous networks. STOC 1993: 632-641 - 1991
- [j4]William Aiello, Johan Håstad
Relativized Perfect Zero Knowledge Is Not BPP. Inf. Comput. 93(2): 223-240 (1991) - [j3]William Aiello, Johan Håstad
Statistical Zero-Knowledge Languages can be Recognized in Two Rounds. J. Comput. Syst. Sci. 42(3): 327-345 (1991) - [j2]William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman:
Fast Algorithms for Bit-Serial Routing on a Hypercube. Math. Syst. Theory 24(4): 253-271 (1991) - [c5]William Aiello, Milena Mihail:
Learning the Fourier Spectrum of Probabilistic Lists and Trees. SODA 1991: 291-299 - [c4]William Aiello, Frank Thomson Leighton:
Coding Theory, Hypercube Embeddings, and Fault Tolerance. SPAA 1991: 125-136 - 1990
- [j1]William Aiello, Shafi Goldwasser, Johan Håstad
On the power of interaction. Comb. 10(1): 3-25 (1990) - [c3]William Aiello, Frank Thomson Leighton, Bruce M. Maggs, Mark Newman:
Fast Algorithms for Bit-Serial Routing on a Hypercube. SPAA 1990: 55-64
1980 – 1989
- 1987
- [c2]William Aiello, Johan Håstad:
Perfect Zero-Knowledge Languages Can Be Recognized in Two Rounds. FOCS 1987: 439-448 - 1986
- [c1]William Aiello, Shafi Goldwasser, Johan Håstad:
On the Power of Interaction. FOCS 1986: 368-379
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: