OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems Sang-Min Choia , Jiho Parka , Quan Nguyena , Kiyoung Jangb , Hyunjoon Cheonb , Yo-Sub Hanb , Byung-Ik Ahna a

First Page		Document Content
Date: 2018-10-24 09:53:18 Cryptocurrencies Computing Concurrent computing Fault-tolerant computer systems Distributed computing Distributed algorithms Theory of computation Cryptography Byzantine fault tolerance Blockchain Consensus Proof-of-stake		OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems Sang-Min Choia , Jiho Parka , Quan Nguyena , Kiyoung Jangb , Hyunjoon Cheonb , Yo-Sub Hanb , Byung-Ik Ahna a Add to Reading List Source URL: fantom.foundation Download Document from Source Website File Size: 854,72 KB Share Document on Facebook

	Mike Izbicki About Me My research makes machine learning algorithms faster. I’ve developed improved data structures for nearest neighbor queries and faster distributed learning procedures. I use techniques from high di DocID: 1xTYW - View Document
	Distributed Hole Detection Algorithms for Wireless Sensor Networks Pradipta Ghosh Bhaskar Krishnamachari Ming Hsieh Department of Electrical Engineering University of Southern California {pradiptg, bkrishna}@usc.edu DocID: 1vdB7 - View Document
	Deterministic distributed algorithms: using covering graphs for good and evil Jukka Suomela Helsinki Institute for Information Technology HIIT University of Helsinki, Finland Braunschweig, DocID: 1vbIR - View Document
	Distributed Best Response Algorithms for Potential Games Stéphane Durand, Federica Garin, Bruno Gaujal To cite this version: Stéphane Durand, Federica Garin, Bruno Gaujal. Distributed Best Response Algorithms for Poten DocID: 1uX5s - View Document
	Distributed Join Algorithms on Thousands of Cores Claude Barthels, Ingo Muller ¨ ‡ , Timo Schneider, Gustavo Alonso, Torsten Hoefler Systems Group, Dept. of Computer Science, ETH Zurich ¨ {firstname.lastname}@inf.eth DocID: 1uMei - View Document