2016 - IEEE Fellow For contributions to reliable distributed systems
2010 - ACM Fellow For contributions to fault-tolerant distributed computing, bridging theory and practice.
2001 - Fellow of Alfred P. Sloan Foundation
Lorenzo Alvisi mainly focuses on Distributed computing, Fault tolerance, Byzantine fault tolerance, Quantum Byzantine agreement and State machine replication. His Distributed computing research is multidisciplinary, incorporating perspectives in Consistency, Scalability, Computer network and Robustness. His Fault tolerance study incorporates themes from State and Language construct.
His research brings together the fields of Server and Byzantine fault tolerance. As a part of the same scientific family, Lorenzo Alvisi mostly works in the field of Quantum Byzantine agreement, focusing on Protocol and, on occasion, Shared memory and Computer data storage. In his study, Parameterized complexity is inextricably linked to Asynchronous communication, which falls within the broad field of State machine replication.
His main research concerns Distributed computing, Fault tolerance, Server, Byzantine fault tolerance and Computer network. Lorenzo Alvisi has included themes like Consistency, Scalability and Protocol in his Distributed computing study. The study incorporates disciplines such as High availability, Debugging, Crash and Parallel computing in addition to Fault tolerance.
His studies deal with areas such as File server and Data integrity as well as Server. His research on Byzantine fault tolerance also deals with topics like
The scientist’s investigation covers issues in Distributed computing, Scalability, Computer security, Concurrency control and Distributed database. A large part of his Distributed computing studies is devoted to Distributed data store. His work focuses on many connections between Scalability and other disciplines, such as Leverage, that overlap with his field of interest in Telecommunications.
His study in the field of Adversary, Cryptographic protocol and Encryption also crosses realms of Social graph and Email encryption. His Cryptographic protocol research focuses on Overhead and how it relates to Plaintext, Server and Protocol. His work deals with themes such as Computer network, Commit, Online transaction processing and Oblivious ram, Cloud computing, which intersect with Concurrency control.
His primary scientific interests are in Distributed computing, Scalability, Computer security, Causal consistency and Concurrency control. His Distributed computing study which covers Operating system that intersects with Correctness. His Scalability research is multidisciplinary, incorporating elements of Isolation, Database transaction, Atomicity and Workflow.
Many of his research projects under Computer security are closely connected to Social graph, Slowdown and Replica with Social graph, Slowdown and Replica, tying the diverse disciplines of science together. His Causal consistency studies intersect with other disciplines such as Thread, Weak consistency, Eventual consistency, Merge and Snapshot. His Concurrency control study frequently involves adjacent topics like Concurrency.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A survey of rollback-recovery protocols in message-passing systems
E. N. (Mootaz) Elnozahy;Lorenzo Alvisi;Yi-Min Wang;David B. Johnson.
ACM Computing Surveys (2002)
Modeling the effect of technology trends on the soft error rate of combinational logic
P. Shivakumar;M. Kistler;S.W. Keckler;D. Burger.
dependable systems and networks (2002)
Making Byzantine fault tolerant systems tolerate Byzantine faults
Allen Clement;Edmund Wong;Lorenzo Alvisi;Mike Dahlin.
networked systems design and implementation (2009)
Separating agreement from execution for byzantine fault tolerant services
Jian Yin;Jean-Philippe Martin;Arun Venkataramani;Lorenzo Alvisi.
symposium on operating systems principles (2003)
BAR fault tolerance for cooperative services
Amitanand S. Aiyer;Lorenzo Alvisi;Allen Clement;Mike Dahlin.
symposium on operating systems principles (2005)
Depot: Cloud Storage with Minimal Trust
Prince Mahajan;Srinath Setty;Sangmin Lee;Allen Clement.
ACM Transactions on Computer Systems (2011)
Fast Byzantine Consensus
J.-P. Martin;L. Alvisi.
IEEE Transactions on Dependable and Secure Computing (2006)
Message logging: pessimistic, optimistic, causal, and optimal
L. Alvisi;K. Marzullo.
IEEE Transactions on Software Engineering (1998)
BAR gossip
Harry C. Li;Allen Clement;Edmund L. Wong;Jeff Napper.
operating systems design and implementation (2006)
Zyzzyva: Speculative Byzantine fault tolerance
Ramakrishna Kotla;Lorenzo Alvisi;Mike Dahlin;Allen Clement.
ACM Transactions on Computer Systems (2010)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
The University of Texas at Austin
University of Maryland, College Park
Tata Consultancy Services Venture
New York University
University of Bologna
IBM (United States)
Diem Association
The University of Texas at Austin
University of Massachusetts Amherst
Duke University
National University of Kaohsiung
Google (United States)
University of Sheffield
Kyoto University
Ocean University of China
University of Cambridge
University of Salerno
Universidade de Vigo
University of Miami
University of Lille
ETH Zurich
University of Colorado Boulder
University of Washington
University of Milan
University of Western Ontario
IMT Atlantique