92 citations · 220 across the 35 of their papers we have counts for
4 papers · 1 filter
Fast Routing Table Construction Using Small Messages
Christoph Lenzen, Boaz Patt-Shamir
We describe a distributed randomized algorithm computing approximate distances and routes that approximate shortest paths. Let n denote the number of nodes in the graph, and let HD…
Optimal Deterministic Routing and Sorting on the Congested Clique
Christoph Lenzen
Consider a clique of n nodes, where in each synchronous round each pair of nodes can exchange O(log n) bits. We provide deterministic constant-time solutions for two problems in th…
FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs
Danny Dolev, Matthias Függer, Christoph Lenzen +3
We present concept and implementation of a self-stabilizing Byzantine fault-tolerant distributed clock generation scheme for multi-synchronous GALS architectures in critical applic…
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting
Danny Dolev, Christoph Lenzen, Shir Peled
Let G = (V,E) be an n-vertex graph and M_d a d-vertex graph, for some constant d. Is M_d a subgraph of G? We consider this problem in a model where all n processes are connected to…