zweidimensionales bewegtes Bild
Graph algorithms and population protocols: Secured Distributed Algorithms without Hardness Assumptions
- Standort
-
Hannover TIB
- Umfang
-
91MB, 00:20:00:02 (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
-
Barenboim, Leonid
Levin, Harel
- DOI
-
10.5446/52872
- 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
- Barenboim, Leonid
- Levin, Harel
- Opodis
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
Consistency algorithms and protocols for distributed interactive applications
Graph algorithms and population protocols: Distributed Distance Approximation
Cryptographic protocols and algorithms for distributed multimedia systems
Algorithms and Hardness Results for Object Nets
Bulk-robust assignment problems: hardness, approximability and algorithms
Approximating distributed graph algorithms
(4) Distributed Algorithms I
Integrating Distributed Algorithms into Distributed Systems
Graph powers: hardness results, good characterizations and efficient algorithms
Improved distributed fractional coloring algorithms
Graph algorithms and population protocols: Fast Deterministic Algorithms for Highly-Dynamic Networks
Cryptographic Protocols from Physical Assumptions
Consistency algorithms and protocols for distributed interactive applications
Graph algorithms and population protocols: Distributed Distance Approximation
Cryptographic protocols and algorithms for distributed multimedia systems
Algorithms and Hardness Results for Object Nets
Bulk-robust assignment problems: hardness, approximability and algorithms
Approximating distributed graph algorithms
(4) Distributed Algorithms I
Integrating Distributed Algorithms into Distributed Systems
Graph powers: hardness results, good characterizations and efficient algorithms
Improved distributed fractional coloring algorithms
Graph algorithms and population protocols: Fast Deterministic Algorithms for Highly-Dynamic Networks
Cryptographic Protocols from Physical Assumptions
Consistency algorithms and protocols for distributed interactive applications
Graph algorithms and population protocols: Distributed Distance Approximation
Cryptographic protocols and algorithms for distributed multimedia systems
Algorithms and Hardness Results for Object Nets
Bulk-robust assignment problems: hardness, approximability and algorithms
Approximating distributed graph algorithms
(4) Distributed Algorithms I
Integrating Distributed Algorithms into Distributed Systems
Graph powers: hardness results, good characterizations and efficient algorithms
Improved distributed fractional coloring algorithms
Graph algorithms and population protocols: Fast Deterministic Algorithms for Highly-Dynamic Networks