Travelled to:1 × Finland
1 × Greece
1 × The Netherlands
5 × USA
Collaborated with:B.Awerbuch B.Vöcking A.Brinkmann S.Schmid ∅ A.Czumaj U.Feige P.Berenbrink R.Cypher F.M.a.d.Heide
Talks about:rout (3) distribut (2) algorithm (2) adversari (2) protocol (2) schedul (2) forward (2) spread (2) store (2) transform (1)
Person: Christian Scheideler
DBLP: Scheideler:Christian
Contributed to:
2009
200520042003
20012000199919981996Wrote 9 papers:
- ICALP-v2-2009-ScheidelerS #distributed
- A Distributed and Oblivious Heap (CS, SS), pp. 571–582.
- STOC-2005-Scheideler #exclamation #how
- How to spread adversarial nodes?: rotate! (CS), pp. 704–713.
- ICALP-2004-AwerbuchS #distributed #protocol
- Group Spreading: A Protocol for Provably Secure Distributed Name Service (BA, CS), pp. 183–195.
- ICALP-2003-AwerbuchBS
- Anycasting in Adversarial Systems: Routing and Admission Control (BA, AB, CS), pp. 1153–1168.
- PDP-2001-BerenbrinkBS #network #simulation
- SIMLAB-A Simulation Environment for Storage Area Networks (PB, AB, CS), pp. 227–234.
- STOC-2000-CzumajS #algorithm #approach #problem #satisfiability #scheduling
- A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (AC, CS), pp. 38–47.
- STOC-1999-ScheidelerV #performance #protocol
- From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols (CS, BV), pp. 215–224.
- STOC-1998-FeigeS #bound #scheduling
- Improved Bounds for Acyclic Job Shop Scheduling (UF, CS), pp. 624–633.
- STOC-1996-CypherHSV #algorithm
- Universal Algorithms for Store-and-Forward and Wormhole Routing (RC, FMadH, CS, BV), pp. 356–365.