Alexander Spiegelman

Orcid: 0000-0002-7148-0414

Affiliations:
  • Aptos Labs, Palo Alto, USA


According to our database1, Alexander Spiegelman authored at least 57 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A New Paradigm for Verifiable Secret Sharing.
IACR Cryptol. ePrint Arch., 2023

Shoal: Improving DAG-BFT Latency And Robustness.
CoRR, 2023

Block-STM: Scaling Blockchain Execution by Turning Ordering Curse to a Performance Blessing.
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Proof of Availability and Retrieval in a Modular Blockchain Architecture.
Proceedings of the Financial Cryptography and Data Security, 2023

2022
Fast Concurrent Data Sketches.
ACM Trans. Parallel Comput., 2022

Proof of Availability & Retrieval in a Modular Blockchain Architecture.
IACR Cryptol. ePrint Arch., 2022

Bullshark: The Partially Synchronous Version.
CoRR, 2022

Make Every Word Count: Adaptive BA with Fewer Words.
CoRR, 2022

Brief Announcement: Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback.
Proceedings of the Financial Cryptography and Data Security, 2022

Short Paper: On Game-Theoretically-Fair Leader Election.
Proceedings of the Financial Cryptography and Data Security, 2022

Be Aware of Your Leaders.
Proceedings of the Financial Cryptography and Data Security, 2022

Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus.
Proceedings of the EuroSys '22: Seventeenth European Conference on Computer Systems, Rennes, France, April 5, 2022

Bullshark: DAG BFT Protocols Made Practical.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement.
Proceedings of the 4th ACM Conference on Advances in Financial Technologies, 2022

2021
Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.
CoRR, 2021

In Search for an Optimal Authenticated Byzantine Agreement.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Brief Announcement: Probabilistic Indistinguishability and The Quality of Validity in Byzantine Agreement.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Brief Announcement: Using Nesting to Push the Limits of Transactional Data Structure Libraries.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Tuning PoW with Hybrid Expenditure.
Proceedings of the 3rd International Conference on Blockchain Economics, 2021

All You Need is DAG.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Brief Announcement: Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Using Nesting to Push the Limits of Transactional Data Structure Libraries.
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Game of Coins.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020
In Search for a Linear Byzantine Agreement.
CoRR, 2020

Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Nesting and composition in transactional data structure libraries.
Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Brief Announcement: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Bootstrapping Consensus Without Trusted Setup: Fully Asynchronous Distributed Key Generation.
IACR Cryptol. ePrint Arch., 2019

ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication.
CoRR, 2019

Just Enough Security: Reducing Proof-of-Work Ecological Footprint.
CoRR, 2019

Lumière: Byzantine View Synchronization.
CoRR, 2019

Fast Concurrent Data Sketches.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Asymptotically Optimal Validated Asynchronous Byzantine Agreement.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

FairLedger: A Fair Blockchain Protocol for Financial Institutions.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Mind the Mining.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication.
CoRR, 2018

Integrated Bounds for Disintegrated Storage.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

2017
Revisiting the Paxos Foundations: A Look at Summer Internship Work at VMware Research.
ACM SIGOPS Oper. Syst. Rev., 2017

Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus.
IACR Cryptol. ePrint Arch., 2017

Towards Reduced Instruction Sets for Synchronization.
CoRR, 2017

Dynamic Reconfiguration: Abstraction and Optimal Asynchronous Solution.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Brief Announcement: Towards Reduced Instruction Sets for Synchronization.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

On Liveness of Dynamic Storage.
Proceedings of the Structural Information and Communication Complexity, 2017

Space Complexity of Fault-Tolerant Register Emulations.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus.
CoRR, 2016

Brief Announcement: Transactional Data Structure Libraries.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Space Bounds for Reliable Storage: Fundamental Limits of Coding.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Transactional data structure libraries.
Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2016

Dynamic Atomic Snapshots.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Flexible Paxos: Quorum Intersection Revisited.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
Space Bounds for Reliable Multi-Writer Data Store: Inherent Cost of Read/Write Primitives.
CoRR, 2015

Dynamic Reconfiguration: A Tutorial (Tutorial).
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Space Bounds for Reliable Storage: Fundamental Limits of Coding (Keynote).
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015


  Loading...