zweidimensionales bewegtes Bild
Graph algorithms and population protocols: Secured Distributed Algorithms without Hardness Assumptions
- Location
-
Hannover TIB
- Extent
-
91MB, 00:20:00:02 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
OPODIS: International Conference on Principles of Distributed Systems, 2020 ; (Jan. 2020)
- Event
-
Veröffentlichung
- (who)
-
Opodis
- (when)
-
2020-01-01
- Contributor
-
Barenboim, Leonid
Levin, Harel
- DOI
-
10.5446/52872
- Last update
-
04.12.2024, 8:09 AM CET
Data provider
This object is provided by:
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Object type
- zweidimensionales bewegtes Bild
Associated
- Barenboim, Leonid
- Levin, Harel
- Opodis
Time of origin
- 2020-01-01
Other Objects (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