Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Kuhn, Fabian"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Distributed
(\Delta+1)
-coloring in linear (in
\Delta
) time
Leonid Barenboim
,
Michael Elkin
,
Fabian Kuhn
SIAM Journal on Computing
43
(1), 2014, pp. 72-95
Internal DLA: Efficient simulation of a physical growth model
Karl Bringmann
,
Fabian Kuhn
,
Konstantinos Panagiotou
,
Ueli Peter
,
Henning Thomas
Lecture Notes in Computer Science
8572
, 2014, pp. 247-258
Vertex cover in graphs with locally few colors
Fabian Kuhn
,
Monaldo Mastrolilli
Information and Computation
222
, 2013, pp. 265-277
Gradient clock synchronization in dynamic networks
Fabian Kuhn
,
Thomas Locher
,
Rotem Oshman
Theory of Computing Systems
49
(4), 2011, pp. 781-816
Vertex cover in graphs with locally few colors
Fabian Kuhn
,
Monaldo Mastrolilli
Lecture Notes in Computer Science
6755
, 2011, pp. 498-509
Distributed computation in dynamic networks
Fabian Kuhn
,
Nancy Lynch
,
Rotem Oshman
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 513-522
Distributed approximation of capacitated dominating sets
Fabian Kuhn
,
Thomas Moscibroda
Theory of Computing Systems
47
(4), 2010, pp. 811-836
Gradient clock synchronization in dynamic networks
Fabian Kuhn
,
Thomas Locher
,
Rotem Oshman
Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2009 (Calgary, Alberta, Canada, August 11-13, 2009)
, 2009, pp. 270-279
Weak graph colorings: Distributed algorithms and applications
Fabian Kuhn
Proceedings of the 21st Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2009 (Calgary, Alberta, Canada, August 11-13, 2009)
, 2009, pp. 138-144
Local multicoloring algorithms: Computing a nearly-optimal TDMA schedule in constant time
Fabian Kuhn
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 613-624
Tight bounds for distributed selection
Fabian Kuhn
,
Thomas Locher
,
Roger Wattenhofer
Proceedings of the 19th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2007 (San Diego, CA, USA, June 9-11, 2007)
, 2007, pp. 145-153
Distributed approximation of capacitated dominating sets
Fabian Kuhn
,
Thomas Moscibroda
Proceedings of the 19th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2007 (San Diego, CA, USA, June 9-11, 2007)
, 2007, pp. 161-170
Dynamic analysis of the arrow distributed protocol
Maurice Herlihy
,
Fabian Kuhn
,
Srikanta Tirthapura
,
Roger Wattenhofer
Theory of Computing Systems
39
(6), 2006, pp. 875-901
Interference in cellular networks: The minimum membership set cover problem
Fabian Kuhn
,
Pascal von Rickenbach
,
Roger Wattenhofer
,
Emo Welzl
,
Aaron Zollinger
Lecture Notes in Computer Science
3595
, 2005, pp. 188-198
Radio network clustering from scratch
Fabian Kuhn
,
Thomas Moscibroda
,
Roger Wattenhofer
Lecture Notes in Computer Science
3221
, 2004, pp. 460-471
Dynamic analysis of the arrow distributed protocol
Fabian Kuhn
,
Roger Wattenhofer
Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2004 (Barcelona, Spain, June 27-30, 2004)
, 2004, pp. 294-301