- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0452
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
The complexity of verifying population protocols ; volume:34 ; number:2 ; day:24 ; month:3 ; year:2021 ; pages:133-177 ; date:4.2021
Distributed computing ; 34, Heft 2 (24.3.2021), 133-177, 4.2021
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00446-021-00390-x
- URN
-
urn:nbn:de:101:1-2021051616043890688635
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:51 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Esparza, Javier
- Jaax, Stefan
- Raskin, Mikhail
- Weil-Kennedy, Chana
- SpringerLink (Online service)
Ähnliche Objekte (12)
Computational Complexity of Verifying Parameterized Systems
Lower bounds on the state complexity of population protocols
Verifying probabilistic systems : new algorithms and complexity results
Verifying OPAL, Pt. 1.. Verifying in the small
The complexity of verifying popularity and strict popularity in altruistic hedonic games
A note on the computational complexity of some problems for self-verifying finite automata
On the Complexity of Verifying Timed Golog Programs over Description Logic Actions : Extended Version
Verifying Negative Sentences
The Complexity of Verifying Loop-free Programs as Differentially Private: Q/A Session D - Paper D4.C
Verifying the robustness of opinion inference
Verifying the robustness of opinion inference
Verifying real-time systems
Computational Complexity of Verifying Parameterized Systems
Lower bounds on the state complexity of population protocols
Verifying probabilistic systems : new algorithms and complexity results
Verifying OPAL, Pt. 1.. Verifying in the small
The complexity of verifying popularity and strict popularity in altruistic hedonic games
A note on the computational complexity of some problems for self-verifying finite automata
On the Complexity of Verifying Timed Golog Programs over Description Logic Actions : Extended Version
Verifying Negative Sentences
The Complexity of Verifying Loop-free Programs as Differentially Private: Q/A Session D - Paper D4.C
Verifying the robustness of opinion inference
Verifying the robustness of opinion inference
Verifying real-time systems
Computational Complexity of Verifying Parameterized Systems
Lower bounds on the state complexity of population protocols
Verifying probabilistic systems : new algorithms and complexity results
Verifying OPAL, Pt. 1.. Verifying in the small
The complexity of verifying popularity and strict popularity in altruistic hedonic games
A note on the computational complexity of some problems for self-verifying finite automata
On the Complexity of Verifying Timed Golog Programs over Description Logic Actions : Extended Version
Verifying Negative Sentences
The Complexity of Verifying Loop-free Programs as Differentially Private: Q/A Session D - Paper D4.C
Verifying the robustness of opinion inference
Verifying the robustness of opinion inference