Search for Author All Reviews
	Elkin, Michael     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 3 of 3 reviews       Distributed graph coloring: fundamentals and recent developments Barenboim L., Elkin M., Morgan&Claypool Publishers, San Rafael, CA, 2013. 172 pp.  Type: Book (978-1-627050-18-0) Distributed computing has been an active area of research for a few decades now; we have witnessed significant advances in the principles of distributed computing and the design and analysis of distributed algorithms. Now is the right ...... Jul 21 2014     An improved algorithm for radio broadcast Elkin M., Kortsarz G. ACM Transactions on Algorithms 3(1): 8-es, 2007.  Type: Article The investigation into a distributed computing problem that involves a type of broadcast over an undirected graph is refined in this paper. The idea is to propagate a message from a source node to all other nodes in the fewest number o...... May 10 2007     Computing almost shortest paths Elkin M. ACM Transactions on Algorithms 1(2): 283-323, 2005.  Type: Article Computing the shortest paths between all vertices in a graph is a very important problem. It has many applications and can be used to solve problems like network routing, where the goal is to find the shortest path for data packets to ...... Mar 2 2006
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy