Christoph Lenzen

CoRR, 2024

Brief Announcement: Clock Distribution with Gradient TRIX.

[BibT_eX]

[DOI]

Dimitrios Papachristoudis

Shreyas Srinivas

Proceedings of the 38th International Symposium on Distributed Computing, 2024

GRandLine: Adaptively Secure DKG and Randomness Beacon with (Log-)Quadratic Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023

Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts.

[BibT_eX]

[DOI]

Distributed Comput., December, 2023

GRandLine: Adaptively Secure DKG and Randomness Beacon with (Almost) Quadratic Communication Complexity.

[BibT_eX]

[DOI]

Dimitrios Papachristoudis

IACR Cryptol. ePrint Arch., 2023

Gradient TRIX.

[BibT_eX]

[DOI]

Shreyas Srinivas

CoRR, 2023

2022

Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2022

Current Challenges in Reliable and Secure Clock Synchronization.

[BibT_eX]

[DOI]

Swen Jacobs

Bull. EATCS, 2022

G-SINC: Global Synchronization Infrastructure for Network Clocks.

[BibT_eX]

[DOI]

Marc Frei

Jonghoon Kwon

Seyedali Tabaeiaghdaei

Marc Wyss

Adrian Perrig

Proceedings of the 41st International Symposium on Reliable Distributed Systems, 2022

Optimal Clock Synchronization with Signatures.

[BibT_eX]

[DOI]

Julian Loss

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

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver.

[BibT_eX]

[DOI]

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

A Recursive Early-Stopping Phase King Protocol.

[BibT_eX]

[DOI]

Sahar Sheikholeslami

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

Small Hazard-Free Transducers.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

On Specifications and Proofs of Timed Circuits.

[BibT_eX]

[DOI]

Matthias Függer

Ulrich Schmid

Proceedings of the Principles of Systems Design, 2022

2021

Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Accelerated Distributed Laplacian Solvers via Shortcuts.

[BibT_eX]

[DOI]

Ioannis Anagnostides

Themis Gouleakis

CoRR, 2021

A Breezing Proof of the KMW Bound.

[BibT_eX]

[DOI]

Corinna Coupette

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Approximate Minimum Directed Spanning Trees Under Congestion.

[BibT_eX]

[DOI]

Hossein Vahidi

Proceedings of the Structural Information and Communication Complexity, 2021

2020

Synchronizer-Free Digital Link Controller.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst., 2020

Optimal Metastability-Containing Sorting via Parallel Prefix Computation.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2020

Fooling views: a new lower bound technique for distributed computations under congestion.

[BibT_eX]

[DOI]

Distributed Comput., 2020

TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware.

[BibT_eX]

[DOI]

Ben Wiederhake

CoRR, 2020

Brief Announcement: TRIX: Low-Skew Pulse Propagation for Fault-Tolerant Hardware.

[BibT_eX]

[DOI]

Ben Wiederhake

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Low Diameter Graph Decompositions by Approximate Distance Computation.

[BibT_eX]

[DOI]

Ruben Becker

Yuval Emek

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

PALS: Plesiochronous and Locally Synchronous Systems.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Symposium on Asynchronous Circuits and Systems, 2020

2019

Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision.

[BibT_eX]

[DOI]

Pankaj Khanchandani

Theory Comput. Syst., 2019

Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus.

[BibT_eX]

[DOI]

J. ACM, 2019

On the Complexity of Hazard-free Circuits.

[BibT_eX]

[DOI]

Karteek Sreenivasaiah

J. ACM, 2019

Near-optimal self-stabilising counting and firing squads.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Distributed distance computation and routing with small messages.

[BibT_eX]

[DOI]

David Peleg

Distributed Comput., 2019

Algebraic methods in the congested clique.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Distributed Algorithms for Low Stretch Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Parallel Balanced Allocations: The Heavily Loaded Case.

[BibT_eX]

[DOI]

Merav Parter

Eylon Yogev

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

Locality of Not-so-Weak Coloring.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Fault Tolerant Gradient Clock Synchronization.

[BibT_eX]

[DOI]

Will Rosenbaum

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

2018

Metastability-Containing Circuits.

[BibT_eX]

[DOI]

Stephan Friedrichs

Matthias Függer

IEEE Trans. Computers, 2018

Near-Optimal Distributed Maximum Flow.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford.

[BibT_eX]

[DOI]

Stephan Friedrichs

J. ACM, 2018

A Centralized Local Algorithm for the Sparse Spanning Graph Problem.

[BibT_eX]

[DOI]

Reut Levi

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Optimal metastability-containing sorting networks.

[BibT_eX]

[DOI]

Proceedings of the 2018 Design, Automation & Test in Europe Conference & Exhibition, 2018

2017

Efficient Counting with Optimal Resilience.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Searching without communicating: tradeoffs between performance and selection complexity.

[BibT_eX]

[DOI]

Distributed Comput., 2017

A Local Algorithm for the Sparse Spanning Graph Problem.

[BibT_eX]

[DOI]

Reut Levi

CoRR, 2017

Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem.

[BibT_eX]

[DOI]

Reut Levi

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

Robust Routing Made Easy.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

Near-optimal metastability-containing sorting networks.

[BibT_eX]

[DOI]

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2017

Metastability Tolerant Computing.

[BibT_eX]

[DOI]

Ghaith Tarawneh

Matthias Függer

Proceedings of the 23rd IEEE International Symposium on Asynchronous Circuits and Systems, 2017

Metastability-Aware Memory-Efficient Time-to-Digital Converters.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Asynchronous Circuits and Systems, 2017

2016

Synchronous counting and computational algorithm design.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

HEX: Scaling honeycombs is easier than scaling clock trees.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Tight bounds for parallel randomized load balancing.

[BibT_eX]

[DOI]

Distributed Comput., 2016

CLEX: Yet Another Supercomputer Architecture?

[BibT_eX]

[DOI]

CoRR, 2016

Approximate Undirected Transshipment and Shortest Paths via Gradient Descent.

[BibT_eX]

[DOI]

CoRR, 2016

Fault-Tolerant Clock Synchronization with High Precision.

[BibT_eX]

[DOI]

Attila Kinali

Florian Huemer

Proceedings of the IEEE Computer Society Annual Symposium on VLSI, 2016

Efficient Metastability-Containing Gray Code 2-Sort.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE International Symposium on Asynchronous Circuits and Systems, 2016

2015

PulseSync: An Efficient and Scalable Clock Synchronization Protocol.

[BibT_eX]

[DOI]

Philipp Sommer

IEEE/ACM Trans. Netw., 2015

Fault-tolerant Distributed Systems in Hardware.

[BibT_eX]

[DOI]

Bull. EATCS, 2015

Efficient Counting with Optimal Resilience.

[BibT_eX]

[DOI]

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

Towards Optimal Synchronous Counting.

[BibT_eX]

[DOI]

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

Fast Partial Distance Estimation and Applications.

[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

The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm.

[BibT_eX]

[DOI]

Pierre Bertrand

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation.

[BibT_eX]

[DOI]

J. ACM, 2014

Local Approximability of Minimum Dominating Set on Planar Graphs.

[BibT_eX]

[DOI]

Miikka Hilke

CoRR, 2014

Near-Optimal Distributed Tree Embedding.

[BibT_eX]

[DOI]

Mohsen Ghaffari

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Improved distributed steiner forest construction.

[BibT_eX]

[DOI]

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

Trade-offs between selection complexity and performance when searching the plane without communication.

[BibT_eX]

[DOI]

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

Brief announcement: local approximability of minimum dominating set on planar graphs.

[BibT_eX]

[DOI]

Miikka Hilke

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

2013

Distributed minimum dominating set approximations in restricted families of graphs.

[BibT_eX]

[DOI]

Yvonne-Anne Pignolet

Distributed Comput., 2013

Node-Initiated Byzantine Consensus Without a Common Clock.

[BibT_eX]

[DOI]

CoRR, 2013

Fast routing table construction using small messages: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Synchronous Counting and Computational Algorithm Design.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Efficient distributed source detection with limited bandwidth.

[BibT_eX]

[DOI]

David Peleg

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

Optimal deterministic routing and sorting on the congested clique.

[BibT_eX]

[DOI]

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

Early-deciding consensus is expensive.

[BibT_eX]

[DOI]

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

Efficient Construction of Global Time in SoCs Despite Arbitrary Faults.

[BibT_eX]

[DOI]

Proceedings of the 2013 Euromicro Conference on Digital System Design, 2013

2012

Fast Routing Table Construction Using Small Messages

[BibT_eX]

[DOI]

CoRR, 2012

FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs

[BibT_eX]

[DOI]

CoRR, 2012

"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting

[BibT_eX]

[DOI]

Shir Peled

CoRR, 2012

"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract).

[BibT_eX]

[DOI]

Shir Peled

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

2011

Synchronization and symmetry breaking in distributedsystems.

[BibT_eX]

[DOI]

PhD thesis, 2011

Tight bounds for parallel randomized load balancing: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation - [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

MIS on trees.

[BibT_eX]

[DOI]

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

2010

Tight bounds for clock synchronization.

[BibT_eX]

[DOI]

Thomas Locher

J. ACM, 2010

Minimum Dominating Set Approximation in Graphs of Bounded Arboricity.

[BibT_eX]

[DOI]

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

Clock Synchronization: Open Problems in Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Brief announcement: exponential speed-up of local algorithms using non-local communication.

[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

A review of PODC 2009.

[BibT_eX]

[DOI]

Keren Censor

SIGACT News, 2009

Optimal clock synchronization in networks.

[BibT_eX]

[DOI]

Philipp Sommer

Proceedings of the 7th International Conference on Embedded Networked Sensor Systems, 2009

Local Algorithms: Self-Stabilization on Speed.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Methods for Distributed Cooperative Systems, 06.09., 2009

2008

Leveraging Linial's Locality Limit.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

What can be approximated locally?: case study: dominating sets in planar graphs.

[BibT_eX]

[DOI]

Yvonne Anne Oswald

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

Clock Synchronization with Bounded Global and Local Skew.

[BibT_eX]

[DOI]

Thomas Locher