( en | de | ru )

 

Disambiguation of "Spiegelman, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Be Aware of Your Leaders.

, , , , , , and . Financial Cryptography, volume 13411 of Lecture Notes in Computer Science, page 279-295. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexander

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)

Alexander Gocht

Methods in economic farm modelling. Uni Bonn, (2009)

Alexander Blecken

A reference task model for supply chain processes of humanitarian organisations. Uni Paderborn, (2009)
 

Other publications of authors with the same name

Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures., , and . ACM Conference on Computer and Communications Security, page 1751-1767. ACM, (2020)Bullshark: DAG BFT Protocols Made Practical., , , and . CCS, page 2705-2718. ACM, (2022)Tuning PoW with Hybrid Expenditure., , and . Tokenomics, volume 97 of OASIcs, page 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dynamic Atomic Snapshots., and . OPODIS, volume 70 of LIPIcs, page 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Integrated Bounds for Disintegrated Storage., , and . DISC, volume 121 of LIPIcs, page 11:1-11:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)All You Need is DAG., , , and . PODC, page 165-175. ACM, (2021)Nesting and composition in transactional data structure libraries., , , , and . PPoPP, page 405-406. ACM, (2020)Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement., , and . CoRR, (2020)Fast Concurrent Data Sketches., , , , , , and . ACM Trans. Parallel Comput., 9 (2): 6:1-6:35 (2022)Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication., , and . CoRR, (2018)