The following pages link to Christoph Lenzen (Q269515):
Displaying 50 items.
- HEX: scaling honeycombs is easier than scaling clock trees (Q269518) (← links)
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Efficient counting with optimal resilience (Q1664123) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Locality of not-so-weak coloring (Q2303281) (← links)
- Searching without communicating: tradeoffs between performance and selection complexity (Q2401119) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip (Q2637656) (← links)
- Near-Optimal Distributed Maximum Flow (Q2796244) (← links)
- Fast Partial Distance Estimation and Applications (Q2796252) (← links)
- Towards Optimal Synchronous Counting (Q2796281) (← links)
- (Q2889027) (← links)
- Coupling Molecular Dynamics and Continua with Weak Constraints (Q2903608) (← links)
- MIS on trees (Q2943380) (← links)
- Trade-offs between selection complexity and performance when searching the plane without communication (Q2943625) (← links)
- Improved distributed steiner forest construction (Q2943626) (← links)
- Leveraging Linial’s Locality Limit (Q3540245) (← links)
- Tight bounds for clock synchronization (Q3578187) (← links)
- Minimum Dominating Set Approximation in Graphs of Bounded Arboricity (Q3588326) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford (Q4625664) (← links)
- Metastability-Containing Circuits (Q4683259) (← links)
- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting (Q4909412) (← links)
- (Q4967183) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- (Q5002766) (← links)
- (Q5008248) (← links)
- Robust Routing Made Easy (Q5045442) (← links)
- Fault Tolerant Gradient Clock Synchronization (Q5145235) (← links)
- Tight bounds for clock synchronization (Q5170300) (← links)
- Optimal deterministic routing and sorting on the congested clique (Q5176081) (← links)
- Early-deciding consensus is expensive (Q5176104) (← links)
- Efficient distributed source detection with limited bandwidth (Q5176116) (← links)
- Optimal gradient clock synchronization in dynamic networks (Q5176218) (← links)
- Optimal Metastability-Containing Sorting via Parallel Prefix Computation (Q5211782) (← links)
- On the Complexity of Hazard-free Circuits (Q5215454) (← links)
- Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus (Q5215461) (← links)
- On the complexity of hazard-free circuits (Q5230345) (← links)
- Efficient Counting with Optimal Resilience (Q5359491) (← links)
- Tight bounds for parallel randomized load balancing (Q5419070) (← links)
- Fast routing table construction using small messages (Q5495808) (← links)
- Fault-tolerant algorithms for tick-generation in asynchronous logic (Q5501934) (← links)
- (Q5875752) (← links)
- Self-stabilizing Byzantine clock synchronization with optimal precision (Q5918193) (← links)
- Near-optimal self-stabilising counting and firing squads (Q5918195) (← links)
- Near-optimal self-stabilising counting and firing squads (Q5919570) (← links)
