Rida A. Bazzi

Orcid: 0000-0003-1872-1634

Affiliations:
  • Arizona State University, Tempe, Arizona, USA


According to our database1, Rida A. Bazzi authored at least 57 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fractional Payment Transactions: Executing Payment Transactions in Parallel with Less than f+1 Validations.
CoRR, 2024

The Fractional Spending Problem: Executing Payment transactions in parallel with less than <i>f</i>+1 validations.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Deep Dive into Client-Side Anti-Phishing: A Longitudinal Study Bridging Academia and Industry.
Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, 2024

2023
Breaking the f+1 Barrier: Executing Payment Transactions in Parallel with Less than f+1 Validations.
CoRR, 2023

Brief Announcement: Breaking the <i>f</i> + 1 Barrier: Executing Payment Transactions in Parallel with Less than <i>f</i> + 1 Validations.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022
Clairvoyant state machine replication.
Inf. Comput., 2022

2019
Stationary and Deterministic Leader Election in Self-organizing Particle Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

2018
Clairvoyant State Machine Replications.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Brief Announcement: Deterministic Leader Election in Self-organizing Particle Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

AVAIL: Assured Volt-Ampère Information Ledger.
Proceedings of the 2018 IEEE International Conference on Communications, 2018

2015
A Formal Study of Backward Compatible Dynamic Software Updates.
Proceedings of the Software Engineering and Formal Methods - 13th International Conference, 2015

Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Leader Election and Shape Formation with Self-organizing Programmable Matter.
Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015

Instrumentation and Trace Analysis for Ad-Hoc Python Workflows in Cloud Environments.
Proceedings of the 8th IEEE International Conference on Cloud Computing, 2015

2014
Effective storage capacity of labeled graphs.
Inf. Comput., 2014

2013
The Bounded Data Reuse Problem in Scientific Workflows.
Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Auto-FBI: a user-friendly approach for secure access to sensitive content on the web.
Proceedings of the Annual Computer Security Applications Conference, 2013

2012
How to have your cake and eat it too: Dynamic software updating with just-in-time overhead.
Proceedings of the 4th International Workshop on Hot Topics in Software Upgrades, 2012

2011
The K-Observer Problem in Computer Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Foreword.
Proceedings of the Workshops Proceedings of the 27th International Conference on Data Engineering, 2011

2010
Storage Capacity of Labeled Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

A User-Centric Classification of Tools for Biological Resource Discovery and Integration on the Web.
Proceedings of the Resource Discovery - Third International Workshop, 2010

2009
Hop chains: Secure routing and the establishment of distinct identities.
Theor. Comput. Sci., 2009

Immediate Multi-Threaded Dynamic Software Updates Using Stack Reconstruction.
Proceedings of the 2009 USENIX Annual Technical Conference, 2009

Enhanced Fault-Tolerance through Byzantine Failure Detection.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Dynamic Software Updates: The State Mapping Problem.
Proceedings of the 2nd ACM Workshop on Hot Topics in Software Upgrades, 2009

2008
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

2007
On the establishment of distinct identities in overlay networks.
Distributed Comput., 2007

Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Bounded Wait-Free <i>f</i>-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Byzantine and Multi-writer K-Quorums.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

A Captcha Based on the Human Visual Systems Masking Characteristics.
Proceedings of the 2006 IEEE International Conference on Multimedia and Expo, 2006

2005
On the Availability of Non-strict Quorum Systems.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Reduced-Delay Selective ARQ for Low Bit-Rate Image and Multimedia Data Transmission.
Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

2004
Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Non-skipping Timestamps for Byzantine Data Storage Systems.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Brief announcement: efficient implementation of a byzantine data storage system.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Selective fec for error-resilient image coding and transmission using similarity check functions.
Proceedings of the 2004 International Conference on Image Processing, 2004

2003
Hiding Data and Code Security for Application Hosting Infrastructure.
Proceedings of the Intelligence and Security Informatics, First NSF/NIJ Symposium, 2003

2002
Heterogeneous Checkpointing for Multithreaded Applications.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

2001
Simplifying fault-tolerance: providing the abstraction of crash failures.
J. ACM, 2001

Access cost for asynchronous Byzantine quorum systems.
Distributed Comput., 2001

Compiler-Assisted Heterogeneous Checkpointing.
Proceedings of the 20th Symposium on Reliable Distributed Systems (SRDS 2001), 2001

2000
Planar quorums.
Theor. Comput. Sci., 2000

Synchronous Byzantine Quorum Systems.
Distributed Comput., 2000

1999
Using Knowledge to Optimally Achieve Coordination in Distributed Systems.
Theor. Comput. Sci., 1999

Non-blocking Asynchronous Byzantine Quorum Systems.
Proceedings of the Distributed Computing, 1999

1997
On the Use of Registers in Achieving Wait-Free Consensus.
Distributed Comput., 1997

The Complexity of Almost-Optimal Simultaneous Coordination.
Algorithmica, 1997

Portable Memory.
Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computer Systems (FTDCS '97), 1997

1994
On the Use of Registers in Achieving Wait-Free Consensus.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

A Gap Theorem for Consensus Types (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
The Power of Processor Consistency.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1992
Simulating Crash Failures with Many Faulty Processors (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

The Possibility and the Complexity of Achieving Fault-Tolerant Coordination.
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991
Optimally Simulating Crash Failures in a Byzantine Environment.
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991


  Loading...