Computer Science Colloquium
Randomized Algorithms for Information Dissemination and Renaming ProcessesThu 21.05.2015, 17:15, 60 minutes
S3-055 in Science Park 3
AbstractIn this talk, we consider information dissemination and renaming in large networks - two fundamental problems in parallel and distributed computing. In information dissemination, one or several messages in a network have to be distributed to all nodes of this network. In renaming, the goal is to assign from a certain so called name space of size m distinct names to n different processes, where m is at least n. We will present several randomized algorithms for these problems under different settings, and compare them to each other with respect to their strengths and weaknesses.
BioRobert Elsässer obtained a PhD in Computer Science at the University of Paderborn in 2002, and was appointed to Junior Professor at the same university. For his PhD Thesis, he received the faculty award for an excellent dissertation. From April 2005 to March 2006, Robert Elsässer visited the Department of Mathematics at the University of California, San Diego, USA. In September 2007, he was a visiting professor at INRIA-Futurs, Bordeaux, and from October 2009 to September 2010 he headed the Chair of Algorithms and Complexity at the University of Freiburg as a visiting professor. The main research interests of Robert Elsässer include parallel and distributed algorithms, as well as the structure and spectra of graphs and networks.
Invited by Univ.-Prof. Dr. Volker Strumpen, Institute for Computer Architecture
The Computer Science Colloquium is organized by the Department of Coputer Science at JKU, the Österreichische Gesellschaft für Informatik (ÖGI) and the Österreichische Computergesellschaft (OCG).