Fabian Kuhn

According to our database1, Fabian Kuhn authored at least 137 papers between 2001 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Rumor spreading with bounded in-degree.
Theor. Comput. Sci., 2020

The cost of global broadcast in dynamic radio networks.
Theor. Comput. Sci., 2020

Faster Deterministic Distributed Coloring Through Recursive List Coloring.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Shortest Paths in a Hybrid Network Model.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for Nominations.
Bulletin of the EATCS, 2019

Contention resolution on a fading channel.
Distributed Computing, 2019

Efficient Deterministic Distributed Coloring with Small Bandwidth.
CoRR, 2019

Latency, Capacity, and Distributed MST.
CoRR, 2019

Competitive Concurrent Distributed Scheduling.
CoRR, 2019

Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Distributed Computation in Node-Capacitated Networks.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

On the Use of Randomness in Local Distributed Graph Algorithms.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Deterministic Distributed Dominating Set Approximation in the CONGEST Model.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

On the Complexity of Distributed Splitting Problems.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2019 Edsger W. Dijkstra Prize in Distributed Computing.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Concurrent Distributed Serving with Mobile Servers.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Local Distributed Algorithms in Highly Dynamic Networks.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

The Communication Cost of Information Spreading in Dynamic Networks.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

Optimal Strategies for Patrolling Fences.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Near-Optimal Distributed Maximum Flow.
SIAM J. Comput., 2018

Distributed Computation in the Node-Congested Clique.
CoRR, 2018

Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs.
CoRR, 2018

Improved Distributed Δ-Coloring.
CoRR, 2018

Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Distributed Approximate Maximum Matching in the CONGEST Model.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Deterministic distributed edge-coloring with fewer colors.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Possibilities and Impossibilities for Distributed Subgraph Detection.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Deterministic Distributed Ruling Sets of Line Graphs.
Proceedings of the Structural Information and Communication Complexity, 2018

Improved Distributed Delta-Coloring.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Shape Recognition by a Finite Automaton Robot.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

On Derandomizing Local Distributed Algorithms.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Forming Tile Shapes with Simple Robots.
Proceedings of the DNA Computing and Molecular Programming - 24th International Conference, 2018

2017
Tight Bounds on Vertex Connectivity Under Sampling.
ACM Trans. Algorithms, 2017

Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes.
CoRR, 2017

An Efficient Communication Abstraction for Dense Wireless Networks.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Improved Distributed Degree Splitting and Edge Coloring.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

On the complexity of local distributed graph problems.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Communication Primitives in Cognitive Radio Networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Distributed MST and Routing in Almost Mixing Time.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Broadcasting in an Unreliable SINR Model.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Local Approximation of Covering and Packing Problems.
Encyclopedia of Algorithms, 2016

Local Computation: Lower and Upper Bounds.
J. ACM, 2016

ICALP 2017 - Call for Papers.
Bulletin of the EATCS, 2016

Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Brief Announcement: Local Independent Set Approximation.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Multi-message Broadcast in Dynamic Radio Networks.
Proceedings of the Algorithms for Sensor Systems, 2016

2015
Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position.
IEEE/ACM Trans. Netw., 2015

Tight Bounds for MIS in Multichannel Radio Networks.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Tight Bounds on Vertex Connectivity Under Vertex Sampling.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Efficient Communication in Cognitive Radio Networks.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Near-Optimal Distributed Maximum Flow: Extended Abstract.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

goProbe: a scalable distributed network monitoring solution.
Proceedings of the 2015 IEEE International Conference on Peer-to-Peer Computing, 2015

Distributed Sparse Cut Approximation.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Serving Online Requests with Mobile Servers.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
Distributed (Delta+1)-Coloring in Linear (in Delta) Time.
SIAM J. Comput., 2014

Structuring unreliable radio networks.
Distributed Computing, 2014

Serving Online Demands with Movable Centers.
CoRR, 2014

Decomposing broadcast algorithms using abstract MAC layers.
Ad Hoc Networks, 2014

A distributed perspective on graph connectivity and cuts.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

A New Perspective on Vertex Connectivity.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

On the power of the congested clique model.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Distributed connectivity decomposition.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Vertex cover in graphs with locally few colors.
Inf. Comput., 2013

Beeping a maximal independent set.
Distributed Computing, 2013

Distributed Minimum Cut Approximation.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Broadcast in the Ad Hoc SINR Model.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Maximal independent sets in multichannel radio networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Efficient distributed approximation algorithms via probabilistic tree embeddings.
Distributed Computing, 2012

Lower Bounds on Information Dissemination in Dynamic Networks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Efficient Symmetry Breaking in Multi-Channel Radio Networks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

The communication complexity of distributed task allocation.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Leader election in shared spectrum radio networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Oblivious low-congestion multicast routing in wireless networks.
Proceedings of the Thirteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2012

2011
Dynamic networks: models and algorithms.
SIGACT News, 2011

Gradient Clock Synchronization in Dynamic Networks.
Theory Comput. Syst., 2011

The abstract MAC layer.
Distributed Computing, 2011

Computing a Maximal Independent Set Using Beeps
CoRR, 2011

The Complexity of Data Aggregation in Directed Networks.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Coordinated consensus in dynamic networks.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

MAC design for analog network coding.
Proceedings of the FOMC'11, 2011

2010
Distributed Approximation of Capacitated Dominating Sets.
Theory Comput. Syst., 2010

Towards worst-case churn resistant peer-to-peer systems.
Distributed Computing, 2010

Deploying Wireless Networks with Beeps.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Distributed computation in dynamic networks.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Synchrony and Asynchrony in Neural Networks.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Broadcasting in unreliable radio networks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Optimal gradient clock synchronization in dynamic networks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
Keeping Mobile Robot Swarms Connected.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Weak graph colorings: distributed algorithms and applications.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

On the treeness of internet latency and bandwidth.
Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

Brief announcement: hardness of broadcasting in wireless networks with unreliable communication.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

The wireless synchronization problem.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Gradient Clock Synchronization Using Reference Broadcasts.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008
Local Approximation of Covering and Packing Problems.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Ad hoc networks beyond unit disk graphs.
Wireless Networks, 2008

An algorithmic approach to geographic routing in ad hoc and sensor networks.
IEEE/ACM Trans. Netw., 2008

Distributed selection: a missing piece of data aggregation.
Commun. ACM, 2008

Understanding Radio Irregularity in Wireless Networks.
Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, 2008

Distributed computation of the mode.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007
Improved approximation algorithms for connected sensor cover.
Wireless Networks, 2007

Tight bounds for distributed selection.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Reconstructing approximate tree metrics.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Dynamic Analysis of the Arrow Distributed Protocol.
Theory Comput. Syst., 2006

Efficient adaptive collect using randomization.
Distributed Computing, 2006

The price of being near-sighted.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

On the complexity of distributed graph coloring.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves.
Proceedings of the Quality of Service - IWQoS 2006: 14th International Workshop, 2006

Fault-Tolerant Clustering in Ad Hoc and Sensor Networks.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

Dependable Peer-to-Peer Systems Withstanding Dynamic Adversarial Churn.
Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

Taming Dynamic and Selfish Peers.
Proceedings of the Peer-to-Peer-Systems and -Applications, 26.03. - 29.03.2006, 2006

2005
The price of locality: exploring the complexity of distributed coordination primitives.
PhD thesis, 2005

Constant-time distributed dominating set approximation.
Distributed Computing, 2005

Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs.
Proceedings of the Distributed Computing, 19th International Conference, 2005

On the locality of bounded growth.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn.
Proceedings of the Peer-to-Peer Systems IV, 4th International Workshop, 2005

Local approximation schemes for ad hoc and sensor networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2005

Interference in Cellular Networks: The Minimum Membership Set Cover Problem.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Efficient Adaptive Collect Using Randomization.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Dynamic analysis of the arrow distributed protocol.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Brief announcement: efficient clustering in unstructured radio networks.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

What cannot be computed locally!
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Initializing newly deployed ad hoc and sensor networks.
Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, 2004

Radio Network Clustering from Scratch.
Proceedings of the Algorithms, 2004

Unit disk graph approximation.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004

2003
Geometric ad-hoc routing: of theory and practice.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Worst-Case optimal and average-case efficient geometric ad-hoc routing.
Proceedings of the 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2003

Ad-hoc networks beyond unit disk graphs.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

2002
Asymptotically optimal geometric mobile ad-hoc routing.
Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), 2002

2001
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms.
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001


  Loading...