Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, June 16, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Vijay Victor D'Silva

The Topological Structure of Asynchronous Computability

Herlihy and Shavit identified necessary and sufficient conditions which must be satisfied for a class of distributed computing problems to be solvable. Specifically, they consider asynchronous systems with shared memory in which processes may fail. The characterization is based on notions from topology. Inputs and outputs are modelled as topological structures. The problems considered have a solution if and only if these structures satisfy some topological properties. In this talk, their modelling framework is reviewed and its use to prove properties about certain distributed computing problems is presented.

Source: Maurice Herlihy and Sergio Rajsbaum, Algebraic Topology and Distributed Computing - a Primer, On Computer Science Today - Recent Trends and Developments, Jan van Leeuwen Editor, Springer-Verlag Lecture Notes in Computer Science #1000, 1996.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login