Fabian Kuhn

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Toward Online Mobile Facility Location on General Metrics.

[BibT_eX]

[DOI]

Theory Comput. Syst., December, 2023

Node and edge averaged complexities of local graph problems.

[BibT_eX]

[DOI]

Distributed Comput., December, 2023

No distributed quantum advantage for approximate graph coloring.

[BibT_eX]

[DOI]

CoRR, 2023

List Defective Colorings: Distributed Algorithms and Applications.

[BibT_eX]

[DOI]

Marc Fuchs

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

On the Node-Averaged Complexity of Locally Checkable Problems on Trees.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Brief Announcement: List Defective Colorings: Distributed Algorithms and Applications.

[BibT_eX]

[DOI]

Marc Fuchs

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Coloring Fast with Broadcasts.

[BibT_eX]

[DOI]

Maxime Flin

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Sinkless Orientation Made Simple.

[BibT_eX]

[DOI]

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Distributed Maximal Matching and Maximal Independent Set on Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Latency, capacity, and distributed minimum spanning trees.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Sublinear-time distributed algorithms for detecting small cliques and even cycles.

[BibT_eX]

[DOI]

Distributed Comput., 2022

Routing Schemes and Distance Oracles in the Hybrid Model.

[BibT_eX]

[DOI]

Philipp Schneider

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Near-optimal distributed degree+1 coloring.

[BibT_eX]

[DOI]

Tigran Tonoyan

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Distributed ∆-coloring plays hide-and-seek.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Contention Resolution for Coded Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Distributed Edge Coloring in Time Polylogarithmic in Δ.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Improved distributed Δ-coloring.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Distributed Δ-Coloring Plays Hide-and-Seek.

[BibT_eX]

[DOI]

CoRR, 2021

Efficient randomized distributed coloring in CONGEST.

[BibT_eX]

[DOI]

Tigran Tonoyan

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings.

[BibT_eX]

[DOI]

Salwa Faour

Marc Fuchs

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Near-Shortest Path Routing in Hybrid Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Improved Distributed Fractional Coloring Algorithms.

[BibT_eX]

[DOI]

Alkida Balliu

Dennis Olivetti

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Rumor spreading with bounded in-degree.

[BibT_eX]

[DOI]

Sebastian Daum

Theor. Comput. Sci., 2020

The cost of global broadcast in dynamic radio networks.

[BibT_eX]

[DOI]

Anisur Rahaman Molla

Theor. Comput. Sci., 2020

Forming tile shapes with simple robots.

[BibT_eX]

[DOI]

Nat. Comput., 2020

Improved distributed degree splitting and edge coloring.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Approximate Bipartite Vertex Cover in the CONGEST Model.

[BibT_eX]

[DOI]

Salwa Faour

CoRR, 2020

Coloring Fast Without Learning Your Neighbors' Colors.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Distributed Maximum Matching Verification in CONGEST.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Faster Deterministic Distributed Coloring Through Recursive List Coloring.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Shortest Paths in a Hybrid Network Model.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Computing Shortest Paths and Diameter in the Hybrid Network Model.

[BibT_eX]

[DOI]

Philipp Schneider

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Distance-2 Coloring in the CONGEST Model.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Efficient Deterministic Distributed Coloring with Small Bandwidth.

[BibT_eX]

[DOI]

Philipp Bamberger

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta.

[BibT_eX]

[DOI]

Alkida Balliu

Dennis Olivetti

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Approximating Bipartite Minimum Vertex Cover in the CONGEST Model.

[BibT_eX]

[DOI]

Salwa Faour

Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

Latency, Capacity, and Distributed Minimum Spanning Tree†.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Distributed Computing Systems, 2020

2019

Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

Contention resolution on a fading channel.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Latency, Capacity, and Distributed MST.

[BibT_eX]

[DOI]

CoRR, 2019

Competitive Concurrent Distributed Scheduling.

[BibT_eX]

[DOI]

Volker Turau

CoRR, 2019

Distributed Computation in Node-Capacitated Networks.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

On the Use of Randomness in Local Distributed Graph Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Deterministic Distributed Dominating Set Approximation in the CONGEST Model.

[BibT_eX]

[DOI]

Janosch Deurer

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

On the Complexity of Distributed Splitting Problems.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2019 Edsger W. Dijkstra Prize in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Concurrent Distributed Serving with Mobile Servers.

[BibT_eX]

[DOI]

Volker Turau

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Local Distributed Algorithms in Highly Dynamic Networks.

[BibT_eX]

[DOI]

Philipp Bamberger

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

The Communication Cost of Information Spreading in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

Optimal Strategies for Patrolling Fences.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds.

[BibT_eX]

[DOI]

Jara Uitto

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

Near-Optimal Distributed Maximum Flow.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Distributed Computation in the Node-Congested Clique.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient Distributed Computation of MIS and Generalized MIS in Linear Hypergraphs.

[BibT_eX]

[DOI]

Chaodong Zheng

CoRR, 2018

Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks.

[BibT_eX]

[DOI]

Philipp Bamberger

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Distributed Approximate Maximum Matching in the CONGEST Model.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Deterministic distributed edge-coloring with fewer colors.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Possibilities and Impossibilities for Distributed Subgraph Detection.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Jakub Lopuszanski

Pascal Su

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Deterministic Distributed Ruling Sets of Line Graphs.

[BibT_eX]

[DOI]

Simon Weidner

Proceedings of the Structural Information and Communication Complexity, 2018

Improved Distributed Delta-Coloring.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Shape Recognition by a Finite Automaton Robot.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

On Derandomizing Local Distributed Algorithms.

[BibT_eX]

[DOI]

David G. Harris

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

Tight Bounds on Vertex Connectivity Under Sampling.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes.

[BibT_eX]

[DOI]

Pascal Su

CoRR, 2017

An Efficient Communication Abstraction for Dense Wireless Networks.

[BibT_eX]

[DOI]

Calvin Newport

Proceedings of the 31st International Symposium on Distributed Computing, 2017

Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Distributed Computing, 2017

On the complexity of local distributed graph problems.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Communication Primitives in Cognitive Radio Networks.

[BibT_eX]

[DOI]

Seth Gilbert

Chaodong Zheng

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Distributed MST and Routing in Almost Mixing Time.

[BibT_eX]

[DOI]

Hsin-Hao Su

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Broadcasting in an Unreliable SINR Model.

[BibT_eX]

[DOI]

Philipp Schneider

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching.

[BibT_eX]

[DOI]

Manuela Fischer

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Local Approximation of Covering and Packing Problems.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Local Computation: Lower and Upper Bounds.

[BibT_eX]

[DOI]

J. ACM, 2016

ICALP 2017 - Call for Papers.

[BibT_eX]

[DOI]

Piotr Indyk

Anca Muscholl

Bull. EATCS, 2016

Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Brief Announcement: Local Independent Set Approximation.

[BibT_eX]

[DOI]

Marijke H. L. Bodlaender

Christian Konrad

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Multi-message Broadcast in Dynamic Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2016

2015

Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2015

Tight Bounds for MIS in Multichannel Radio Networks.

[BibT_eX]

[DOI]

Sebastian Daum

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Tight Bounds on Vertex Connectivity Under Vertex Sampling.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Efficient Communication in Cognitive Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Near-Optimal Distributed Maximum Flow: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

goProbe: a scalable distributed network monitoring solution.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Peer-to-Peer Computing, 2015

Distributed Sparse Cut Approximation.

[BibT_eX]

[DOI]

Anisur Rahaman Molla

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Serving Online Requests with Mobile Servers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Distributed (Delta+1)-Coloring in Linear (in Delta) Time.

[BibT_eX]

[DOI]

Leonid Barenboim

Michael Elkin

SIAM J. Comput., 2014

Structuring unreliable radio networks.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Serving Online Demands with Movable Centers.

[BibT_eX]

[DOI]

CoRR, 2014

Decomposing broadcast algorithms using abstract MAC layers.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2014

A distributed perspective on graph connectivity and cuts.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

A New Perspective on Vertex Connectivity.

[BibT_eX]

[DOI]

Keren Censor-Hillel

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

On the power of the congested clique model.

[BibT_eX]

[DOI]

Andrew Drucker

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Distributed connectivity decomposition.

[BibT_eX]

[DOI]

Keren Censor-Hillel

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract).

[BibT_eX]

[DOI]

Karl Bringmann

Ueli Peter

Henning Thomas

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Vertex cover in graphs with locally few colors.

[BibT_eX]

[DOI]

Monaldo Mastrolilli

Inf. Comput., 2013

Beeping a maximal independent set.

[BibT_eX]

[DOI]

Distributed Comput., 2013

Distributed Minimum Cut Approximation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Broadcast in the Ad Hoc SINR Model.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Maximal independent sets in multichannel radio networks.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

Efficient distributed approximation algorithms via probabilistic tree embeddings.

[BibT_eX]

[DOI]

Distributed Comput., 2012

Lower Bounds on Information Dissemination in Dynamic Networks.

[BibT_eX]

[DOI]

Bernhard Haeupler

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Efficient Symmetry Breaking in Multi-Channel Radio Networks.

[BibT_eX]

[DOI]

Sebastian Daum

Calvin C. Newport

Proceedings of the Distributed Computing - 26th International Symposium, 2012

The communication complexity of distributed task allocation.

[BibT_eX]

[DOI]

Andrew Drucker

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Leader election in shared spectrum radio networks.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Oblivious low-congestion multicast routing in wireless networks.

[BibT_eX]

[DOI]

Antonio Carzaniga

Koorosh Khazaei

Proceedings of the Thirteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2012

2011

Dynamic networks: models and algorithms.

[BibT_eX]

[DOI]

SIGACT News, 2011

Gradient Clock Synchronization in Dynamic Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

The abstract MAC layer.

[BibT_eX]

[DOI]

Calvin C. Newport

Distributed Comput., 2011

Computing a Maximal Independent Set Using Beeps

[BibT_eX]

[DOI]

Alejandro Cornejo

Bernhard Haeupler

CoRR, 2011

The Complexity of Data Aggregation in Directed Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

Coordinated consensus in dynamic networks.

[BibT_eX]

[DOI]

Yoram Moses

Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

MAC design for analog network coding.

[BibT_eX]

[DOI]

Proceedings of the FOMC'11, 2011

2010

Distributed Approximation of Capacitated Dominating Sets.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Towards worst-case churn resistant peer-to-peer systems.

[BibT_eX]

[DOI]

Stefan Schmid

Distributed Comput., 2010

Deploying Wireless Networks with Beeps.

[BibT_eX]

[DOI]

Alejandro Cornejo

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Distributed computation in dynamic networks.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Synchrony and Asynchrony in Neural Networks.

[BibT_eX]

[DOI]

Joel Spencer

Angelika Steger

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Broadcasting in unreliable radio networks.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Optimal gradient clock synchronization in dynamic networks.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

Keeping Mobile Robot Swarms Connected.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Weak graph colorings: distributed algorithms and applications.

[BibT_eX]

[DOI]

Venugopalan Ramasubramanian

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.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems, 2009

Reliable distributed computing on unreliable radio channels.

[BibT_eX]

[DOI]

Proceedings of the 2009 MobiHoc S³ workshop on MobiHoc S³, 2009

Brief announcement: hardness of broadcasting in wireless networks with unreliable communication.

[BibT_eX]

[DOI]

Calvin C. Newport

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

The wireless synchronization problem.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Gradient Clock Synchronization Using Reference Broadcasts.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008

Local Approximation of Covering and Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Ad hoc networks beyond unit disk graphs.

[BibT_eX]

[DOI]

Wirel. Networks, 2008

An algorithmic approach to geographic routing in ad hoc and sensor networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2008

Distributed selection: a missing piece of data aggregation.

[BibT_eX]

[DOI]

Commun. ACM, 2008

Understanding Radio Irregularity in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, 2008

Distributed computation of the mode.

[BibT_eX]

[DOI]

Stefan Schmid

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

2007

Improved approximation algorithms for connected sensor cover.

[BibT_eX]

[DOI]

Wirel. Networks, 2007

Tight bounds for distributed selection.

[BibT_eX]

[DOI]

Venugopalan Ramasubramanian

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Reconstructing approximate tree metrics.

[BibT_eX]

[DOI]

Kunal Talwar

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006

Dynamic Analysis of the Arrow Distributed Protocol.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

Efficient adaptive collect using randomization.

[BibT_eX]

[DOI]

Distributed Comput., 2006

The price of being near-sighted.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

On the complexity of distributed graph coloring.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Quality of Service - IWQoS 2006: 14th International Workshop, 2006

Fault-Tolerant Clustering in Ad Hoc and Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

Dependable Peer-to-Peer Systems Withstanding Dynamic Adversarial Churn.

[BibT_eX]

[DOI]

Keno Albrecht

Proceedings of the Dependable Systems: Software, Computing, Networks, 2006

Taming Dynamic and Selfish Peers.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

PhD thesis, 2005

Constant-time distributed dominating set approximation.

[BibT_eX]

[DOI]

Distributed Comput., 2005

Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 19th International Conference, 2005

On the locality of bounded growth.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Stefan Schmid

Proceedings of the Peer-to-Peer Systems IV, 4th International Workshop, 2005

Local approximation schemes for ad hoc and sensor networks.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2005

Interference in Cellular Networks: The Minimum Membership Set Cover Problem.

[BibT_eX]

[DOI]

Pascal von Rickenbach

Emo Welzl

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Efficient Adaptive Collect Using Randomization.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 18th International Conference, 2004

Dynamic analysis of the arrow distributed protocol.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

What cannot be computed locally!

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Initializing newly deployed ad hoc and sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, 2004

Radio Network Clustering from Scratch.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

Unit disk graph approximation.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004

2003

Geometric ad-hoc routing: of theory and practice.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Worst-Case optimal and average-case efficient geometric ad-hoc routing.

[BibT_eX]

[DOI]

Proceedings of the 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2003

Ad-hoc networks beyond unit disk graphs.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

2002

Asymptotically optimal geometric mobile ad-hoc routing.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]