Weak Models of Distributed Computing, with Connections to Modal Logic

v1v2v3 (latest)

Weak Models of Distributed Computing, with Connections to Modal Logic

9 May 2012

Matti Järvisalo

Juhana Laurinharju

Tuomo Lempiäinen

ArXiv (abs)PDF HTML

Papers citing "Weak Models of Distributed Computing, with Connections to Modal Logic"

10 / 10 papers shown

Title
Beeping a Maximal Independent Set Y. Afek N. Alon Z. Bar-Joseph Alejandro Cornejo Bernhard Haeupler Fabian Kuhn 103 116 0 01 Jun 2012
Stone Age Distributed Computing Y. Emek Jasmin Smula Roger Wattenhofer 108 88 0 06 Feb 2012
Deploying Wireless Networks with Beeps Alejandro Cornejo Fabian Kuhn 101 128 0 14 May 2010
Local algorithms in (weakly) coloured graphs M. Åstrand V. Polishchuk Joel Rybicki Jukka Suomela Jara Uitto 146 21 0 31 Jan 2010
Almost stable matchings in constant time P. Floréen P. Kaski V. Polishchuk Jukka Suomela 59 17 0 29 Dec 2008
A simple local 3-approximation algorithm for vertex cover V. Polishchuk Jukka Suomela 65 45 0 13 Oct 2008
An optimal local approximation algorithm for max-min linear programs P. Floréen Joel Kaasinen P. Kaski Jukka Suomela 96 17 0 09 Sep 2008
Local approximation algorithms for a class of 0/1 max-min linear programs P. Floréen Marja Hassinen P. Kaski Jukka Suomela 104 7 0 02 Jun 2008
Tight local approximation results for max-min linear programs P. Floréen Marja Hassinen P. Kaski Jukka Suomela 70 12 0 30 Apr 2008
Approximating max-min linear programs with local algorithms P. Floréen P. Kaski Topi Musto Jukka Suomela 109 14 0 08 Oct 2007

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.