default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRida A. Bazzi
Person information
- affiliation: Arizona State University, Tempe, Arizona, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c50]Rana Pourmohamad
, Steven Wirsz, Adam Oest, Tiffany Bao, Yan Shoshitaishvili, Ruoyu Wang, Adam Doupé, Rida A. Bazzi:
Deep Dive into Client-Side Anti-Phishing: A Longitudinal Study Bridging Academia and Industry. AsiaCCS 2024- [c49]Rida A. Bazzi, Sara Tucci Piergiovanni:
The Fractional Spending Problem: Executing Payment transactions in parallel with less than f+1 validations. PODC 2024: 295-305 - [i5]Rida A. Bazzi, Sara Tucci Piergiovanni:
Fractional Payment Transactions: Executing Payment Transactions in Parallel with Less than f+1 Validations. CoRR abs/2405.05645 (2024) - 2023
- [c48]Rida A. Bazzi, Sara Tucci Piergiovanni:
Brief Announcement: Breaking the f + 1 Barrier: Executing Payment Transactions in Parallel with Less than f + 1 Validations. PODC 2023: 274-277 - [i4]Rida A. Bazzi, Sara Tucci Piergiovanni:
Breaking the f+1 Barrier: Executing Payment Transactions in Parallel with Less than f+1 Validations. CoRR abs/2301.10149 (2023) - 2022
- [j11]Rida A. Bazzi, Maurice Herlihy:
Clairvoyant state machine replication. Inf. Comput. 285(Part): 104701 (2022)
2010 – 2019
- 2019
- [c47]Rida A. Bazzi, Joseph L. Briones:
Stationary and Deterministic Leader Election in Self-organizing Particle Systems. SSS 2019: 22-37 - [i3]Rida A. Bazzi, Maurice Herlihy:
Clairvoyant State Machine Replication. CoRR abs/1905.11607 (2019) - 2018
- [c46]Teklemariam Tesfay, Mahdi Jamei, Anna Scaglione, Mojdeh Khorsand, Kory Hedman, Rida A. Bazzi:
AVAIL: Assured Volt-Ampère Information Ledger. SmartGridComm 2018: 1-6 - [c45]Rida A. Bazzi, Maurice Herlihy:
Clairvoyant State Machine Replications. SSS 2018: 254-268 - [c44]Rida A. Bazzi, Joseph L. Briones:
Brief Announcement: Deterministic Leader Election in Self-organizing Particle Systems. SSS 2018: 381-386 - 2015
- [c43]Ruben Acuña, Zoé Lacroix, Rida A. Bazzi:
Instrumentation and Trace Analysis for Ad-Hoc Python Workflows in Cloud Environments. CLOUD 2015: 114-121 - [c42]Zahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida A. Bazzi, Andréa W. Richa, Christian Scheideler:
Leader Election and Shape Formation with Self-organizing Programmable Matter. DNA 2015: 117-132 - [c41]Zahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida A. Bazzi, Andréa W. Richa, Christian Scheideler:
Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. PODC 2015: 67-69 - [c40]Jun Shen, Rida A. Bazzi:
A Formal Study of Backward Compatible Dynamic Software Updates. SEFM 2015: 231-248 - [i2]Jun Shen, Rida A. Bazzi:
A Formal Study on Backward Compatible Dynamic Software Updates. CoRR abs/1503.07235 (2015) - [i1]Zahra Derakhshandeh, Robert Gmyr, Thim Strothmann, Rida A. Bazzi, Andréa W. Richa, Christian Scheideler:
Leader Election and Shape Formation with Self-Organizing Programmable Matter. CoRR abs/1503.07991 (2015) - 2014
- [j10]Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod:
Effective storage capacity of labeled graphs. Inf. Comput. 234: 44-56 (2014) - 2013
- [c39]Mohsen Zohrevandi, Rida A. Bazzi:
Auto-FBI: a user-friendly approach for secure access to sensitive content on the web. ACSAC 2013: 349-358 - [c38]Mohsen Zohrevandi, Rida A. Bazzi:
The Bounded Data Reuse Problem in Scientific Workflows. IPDPS 2013: 1051-1062 - 2012
- [c37]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
- [c36]Michael Hicks, Rida A. Bazzi, Carlo Zaniolo:
Foreword. ICDE Workshops 2011: 132-133 - [c35]Hrishikesh B. Acharya, Taehwan Choi, Rida A. Bazzi, Mohamed G. Gouda:
The K-Observer Problem in Computer Networks. SSS 2011: 5-18 - 2010
- [c34]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 - [c33]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) - [c32]Rida A. Bazzi, Kristis Makris, Peyman Nayeri, Jun Shen:
Dynamic Software Updates: The State Mapping Problem. HotSWUp 2009 - [c31]Rida A. Bazzi, Maurice Herlihy:
Enhanced Fault-Tolerance through Byzantine Failure Detection. OPODIS 2009: 129-143 - [c30]Kristis Makris, Rida A. Bazzi:
Immediate Multi-Threaded Dynamic Software Updates Using Stack Reconstruction. USENIX ATC 2009 - 2008
- [c29]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:
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 [contents] - 2007
- [j8]Rida A. Bazzi, Goran Konjevod:
On the establishment of distinct identities in overlay networks. Distributed Comput. 19(4): 267-287 (2007) - [c28]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 - [c27]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
- [c26]Rony Ferzli, Rida A. Bazzi, Lina J. Karam:
A Captcha Based on the Human Visual Systems Masking Characteristics. ICME 2006: 517-520 - [c25]Rida A. Bazzi, Young-ri Choi, Mohamed G. Gouda:
Hop Chains: Secure Routing and the Establishment of Distinct Identities. OPODIS 2006: 365-379 - [c24]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 - [c23]Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi:
Byzantine and Multi-writer K-Quorums. DISC 2006: 443-458 - 2005
- [c22]Tuyet-Trang Lam, Lina J. Karam, Rida A. Bazzi, Glen P. Abousleman:
Reduced-Delay Selective ARQ for Low Bit-Rate Image and Multimedia Data Transmission. ICASSP (2) 2005: 309-312 - [c21]Rida A. Bazzi, Goran Konjevod:
On the establishment of distinct identities in overlay networks. PODC 2005: 312-320 - [c20]Rida A. Bazzi, Yin Ding:
Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems. PODC 2005: 353 - [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]Rida A. Bazzi, Yin Ding:
Brief announcement: efficient implementation of a byzantine data storage system. PODC 2004: 400 - [c16]Rida A. Bazzi, Yin Ding:
Non-skipping Timestamps for Byzantine Data Storage Systems. DISC 2004: 405-419 - [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 Comput. 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]Rida A. Bazzi:
Synchronous Byzantine Quorum Systems. Distributed Comput. 13(1): 45-52 (2000) - [j4]Rida A. Bazzi:
Planar quorums. Theor. Comput. Sci. 243(1-2): 243-268 (2000)
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]Rida A. Bazzi:
Non-blocking Asynchronous Byzantine Quorum Systems. DISC 1999: 109-122 - 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 Comput. 10(3): 117-127 (1997) - [c10]Rida A. Bazzi:
Portable Memory. FTDCS 1997: 162-167 - [c9]Rida A. Bazzi:
Synchronous Byzantine Quorum Systems. PODC 1997: 259-266 - 1996
- [c8]Rida A. Bazzi:
Planar Quorums. WDAG 1996: 251-268 - 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
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-08-05 21:10 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:
