<--- Back to Details
First PageDocument Content
Computing / Computational complexity theory / Mathematics / Theoretical computer science / Distributed computing / Routing algorithms / Consensus / Algorithm / Randomized algorithm / Leader election / A* search algorithm
Date: 2015-05-29 10:12:08
Computing
Computational complexity theory
Mathematics
Theoretical computer science
Distributed computing
Routing algorithms
Consensus
Algorithm
Randomized algorithm
Leader election
A* search algorithm

Synchronous Counting and Computational Algorithm Design Danny Dolev1 , Janne H. Korhonen2 , Christoph Lenzen3 , Joel Rybicki2 , and Jukka Suomela2 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Download Document from Source Website

File Size: 311,84 KB

Share Document on Facebook

Similar Documents

Distributed Computing Prof. R. Wattenhofer BA/MA/SA:  A Hybrid Blockchain System

Distributed Computing Prof. R. Wattenhofer BA/MA/SA: A Hybrid Blockchain System

DocID: 1xVNV - View Document

Distributed Computing Prof. R. Wattenhofer SA/MA:  Byzantine Reinforcement Learning

Distributed Computing Prof. R. Wattenhofer SA/MA: Byzantine Reinforcement Learning

DocID: 1xVKs - View Document

Distributed Computing Prof. R. Wattenhofer Activity Recognition and Adversarial Learning with Smartwatches

Distributed Computing Prof. R. Wattenhofer Activity Recognition and Adversarial Learning with Smartwatches

DocID: 1xVFo - View Document

Distributed Computing Prof. R. Wattenhofer BA/SA/Group/Lab:  Dynamic Directories

Distributed Computing Prof. R. Wattenhofer BA/SA/Group/Lab: Dynamic Directories

DocID: 1xVCB - View Document

Distributed Computing Prof. R. Wattenhofer Advanced Topics in Deep Learning - Disentangled Representations

Distributed Computing Prof. R. Wattenhofer Advanced Topics in Deep Learning - Disentangled Representations

DocID: 1xVwm - View Document