zweidimensionales bewegtes Bild
Graph algorithms and population protocols: Fast Deterministic Algorithms for Highly-Dynamic Networks
- Standort
-
Hannover TIB
- Umfang
-
114MB, 00:22:19:25 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
OPODIS: International Conference on Principles of Distributed Systems, 2020 ; (Jan. 2020)
- Ereignis
-
Veröffentlichung
- (wer)
-
Opodis
- (wann)
-
2020-01-01
- Beteiligte Personen und Organisationen
-
Censor-Hillel, Keren
Dafni, Neta
Kolobov, Victor I.
Paz, Ami
Schwartzman, Gregory
- DOI
-
10.5446/52876
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Censor-Hillel, Keren
- Dafni, Neta
- Kolobov, Victor I.
- Paz, Ami
- Schwartzman, Gregory
- Opodis
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
Graph algorithms and population protocols: Secured Distributed Algorithms without Hardness Assumptions
Deterministic Sparse FFT Algorithms
Graph algorithms and population protocols: Distributed Distance Approximation
Graph algorithms and population protocols: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Graph algorithms
Algorithms for deterministic and stochastic scheduling
Deterministic approximation algorithms in computational convexity
Temporal Graph Algorithms
Graph algorithms and population protocols: Uniform Bipartition in Population Protocol Model with Arbitrary Communication Graphs
Graphs, networks and algorithms
Graphs, networks and algorithms
Engineering Graph Clustering Algorithms
Graph algorithms and population protocols: Secured Distributed Algorithms without Hardness Assumptions
Deterministic Sparse FFT Algorithms
Graph algorithms and population protocols: Distributed Distance Approximation
Graph algorithms and population protocols: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Graph algorithms
Algorithms for deterministic and stochastic scheduling
Deterministic approximation algorithms in computational convexity
Temporal Graph Algorithms
Graph algorithms and population protocols: Uniform Bipartition in Population Protocol Model with Arbitrary Communication Graphs
Graphs, networks and algorithms
Graphs, networks and algorithms
Engineering Graph Clustering Algorithms
Graph algorithms and population protocols: Secured Distributed Algorithms without Hardness Assumptions
Deterministic Sparse FFT Algorithms
Graph algorithms and population protocols: Distributed Distance Approximation
Graph algorithms and population protocols: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Graph algorithms
Algorithms for deterministic and stochastic scheduling
Deterministic approximation algorithms in computational convexity
Temporal Graph Algorithms
Graph algorithms and population protocols: Uniform Bipartition in Population Protocol Model with Arbitrary Communication Graphs
Graphs, networks and algorithms
Graphs, networks and algorithms