The following pages link to Christian Scheideler (Q360273):
Displaying 50 items.
- (Q169701) (redirect page) (← links)
- Competitive throughput in multi-hop wireless networks despite adaptive jamming (Q360275) (← links)
- Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing (Q372974) (← links)
- Corona: a stabilizing deterministic message-passing skip list (Q392011) (← links)
- Tiara: a self-stabilizing deterministic skip list and skip graph (Q418743) (← links)
- Re-Chord: a self-stabilizing chord overlay network (Q487270) (← links)
- Universal coating for programmable matter (Q529029) (← links)
- Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs (Q714851) (← links)
- Towards a scalable and robust DHT (Q733718) (← links)
- The effect of faults on network expansion (Q863198) (← links)
- Deterministic routing with bounded buffers: turning offline into online protocols (Q873651) (← links)
- Robust random number generation for peer-to-peer systems (Q1004308) (← links)
- Universal continuous routing strategies (Q1265164) (← links)
- Simple, efficient routing schemes for all-optical networks (Q1293922) (← links)
- Exploiting storage redundancy to speed up randomized shared memory simulations (Q1365933) (← links)
- Forming tile shapes with simple robots (Q1621139) (← links)
- Sade: competitive MAC under adversarial SINR (Q1635833) (← links)
- Towards a universal approach for monotonic searchability in self-stabilizing overlay networks (Q1660922) (← links)
- Simple on-line algorithms for the maximum disjoint paths problem (Q1889861) (← links)
- Towards a universal approach for the finite departure problem in overlay networks (Q2013592) (← links)
- A self-stabilizing Hashed Patricia Trie (Q2139093) (← links)
- A note on the parallel runtime of self-stabilizing graph linearization (Q2254491) (← links)
- Faster construction of overlay networks (Q2303294) (← links)
- A bounding box overlay for competitive routing in hybrid communication networks (Q2303301) (← links)
- A deterministic worst-case message complexity optimal solution for resource discovery (Q2345458) (← links)
- From static to dynamic routing (Q2819548) (← links)
- On the Runtime of Universal Coating for Programmable Matter (Q2835712) (← links)
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery (Q2868642) (← links)
- Competitive and fair throughput for co-existing networks under adversarial interference (Q2933804) (← links)
- A jamming-resistant MAC protocol for single-hop wireless networks (Q2934331) (← links)
- Peer-to-peer systems for prefix search (Q2943751) (← links)
- Leader Election and Shape Formation with Self-organizing Programmable Matter (Q2948412) (← links)
- Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems (Q3078395) (← links)
- (Q3113678) (← links)
- Smoothed analysis of left-to-right maxima with applications (Q3189072) (← links)
- A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) (Q3191969) (← links)
- (Q3396637) (← links)
- Improved bounds for the unsplittable flow problem (Q3410948) (← links)
- Minimum Linear Arrangement of Series-Parallel Graphs (Q3453293) (← links)
- A Denial-of-Service Resistant DHT (Q3523197) (← links)
- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization (Q3557028) (← links)
- (Q3579433) (← links)
- How to spread adversarial nodes? (Q3581458) (← links)
- A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks (Q3588303) (← links)
- A Self-stabilizing and Local Delaunay Graph Construction (Q3652263) (← links)
- (Q4228489) (← links)
- (Q4252279) (← links)
- (Q4397705) (← links)
- (Q4449248) (← links)
- From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols (Q4507387) (← links)
