I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
When is Recoverable Consensus Harder Than Consensus?:
, In:
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
,
Delporte-Gallet, Carole
;
Fatourou, Panagiota
;
Fauconnier, Hugues
. - p. 198-208 , 2022
Link:
https://dl.acm.org/doi/10.1145/3519270.3538418
RT T1 <cTitle>Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing</cTitle>: T1 <Title>When is Recoverable Consensus Harder Than Consensus?</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3538418&Exemplar=1&LAN=DE A1 Delporte-Gallet, Carole A1 Fatourou, Panagiota A1 Fauconnier, Hugues A1 Ruppert, Eric PB ACM YR 2022 K1 asynchronous K1 consensus hierarchy K1 crash and recovery K1 non-volatile memory K1 readable objects K1 recoverable consensus K1 shared memory K1 wait-free K1 Theory of computation K1 Design and analysis of algorithms K1 Concurrent algorithms K1 Parallel algorithms K1 Shared memory algorithms K1 Models of computation K1 Concurrency K1 Distributed computing models K1 Computer systems organization K1 Dependable and fault-tolerant systems and networks SP 198 OP 208 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3519270.3538418 DO https://dl.acm.org/doi/10.1145/3519270.3538418 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
