Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Rida A. Bazzi
2010 – today
- 2012
[c35]Rida A. Bazzi, Bryan Topp, Iulian Neamtiu: How to have your cake and eat it too: Dynamic software updating with just-in-time overhead. HotSWUp 2012: 1-5- 2011
- [c34]
- [c33]Hrishikesh B. Acharya, Taehwan Choi, Rida A. Bazzi, Mohamed G. Gouda: The K-Observer Problem in Computer Networks. SSS 2011: 5-18
- 2010
- [c32]Rida A. Bazzi, Jeffrey M. Kiefer, Zoé Lacroix: A User-Centric Classification of Tools for Biological Resource Discovery and Integration on the Web. RED 2010: 71-87
- [c31]Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod: Storage Capacity of Labeled Graphs. SSS 2010: 573-587
2000 – 2009
- 2009
- [j9]Rida A. Bazzi, Young-ri Choi, Mohamed G. Gouda: Hop chains: Secure routing and the establishment of distinct identities. Theor. Comput. Sci. 410(6-7): 467-480 (2009)
- [c30]Rida A. Bazzi, Kristis Makris, Peyman Nayeri, Jun Shen: Dynamic Software Updates: The State Mapping Problem. HotSWUp 2009
- [c29]Rida A. Bazzi, Maurice Herlihy: Enhanced Fault-Tolerance through Byzantine Failure Detection. OPODIS 2009: 129-143
- 2008
- [c28]Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi, Allen Clement: Matrix Signatures: From MACs to Digital Signatures in Distributed Systems. DISC 2008: 16-31
- [e1]Rida A. Bazzi, Boaz Patt-Shamir (Eds.): Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008. ACM 2008, ISBN 978-1-59593-989-0
- 2007
- [j8]Rida A. Bazzi, Goran Konjevod: On the establishment of distinct identities in overlay networks. Distributed Computing 19(4): 267-287 (2007)
- [c27]Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi: Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. PODC 2007: 310-311
- [c26]Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi: Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions. DISC 2007: 7-19
- 2006
- [c25]Rony Ferzli, Rida A. Bazzi, Lina J. Karam: A Captcha Based on the Human Visual Systems Masking Characteristics. ICME 2006: 517-520
- [c24]Rida A. Bazzi, Young-ri Choi, Mohamed G. Gouda: Hop Chains: Secure Routing and the Establishment of Distinct Identities. OPODIS 2006: 365-379
- [c23]
- [c22]Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi: Byzantine and Multi-writer K-Quorums. DISC 2006: 443-458
- 2005
- [c21]Rida A. Bazzi, Goran Konjevod: On the establishment of distinct identities in overlay networks. PODC 2005: 312-320
- [c20]
- [c19]Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi: On the Availability of Non-strict Quorum Systems. DISC 2005: 48-62
- 2004
- [c18]Tuyet-Trang Lam, Lina J. Karam, Rida A. Bazzi, Glen P. Abousleman: Selective fec for error-resilient image coding and transmission using similarity check functions. ICIP 2004: 3217-3220
- [c17]
- [c16]
- [c15]Rida A. Bazzi, Goran Konjevod: Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty. DISC 2004: 420-434
- 2003
- [c14]Ping Lin, K. Selçuk Candan, Rida A. Bazzi, Zhichao Liu: Hiding Data and Code Security for Application Hosting Infrastructure. ISI 2003: 388
- 2002
- [c13]Feras Karablieh, Rida A. Bazzi: Heterogeneous Checkpointing for Multithreaded Applications. SRDS 2002: 140-149
- 2001
- [j7]Rida A. Bazzi: Access cost for asynchronous Byzantine quorum systems. Distributed Computing 14(1): 41-48 (2001)
- [j6]Rida A. Bazzi, Gil Neiger: Simplifying fault-tolerance: providing the abstraction of crash failures. J. ACM 48(3): 499-554 (2001)
- [c12]Feras Karablieh, Rida A. Bazzi, Margaret Hicks: Compiler-Assisted Heterogeneous Checkpointing. SRDS 2001: 56-
- 2000
- [j5]
- [j4]
1990 – 1999
- 1999
- [j3]Gil Neiger, Rida A. Bazzi: Using Knowledge to Optimally Achieve Coordination in Distributed Systems. Theor. Comput. Sci. 220(1): 31-65 (1999)
- [c11]
- 1997
- [j2]Rida A. Bazzi, Gil Neiger: The Complexity of Almost-Optimal Simultaneous Coordination. Algorithmica 17(3): 308-321 (1997)
- [j1]Rida A. Bazzi, Gil Neiger, Gary L. Peterson: On the Use of Registers in Achieving Wait-Free Consensus. Distributed Computing 10(3): 117-127 (1997)
- [c10]
- [c9]
- 1996
- [c8]
- 1994
- [c7]Rida A. Bazzi, Gary L. Peterson: A Gap Theorem for Consensus Types (Extended Abstract). PODC 1994: 344-353
- [c6]Rida A. Bazzi, Gary L. Peterson: On the Use of Registers in Achieving Wait-Free Consensus. PODC 1994: 354-362
- 1993
- [c5]Mustaque Ahamad, Rida A. Bazzi, Ranjit John, Prince Kohli, Gil Neiger: The Power of Processor Consistency. SPAA 1993: 251-260
- 1992
- [c4]Rida A. Bazzi, Gil Neiger: The Possibility and the Complexity of Achieving Fault-Tolerant Coordination. PODC 1992: 203-214
- [c3]Gil Neiger, Rida A. Bazzi: Using Knowledge to Optimally Achieve Coordination in Distributed Systems. TARK 1992: 43-59
- [c2]Rida A. Bazzi, Gil Neiger: Simulating Crash Failures with Many Faulty Processors (Extended Abstract). WDAG 1992: 166-184
- 1991
- [c1]Rida A. Bazzi, Gil Neiger: Optimally Simulating Crash Failures in a Byzantine Environment. WDAG 1991: 108-128
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-26 20:11 CET by the dblp team