| 2009 |
|---|
| 38 | EE | 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) |
| 2008 |
|---|
| 37 | | Rida A. Bazzi,
Boaz Patt-Shamir:
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008
ACM 2008 |
| 36 | EE | Amitanand S. Aiyer,
Lorenzo Alvisi,
Rida A. Bazzi,
Allen Clement:
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems.
DISC 2008: 16-31 |
| 2007 |
|---|
| 35 | EE | 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 |
| 34 | EE | 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 |
| 33 | EE | Rida A. Bazzi,
Goran Konjevod:
On the establishment of distinct identities in overlay networks.
Distributed Computing 19(4): 267-287 (2007) |
| 2006 |
|---|
| 32 | EE | Rida A. Bazzi,
Yin Ding:
Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients.
DISC 2006: 299-313 |
| 31 | EE | Amitanand S. Aiyer,
Lorenzo Alvisi,
Rida A. Bazzi:
Byzantine and Multi-writer K-Quorums.
DISC 2006: 443-458 |
| 30 | EE | Rony Ferzli,
Rida A. Bazzi,
Lina J. Karam:
A Captcha Based on the Human Visual Systems Masking Characteristics.
ICME 2006: 517-520 |
| 29 | EE | Rida A. Bazzi,
Young-ri Choi,
Mohamed G. Gouda:
Hop Chains: Secure Routing and the Establishment of Distinct Identities.
OPODIS 2006: 365-379 |
| 2005 |
|---|
| 28 | EE | Amitanand S. Aiyer,
Lorenzo Alvisi,
Rida A. Bazzi:
On the Availability of Non-strict Quorum Systems.
DISC 2005: 48-62 |
| 27 | EE | Rida A. Bazzi,
Goran Konjevod:
On the establishment of distinct identities in overlay networks.
PODC 2005: 312-320 |
| 26 | EE | Rida A. Bazzi,
Yin Ding:
Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems.
PODC 2005: 353 |
| 2004 |
|---|
| 25 | EE | Rida A. Bazzi,
Yin Ding:
Non-skipping Timestamps for Byzantine Data Storage Systems.
DISC 2004: 405-419 |
| 24 | EE | 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 |
| 23 | | 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 |
| 22 | EE | Rida A. Bazzi,
Yin Ding:
Brief announcement: efficient implementation of a byzantine data storage system.
PODC 2004: 400 |
| 2003 |
|---|
| 21 | EE | Ping Lin,
K. Selçuk Candan,
Rida A. Bazzi,
Zhichao Liu:
Hiding Data and Code Security for Application Hosting Infrastructure.
ISI 2003: 388 |
| 2002 |
|---|
| 20 | EE | Feras Karablieh,
Rida A. Bazzi:
Heterogeneous Checkpointing for Multithreaded Applications.
SRDS 2002: 140-149 |
| 2001 |
|---|
| 19 | EE | Feras Karablieh,
Rida A. Bazzi,
Margaret Hicks:
Compiler-Assisted Heterogeneous Checkpointing.
SRDS 2001: 56- |
| 18 | EE | Rida A. Bazzi:
Access cost for asynchronous Byzantine quorum systems.
Distributed Computing 14(1): 41-48 (2001) |
| 17 | EE | Rida A. Bazzi,
Gil Neiger:
Simplifying fault-tolerance: providing the abstraction of crash failures.
J. ACM 48(3): 499-554 (2001) |
| 2000 |
|---|
| 16 | EE | Rida A. Bazzi:
Synchronous Byzantine Quorum Systems.
Distributed Computing 13(1): 45-52 (2000) |
| 15 | EE | Rida A. Bazzi:
Planar quorums.
Theor. Comput. Sci. 243(1-2): 243-268 (2000) |
| 1999 |
|---|
| 14 | EE | Rida A. Bazzi:
Non-blocking Asynchronous Byzantine Quorum Systems.
DISC 1999: 109-122 |
| 13 | EE | Gil Neiger,
Rida A. Bazzi:
Using Knowledge to Optimally Achieve Coordination in Distributed Systems.
Theor. Comput. Sci. 220(1): 31-65 (1999) |
| 1997 |
|---|
| 12 | EE | Rida A. Bazzi:
Portable Memory.
FTDCS 1997: 162-167 |
| 11 | | Rida A. Bazzi:
Synchronous Byzantine Quorum Systems.
PODC 1997: 259-266 |
| 10 | | Rida A. Bazzi,
Gil Neiger:
The Complexity of Almost-Optimal Simultaneous Coordination.
Algorithmica 17(3): 308-321 (1997) |
| 9 | | 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) |
| 1996 |
|---|
| 8 | | Rida A. Bazzi:
Planar Quorums.
WDAG 1996: 251-268 |
| 1994 |
|---|
| 7 | | Rida A. Bazzi,
Gary L. Peterson:
A Gap Theorem for Consensus Types (Extended Abstract).
PODC 1994: 344-353 |
| 6 | | Rida A. Bazzi,
Gary L. Peterson:
On the Use of Registers in Achieving Wait-Free Consensus.
PODC 1994: 354-362 |
| 1993 |
|---|
| 5 | EE | Mustaque Ahamad,
Rida A. Bazzi,
Ranjit John,
Prince Kohli,
Gil Neiger:
The Power of Processor Consistency.
SPAA 1993: 251-260 |
| 1992 |
|---|
| 4 | | Rida A. Bazzi,
Gil Neiger:
The Possibility and the Complexity of Achieving Fault-Tolerant Coordination.
PODC 1992: 203-214 |
| 3 | | Gil Neiger,
Rida A. Bazzi:
Using Knowledge to Optimally Achieve Coordination in Distributed Systems.
TARK 1992: 43-59 |
| 2 | | Rida A. Bazzi,
Gil Neiger:
Simulating Crash Failures with Many Faulty Processors (Extended Abstract).
WDAG 1992: 166-184 |
| 1991 |
|---|
| 1 | | Rida A. Bazzi,
Gil Neiger:
Optimally Simulating Crash Failures in a Byzantine Environment.
WDAG 1991: 108-128 |
