---
_id: '579'
abstract:
- lang: eng
text: A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number
that is strictly larger than all preceding numbers. In this article we present
a smoothed analysis of the number of left-to-right maxima in the presence of additive
random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are
perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right
maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation
σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis
of the smoothed height of binary search trees and the smoothed number of comparisons
in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε
+ n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our
results can also be applied to bound the smoothed number of points on a convex
hull of points in the two-dimensional plane and to smoothed motion complexity,
a concept we describe in this article. We bound how often one needs to update
a data structure storing the smallest axis-aligned box enclosing a set of points
moving in d-dimensional space.
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Bodo
full_name: Manthey, Bodo
last_name: Manthey
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Till
full_name: Tantau, Till
last_name: Tantau
citation:
ama: Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right
maxima with applications. Transactions on Algorithms. 2012;(3):30. doi:10.1145/2229163.2229174
apa: Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C.,
Sohler, C., & Tantau, T. (2012). Smoothed analysis of left-to-right maxima
with applications. Transactions on Algorithms, (3), 30. https://doi.org/10.1145/2229163.2229174
bibtex: '@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012,
title={Smoothed analysis of left-to-right maxima with applications}, DOI={10.1145/2229163.2229174},
number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow,
Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald
and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012},
pages={30} }'
chicago: 'Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald
Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis
of Left-to-Right Maxima with Applications.” Transactions on Algorithms,
no. 3 (2012): 30. https://doi.org/10.1145/2229163.2229174.'
ieee: V. Damerow et al., “Smoothed analysis of left-to-right maxima with
applications,” Transactions on Algorithms, no. 3, p. 30, 2012.
mla: Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with
Applications.” Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.
short: V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler,
C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:41Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2229163.2229174
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T09:04:58Z
date_updated: 2018-03-15T09:04:58Z
file_id: '1266'
file_name: 579-a30-damerow.pdf
file_size: 329282
relation: main_file
success: 1
file_date_updated: 2018-03-15T09:04:58Z
has_accepted_license: '1'
issue: '3'
page: '30'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Smoothed analysis of left-to-right maxima with applications
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '581'
abstract:
- lang: eng
text: 'Nanoparticles are getting more and more in the focus of the scientic community
since the potential for the development of very small particles interacting with
each other and completing medical and other tasks is getting bigger year by year.
In this work we introduce a distributed local algorithm for arranging a set of
nanoparticles on the discrete plane into specic geometric shapes, for instance
a rectangle. The concept of a particle we use can be seen as a simple mobile robot
with the following restrictions: it can only view the state of robots it is physically
connected to, is anonymous, has only a constant size memory, can only move by
using other particles as an anchor point on which it pulls itself alongside, and
it operates in Look-Compute-Move cycles. The main result of this work is the presentation
of a random distributed local algorithm which transforms any given connected set
of particles into a particular geometric shape. As an example we provide a version
of this algorithm for forming a rectangle with an arbitrary predened aspect ratio.
To the best of our knowledge this is the rst work that considers arrangement problems
for these types of robots.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Martina
full_name: 'Hüllmann (married name: Eikel), Martina'
last_name: 'Hüllmann (married name: Eikel)'
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing
Particle Systems. In: Proceedings of the 26th IEEE International Parallel and
Distributed Processing Symposium (IPDPS). ; 2012:1272-1283. doi:10.1109/IPDPS.2012.116'
apa: 'Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., & Scheideler,
C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE
International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283).
https://doi.org/10.1109/IPDPS.2012.116'
bibtex: '@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012,
title={Self-Organizing Particle Systems}, DOI={10.1109/IPDPS.2012.116},
booktitle={Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married
name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012},
pages={1272–1283} }'
chicago: 'Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos,
and Christian Scheideler. “Self-Organizing Particle Systems.” In Proceedings
of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
1272–83, 2012. https://doi.org/10.1109/IPDPS.2012.116.'
ieee: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler,
“Self-Organizing Particle Systems,” in Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.'
mla: Drees, Maximilian, et al. “Self-Organizing Particle Systems.” Proceedings
of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116.
short: 'M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler,
in: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS), 2012, pp. 1272–1283.'
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1109/IPDPS.2012.116
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:39:33Z
date_updated: 2018-03-15T08:39:33Z
file_id: '1263'
file_name: 581-IPDPS2012-Scheideler_Huellmann.pdf
file_size: 373131
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:39:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 1272-1283
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: Self-Organizing Particle Systems
type: conference
user_id: '14955'
year: '2012'
...
---
_id: '623'
abstract:
- lang: eng
text: 'This paper initiates the formal study of a fundamental problem: How to efficiently
allocate a shared communication medium among a set of K co-existing networks in
the presence of arbitrary external interference? While most literature on medium
access focuses on how to share a medium among nodes, these approaches are often
either not directly applicable to co-existing networks as they would violate the
independence requirement, or they yield a low throughput if applied to multiple
networks. We present the randomized medium access (MAC) protocol COMAC which guarantees
that a given communication channel is shared fairly among competing and independent
networks, and that the available bandwidth is used efficiently. These performance
guarantees hold in the presence of arbitrary external interference or even under
adversarial jamming. Concretely, we show that the co-existing networks can use
a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful
message transmissions, where ε is the (arbitrarily distributed) fraction of time
which is not jammed.'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: 'Jin '
full_name: 'Zhang, Jin '
last_name: Zhang
citation:
ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput
for co-existing networks under adversarial interference. In: Proceedings of
the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC). ; 2012:291-300. doi:10.1145/2332432.2332488'
apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive
and fair throughput for co-existing networks under adversarial interference. In
Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and
Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488
bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and
fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings
of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin }, year={2012}, pages={291–300} }'
chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang.
“Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.”
In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair
throughput for co-existing networks under adversarial interference,” in Proceedings
of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing
(PODC), 2012, pp. 291–300.
mla: Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks
under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS
Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300,
doi:10.1145/2332432.2332488.
short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st
Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC),
2012, pp. 291–300.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2332432.2332488
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:45:25Z
date_updated: 2018-03-15T06:45:25Z
file_id: '1241'
file_name: 623-PODC-2012_01.pdf
file_size: 210382
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:45:25Z
has_accepted_license: '1'
page: 291-300
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles
and Distributed Computing (PODC)
status: public
title: Competitive and fair throughput for co-existing networks under adversarial
interference
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '625'
abstract:
- lang: eng
text: 'This paper initiates the study of self-adjusting distributed data structures
for networks. In particular, we present SplayNets: a binary search tree based
network that is self-adjusting to routing request.We derive entropy bounds on
the amortized routing cost and show that our splaying algorithm has some interesting
properties.'
author:
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Chen
full_name: Avin, Chen
last_name: Avin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Bernhard
full_name: Häupler, Bernhard
last_name: Häupler
- first_name: Zvi
full_name: Lotker, Zvi
last_name: Lotker
citation:
ama: 'Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets
- Towards Self-Adjusting Distributed Data Structures. In: Proceedings of the
26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:439-440.
doi:10.1007/978-3-642-33651-5_47'
apa: 'Schmid, S., Avin, C., Scheideler, C., Häupler, B., & Lotker, Z. (2012).
Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.
In Proceedings of the 26th International Symposium on Distributed Computing
(DISC) (pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47'
bibtex: '@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS},
title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data
Structures}, DOI={10.1007/978-3-642-33651-5_47},
booktitle={Proceedings of the 26th International Symposium on Distributed Computing
(DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler,
Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }'
chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and
Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed
Data Structures.” In Proceedings of the 26th International Symposium on Distributed
Computing (DISC), 439–40. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_47.'
ieee: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement:
SplayNets - Towards Self-Adjusting Distributed Data Structures,” in Proceedings
of the 26th International Symposium on Distributed Computing (DISC), 2012,
pp. 439–440.'
mla: 'Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting
Distributed Data Structures.” Proceedings of the 26th International Symposium
on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.'
short: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings
of the 26th International Symposium on Distributed Computing (DISC), 2012, pp.
439–440.'
date_created: 2017-10-17T12:42:53Z
date_updated: 2022-01-06T07:02:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33651-5_47
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:44:09Z
date_updated: 2018-03-15T06:44:09Z
file_id: '1240'
file_name: 625-disc12adjBAshort.pdf
file_size: 717284
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:44:09Z
has_accepted_license: '1'
page: 439-440
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '626'
abstract:
- lang: eng
text: The design of ecient search structures for peer-to-peer systems has attracted
a lot of attention in recent years. In this announcement we address the problem
of nding the predecessor in a key set and present an ecient data structure called
hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports
PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses
when u is the size of the universe of the keys. That is the costs only depend
on u and not the size of the data structure. One feature of our approach is that
it only uses the lookup interface of the hash table and therefore hash table accesses
may be realized by any distributed hash table (DHT).
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia
Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.
In: Proceedings of the 26th International Symposium on Distributed Computing
(DISC). LNCS. ; 2012:435-436. doi:10.1007/978-3-642-33651-5_45'
apa: 'Kniesburges, S., & Scheideler, C. (2012). Brief Announcement: Hashed Predecessor
Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer
Systems. In Proceedings of the 26th International Symposium on Distributed
Computing (DISC) (pp. 435–436). https://doi.org/10.1007/978-3-642-33651-5_45'
bibtex: '@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief
Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient
Predecessor Queries in Peer-to-Peer Systems}, DOI={10.1007/978-3-642-33651-5_45},
booktitle={Proceedings of the 26th International Symposium on Distributed Computing
(DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012},
pages={435–436}, collection={LNCS} }'
chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement:
Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor
Queries in Peer-to-Peer Systems.” In Proceedings of the 26th International
Symposium on Distributed Computing (DISC), 435–36. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_45.'
ieee: 'S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor
Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer
Systems,” in Proceedings of the 26th International Symposium on Distributed
Computing (DISC), 2012, pp. 435–436.'
mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed
Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries
in Peer-to-Peer Systems.” Proceedings of the 26th International Symposium on
Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.'
short: 'S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International
Symposium on Distributed Computing (DISC), 2012, pp. 435–436.'
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:02:59Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-33651-5_45
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:42:40Z
date_updated: 2018-03-15T06:42:40Z
file_id: '1239'
file_name: 626-Predecessor-Kniesburges_Scheideler.pdf
file_size: 184095
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:42:40Z
has_accepted_license: '1'
page: 435-436
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for
Efficient Predecessor Queries in Peer-to-Peer Systems'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '632'
abstract:
- lang: eng
text: 'Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities
and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals,
an h-route cut is a set F µ E of edges such that after the removal of the edges
in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity
of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural
generalization of the classical cut problem for multicommodity °ows (take h =
1). The main result of this paper is an O(h722h log2 k)-approximation algorithm
for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called
the single source case. As a corollary of it we obtain an approximate duality
theorem for multiroute multicom-modity °ows and cuts with a single source. This
partially answers an open question posted in several previous papers dealing with
cuts for multicommodity multiroute problems.'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows
and Cuts: Single Source Case. In: Proceedings of the 23th ACM SIAM Symposium
on Discrete Algorithms (SODA). ; 2012:800-810. doi:10.1137/1.9781611973099.64'
apa: 'Kolman, P., & Scheideler, C. (2012). Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case. In Proceedings of the 23th ACM
SIAM Symposium on Discrete Algorithms (SODA) (pp. 800–810). https://doi.org/10.1137/1.9781611973099.64'
bibtex: '@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case}, DOI={10.1137/1.9781611973099.64},
booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)},
author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810}
}'
chicago: 'Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case.” In Proceedings of the 23th
ACM SIAM Symposium on Discrete Algorithms (SODA), 800–810, 2012. https://doi.org/10.1137/1.9781611973099.64.'
ieee: 'P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute
Flows and Cuts: Single Source Case,” in Proceedings of the 23th ACM SIAM Symposium
on Discrete Algorithms (SODA), 2012, pp. 800–810.'
mla: 'Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity
Multiroute Flows and Cuts: Single Source Case.” Proceedings of the 23th ACM
SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–10, doi:10.1137/1.9781611973099.64.'
short: 'P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium
on Discrete Algorithms (SODA), 2012, pp. 800–810.'
date_created: 2017-10-17T12:42:55Z
date_updated: 2022-01-06T07:03:01Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1137/1.9781611973099.64
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:35:58Z
date_updated: 2018-03-15T06:35:58Z
file_id: '1234'
file_name: 632-SODA2012-Scheideler_01.pdf
file_size: 220213
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:35:58Z
has_accepted_license: '1'
page: 800-810
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)
status: public
title: 'Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source
Case'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '640'
abstract:
- lang: eng
text: Small-world networks have received significant attention because of their
potential as models for the interaction networks of complex systems. Specifically,
neither random networks nor regular lattices seem to be an adequate framework
within which to study real-world complex systems such as chemical-reaction networks,
neural networks, food webs, social networks, scientific-collaboration networks,
and computer networks. Small-world networks provide some desired properties like
an expected polylogarithmic distance between two processes in the network, which
allows routing in polylogarithmic hops by simple greedy routing, and robustness
against attacks or failures. By these properties, small-world networks are possible
solutions for large overlay networks comparable to structured overlay networks
like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to
their uniform structure, structured overlay networks are more vulnerable to attacks
or failures. In this paper we bring together a randomized process converging to
a small-world network and a self-stabilization process so that a small-world network
is formed out of any weakly connected initial state. To the best of our knowledge
this is the first distributed self-stabilization process for building a small-world
network.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process
for Small-World Networks. In: Proceedings of the 26th IEEE International Parallel
and Distributed Processing Symposium (IPDPS). ; 2012:1261--1271. doi:10.1109/IPDPS.2012.115'
apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2012). A Self-Stabilization
Process for Small-World Networks. In Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS) (pp. 1261--1271). https://doi.org/10.1109/IPDPS.2012.115
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization
Process for Small-World Networks}, DOI={10.1109/IPDPS.2012.115},
booktitle={Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos,
Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }'
chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“A Self-Stabilization Process for Small-World Networks.” In Proceedings of
the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
1261--1271, 2012. https://doi.org/10.1109/IPDPS.2012.115.
ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization
Process for Small-World Networks,” in Proceedings of the 26th IEEE International
Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.
mla: Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World
Networks.” Proceedings of the 26th IEEE International Parallel and Distributed
Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115.
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th
IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012,
pp. 1261--1271.'
date_created: 2017-10-17T12:42:56Z
date_updated: 2022-01-06T07:03:04Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2012.115
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T14:13:13Z
date_updated: 2018-03-14T14:13:13Z
file_id: '1230'
file_name: 640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf
file_size: 210176
relation: main_file
success: 1
file_date_updated: 2018-03-14T14:13:13Z
has_accepted_license: '1'
page: 1261--1271
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: A Self-Stabilization Process for Small-World Networks
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '1891'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive and Fair Medium Access
Despite Reactive Jamming. In: 2011 International Conference on Distributed
Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011.
IEEE Computer Society; 2011:507--516. doi:10.1109/ICDCS.2011.8'
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Competitive
and Fair Medium Access Despite Reactive Jamming. In 2011 International Conference
on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June
20-24, 2011 (pp. 507--516). IEEE Computer Society. https://doi.org/10.1109/ICDCS.2011.8
bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Competitive
and Fair Medium Access Despite Reactive Jamming}, DOI={10.1109/ICDCS.2011.8},
booktitle={2011 International Conference on Distributed Computing Systems, ICDCS
2011, Minneapolis, Minnesota, USA, June 20-24, 2011}, publisher={IEEE Computer
Society}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin}, year={2011}, pages={507--516} }'
chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive
and Fair Medium Access Despite Reactive Jamming.” In 2011 International Conference
on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June
20-24, 2011, 507--516. IEEE Computer Society, 2011. https://doi.org/10.1109/ICDCS.2011.8.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and Fair
Medium Access Despite Reactive Jamming,” in 2011 International Conference on
Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24,
2011, 2011, pp. 507--516.
mla: W. Richa, Andrea, et al. “Competitive and Fair Medium Access Despite Reactive
Jamming.” 2011 International Conference on Distributed Computing Systems, ICDCS
2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society,
2011, pp. 507--516, doi:10.1109/ICDCS.2011.8.
short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 2011 International
Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota,
USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516.'
date_created: 2018-03-28T07:08:13Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '79'
doi: 10.1109/ICDCS.2011.8
page: 507--516
publication: 2011 International Conference on Distributed Computing Systems, ICDCS
2011, Minneapolis, Minnesota, USA, June 20-24, 2011
publication_identifier:
isbn:
- 978-0-7695-4364-2
publisher: IEEE Computer Society
status: public
title: Competitive and Fair Medium Access Despite Reactive Jamming
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1892'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'W. Richa A, Scheideler C, Schmid S, Zhang J. Towards jamming-resistant and
competitive medium access in the SINR model. In: Proceedings of the 3rd ACM
Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM
2011, Las Vegas, NV, USA, September 19 - 23, 2011. ACM; 2011:33--36. doi:10.1145/2030686.2030697'
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Towards jamming-resistant
and competitive medium access in the SINR model. In Proceedings of the 3rd
ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM
2011, Las Vegas, NV, USA, September 19 - 23, 2011 (pp. 33--36). ACM. https://doi.org/10.1145/2030686.2030697
bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Towards jamming-resistant
and competitive medium access in the SINR model}, DOI={10.1145/2030686.2030697},
booktitle={Proceedings of the 3rd ACM workshop on Wireless of the students, by
the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September
19 - 23, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian
and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={33--36} }'
chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Towards
Jamming-Resistant and Competitive Medium Access in the SINR Model.” In Proceedings
of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the
Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, 33--36.
ACM, 2011. https://doi.org/10.1145/2030686.2030697.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Towards jamming-resistant
and competitive medium access in the SINR model,” in Proceedings of the 3rd
ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM
2011, Las Vegas, NV, USA, September 19 - 23, 2011, 2011, pp. 33--36.
mla: W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium
Access in the SINR Model.” Proceedings of the 3rd ACM Workshop on Wireless
of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas,
NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36, doi:10.1145/2030686.2030697.
short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the
3rd ACM Workshop on Wireless of the Students, by the Students, for the Students,
S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36.'
date_created: 2018-03-28T07:09:07Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '79'
doi: 10.1145/2030686.2030697
page: 33--36
publication: Proceedings of the 3rd ACM workshop on Wireless of the students, by the
students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 -
23, 2011
publication_identifier:
isbn:
- 978-1-4503-0868-7
publisher: ACM
status: public
title: Towards jamming-resistant and competitive medium access in the SINR model
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1893'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'W. Richa A, Scheideler C, Schmid S, Zhang J. Self-stabilizing leader election
for single-hop wireless networks despite jamming. In: Proceedings of the 12th
ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc
2011, Paris, France, May 16-20, 2011. ACM; 2011:15. doi:10.1145/2107502.2107522'
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Self-stabilizing
leader election for single-hop wireless networks despite jamming. In Proceedings
of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing,
MobiHoc 2011, Paris, France, May 16-20, 2011 (p. 15). ACM. https://doi.org/10.1145/2107502.2107522
bibtex: '@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Self-stabilizing
leader election for single-hop wireless networks despite jamming}, DOI={10.1145/2107502.2107522},
booktitle={Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc
Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}, publisher={ACM},
author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2011}, pages={15} }'
chicago: W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Self-Stabilizing
Leader Election for Single-Hop Wireless Networks despite Jamming.” In Proceedings
of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing,
MobiHoc 2011, Paris, France, May 16-20, 2011, 15. ACM, 2011. https://doi.org/10.1145/2107502.2107522.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Self-stabilizing leader
election for single-hop wireless networks despite jamming,” in Proceedings
of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing,
MobiHoc 2011, Paris, France, May 16-20, 2011, 2011, p. 15.
mla: W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless
Networks despite Jamming.” Proceedings of the 12th ACM Interational Symposium
on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20,
2011, ACM, 2011, p. 15, doi:10.1145/2107502.2107522.
short: 'A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the
12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc
2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15.'
date_created: 2018-03-28T07:09:54Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '79'
doi: 10.1145/2107502.2107522
page: '15'
publication: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking
and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011
publication_identifier:
isbn:
- 978-1-4503-0722-2
publisher: ACM
status: public
title: Self-stabilizing leader election for single-hop wireless networks despite jamming
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1895'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: a self-stabilizing
chord overlay network. In: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium
on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011
(Co-Located with FCRC 2011). ; 2011:235--244. doi:10.1145/1989493.1989527'
apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2011). Re-Chord:
a self-stabilizing chord overlay network. In SPAA 2011: Proceedings of the
23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San
Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) (pp. 235--244).
https://doi.org/10.1145/1989493.1989527'
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2011, title={Re-Chord:
a self-stabilizing chord overlay network}, DOI={10.1145/1989493.1989527},
booktitle={SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located
with FCRC 2011)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and
Scheideler, Christian}, year={2011}, pages={235--244} }'
chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“Re-Chord: A Self-Stabilizing Chord Overlay Network.” In SPAA 2011: Proceedings
of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures,
San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 235--244, 2011.
https://doi.org/10.1145/1989493.1989527.'
ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: a self-stabilizing
chord overlay network,” in SPAA 2011: Proceedings of the 23rd Annual ACM Symposium
on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011
(Co-located with FCRC 2011), 2011, pp. 235--244.'
mla: 'Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay
Network.” SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located
with FCRC 2011), 2011, pp. 235--244, doi:10.1145/1989493.1989527.'
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: SPAA 2011: Proceedings
of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures,
San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244.'
date_created: 2018-03-28T07:12:49Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '79'
doi: 10.1145/1989493.1989527
page: 235--244
publication: 'SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with
FCRC 2011)'
publication_identifier:
isbn:
- 978-1-4503-0743-7
status: public
title: 'Re-Chord: a self-stabilizing chord overlay network'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1899'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix
Matching in Peer-to-Peer Systems. In: WALCOM: Algorithms and Computation -
5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings. Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170--181.
doi:10.1007/978-3-642-19094-0_18'
apa: 'Kniesburges, S., & Scheideler, C. (2011). Hashed Patricia Trie: Efficient
Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and
Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February
18-20, 2011. Proceedings (Vol. 6552, pp. 170--181). Springer. https://doi.org/10.1007/978-3-642-19094-0_18'
bibtex: '@inproceedings{Kniesburges_Scheideler_2011, series={Lecture Notes in Computer
Science}, title={Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer
Systems}, volume={6552}, DOI={10.1007/978-3-642-19094-0_18},
booktitle={WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM
2011, New Delhi, India, February 18-20, 2011. Proceedings}, publisher={Springer},
author={Kniesburges, Sebastian and Scheideler, Christian}, year={2011}, pages={170--181},
collection={Lecture Notes in Computer Science} }'
chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie:
Efficient Longest Prefix Matching in Peer-to-Peer Systems.” In WALCOM: Algorithms
and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February
18-20, 2011. Proceedings, 6552:170--181. Lecture Notes in Computer Science.
Springer, 2011. https://doi.org/10.1007/978-3-642-19094-0_18.'
ieee: 'S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest
Prefix Matching in Peer-to-Peer Systems,” in WALCOM: Algorithms and Computation
- 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings, 2011, vol. 6552, pp. 170--181.'
mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient
Longest Prefix Matching in Peer-to-Peer Systems.” WALCOM: Algorithms and Computation
- 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings, vol. 6552, Springer, 2011, pp. 170--181, doi:10.1007/978-3-642-19094-0_18.'
short: 'S. Kniesburges, C. Scheideler, in: WALCOM: Algorithms and Computation -
5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011.
Proceedings, Springer, 2011, pp. 170--181.'
date_created: 2018-03-28T07:17:05Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '79'
doi: 10.1007/978-3-642-19094-0_18
intvolume: ' 6552'
page: 170--181
publication: 'WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM
2011, New Delhi, India, February 18-20, 2011. Proceedings'
publication_identifier:
isbn:
- 978-3-642-19093-3
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems'
type: conference
user_id: '15504'
volume: 6552
year: '2011'
...
---
_id: '1900'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Scheideler C, Graffi K. Programming for Distributed Computing: From Physical
to Logical Networks. In: Computer Science, The Hardware, Software and Heart
of It. Springer; 2011:155--168. doi:10.1007/978-1-4614-1168-0_9'
apa: 'Scheideler, C., & Graffi, K. (2011). Programming for Distributed Computing:
From Physical to Logical Networks. In Computer Science, The Hardware, Software
and Heart of It (pp. 155--168). Springer. https://doi.org/10.1007/978-1-4614-1168-0_9'
bibtex: '@inbook{Scheideler_Graffi_2011, title={Programming for Distributed Computing:
From Physical to Logical Networks}, DOI={10.1007/978-1-4614-1168-0_9},
booktitle={Computer Science, The Hardware, Software and Heart of It}, publisher={Springer},
author={Scheideler, Christian and Graffi, Kalman}, year={2011}, pages={155--168}
}'
chicago: 'Scheideler, Christian, and Kalman Graffi. “Programming for Distributed
Computing: From Physical to Logical Networks.” In Computer Science, The Hardware,
Software and Heart of It, 155--168. Springer, 2011. https://doi.org/10.1007/978-1-4614-1168-0_9.'
ieee: 'C. Scheideler and K. Graffi, “Programming for Distributed Computing: From
Physical to Logical Networks,” in Computer Science, The Hardware, Software
and Heart of It, Springer, 2011, pp. 155--168.'
mla: 'Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing:
From Physical to Logical Networks.” Computer Science, The Hardware, Software
and Heart of It, Springer, 2011, pp. 155--168, doi:10.1007/978-1-4614-1168-0_9.'
short: 'C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and
Heart of It, Springer, 2011, pp. 155--168.'
date_created: 2018-03-28T07:17:53Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-1-4614-1168-0_9
page: 155--168
publication: Computer Science, The Hardware, Software and Heart of It
publication_identifier:
isbn:
- 978-1-4614-1167-3
publisher: Springer
status: public
title: 'Programming for Distributed Computing: From Physical to Logical Networks'
type: book_chapter
user_id: '15504'
year: '2011'
...
---
_id: '1901'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Broadcasting - How Can I Quickly Disseminate Information? In:
Algorithms Unplugged. Springer; 2011:223--229. doi:10.1007/978-3-642-15328-0_22'
apa: Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information?
In Algorithms Unplugged (pp. 223--229). Springer. https://doi.org/10.1007/978-3-642-15328-0_22
bibtex: '@inbook{Scheideler_2011, title={Broadcasting - How Can I Quickly Disseminate
Information?}, DOI={10.1007/978-3-642-15328-0_22},
booktitle={Algorithms Unplugged}, publisher={Springer}, author={Scheideler, Christian},
year={2011}, pages={223--229} }'
chicago: Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?”
In Algorithms Unplugged, 223--229. Springer, 2011. https://doi.org/10.1007/978-3-642-15328-0_22.
ieee: C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,”
in Algorithms Unplugged, Springer, 2011, pp. 223--229.
mla: Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?”
Algorithms Unplugged, Springer, 2011, pp. 223--229, doi:10.1007/978-3-642-15328-0_22.
short: 'C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229.'
date_created: 2018-03-28T07:18:43Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15328-0_22
page: 223--229
publication: Algorithms Unplugged
publication_identifier:
isbn:
- 978-3-642-15327-3
publisher: Springer
status: public
title: Broadcasting - How Can I Quickly Disseminate Information?
type: book_chapter
user_id: '15504'
year: '2011'
...
---
_id: '1924'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts
and Flows: Multilevel Ball-Growing. In: 28th International Symposium on Theoretical
Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany.
; 2011:129--140. doi:10.4230/LIPIcs.STACS.2011.129'
apa: 'Kolman, P., & Scheideler, C. (2011). Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium
on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund,
Germany (pp. 129--140). https://doi.org/10.4230/LIPIcs.STACS.2011.129'
bibtex: '@inproceedings{Kolman_Scheideler_2011, title={Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.4230/LIPIcs.STACS.2011.129},
booktitle={28th International Symposium on Theoretical Aspects of Computer Science,
STACS 2011, March 10-12, 2011, Dortmund, Germany}, author={Kolman, Petr and Scheideler,
Christian}, year={2011}, pages={129--140} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” In 28th International
Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12,
2011, Dortmund, Germany, 129--140, 2011. https://doi.org/10.4230/LIPIcs.STACS.2011.129.'
ieee: 'P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute
Cuts and Flows: Multilevel Ball-Growing,” in 28th International Symposium on
Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund,
Germany, 2011, pp. 129--140.'
mla: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” 28th International Symposium
on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund,
Germany, 2011, pp. 129--140, doi:10.4230/LIPIcs.STACS.2011.129.'
short: 'P. Kolman, C. Scheideler, in: 28th International Symposium on Theoretical
Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany,
2011, pp. 129--140.'
date_created: 2018-03-29T08:44:00Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.STACS.2011.129
page: 129--140
publication: 28th International Symposium on Theoretical Aspects of Computer Science,
STACS 2011, March 10-12, 2011, Dortmund, Germany
status: public
title: 'Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '645'
abstract:
- lang: eng
text: In the standard consensus problem there are n processes with possibly di®erent
input values and the goal is to eventually reach a point at which all processes
commit to exactly one of these values. We are studying a slight variant of the
consensus problem called the stabilizing consensus problem [2]. In this problem,
we do not require that each process commits to a ¯nal value at some point, but
that eventually they arrive at a common, stable value without necessarily being
aware of that. This should work irrespective of the states in which the processes
are starting. Our main result is a simple randomized algorithm called median rule
that, with high probability, just needs O(logmlog log n + log n) time and work
per process to arrive at an almost stable consensus for any set of m legal values
as long as an adversary can corrupt the states of at most p n processes at any
time. Without adversarial involvement, just O(log n) time and work is needed for
a stable consensus, with high probability. As a by-product, we obtain a simple
distributed algorithm for approximating the median of n numbers in time O(logmlog
log n + log n) under adversarial presence.
author:
- first_name: Benjamin
full_name: Doerr, Benjamin
last_name: Doerr
- first_name: Leslie Ann
full_name: Goldberg, Leslie Ann
last_name: Goldberg
- first_name: Lorenz
full_name: Minder, Lorenz
last_name: Minder
- first_name: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C. Stabilizing consensus
with the power of two choices. In: Proceedings of the 23rd ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA). ; 2011:149-158. doi:10.1145/1989493.1989516'
apa: Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., & Scheideler, C.
(2011). Stabilizing consensus with the power of two choices. In Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
(pp. 149–158). https://doi.org/10.1145/1989493.1989516
bibtex: '@inproceedings{Doerr_Goldberg_Minder_Sauerwald_Scheideler_2011, title={Stabilizing
consensus with the power of two choices}, DOI={10.1145/1989493.1989516},
booktitle={Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Doerr, Benjamin and Goldberg, Leslie Ann and
Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2011},
pages={149–158} }'
chicago: Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.”
In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 149–58, 2011. https://doi.org/10.1145/1989493.1989516.
ieee: B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing
consensus with the power of two choices,” in Proceedings of the 23rd ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158.
mla: Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”
Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2011, pp. 149–58, doi:10.1145/1989493.1989516.
short: 'B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings
of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2011, pp. 149–158.'
date_created: 2017-10-17T12:42:57Z
date_updated: 2022-01-06T07:03:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/1989493.1989516
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:58:11Z
date_updated: 2018-03-14T13:58:11Z
file_id: '1228'
file_name: 645-spaa70-scheideler.pdf
file_size: 268500
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:58:11Z
has_accepted_license: '1'
page: 149-158
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Stabilizing consensus with the power of two choices
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '646'
abstract:
- lang: eng
text: This paper presents a dynamic overlay network based on the De Bruijn graph
which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage
that it has a guaranteed constant node degree and that the routing between any
two nodes takes at most O(log n) hops with high probability. Also, we show that
there is a simple local-control algorithm that can recover the LDB network from
any network topology that is weakly connected.
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Richa AW, Scheideler C. Self-Stabilizing DeBruijn Networks. In: Proceedings
of the 13th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS). LNCS. ; 2011:416-430. doi:10.1007/978-3-642-24550-3_31'
apa: Richa, A. W., & Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks.
In Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS) (pp. 416–430). https://doi.org/10.1007/978-3-642-24550-3_31
bibtex: '@inproceedings{Richa_Scheideler_2011, series={LNCS}, title={Self-Stabilizing
DeBruijn Networks}, DOI={10.1007/978-3-642-24550-3_31},
booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Richa, Andrea W. and Scheideler,
Christian}, year={2011}, pages={416–430}, collection={LNCS} }'
chicago: Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn
Networks.” In Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 416–30. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_31.
ieee: A. W. Richa and C. Scheideler, “Self-Stabilizing DeBruijn Networks,” in Proceedings
of the 13th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), 2011, pp. 416–430.
mla: Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.”
Proceedings of the 13th International Symposium on Stabilization, Safety, and
Security of Distributed Systems (SSS), 2011, pp. 416–30, doi:10.1007/978-3-642-24550-3_31.
short: 'A.W. Richa, C. Scheideler, in: Proceedings of the 13th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp.
416–430.'
date_created: 2017-10-17T12:42:58Z
date_updated: 2022-01-06T07:03:06Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-24550-3_31
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:57:26Z
date_updated: 2018-03-14T13:57:26Z
file_id: '1227'
file_name: 646-SSS2011-Scheideler_02.pdf
file_size: 339664
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:57:26Z
has_accepted_license: '1'
page: 416-430
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: Self-Stabilizing DeBruijn Networks
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '662'
abstract:
- lang: eng
text: We present Corona, a deterministic self-stabilizing algorithm for skip list
construction in structured overlay networks. Corona operates in the low-atomicity
message-passing asynchronous system model. Corona requires constant process memory
space for its operation and, therefore, scales well. We prove the general necessary
conditions limiting the initial states from which a self-stabilizing structured
overlay network in message-passing system can be constructed. The conditions require
that initial state information has to form a weakly connected graph and it should
only contain identiers that are present in the system. We formally describe Corona
and rigorously prove that it stabilizes from an arbitrary initial state subject
to the necessary conditions. We extend Corona to construct a skip graph.
author:
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Rizal
full_name: Mohd, Rizal
last_name: Mohd
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing
Skip List. In: Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS). LNCS. ; 2011:356--370.
doi:10.1007/978-3-642-24550-3_27'
apa: 'Nesterenko, M., Mohd, R., & Scheideler, C. (2011). Corona: A Stabilizing
Deterministic Message-Passing Skip List. In Proceedings of the 13th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(pp. 356--370). https://doi.org/10.1007/978-3-642-24550-3_27'
bibtex: '@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona:
A Stabilizing Deterministic Message-Passing Skip List}, DOI={10.1007/978-3-642-24550-3_27},
booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd,
Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS}
}'
chicago: 'Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A
Stabilizing Deterministic Message-Passing Skip List.” In Proceedings of the
13th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 356--370. LNCS, 2011. https://doi.org/10.1007/978-3-642-24550-3_27.'
ieee: 'M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic
Message-Passing Skip List,” in Proceedings of the 13th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011,
pp. 356--370.'
mla: 'Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing
Skip List.” Proceedings of the 13th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.'
short: 'M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
2011, pp. 356--370.'
date_created: 2017-10-17T12:43:01Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-24550-3_27
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-14T13:46:48Z
date_updated: 2018-03-14T13:46:48Z
file_id: '1217'
file_name: 662-SSS2011-Corona-Scheideler.pdf
file_size: 305543
relation: main_file
success: 1
file_date_updated: 2018-03-14T13:46:48Z
has_accepted_license: '1'
page: 356--370
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 13th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: 'Corona: A Stabilizing Deterministic Message-Passing Skip List'
type: conference
user_id: '15504'
year: '2011'
...
---
_id: '1903'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme.
Informatik Spektrum. 2010;(5):468--474. doi:10.1007/s00287-010-0470-2
apa: Meyer auf der Heide, F., & Scheideler, C. (2010). Algorithmische Grundlagen
verteilter Speichersysteme. Informatik Spektrum, (5), 468--474. https://doi.org/10.1007/s00287-010-0470-2
bibtex: '@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen
verteilter Speichersysteme}, DOI={10.1007/s00287-010-0470-2},
number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian}, year={2010}, pages={468--474} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische
Grundlagen Verteilter Speichersysteme.” Informatik Spektrum, no. 5 (2010):
468--474. https://doi.org/10.1007/s00287-010-0470-2.'
ieee: F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter
Speichersysteme,” Informatik Spektrum, no. 5, pp. 468--474, 2010.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen
Verteilter Speichersysteme.” Informatik Spektrum, no. 5, 2010, pp. 468--474,
doi:10.1007/s00287-010-0470-2.
short: F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.
date_created: 2018-03-28T07:21:50Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s00287-010-0470-2
issue: '5'
language:
- iso: eng
page: 468--474
publication: Informatik Spektrum
status: public
title: Algorithmische Grundlagen verteilter Speichersysteme
type: journal_article
user_id: '14955'
year: '2010'
...
---
_id: '1904'
author:
- first_name: Cyril
full_name: Gavoille, Cyril
last_name: Gavoille
- first_name: Boaz
full_name: Patt-Shamir, Boaz
last_name: Patt-Shamir
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Gavoille C, Patt-Shamir B, Scheideler C. Foreword. Theory of Computing Systems.
2010;(4):809--810. doi:10.1007/s00224-010-9284-5
apa: Gavoille, C., Patt-Shamir, B., & Scheideler, C. (2010). Foreword. Theory
of Computing Systems, (4), 809--810. https://doi.org/10.1007/s00224-010-9284-5
bibtex: '@article{Gavoille_Patt-Shamir_Scheideler_2010, title={Foreword}, DOI={10.1007/s00224-010-9284-5},
number={4}, journal={Theory of Computing Systems}, author={Gavoille, Cyril and
Patt-Shamir, Boaz and Scheideler, Christian}, year={2010}, pages={809--810} }'
chicago: 'Gavoille, Cyril, Boaz Patt-Shamir, and Christian Scheideler. “Foreword.”
Theory of Computing Systems, no. 4 (2010): 809--810. https://doi.org/10.1007/s00224-010-9284-5.'
ieee: C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” Theory of Computing
Systems, no. 4, pp. 809--810, 2010.
mla: Gavoille, Cyril, et al. “Foreword.” Theory of Computing Systems, no.
4, 2010, pp. 809--810, doi:10.1007/s00224-010-9284-5.
short: C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010)
809--810.
date_created: 2018-03-28T07:22:21Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/s00224-010-9284-5
issue: '4'
page: 809--810
publication: Theory of Computing Systems
status: public
title: Foreword
type: journal_article
user_id: '15504'
year: '2010'
...
---
_id: '1905'
author:
- first_name: Dominik
full_name: Gall, Dominik
last_name: Gall
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Time Complexity
of Distributed Topological Self-stabilization: The Case of Graph Linearization.
In: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca,
Mexico, April 19-23, 2010. Proceedings. Vol 6034. Lecture Notes in Computer
Science. Springer; 2010:294--305. doi:10.1007/978-3-642-12200-2_27'
apa: 'Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig,
H. (2010). Time Complexity of Distributed Topological Self-stabilization: The
Case of Graph Linearization. In LATIN 2010: Theoretical Informatics, 9th Latin
American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (Vol. 6034,
pp. 294--305). Springer. https://doi.org/10.1007/978-3-642-12200-2_27'
bibtex: '@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2010, series={Lecture
Notes in Computer Science}, title={Time Complexity of Distributed Topological
Self-stabilization: The Case of Graph Linearization}, volume={6034}, DOI={10.1007/978-3-642-12200-2_27},
booktitle={LATIN 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings}, publisher={Springer}, author={Gall,
Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid,
Stefan and Täubig, Hanjo}, year={2010}, pages={294--305}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “Time Complexity of Distributed Topological Self-Stabilization:
The Case of Graph Linearization.” In LATIN 2010: Theoretical Informatics, 9th
Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings,
6034:294--305. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-12200-2_27.'
ieee: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig,
“Time Complexity of Distributed Topological Self-stabilization: The Case of Graph
Linearization,” in LATIN 2010: Theoretical Informatics, 9th Latin American
Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, 2010, vol. 6034,
pp. 294--305.'
mla: 'Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization:
The Case of Graph Linearization.” LATIN 2010: Theoretical Informatics, 9th
Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings,
vol. 6034, Springer, 2010, pp. 294--305, doi:10.1007/978-3-642-12200-2_27.'
short: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in:
LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico,
April 19-23, 2010. Proceedings, Springer, 2010, pp. 294--305.'
date_created: 2018-03-28T07:22:42Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-3-642-12200-2_27
intvolume: ' 6034'
page: 294--305
publication: 'LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca,
Mexico, April 19-23, 2010. Proceedings'
publication_identifier:
isbn:
- 978-3-642-12199-9
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Time Complexity of Distributed Topological Self-stabilization: The Case of
Graph Linearization'
type: conference
user_id: '15504'
volume: 6034
year: '2010'
...
---
_id: '1906'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Richa AW, Zhang J, Scheideler C, Schmid S. Brief announcement: towards robust
medium access in multi-hop networks. In: Proceedings of the 29th Annual ACM
Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland,
July 25-28, 2010. ACM; 2010:114--115. doi:10.1145/1835698.1835726'
apa: 'Richa, A. W., Zhang, J., Scheideler, C., & Schmid, S. (2010). Brief announcement:
towards robust medium access in multi-hop networks. In Proceedings of the 29th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010 (pp. 114--115). ACM. https://doi.org/10.1145/1835698.1835726'
bibtex: '@inproceedings{Richa_Zhang_Scheideler_Schmid_2010, title={Brief announcement:
towards robust medium access in multi-hop networks}, DOI={10.1145/1835698.1835726},
booktitle={Proceedings of the 29th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010}, publisher={ACM},
author={Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid,
Stefan}, year={2010}, pages={114--115} }'
chicago: 'Richa, Andrea W., Jin Zhang, Christian Scheideler, and Stefan Schmid.
“Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” In Proceedings
of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC
2010, Zurich, Switzerland, July 25-28, 2010, 114--115. ACM, 2010. https://doi.org/10.1145/1835698.1835726.'
ieee: 'A. W. Richa, J. Zhang, C. Scheideler, and S. Schmid, “Brief announcement:
towards robust medium access in multi-hop networks,” in Proceedings of the
29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010, 2010, pp. 114--115.'
mla: 'Richa, Andrea W., et al. “Brief Announcement: Towards Robust Medium Access
in Multi-Hop Networks.” Proceedings of the 29th Annual ACM Symposium on Principles
of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010,
ACM, 2010, pp. 114--115, doi:10.1145/1835698.1835726.'
short: 'A.W. Richa, J. Zhang, C. Scheideler, S. Schmid, in: Proceedings of the 29th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115.'
date_created: 2018-03-28T07:23:32Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1145/1835698.1835726
page: 114--115
publication: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010
publication_identifier:
isbn:
- 978-1-60558-888-9
publisher: ACM
status: public
title: 'Brief announcement: towards robust medium access in multi-hop networks'
type: conference
user_id: '15504'
year: '2010'
...
---
_id: '1907'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. A Jamming-Resistant MAC Protocol
for Multi-Hop Wireless Networks. In: Distributed Computing, 24th International
Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings.
Vol 6343. Lecture Notes in Computer Science. Springer; 2010:179--193. doi:10.1007/978-3-642-15763-9_17'
apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2010). A Jamming-Resistant
MAC Protocol for Multi-Hop Wireless Networks. In Distributed Computing, 24th
International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010.
Proceedings (Vol. 6343, pp. 179--193). Springer. https://doi.org/10.1007/978-3-642-15763-9_17
bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2010, series={Lecture Notes
in Computer Science}, title={A Jamming-Resistant MAC Protocol for Multi-Hop Wireless
Networks}, volume={6343}, DOI={10.1007/978-3-642-15763-9_17},
booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Richa,
Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2010},
pages={179--193}, collection={Lecture Notes in Computer Science} }'
chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “A
Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” In Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, 6343:179--193. Lecture Notes in Computer Science.
Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_17.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “A Jamming-Resistant
MAC Protocol for Multi-Hop Wireless Networks,” in Distributed Computing, 24th
International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010.
Proceedings, 2010, vol. 6343, pp. 179--193.
mla: Richa, Andrea W., et al. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless
Networks.” Distributed Computing, 24th International Symposium, DISC 2010,
Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343, Springer,
2010, pp. 179--193, doi:10.1007/978-3-642-15763-9_17.
short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Distributed Computing,
24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15,
2010. Proceedings, Springer, 2010, pp. 179--193.'
date_created: 2018-03-28T07:24:22Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15763-9_17
intvolume: ' 6343'
page: 179--193
publication: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings
publication_identifier:
isbn:
- 978-3-642-15762-2
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
type: conference
user_id: '15504'
volume: 6343
year: '2010'
...
---
_id: '1908'
author:
- first_name: Benjamin
full_name: Doerr, Benjamin
last_name: Doerr
- first_name: Leslie
full_name: Ann Goldberg, Leslie
last_name: Ann Goldberg
- first_name: Lorenz
full_name: Minder, Lorenz
last_name: Minder
- first_name: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Brief Announcement:
Stabilizing Consensus with the Power of Two Choices. In: Distributed Computing,
24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15,
2010. Proceedings. Vol 6343. Lecture Notes in Computer Science. Springer;
2010:528--530. doi:10.1007/978-3-642-15763-9_50'
apa: 'Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler,
C. (2010). Brief Announcement: Stabilizing Consensus with the Power of Two Choices.
In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 528--530). Springer.
https://doi.org/10.1007/978-3-642-15763-9_50'
bibtex: '@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2010, series={Lecture
Notes in Computer Science}, title={Brief Announcement: Stabilizing Consensus with
the Power of Two Choices}, volume={6343}, DOI={10.1007/978-3-642-15763-9_50},
booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Doerr,
Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and
Scheideler, Christian}, year={2010}, pages={528--530}, collection={Lecture Notes
in Computer Science} }'
chicago: 'Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Brief Announcement: Stabilizing Consensus with the
Power of Two Choices.” In Distributed Computing, 24th International Symposium,
DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 6343:528--530.
Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_50.'
ieee: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Brief
Announcement: Stabilizing Consensus with the Power of Two Choices,” in Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, 2010, vol. 6343, pp. 528--530.'
mla: 'Doerr, Benjamin, et al. “Brief Announcement: Stabilizing Consensus with the
Power of Two Choices.” Distributed Computing, 24th International Symposium,
DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343,
Springer, 2010, pp. 528--530, doi:10.1007/978-3-642-15763-9_50.'
short: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, Springer, 2010, pp. 528--530.'
date_created: 2018-03-28T07:25:45Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15763-9_50
intvolume: ' 6343'
page: 528--530
publication: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Brief Announcement: Stabilizing Consensus with the Power of Two Choices'
type: conference
user_id: '15504'
volume: 6343
year: '2010'
...
---
_id: '1925'
author:
- first_name: Robert
full_name: D. Kleinberg, Robert
last_name: D. Kleinberg
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: D. Kleinberg R, Scheideler C. Foreword. Theory Comput Syst. 2009;(2):187.
doi:10.1007/s00224-009-9202-x
apa: D. Kleinberg, R., & Scheideler, C. (2009). Foreword. Theory Comput.
Syst., (2), 187. https://doi.org/10.1007/s00224-009-9202-x
bibtex: '@article{D. Kleinberg_Scheideler_2009, title={Foreword}, DOI={10.1007/s00224-009-9202-x},
number={2}, journal={Theory Comput. Syst.}, author={D. Kleinberg, Robert and Scheideler,
Christian}, year={2009}, pages={187} }'
chicago: 'D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory
Comput. Syst., no. 2 (2009): 187. https://doi.org/10.1007/s00224-009-9202-x.'
ieee: R. D. Kleinberg and C. Scheideler, “Foreword,” Theory Comput. Syst.,
no. 2, p. 187, 2009.
mla: D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory Comput.
Syst., no. 2, 2009, p. 187, doi:10.1007/s00224-009-9202-x.
short: R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.
date_created: 2018-03-29T09:01:30Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.1007/s00224-009-9202-x
issue: '2'
page: '187'
publication: Theory Comput. Syst.
status: public
title: Foreword
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1927'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Awerbuch B, Scheideler C. Towards a Scalable and Robust DHT. Theory Comput
Syst. 2009;(2):234--260. doi:10.1007/s00224-008-9099-9
apa: Awerbuch, B., & Scheideler, C. (2009). Towards a Scalable and Robust DHT.
Theory Comput. Syst., (2), 234--260. https://doi.org/10.1007/s00224-008-9099-9
bibtex: '@article{Awerbuch_Scheideler_2009, title={Towards a Scalable and Robust
DHT}, DOI={10.1007/s00224-008-9099-9},
number={2}, journal={Theory Comput. Syst.}, author={Awerbuch, Baruch and Scheideler,
Christian}, year={2009}, pages={234--260} }'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” Theory Comput. Syst., no. 2 (2009): 234--260. https://doi.org/10.1007/s00224-008-9099-9.'
ieee: B. Awerbuch and C. Scheideler, “Towards a Scalable and Robust DHT,” Theory
Comput. Syst., no. 2, pp. 234--260, 2009.
mla: Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” Theory Comput. Syst., no. 2, 2009, pp. 234--260, doi:10.1007/s00224-008-9099-9.
short: B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260.
date_created: 2018-03-29T09:08:11Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.1007/s00224-008-9099-9
issue: '2'
page: 234--260
publication: Theory Comput. Syst.
status: public
title: Towards a Scalable and Robust DHT
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1928'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Awerbuch B, Scheideler C. Robust random number generation for peer-to-peer
systems. Theor Comput Sci. 2009;(6-7):453--466. doi:10.1016/j.tcs.2008.10.003
apa: Awerbuch, B., & Scheideler, C. (2009). Robust random number generation
for peer-to-peer systems. Theor. Comput. Sci., (6–7), 453--466. https://doi.org/10.1016/j.tcs.2008.10.003
bibtex: '@article{Awerbuch_Scheideler_2009, title={Robust random number generation
for peer-to-peer systems}, DOI={10.1016/j.tcs.2008.10.003},
number={6–7}, journal={Theor. Comput. Sci.}, author={Awerbuch, Baruch and Scheideler,
Christian}, year={2009}, pages={453--466} }'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7 (2009): 453--466.
https://doi.org/10.1016/j.tcs.2008.10.003.'
ieee: B. Awerbuch and C. Scheideler, “Robust random number generation for peer-to-peer
systems,” Theor. Comput. Sci., no. 6–7, pp. 453--466, 2009.
mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7, 2009, pp. 453--466,
doi:10.1016/j.tcs.2008.10.003.
short: B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.
date_created: 2018-03-29T09:08:12Z
date_updated: 2022-01-06T06:54:01Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2008.10.003
issue: 6-7
page: 453--466
publication: Theor. Comput. Sci.
status: public
title: Robust random number generation for peer-to-peer systems
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1929'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Scheideler C, Schmid S. A Distributed and Oblivious Heap. In: Automata,
Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes,
Greece, July 5-12, 2009, Proceedings, Part II. Vol 5556. Lecture Notes in
Computer Science. Springer; 2009:571--582. doi:10.1007/978-3-642-02930-1_47'
apa: Scheideler, C., & Schmid, S. (2009). A Distributed and Oblivious Heap.
In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP
2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II (Vol. 5556, pp.
571--582). Springer. https://doi.org/10.1007/978-3-642-02930-1_47
bibtex: '@inproceedings{Scheideler_Schmid_2009, series={Lecture Notes in Computer
Science}, title={A Distributed and Oblivious Heap}, volume={5556}, DOI={10.1007/978-3-642-02930-1_47},
booktitle={Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II}, publisher={Springer},
author={Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={571--582},
collection={Lecture Notes in Computer Science} }'
chicago: Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious
Heap.” In Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, 5556:571--582.
Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-02930-1_47.
ieee: C. Scheideler and S. Schmid, “A Distributed and Oblivious Heap,” in Automata,
Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes,
Greece, July 5-12, 2009, Proceedings, Part II, 2009, vol. 5556, pp. 571--582.
mla: Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.”
Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP
2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, vol. 5556, Springer,
2009, pp. 571--582, doi:10.1007/978-3-642-02930-1_47.
short: 'C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th
Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings,
Part II, Springer, 2009, pp. 571--582.'
date_created: 2018-03-29T09:08:14Z
date_updated: 2022-01-06T06:54:01Z
department:
- _id: '79'
doi: 10.1007/978-3-642-02930-1_47
intvolume: ' 5556'
page: 571--582
publication: Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II
publication_identifier:
isbn:
- 978-3-642-02929-5
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Distributed and Oblivious Heap
type: conference
user_id: '15504'
volume: 5556
year: '2009'
...
---
_id: '1930'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Stephan
full_name: Ritscher, Stephan
last_name: Ritscher
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Jacob R, Ritscher S, Scheideler C, Schmid S. A Self-stabilizing and Local
Delaunay Graph Construction. In: Algorithms and Computation, 20th International
Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings.
Vol 5878. Lecture Notes in Computer Science. Springer; 2009:771--780. doi:10.1007/978-3-642-10631-6_78'
apa: Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2009). A Self-stabilizing
and Local Delaunay Graph Construction. In Algorithms and Computation, 20th
International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009.
Proceedings (Vol. 5878, pp. 771--780). Springer. https://doi.org/10.1007/978-3-642-10631-6_78
bibtex: '@inproceedings{Jacob_Ritscher_Scheideler_Schmid_2009, series={Lecture Notes
in Computer Science}, title={A Self-stabilizing and Local Delaunay Graph Construction},
volume={5878}, DOI={10.1007/978-3-642-10631-6_78},
booktitle={Algorithms and Computation, 20th International Symposium, ISAAC 2009,
Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, publisher={Springer},
author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid,
Stefan}, year={2009}, pages={771--780}, collection={Lecture Notes in Computer
Science} }'
chicago: Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid.
“A Self-Stabilizing and Local Delaunay Graph Construction.” In Algorithms and
Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA,
December 16-18, 2009. Proceedings, 5878:771--780. Lecture Notes in Computer
Science. Springer, 2009. https://doi.org/10.1007/978-3-642-10631-6_78.
ieee: R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “A Self-stabilizing and
Local Delaunay Graph Construction,” in Algorithms and Computation, 20th International
Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings,
2009, vol. 5878, pp. 771--780.
mla: Jacob, Riko, et al. “A Self-Stabilizing and Local Delaunay Graph Construction.”
Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu,
Hawaii, USA, December 16-18, 2009. Proceedings, vol. 5878, Springer, 2009,
pp. 771--780, doi:10.1007/978-3-642-10631-6_78.
short: 'R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation,
20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18,
2009. Proceedings, Springer, 2009, pp. 771--780.'
date_created: 2018-03-29T09:12:59Z
date_updated: 2022-01-06T06:54:02Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-10631-6_78
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:05:53Z
date_updated: 2018-04-13T10:05:53Z
file_id: '2342'
file_name: isaac09.pdf
file_size: 139275
relation: main_file
file_date_updated: 2018-04-13T10:05:53Z
has_accepted_license: '1'
intvolume: ' 5878'
oa: '1'
page: 771--780
publication: Algorithms and Computation, 20th International Symposium, ISAAC 2009,
Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Self-stabilizing and Local Delaunay Graph Construction
type: conference
urn: '19304'
user_id: '15504'
volume: 5878
year: '2009'
...
---
_id: '1932'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic
time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary,
Alberta, Canada, August 10-12, 2009. ; 2009:131--140. doi:10.1145/1582716.1582741'
apa: Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2009).
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.
In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 (pp. 131--140).
https://doi.org/10.1145/1582716.1582741
bibtex: '@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed
polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={10.1145/1582716.1582741},
booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob,
Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig,
Hanjo}, year={2009}, pages={131--140} }'
chicago: Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and
Hanjo Täubig. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing
Skip Graphs.” In Proceedings of the 28th Annual ACM Symposium on Principles
of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009,
131--140, 2009. https://doi.org/10.1145/1582716.1582741.
ieee: R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed
polylogarithmic time algorithm for self-stabilizing skip graphs,” in Proceedings
of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC
2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.
mla: Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing
Skip Graphs.” Proceedings of the 28th Annual ACM Symposium on Principles of
Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009,
2009, pp. 131--140, doi:10.1145/1582716.1582741.
short: 'R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings
of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC
2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.'
date_created: 2018-03-29T09:16:22Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1145/1582716.1582741
page: 131--140
publication: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009
publication_identifier:
isbn:
- 978-1-60558-396-9
status: public
title: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
type: conference
user_id: '15504'
year: '2009'
...
---
_id: '1933'
author:
- first_name: Matthias
full_name: Baumgart, Matthias
last_name: Baumgart
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Baumgart M, Scheideler C, Schmid S. A DoS-resilient information system for
dynamic data management. In: SPAA 2009: Proceedings of the 21st Annual ACM
Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada,
August 11-13, 2009. ; 2009:300--309. doi:10.1145/1583991.1584064'
apa: 'Baumgart, M., Scheideler, C., & Schmid, S. (2009). A DoS-resilient information
system for dynamic data management. In SPAA 2009: Proceedings of the 21st Annual
ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta,
Canada, August 11-13, 2009 (pp. 300--309). https://doi.org/10.1145/1583991.1584064'
bibtex: '@inproceedings{Baumgart_Scheideler_Schmid_2009, title={A DoS-resilient
information system for dynamic data management}, DOI={10.1145/1583991.1584064},
booktitle={SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism
in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009},
author={Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}, year={2009},
pages={300--309} }'
chicago: 'Baumgart, Matthias, Christian Scheideler, and Stefan Schmid. “A DoS-Resilient
Information System for Dynamic Data Management.” In SPAA 2009: Proceedings
of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures,
Calgary, Alberta, Canada, August 11-13, 2009, 300--309, 2009. https://doi.org/10.1145/1583991.1584064.'
ieee: 'M. Baumgart, C. Scheideler, and S. Schmid, “A DoS-resilient information system
for dynamic data management,” in SPAA 2009: Proceedings of the 21st Annual
ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta,
Canada, August 11-13, 2009, 2009, pp. 300--309.'
mla: 'Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic
Data Management.” SPAA 2009: Proceedings of the 21st Annual ACM Symposium on
Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August
11-13, 2009, 2009, pp. 300--309, doi:10.1145/1583991.1584064.'
short: 'M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the
21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary,
Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.'
date_created: 2018-03-29T09:18:06Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1145/1583991.1584064
page: 300--309
publication: 'SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism
in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009'
publication_identifier:
isbn:
- 978-1-60558-606-9
status: public
title: A DoS-resilient information system for dynamic data management
type: conference
user_id: '15504'
year: '2009'
...
---
_id: '1934'
author:
- first_name: Dominik
full_name: Gall, Dominik
last_name: Gall
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Brief Announcement:
On the Time Complexity of Distributed Topological Self-stabilization. In: Stabilization,
Safety, and Security of Distributed Systems, 11th International Symposium, SSS
2009, Lyon, France, November 3-6, 2009. Proceedings. Vol 5873. Lecture Notes
in Computer Science. Springer; 2009:781--782. doi:10.1007/978-3-642-05118-0_58'
apa: 'Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig,
H. (2009). Brief Announcement: On the Time Complexity of Distributed Topological
Self-stabilization. In Stabilization, Safety, and Security of Distributed Systems,
11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings
(Vol. 5873, pp. 781--782). Springer. https://doi.org/10.1007/978-3-642-05118-0_58'
bibtex: '@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, series={Lecture
Notes in Computer Science}, title={Brief Announcement: On the Time Complexity
of Distributed Topological Self-stabilization}, volume={5873}, DOI={10.1007/978-3-642-05118-0_58},
booktitle={Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings}, publisher={Springer},
author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian
and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={781--782}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “Brief Announcement: On the Time Complexity of Distributed
Topological Self-Stabilization.” In Stabilization, Safety, and Security of
Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November
3-6, 2009. Proceedings, 5873:781--782. Lecture Notes in Computer Science.
Springer, 2009. https://doi.org/10.1007/978-3-642-05118-0_58.'
ieee: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig,
“Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization,”
in Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 2009,
vol. 5873, pp. 781--782.'
mla: 'Gall, Dominik, et al. “Brief Announcement: On the Time Complexity of Distributed
Topological Self-Stabilization.” Stabilization, Safety, and Security of Distributed
Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009.
Proceedings, vol. 5873, Springer, 2009, pp. 781--782, doi:10.1007/978-3-642-05118-0_58.'
short: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in:
Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer,
2009, pp. 781--782.'
date_created: 2018-03-29T09:19:17Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1007/978-3-642-05118-0_58
intvolume: ' 5873'
page: 781--782
publication: Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings
publication_identifier:
isbn:
- 978-3-642-05117-3
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization'
type: conference
user_id: '15504'
volume: 5873
year: '2009'
...
---
_id: '1935'
author:
- first_name: Benjamin
full_name: Doerr, Benjamin
last_name: Doerr
- first_name: Leslie
full_name: Ann Goldberg, Leslie
last_name: Ann Goldberg
- first_name: Lorenz
full_name: Minder, Lorenz
last_name: Minder
- first_name: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Stabilizing
Consensus with the Power of Two Choices. In: Algorithmic Methods for Distributed
Cooperative Systems, 06.09. - 11.09.2009. Vol 09371. Dagstuhl Seminar Proceedings.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany; 2009. doi:10.1145/1989493.1989516'
apa: Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler, C.
(2009). Stabilizing Consensus with the Power of Two Choices. In Algorithmic
Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 (Vol. 09371).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. https://doi.org/10.1145/1989493.1989516
bibtex: '@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2009, series={Dagstuhl
Seminar Proceedings}, title={Stabilizing Consensus with the Power of Two Choices},
volume={09371}, DOI={10.1145/1989493.1989516},
booktitle={Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009},
publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}, author={Doerr,
Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and
Scheideler, Christian}, year={2009}, collection={Dagstuhl Seminar Proceedings}
}'
chicago: Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.”
In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009,
Vol. 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, Germany, 2009. https://doi.org/10.1145/1989493.1989516.
ieee: B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing
Consensus with the Power of Two Choices,” in Algorithmic Methods for Distributed
Cooperative Systems, 06.09. - 11.09.2009, 2009, vol. 09371.
mla: Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”
Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009,
vol. 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009,
doi:10.1145/1989493.1989516.
short: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic
Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, Germany, 2009.'
date_created: 2018-03-29T09:20:44Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1145/1989493.1989516
intvolume: ' 9371'
publication: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany
series_title: Dagstuhl Seminar Proceedings
status: public
title: Stabilizing Consensus with the Power of Two Choices
type: conference
user_id: '15504'
volume: '09371'
year: '2009'
...
---
_id: '1937'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Scheideler C. Algorithms for Overlay Networks. Bulletin of the EATCS.
2008:130--152.
apa: Scheideler, C. (2008). Algorithms for Overlay Networks. Bulletin of the
EATCS, 130--152.
bibtex: '@article{Scheideler_2008, title={Algorithms for Overlay Networks}, journal={Bulletin
of the EATCS}, author={Scheideler, Christian}, year={2008}, pages={130--152} }'
chicago: Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of
the EATCS, 2008, 130--152.
ieee: C. Scheideler, “Algorithms for Overlay Networks,” Bulletin of the EATCS,
pp. 130--152, 2008.
mla: Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the
EATCS, 2008, pp. 130--152.
short: C. Scheideler, Bulletin of the EATCS (2008) 130--152.
date_created: 2018-03-29T09:28:22Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
page: 130--152
publication: Bulletin of the EATCS
status: public
title: Algorithms for Overlay Networks
type: journal_article
user_id: '15504'
year: '2008'
...
---
_id: '1938'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Andr{\'{e}}a
full_name: W. Richa, Andr{\'{e}}a
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, W. Richa A, Scheideler C. A jamming-resistant MAC protocol for
single-hop wireless networks. In: Proceedings of the Twenty-Seventh Annual
ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada,
August 18-21, 2008. ACM; 2008:45--54. doi:10.1145/1400751.1400759'
apa: Awerbuch, B., W. Richa, A., & Scheideler, C. (2008). A jamming-resistant
MAC protocol for single-hop wireless networks. In Proceedings of the Twenty-Seventh
Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto,
Canada, August 18-21, 2008 (pp. 45--54). ACM. https://doi.org/10.1145/1400751.1400759
bibtex: '@inproceedings{Awerbuch_W. Richa_Scheideler_2008, title={A jamming-resistant
MAC protocol for single-hop wireless networks}, DOI={10.1145/1400751.1400759},
booktitle={Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles
of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008}, publisher={ACM},
author={Awerbuch, Baruch and W. Richa, Andr{\’{e}}a and Scheideler, Christian},
year={2008}, pages={45--54} }'
chicago: Awerbuch, Baruch, Andr{\’{e}}a W. Richa, and Christian Scheideler. “A Jamming-Resistant
MAC Protocol for Single-Hop Wireless Networks.” In Proceedings of the Twenty-Seventh
Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto,
Canada, August 18-21, 2008, 45--54. ACM, 2008. https://doi.org/10.1145/1400751.1400759.
ieee: B. Awerbuch, A. W. Richa, and C. Scheideler, “A jamming-resistant MAC protocol
for single-hop wireless networks,” in Proceedings of the Twenty-Seventh Annual
ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada,
August 18-21, 2008, 2008, pp. 45--54.
mla: Awerbuch, Baruch, et al. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless
Networks.” Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles
of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008,
ACM, 2008, pp. 45--54, doi:10.1145/1400751.1400759.
short: 'B. Awerbuch, A. W. Richa, C. Scheideler, in: Proceedings of the Twenty-Seventh
Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto,
Canada, August 18-21, 2008, ACM, 2008, pp. 45--54.'
date_created: 2018-03-29T09:29:06Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
doi: 10.1145/1400751.1400759
page: 45--54
publication: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles
of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008
publication_identifier:
isbn:
- 978-1-59593-989-0
publisher: ACM
status: public
title: A jamming-resistant MAC protocol for single-hop wireless networks
type: conference
user_id: '15504'
year: '2008'
...
---
_id: '1940'
author:
- first_name: Mario
full_name: Mense, Mario
last_name: Mense
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage
in dynamic heterogeneous storage systems. In: Proceedings of the Nineteenth
Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California,
USA, January 20-22, 2008. SIAM; 2008:1135--1144.'
apa: 'Mense, M., & Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant
and fair storage in dynamic heterogeneous storage systems. In Proceedings of
the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San
Francisco, California, USA, January 20-22, 2008 (pp. 1135--1144). SIAM.'
bibtex: '@inproceedings{Mense_Scheideler_2008, title={SPREAD: an adaptive scheme
for redundant and fair storage in dynamic heterogeneous storage systems}, booktitle={Proceedings
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008,
San Francisco, California, USA, January 20-22, 2008}, publisher={SIAM}, author={Mense,
Mario and Scheideler, Christian}, year={2008}, pages={1135--1144} }'
chicago: 'Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for
Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” In Proceedings
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008,
San Francisco, California, USA, January 20-22, 2008, 1135--1144. SIAM, 2008.'
ieee: 'M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and
fair storage in dynamic heterogeneous storage systems,” in Proceedings of the
Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco,
California, USA, January 20-22, 2008, 2008, pp. 1135--1144.'
mla: 'Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant
and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of
the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San
Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.'
short: 'M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM
Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January
20-22, 2008, SIAM, 2008, pp. 1135--1144.'
date_created: 2018-03-29T09:30:18Z
date_updated: 2022-01-06T06:54:03Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:03:13Z
date_updated: 2018-04-13T10:03:13Z
file_id: '2341'
file_name: SODA08.pdf
file_size: 211264
relation: main_file
file_date_updated: 2018-04-13T10:03:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 1135--1144
publication: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms,
SODA 2008, San Francisco, California, USA, January 20-22, 2008
publisher: SIAM
status: public
title: 'SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous
storage systems'
type: conference
urn: '19408'
user_id: '14955'
year: '2008'
...
---
_id: '1941'
author:
- first_name: Thomas
full_name: Clouser, Thomas
last_name: Clouser
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Clouser T, Nesterenko M, Scheideler C. Tiara: A Self-stabilizing Deterministic
Skip List. In: Stabilization, Safety, and Security of Distributed Systems,
10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008.
Proceedings. Vol 5340. Lecture Notes in Computer Science. Springer; 2008:124--140.
doi:10.1007/978-3-540-89335-6_12'
apa: 'Clouser, T., Nesterenko, M., & Scheideler, C. (2008). Tiara: A Self-stabilizing
Deterministic Skip List. In Stabilization, Safety, and Security of Distributed
Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23,
2008. Proceedings (Vol. 5340, pp. 124--140). Springer. https://doi.org/10.1007/978-3-540-89335-6_12'
bibtex: '@inproceedings{Clouser_Nesterenko_Scheideler_2008, series={Lecture Notes
in Computer Science}, title={Tiara: A Self-stabilizing Deterministic Skip List},
volume={5340}, DOI={10.1007/978-3-540-89335-6_12},
booktitle={Stabilization, Safety, and Security of Distributed Systems, 10th International
Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}, publisher={Springer},
author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2008},
pages={124--140}, collection={Lecture Notes in Computer Science} }'
chicago: 'Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara:
A Self-Stabilizing Deterministic Skip List.” In Stabilization, Safety, and
Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit,
MI, USA, November 21-23, 2008. Proceedings, 5340:124--140. Lecture Notes in
Computer Science. Springer, 2008. https://doi.org/10.1007/978-3-540-89335-6_12.'
ieee: 'T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A Self-stabilizing
Deterministic Skip List,” in Stabilization, Safety, and Security of Distributed
Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23,
2008. Proceedings, 2008, vol. 5340, pp. 124--140.'
mla: 'Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.”
Stabilization, Safety, and Security of Distributed Systems, 10th International
Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings,
vol. 5340, Springer, 2008, pp. 124--140, doi:10.1007/978-3-540-89335-6_12.'
short: 'T. Clouser, M. Nesterenko, C. Scheideler, in: Stabilization, Safety, and
Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit,
MI, USA, November 21-23, 2008. Proceedings, Springer, 2008, pp. 124--140.'
date_created: 2018-03-29T09:31:18Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
doi: 10.1007/978-3-540-89335-6_12
intvolume: ' 5340'
page: 124--140
publication: Stabilization, Safety, and Security of Distributed Systems, 10th International
Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings
publication_identifier:
isbn:
- 978-3-540-89334-9
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Tiara: A Self-stabilizing Deterministic Skip List'
type: conference
user_id: '15504'
volume: 5340
year: '2008'
...
---
_id: '1942'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Broadcasting: Wie verbreite ich schnell Informationen? In: Taschenbuch
Der Algorithmen. eXamen.press. Springer; 2008:229--236. doi:10.1007/978-3-540-76394-9_22'
apa: 'Scheideler, C. (2008). Broadcasting: Wie verbreite ich schnell Informationen?
In Taschenbuch der Algorithmen (pp. 229--236). Springer. https://doi.org/10.1007/978-3-540-76394-9_22'
bibtex: '@inbook{Scheideler_2008, series={eXamen.press}, title={Broadcasting: Wie
verbreite ich schnell Informationen?}, DOI={10.1007/978-3-540-76394-9_22},
booktitle={Taschenbuch der Algorithmen}, publisher={Springer}, author={Scheideler,
Christian}, year={2008}, pages={229--236}, collection={eXamen.press} }'
chicago: 'Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?”
In Taschenbuch Der Algorithmen, 229--236. EXamen.Press. Springer, 2008.
https://doi.org/10.1007/978-3-540-76394-9_22.'
ieee: 'C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,”
in Taschenbuch der Algorithmen, Springer, 2008, pp. 229--236.'
mla: 'Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?”
Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236, doi:10.1007/978-3-540-76394-9_22.'
short: 'C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236.'
date_created: 2018-03-29T09:32:34Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
doi: 10.1007/978-3-540-76394-9_22
page: 229--236
publication: Taschenbuch der Algorithmen
publication_identifier:
isbn:
- 978-3-540-76393-2
publisher: Springer
series_title: eXamen.press
status: public
title: 'Broadcasting: Wie verbreite ich schnell Informationen?'
type: book_chapter
user_id: '15504'
year: '2008'
...
---
_id: '2017'
author:
- first_name: Amitabha
full_name: Bagchi, Amitabha
last_name: Bagchi
- first_name: Amitabh
full_name: Chaudhary, Amitabh
last_name: Chaudhary
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
citation:
ama: Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for Fault-Tolerant
Routing in Circuit-Switched Networks. SIAM J Discrete Math. 2007;(1):141--157.
doi:10.1137/S0895480102419743
apa: Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2007). Algorithms
for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discrete Math.,
(1), 141--157. https://doi.org/10.1137/S0895480102419743
bibtex: '@article{Bagchi_Chaudhary_Scheideler_Kolman_2007, title={Algorithms for
Fault-Tolerant Routing in Circuit-Switched Networks}, DOI={10.1137/S0895480102419743},
number={1}, journal={SIAM J. Discrete Math.}, author={Bagchi, Amitabha and Chaudhary,
Amitabh and Scheideler, Christian and Kolman, Petr}, year={2007}, pages={141--157}
}'
chicago: 'Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman.
“Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.” SIAM
J. Discrete Math., no. 1 (2007): 141--157. https://doi.org/10.1137/S0895480102419743.'
ieee: A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for Fault-Tolerant
Routing in Circuit-Switched Networks,” SIAM J. Discrete Math., no. 1, pp.
141--157, 2007.
mla: Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit-Switched
Networks.” SIAM J. Discrete Math., no. 1, 2007, pp. 141--157, doi:10.1137/S0895480102419743.
short: A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math.
(2007) 141--157.
date_created: 2018-03-29T11:50:23Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '79'
doi: 10.1137/S0895480102419743
issue: '1'
page: 141--157
publication: SIAM J. Discrete Math.
status: public
title: Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks
type: journal_article
user_id: '15504'
year: '2007'
...
---
_id: '2020'
author:
- first_name: Melih
full_name: Onus, Melih
last_name: Onus
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Onus M, W. Richa A, Scheideler C. Linearization: Locally Self-Stabilizing
Sorting in Graphs. In: Proceedings of the Nine Workshop on Algorithm Engineering
and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007.
; 2007. doi:10.1137/1.9781611972870.10'
apa: 'Onus, M., W. Richa, A., & Scheideler, C. (2007). Linearization: Locally
Self-Stabilizing Sorting in Graphs. In Proceedings of the Nine Workshop on
Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA,
January 6, 2007. https://doi.org/10.1137/1.9781611972870.10'
bibtex: '@inproceedings{Onus_W. Richa_Scheideler_2007, title={Linearization: Locally
Self-Stabilizing Sorting in Graphs}, DOI={10.1137/1.9781611972870.10},
booktitle={Proceedings of the Nine Workshop on Algorithm Engineering and Experiments,
ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007}, author={Onus, Melih
and W. Richa, Andrea and Scheideler, Christian}, year={2007} }'
chicago: 'Onus, Melih, Andrea W. Richa, and Christian Scheideler. “Linearization:
Locally Self-Stabilizing Sorting in Graphs.” In Proceedings of the Nine Workshop
on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana,
USA, January 6, 2007, 2007. https://doi.org/10.1137/1.9781611972870.10.'
ieee: 'M. Onus, A. W. Richa, and C. Scheideler, “Linearization: Locally Self-Stabilizing
Sorting in Graphs,” in Proceedings of the Nine Workshop on Algorithm Engineering
and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007,
2007.'
mla: 'Onus, Melih, et al. “Linearization: Locally Self-Stabilizing Sorting in Graphs.”
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments,
ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007, doi:10.1137/1.9781611972870.10.'
short: 'M. Onus, A. W. Richa, C. Scheideler, in: Proceedings of the Nine Workshop
on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana,
USA, January 6, 2007, 2007.'
date_created: 2018-03-29T11:54:37Z
date_updated: 2022-01-06T06:54:23Z
department:
- _id: '79'
doi: 10.1137/1.9781611972870.10
publication: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments,
ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007
publication_identifier:
isbn:
- 978-1-61197-287-0
status: public
title: 'Linearization: Locally Self-Stabilizing Sorting in Graphs'
type: conference
user_id: '15504'
year: '2007'
...
---
_id: '2022'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. Towards Scalable and Robust Overlay Networks. In:
6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA,
USA, February 26-27, 2007. ; 2007.'
apa: Awerbuch, B., & Scheideler, C. (2007). Towards Scalable and Robust Overlay
Networks. In 6th International workshop on Peer-To-Peer Systems, IPTPS 2007,
Bellevue, WA, USA, February 26-27, 2007.
bibtex: '@inproceedings{Awerbuch_Scheideler_2007, title={Towards Scalable and Robust
Overlay Networks}, booktitle={6th International workshop on Peer-To-Peer Systems,
IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}, author={Awerbuch, Baruch
and Scheideler, Christian}, year={2007} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust
Overlay Networks.” In 6th International Workshop on Peer-To-Peer Systems, IPTPS
2007, Bellevue, WA, USA, February 26-27, 2007, 2007.
ieee: B. Awerbuch and C. Scheideler, “Towards Scalable and Robust Overlay Networks,”
in 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue,
WA, USA, February 26-27, 2007, 2007.
mla: Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay
Networks.” 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007,
Bellevue, WA, USA, February 26-27, 2007, 2007.
short: 'B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer
Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.'
date_created: 2018-03-29T11:55:52Z
date_updated: 2022-01-06T06:54:23Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:00:55Z
date_updated: 2018-04-13T10:00:55Z
file_id: '2338'
file_name: IPTPS07.pdf
file_size: 191943
relation: main_file
file_date_updated: 2018-04-13T10:00:55Z
has_accepted_license: '1'
oa: '1'
publication: 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue,
WA, USA, February 26-27, 2007
status: public
title: Towards Scalable and Robust Overlay Networks
type: conference
urn: '20228'
user_id: '15504'
year: '2007'
...
---
_id: '2023'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. A denial-of-service resistant DHT. In: Proceedings
of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing,
PODC 2007, Portland, Oregon, USA, August 12-15, 2007. ACM; 2007:370--371.
doi:10.1145/1281100.1281178'
apa: Awerbuch, B., & Scheideler, C. (2007). A denial-of-service resistant DHT.
In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed
Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 (pp. 370--371).
ACM. https://doi.org/10.1145/1281100.1281178
bibtex: '@inproceedings{Awerbuch_Scheideler_2007, title={A denial-of-service resistant
DHT}, DOI={10.1145/1281100.1281178},
booktitle={Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles
of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007},
publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007},
pages={370--371} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles
of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007,
370--371. ACM, 2007. https://doi.org/10.1145/1281100.1281178.
ieee: B. Awerbuch and C. Scheideler, “A denial-of-service resistant DHT,” in Proceedings
of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing,
PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 2007, pp. 370--371.
mla: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of
Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007,
ACM, 2007, pp. 370--371, doi:10.1145/1281100.1281178.
short: 'B. Awerbuch, C. Scheideler, in: Proceedings of the Twenty-Sixth Annual ACM
Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon,
USA, August 12-15, 2007, ACM, 2007, pp. 370--371.'
date_created: 2018-03-29T11:56:35Z
date_updated: 2022-01-06T06:54:24Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/1281100.1281178
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:02:18Z
date_updated: 2018-04-13T10:02:18Z
file_id: '2340'
file_name: DISC-07.pdf
file_size: 193097
relation: main_file
file_date_updated: 2018-04-13T10:02:18Z
has_accepted_license: '1'
oa: '1'
page: 370--371
publication: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of
Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007
publication_identifier:
isbn:
- 978-1-59593-616-5
publisher: ACM
status: public
title: A denial-of-service resistant DHT
type: conference
urn: '20237'
user_id: '15504'
year: '2007'
...
---
_id: '2024'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. A Denial-of-Service Resistant DHT. In: Distributed
Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September
24-26, 2007, Proceedings. Vol 4731. Lecture Notes in Computer Science. Springer;
2007:33--47. doi:10.1007/978-3-540-75142-7_6'
apa: Awerbuch, B., & Scheideler, C. (2007). A Denial-of-Service Resistant DHT.
In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings (Vol. 4731, pp. 33--47). Springer.
https://doi.org/10.1007/978-3-540-75142-7_6
bibtex: '@inproceedings{Awerbuch_Scheideler_2007, series={Lecture Notes in Computer
Science}, title={A Denial-of-Service Resistant DHT}, volume={4731}, DOI={10.1007/978-3-540-75142-7_6},
booktitle={Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings}, publisher={Springer}, author={Awerbuch,
Baruch and Scheideler, Christian}, year={2007}, pages={33--47}, collection={Lecture
Notes in Computer Science} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings, 4731:33--47. Lecture Notes in
Computer Science. Springer, 2007. https://doi.org/10.1007/978-3-540-75142-7_6.
ieee: B. Awerbuch and C. Scheideler, “A Denial-of-Service Resistant DHT,” in Distributed
Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September
24-26, 2007, Proceedings, 2007, vol. 4731, pp. 33--47.
mla: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings, vol. 4731, Springer, 2007, pp.
33--47, doi:10.1007/978-3-540-75142-7_6.
short: 'B. Awerbuch, C. Scheideler, in: Distributed Computing, 21st International
Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer,
2007, pp. 33--47.'
date_created: 2018-03-29T11:57:42Z
date_updated: 2022-01-06T06:54:24Z
department:
- _id: '79'
doi: 10.1007/978-3-540-75142-7_6
intvolume: ' 4731'
page: 33--47
publication: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings
publication_identifier:
isbn:
- 978-3-540-75141-0
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Denial-of-Service Resistant DHT
type: conference
user_id: '15504'
volume: 4731
year: '2007'
...
---
_id: '2028'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'W. Richa A, Scheideler C. Overlay Networks for Peer-to-Peer Networks. In:
Handbook of Approximation Algorithms and Metaheuristics. ; 2007. doi:10.1201/9781420010749.ch72'
apa: W. Richa, A., & Scheideler, C. (2007). Overlay Networks for Peer-to-Peer
Networks. In Handbook of Approximation Algorithms and Metaheuristics. https://doi.org/10.1201/9781420010749.ch72
bibtex: '@inbook{W. Richa_Scheideler_2007, title={Overlay Networks for Peer-to-Peer
Networks}, DOI={10.1201/9781420010749.ch72},
booktitle={Handbook of Approximation Algorithms and Metaheuristics.}, author={W.
Richa, Andrea and Scheideler, Christian}, year={2007} }'
chicago: W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer
Networks.” In Handbook of Approximation Algorithms and Metaheuristics.,
2007. https://doi.org/10.1201/9781420010749.ch72.
ieee: A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,”
in Handbook of Approximation Algorithms and Metaheuristics., 2007.
mla: W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer
Networks.” Handbook of Approximation Algorithms and Metaheuristics., 2007,
doi:10.1201/9781420010749.ch72.
short: 'A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and
Metaheuristics., 2007.'
date_created: 2018-03-29T12:00:39Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '79'
doi: 10.1201/9781420010749.ch72
publication: Handbook of Approximation Algorithms and Metaheuristics.
publication_identifier:
isbn:
- 978-1-58488-550-4
status: public
title: Overlay Networks for Peer-to-Peer Networks
type: book_chapter
user_id: '15504'
year: '2007'
...
---
_id: '2214'
abstract:
- lang: eng
text: We present a randomized block-level storage virtualization for arbitrary heterogeneous
storage systems that can distribute data in a fair and redundant way and can adapt
this distribution in an efficient way as storage devices enter or leave the system.
More precisely, our virtualization strategies can distribute a set of data blocks
among a set of storage devices of arbitrary non-uniform capacities so that a storage
device representing x% of the capacity in the system will get x% of the data (as
long as this is in principle possible) and the different copies of each data block
are stored so that no two copies of a data block are located in the same device.
Achieving these two properties is not easy, and no virtualization strategy has
been presented so far that has been formally shown to satisfy fairness and redundancy
while being time- and space-eflcient and allowing an efficient adaptation to a
changing set of devices.
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Sascha
full_name: Effert, Sascha
last_name: Effert
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant
data placement. In: IEEE International Conference on Distributed Computing
Systems (ICDCS). ; 2007.'
apa: Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007).
Dynamic and redundant data placement. IEEE International Conference on Distributed
Computing Systems (ICDCS).
bibtex: '@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic
and redundant data placement}, booktitle={IEEE International Conference on Distributed
Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer
auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }'
chicago: Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian
Scheideler. “Dynamic and Redundant Data Placement.” In IEEE International Conference
on Distributed Computing Systems (ICDCS), 2007.
ieee: A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic
and redundant data placement,” 2007.
mla: Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International
Conference on Distributed Computing Systems (ICDCS), 2007.
short: 'A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE
International Conference on Distributed Computing Systems (ICDCS), 2007.'
date_created: 2018-04-05T07:08:35Z
date_updated: 2022-01-06T06:55:27Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:01:42Z
date_updated: 2018-04-13T10:01:42Z
file_id: '2339'
file_name: ICDCS07.pdf
file_size: 164121
relation: main_file
file_date_updated: 2018-04-13T10:01:42Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: IEEE International Conference on Distributed Computing Systems (ICDCS)
status: public
title: Dynamic and redundant data placement
type: conference
urn: '22147'
user_id: '15415'
year: '2007'
...
---
_id: '2209'
author:
- first_name: Vinay
full_name: Aggarwal, Vinay
last_name: Aggarwal
- first_name: Anja
full_name: Feldmann, Anja
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P2P users cooperate for
improved performance? ACM Computer Commucation Review. 2007. doi:10.1145/1273445.1273449
apa: Aggarwal, V., Feldmann, A., & Scheideler, C. (2007). Can ISPs and P2P users
cooperate for improved performance? ACM Computer Commucation Review. https://doi.org/10.1145/1273445.1273449
bibtex: '@article{Aggarwal_Feldmann_Scheideler_2007, title={Can ISPs and P2P users
cooperate for improved performance?}, DOI={10.1145/1273445.1273449},
journal={ACM Computer Commucation Review}, author={Aggarwal, Vinay and Feldmann,
Anja and Scheideler, Christian}, year={2007} }'
chicago: Aggarwal, Vinay, Anja Feldmann, and Christian Scheideler. “Can ISPs and
P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review,
2007. https://doi.org/10.1145/1273445.1273449.
ieee: V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate
for improved performance?,” ACM Computer Commucation Review, 2007.
mla: Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?”
ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.
short: V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review
(2007).
date_created: 2018-04-05T06:08:43Z
date_updated: 2022-01-06T06:55:25Z
department:
- _id: '79'
doi: 10.1145/1273445.1273449
publication: ACM Computer Commucation Review
status: public
title: Can ISPs and P2P users cooperate for improved performance?
type: journal_article
user_id: '15504'
year: '2007'
...
---
_id: '2029'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem.
J Algorithms. 2006;61(1):20--44. doi:10.1016/j.jalgor.2004.07.006
apa: Kolman, P., & Scheideler, C. (2006). Improved bounds for the unsplittable
flow problem. J. Algorithms, 61(1), 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006
bibtex: '@article{Kolman_Scheideler_2006, title={Improved bounds for the unsplittable
flow problem}, volume={61}, DOI={10.1016/j.jalgor.2004.07.006},
number={1}, journal={J. Algorithms}, author={Kolman, Petr and Scheideler, Christian},
year={2006}, pages={20--44} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” J. Algorithms 61, no. 1 (2006): 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006.'
ieee: P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,”
J. Algorithms, vol. 61, no. 1, pp. 20--44, 2006.
mla: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” J. Algorithms, vol. 61, no. 1, 2006, pp. 20--44, doi:10.1016/j.jalgor.2004.07.006.
short: P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.
date_created: 2018-03-29T12:01:37Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '79'
doi: 10.1016/j.jalgor.2004.07.006
intvolume: ' 61'
issue: '1'
page: 20--44
publication: J. Algorithms
status: public
title: Improved bounds for the unsplittable flow problem
type: journal_article
user_id: '15504'
volume: 61
year: '2006'
...
---
_id: '2110'
author:
- first_name: Giuseppe
full_name: Ateniese, Giuseppe
last_name: Ateniese
- first_name: Chris
full_name: Riley, Chris
last_name: Riley
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks.
IEEE Trans Mob Comput. 2006;(9):1242--1254. doi:10.1109/TMC.2006.138
apa: Ateniese, G., Riley, C., & Scheideler, C. (2006). Survivable Monitoring
in Dynamic Networks. IEEE Trans. Mob. Comput., (9), 1242--1254. https://doi.org/10.1109/TMC.2006.138
bibtex: '@article{Ateniese_Riley_Scheideler_2006, title={Survivable Monitoring in
Dynamic Networks}, DOI={10.1109/TMC.2006.138},
number={9}, journal={IEEE Trans. Mob. Comput.}, author={Ateniese, Giuseppe and
Riley, Chris and Scheideler, Christian}, year={2006}, pages={1242--1254} }'
chicago: 'Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable
Monitoring in Dynamic Networks.” IEEE Trans. Mob. Comput., no. 9 (2006):
1242--1254. https://doi.org/10.1109/TMC.2006.138.'
ieee: G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic
Networks,” IEEE Trans. Mob. Comput., no. 9, pp. 1242--1254, 2006.
mla: Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IEEE
Trans. Mob. Comput., no. 9, 2006, pp. 1242--1254, doi:10.1109/TMC.2006.138.
short: G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254.
date_created: 2018-04-03T05:21:30Z
date_updated: 2022-01-06T06:54:45Z
department:
- _id: '79'
doi: 10.1109/TMC.2006.138
issue: '9'
page: 1242--1254
publication: IEEE Trans. Mob. Comput.
status: public
title: Survivable Monitoring in Dynamic Networks
type: journal_article
user_id: '15504'
year: '2006'
...
---
_id: '2111'
author:
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Melih
full_name: Onus, Melih
last_name: Onus
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Kothapalli K, Scheideler C, Onus M, Schindelhauer C. Distributed coloring
in O/spl tilde/(/spl radic/(log n)) bit rounds. In: IPDPS. ; 2006.'
apa: Kothapalli, K., Scheideler, C., Onus, M., & Schindelhauer, C. (2006). Distributed
coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In IPDPS.
bibtex: '@inproceedings{Kothapalli_Scheideler_Onus_Schindelhauer_2006, title={Distributed
coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}, booktitle={IPDPS}, author={Kothapalli,
Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian},
year={2006} }'
chicago: Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Christian Schindelhauer.
“Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” In IPDPS,
2006.
ieee: K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer, “Distributed
coloring in O/spl tilde/(/spl radic/(log n)) bit rounds,” in IPDPS, 2006.
mla: Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log
n)) Bit Rounds.” IPDPS, 2006.
short: 'K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006.'
date_created: 2018-04-03T05:22:43Z
date_updated: 2022-01-06T06:54:46Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T09:57:03Z
date_updated: 2018-04-13T09:57:03Z
file_id: '2334'
file_name: IPDPS06.pdf
file_size: 192708
relation: main_file
file_date_updated: 2018-04-13T09:57:03Z
has_accepted_license: '1'
oa: '1'
publication: IPDPS
status: public
title: Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
type: conference
urn: '21110'
user_id: '15504'
year: '2006'
...
---
_id: '2112'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. Robust Random Number Generation for Peer-to-Peer
Systems. In: OPODIS. Lecture Notes in Computer Science. ; 2006:275--289.'
apa: Awerbuch, B., & Scheideler, C. (2006). Robust Random Number Generation
for Peer-to-Peer Systems. In OPODIS (pp. 275--289).
bibtex: '@inproceedings{Awerbuch_Scheideler_2006, series={Lecture Notes in Computer
Science}, title={Robust Random Number Generation for Peer-to-Peer Systems}, booktitle={OPODIS},
author={Awerbuch, Baruch and Scheideler, Christian}, year={2006}, pages={275--289},
collection={Lecture Notes in Computer Science} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” In OPODIS, 275--289. Lecture Notes in Computer
Science, 2006.
ieee: B. Awerbuch and C. Scheideler, “Robust Random Number Generation for Peer-to-Peer
Systems,” in OPODIS, 2006, pp. 275--289.
mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” OPODIS, 2006, pp. 275--289.
short: 'B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.'
date_created: 2018-04-03T05:23:39Z
date_updated: 2022-01-06T06:54:46Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T09:57:51Z
date_updated: 2018-04-13T09:57:51Z
file_id: '2335'
file_name: OPODIS06.pdf
file_size: 198976
relation: main_file
file_date_updated: 2018-04-13T09:57:51Z
has_accepted_license: '1'
oa: '1'
page: 275--289
publication: OPODIS
series_title: Lecture Notes in Computer Science
status: public
title: Robust Random Number Generation for Peer-to-Peer Systems
type: conference
urn: '21128'
user_id: '15504'
year: '2006'
...
---
_id: '2113'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. Towards a scalable and robust DHT. In: SPAA.
; 2006:318--327.'
apa: Awerbuch, B., & Scheideler, C. (2006). Towards a scalable and robust DHT.
In SPAA (pp. 318--327).
bibtex: '@inproceedings{Awerbuch_Scheideler_2006, title={Towards a scalable and
robust DHT}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian},
year={2006}, pages={318--327} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” In SPAA, 318--327, 2006.
ieee: B. Awerbuch and C. Scheideler, “Towards a scalable and robust DHT,” in SPAA,
2006, pp. 318--327.
mla: Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” SPAA, 2006, pp. 318--327.
short: 'B. Awerbuch, C. Scheideler, in: SPAA, 2006, pp. 318--327.'
date_created: 2018-04-03T05:24:22Z
date_updated: 2022-01-06T06:54:46Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:00:09Z
date_updated: 2018-04-13T10:00:09Z
file_id: '2337'
file_name: SPAA06.pdf
file_size: 144588
relation: main_file
file_date_updated: 2018-04-13T10:00:09Z
has_accepted_license: '1'
oa: '1'
page: 318--327
publication: SPAA
status: public
title: Towards a scalable and robust DHT
type: conference
urn: '21137'
user_id: '15504'
year: '2006'
...
---
_id: '2043'
author:
- first_name: Amitabha
full_name: Bagchi, Amitabha
last_name: Bagchi
- first_name: Ankur
full_name: Bhargava, Ankur
last_name: Bhargava
- first_name: Amitabh
full_name: Chaudhary, Amitabh
last_name: Chaudhary
- first_name: David
full_name: Eppstein, David
last_name: Eppstein
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The Effect of
Faults on Network Expansion. Theory Comput Syst. 2006;(6):903--928. doi:10.1007/s00224-006-1349-0
apa: Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C.
(2006). The Effect of Faults on Network Expansion. Theory Comput. Syst.,
(6), 903--928. https://doi.org/10.1007/s00224-006-1349-0
bibtex: '@article{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2006, title={The
Effect of Faults on Network Expansion}, DOI={10.1007/s00224-006-1349-0},
number={6}, journal={Theory Comput. Syst.}, author={Bagchi, Amitabha and Bhargava,
Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2006},
pages={903--928} }'
chicago: 'Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and
Christian Scheideler. “The Effect of Faults on Network Expansion.” Theory Comput.
Syst., no. 6 (2006): 903--928. https://doi.org/10.1007/s00224-006-1349-0.'
ieee: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The
Effect of Faults on Network Expansion,” Theory Comput. Syst., no. 6, pp.
903--928, 2006.
mla: Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” Theory
Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.
short: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory
Comput. Syst. (2006) 903--928.
date_created: 2018-03-29T12:32:54Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '79'
doi: 10.1007/s00224-006-1349-0
issue: '6'
page: 903--928
publication: Theory Comput. Syst.
status: public
title: The Effect of Faults on Network Expansion
type: journal_article
user_id: '15504'
year: '2006'
...
---
_id: '2213'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Towards a paradigm for robust distributed algorithms and data
structures. In: 6th International HNI Symposium on New Trends in Parallel and
Distributed Computing. ; 2006.'
apa: Scheideler, C. (2006). Towards a paradigm for robust distributed algorithms
and data structures. In 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing.
bibtex: '@inproceedings{Scheideler_2006, title={Towards a paradigm for robust distributed
algorithms and data structures}, booktitle={6th International HNI Symposium on
New Trends in Parallel and Distributed Computing}, author={Scheideler, Christian},
year={2006} }'
chicago: Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms
and Data Structures.” In 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.
ieee: C. Scheideler, “Towards a paradigm for robust distributed algorithms and data
structures,” in 6th International HNI Symposium on New Trends in Parallel and
Distributed Computing, 2006.
mla: Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms
and Data Structures.” 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.
short: 'C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.'
date_created: 2018-04-05T07:06:44Z
date_updated: 2022-01-06T06:55:27Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T09:59:14Z
date_updated: 2018-04-13T09:59:14Z
file_id: '2336'
file_name: HNI-Symposium-06.pdf
file_size: 85116
relation: main_file
file_date_updated: 2018-04-13T09:59:14Z
has_accepted_license: '1'
oa: '1'
publication: 6th International HNI Symposium on New Trends in Parallel and Distributed
Computing
status: public
title: Towards a paradigm for robust distributed algorithms and data structures
type: conference
urn: '22137'
user_id: '15504'
year: '2006'
...
---
_id: '2114'
author:
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Korzeniowski M, Scheideler C. Transparent Data Structures, or How to Make
Search Trees Robust in a Distributed Environment. In: ISPAN. ; 2005:182--187.'
apa: Korzeniowski, M., & Scheideler, C. (2005). Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment. In ISPAN
(pp. 182--187).
bibtex: '@inproceedings{Korzeniowski_Scheideler_2005, title={Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment}, booktitle={ISPAN},
author={Korzeniowski, Miroslaw and Scheideler, Christian}, year={2005}, pages={182--187}
}'
chicago: Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment.” In ISPAN,
182--187, 2005.
ieee: M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to
Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005,
pp. 182--187.
mla: Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment.” ISPAN,
2005, pp. 182--187.
short: 'M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.'
date_created: 2018-04-03T05:25:16Z
date_updated: 2022-01-06T06:54:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:45:41Z
date_updated: 2018-04-13T08:45:41Z
file_id: '2325'
file_name: KS-ISPAN-05-TransData.pdf
file_size: 110389
relation: main_file
file_date_updated: 2018-04-13T08:45:41Z
has_accepted_license: '1'
oa: '1'
page: 182--187
publication: ISPAN
status: public
title: Transparent Data Structures, or How to Make Search Trees Robust in a Distributed
Environment
type: conference
urn: '21146'
user_id: '15504'
year: '2005'
...
---
_id: '2115'
author:
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kothapalli K, Scheideler C. Supervised Peer-to-Peer Systems. In: ISPAN.
; 2005:188--193.'
apa: Kothapalli, K., & Scheideler, C. (2005). Supervised Peer-to-Peer Systems.
In ISPAN (pp. 188--193).
bibtex: '@inproceedings{Kothapalli_Scheideler_2005, title={Supervised Peer-to-Peer
Systems}, booktitle={ISPAN}, author={Kothapalli, Kishore and Scheideler, Christian},
year={2005}, pages={188--193} }'
chicago: Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer
Systems.” In ISPAN, 188--193, 2005.
ieee: K. Kothapalli and C. Scheideler, “Supervised Peer-to-Peer Systems,” in ISPAN,
2005, pp. 188--193.
mla: Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.”
ISPAN, 2005, pp. 188--193.
short: 'K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 188--193.'
date_created: 2018-04-03T05:26:10Z
date_updated: 2022-01-06T06:54:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:50:40Z
date_updated: 2018-04-13T08:50:40Z
file_id: '2326'
file_name: KS-ISPAN-05-Supervised.pdf
file_size: 69350
relation: main_file
file_date_updated: 2018-04-13T08:50:40Z
has_accepted_license: '1'
oa: '1'
page: 188--193
publication: ISPAN
status: public
title: Supervised Peer-to-Peer Systems
type: conference
urn: '21156'
user_id: '15504'
year: '2005'
...
---
_id: '2116'
author:
- first_name: Melih
full_name: Onus, Melih
last_name: Onus
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Onus M, W. Richa A, Kothapalli K, Scheideler C. Efficient Broadcasting and
Gathering in Wireless Ad-Hoc Networks. In: ISPAN. ; 2005:346--351.'
apa: Onus, M., W. Richa, A., Kothapalli, K., & Scheideler, C. (2005). Efficient
Broadcasting and Gathering in Wireless Ad-Hoc Networks. In ISPAN (pp. 346--351).
bibtex: '@inproceedings{Onus_W. Richa_Kothapalli_Scheideler_2005, title={Efficient
Broadcasting and Gathering in Wireless Ad-Hoc Networks}, booktitle={ISPAN}, author={Onus,
Melih and W. Richa, Andrea and Kothapalli, Kishore and Scheideler, Christian},
year={2005}, pages={346--351} }'
chicago: Onus, Melih, Andrea W. Richa, Kishore Kothapalli, and Christian Scheideler.
“Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” In ISPAN,
346--351, 2005.
ieee: M. Onus, A. W. Richa, K. Kothapalli, and C. Scheideler, “Efficient Broadcasting
and Gathering in Wireless Ad-Hoc Networks,” in ISPAN, 2005, pp. 346--351.
mla: Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc
Networks.” ISPAN, 2005, pp. 346--351.
short: 'M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp.
346--351.'
date_created: 2018-04-03T05:26:50Z
date_updated: 2022-01-06T06:54:48Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:55:51Z
date_updated: 2018-04-13T08:55:51Z
file_id: '2327'
file_name: KORS-ISPAN-05.pdf
file_size: 135267
relation: main_file
file_date_updated: 2018-04-13T08:55:51Z
has_accepted_license: '1'
oa: '1'
page: 346--351
publication: ISPAN
status: public
title: Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
type: conference
urn: '21165'
user_id: '15504'
year: '2005'
...
---
_id: '2117'
author:
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Melih
full_name: Onus, Melih
last_name: Onus
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
citation:
ama: 'Kothapalli K, Scheideler C, Onus M, W. Richa A. Constant density spanners
for wireless ad-hoc networks. In: SPAA. ; 2005:116--125.'
apa: Kothapalli, K., Scheideler, C., Onus, M., & W. Richa, A. (2005). Constant
density spanners for wireless ad-hoc networks. In SPAA (pp. 116--125).
bibtex: '@inproceedings{Kothapalli_Scheideler_Onus_W. Richa_2005, title={Constant
density spanners for wireless ad-hoc networks}, booktitle={SPAA}, author={Kothapalli,
Kishore and Scheideler, Christian and Onus, Melih and W. Richa, Andrea}, year={2005},
pages={116--125} }'
chicago: Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Andrea W. Richa.
“Constant Density Spanners for Wireless Ad-Hoc Networks.” In SPAA, 116--125,
2005.
ieee: K. Kothapalli, C. Scheideler, M. Onus, and A. W. Richa, “Constant density
spanners for wireless ad-hoc networks,” in SPAA, 2005, pp. 116--125.
mla: Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc
Networks.” SPAA, 2005, pp. 116--125.
short: 'K. Kothapalli, C. Scheideler, M. Onus, A. W. Richa, in: SPAA, 2005, pp.
116--125.'
date_created: 2018-04-03T05:28:33Z
date_updated: 2022-01-06T06:54:48Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:56:49Z
date_updated: 2018-04-13T08:56:49Z
file_id: '2328'
file_name: SPAA-05.pdf
file_size: 118644
relation: main_file
file_date_updated: 2018-04-13T08:56:49Z
has_accepted_license: '1'
oa: '1'
page: 116--125
publication: SPAA
status: public
title: Constant density spanners for wireless ad-hoc networks
type: conference
urn: '21175'
user_id: '15504'
year: '2005'
...
---
_id: '2118'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. How to spread adversarial nodes?: rotate! In: STOC. ;
2005:704--713.'
apa: 'Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In STOC
(pp. 704--713).'
bibtex: '@inproceedings{Scheideler_2005, title={How to spread adversarial nodes?:
rotate!}, booktitle={STOC}, author={Scheideler, Christian}, year={2005}, pages={704--713}
}'
chicago: 'Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” In
STOC, 704--713, 2005.'
ieee: 'C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC,
2005, pp. 704--713.'
mla: 'Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” STOC,
2005, pp. 704--713.'
short: 'C. Scheideler, in: STOC, 2005, pp. 704--713.'
date_created: 2018-04-03T05:29:27Z
date_updated: 2022-01-06T06:54:49Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:58:22Z
date_updated: 2018-04-13T08:58:22Z
file_id: '2330'
file_name: STOC-05.pdf
file_size: 134460
relation: main_file
file_date_updated: 2018-04-13T08:58:22Z
has_accepted_license: '1'
oa: '1'
page: 704--713
publication: STOC
status: public
title: 'How to spread adversarial nodes?: rotate!'
type: conference
urn: '21185'
user_id: '15504'
year: '2005'
...
---
_id: '2212'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Overlay networks for wireless ad hoc networks. In: IMA Workshop
on Wireless Communications. ; 2005.'
apa: Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA
Workshop on Wireless Communications.
bibtex: '@inproceedings{Scheideler_2005, title={Overlay networks for wireless ad
hoc networks}, booktitle={IMA Workshop on Wireless Communications}, author={Scheideler,
Christian}, year={2005} }'
chicago: Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.”
In IMA Workshop on Wireless Communications, 2005.
ieee: C. Scheideler, “Overlay networks for wireless ad hoc networks,” in IMA
Workshop on Wireless Communications, 2005.
mla: Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” IMA
Workshop on Wireless Communications, 2005.
short: 'C. Scheideler, in: IMA Workshop on Wireless Communications, 2005.'
date_created: 2018-04-05T07:05:16Z
date_updated: 2022-01-06T06:55:26Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:57:39Z
date_updated: 2018-04-13T08:57:39Z
file_id: '2329'
file_name: IMA-05.pdf
file_size: 295333
relation: main_file
file_date_updated: 2018-04-13T08:57:39Z
has_accepted_license: '1'
oa: '1'
publication: IMA Workshop on Wireless Communications
status: public
title: Overlay networks for wireless ad hoc networks
type: conference
urn: '22129'
user_id: '15504'
year: '2005'
...
---
_id: '2119'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint
Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1
apa: Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1
bibtex: '@article{Kolman_Scheideler_2004, title={Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem}, DOI={10.1007/s00453-004-1086-1},
number={3}, journal={Algorithmica}, author={Kolman, Petr and Scheideler, Christian},
year={2004}, pages={209--233} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for
the Maximum Disjoint Paths Problem.” Algorithmica, no. 3 (2004): 209--233.
https://doi.org/10.1007/s00453-004-1086-1.'
ieee: P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint
Paths Problem,” Algorithmica, no. 3, pp. 209--233, 2004.
mla: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem.” Algorithmica, no. 3, 2004, pp. 209--233,
doi:10.1007/s00453-004-1086-1.
short: P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.
date_created: 2018-04-03T05:30:23Z
date_updated: 2022-01-06T06:54:49Z
department:
- _id: '79'
doi: 10.1007/s00453-004-1086-1
issue: '3'
page: 209--233
publication: Algorithmica
status: public
title: Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
type: journal_article
user_id: '15504'
year: '2004'
...
---
_id: '2120'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. Group Spreading: A Protocol for Provably Secure
Distributed Name Service. In: ICALP. Vol 3142. Lecture Notes in Computer
Science. ; 2004:183--195.'
apa: 'Awerbuch, B., & Scheideler, C. (2004). Group Spreading: A Protocol for
Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 183--195).'
bibtex: '@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer
Science}, title={Group Spreading: A Protocol for Provably Secure Distributed Name
Service}, volume={3142}, booktitle={ICALP}, author={Awerbuch, Baruch and Scheideler,
Christian}, year={2004}, pages={183--195}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol
for Provably Secure Distributed Name Service.” In ICALP, 3142:183--195.
Lecture Notes in Computer Science, 2004.'
ieee: 'B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably
Secure Distributed Name Service,” in ICALP, 2004, vol. 3142, pp. 183--195.'
mla: 'Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for
Provably Secure Distributed Name Service.” ICALP, vol. 3142, 2004, pp.
183--195.'
short: 'B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.'
date_created: 2018-04-03T05:31:04Z
date_updated: 2022-01-06T06:54:49Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:20:16Z
date_updated: 2018-04-12T09:20:16Z
file_id: '2312'
file_name: ICALP-04.pdf
file_size: 145383
relation: main_file
file_date_updated: 2018-04-12T09:20:16Z
has_accepted_license: '1'
intvolume: ' 3142'
oa: '1'
page: 183--195
publication: ICALP
series_title: Lecture Notes in Computer Science
status: public
title: 'Group Spreading: A Protocol for Provably Secure Distributed Name Service'
type: conference
urn: '21200'
user_id: '15504'
volume: 3142
year: '2004'
...
---
_id: '2121'
author:
- first_name: Chris
full_name: Riley, Chris
last_name: Riley
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In:
IPDPS. ; 2004.'
apa: Riley, C., & Scheideler, C. (2004). A Distributed Hash Table for Computational
Grids. In IPDPS.
bibtex: '@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for
Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler,
Christian}, year={2004} }'
chicago: Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational
Grids.” In IPDPS, 2004.
ieee: C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,”
in IPDPS, 2004.
mla: Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational
Grids.” IPDPS, 2004.
short: 'C. Riley, C. Scheideler, in: IPDPS, 2004.'
date_created: 2018-04-03T05:31:59Z
date_updated: 2022-01-06T06:54:50Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:50:26Z
date_updated: 2018-04-12T09:50:26Z
file_id: '2316'
file_name: IPDPS-04.pdf
file_size: 91542
relation: main_file
file_date_updated: 2018-04-12T09:50:26Z
has_accepted_license: '1'
oa: '1'
publication: IPDPS
status: public
title: A Distributed Hash Table for Computational Grids
type: conference
urn: '21212'
user_id: '15504'
year: '2004'
...
---
_id: '2122'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. Robust Distributed Name Service. In: IPTPS.
Vol 3279. Lecture Notes in Computer Science. ; 2004:237--249.'
apa: Awerbuch, B., & Scheideler, C. (2004). Robust Distributed Name Service.
In IPTPS (Vol. 3279, pp. 237--249).
bibtex: '@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer
Science}, title={Robust Distributed Name Service}, volume={3279}, booktitle={IPTPS},
author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={237--249},
collection={Lecture Notes in Computer Science} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.”
In IPTPS, 3279:237--249. Lecture Notes in Computer Science, 2004.
ieee: B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS,
2004, vol. 3279, pp. 237--249.
mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.”
IPTPS, vol. 3279, 2004, pp. 237--249.
short: 'B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.'
date_created: 2018-04-03T05:32:33Z
date_updated: 2022-01-06T06:54:50Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T11:39:38Z
date_updated: 2018-04-12T11:39:38Z
file_id: '2318'
file_name: IPTPS-04.pdf
file_size: 136987
relation: main_file
file_date_updated: 2018-04-12T11:39:38Z
has_accepted_license: '1'
intvolume: ' 3279'
oa: '1'
page: 237--249
publication: IPTPS
series_title: Lecture Notes in Computer Science
status: public
title: Robust Distributed Name Service
type: conference
urn: '21229'
user_id: '15504'
volume: 3279
year: '2004'
...
---
_id: '2123'
author:
- first_name: Giuseppe
full_name: Ateniese, Giuseppe
last_name: Ateniese
- first_name: Chris
full_name: Riley, Chris
last_name: Riley
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks.
In: IWIA. ; 2004:33--47.'
apa: Ateniese, G., Riley, C., & Scheideler, C. (2004). Survivable Monitoring
in Dynamic Networks. In IWIA (pp. 33--47).
bibtex: '@inproceedings{Ateniese_Riley_Scheideler_2004, title={Survivable Monitoring
in Dynamic Networks}, booktitle={IWIA}, author={Ateniese, Giuseppe and Riley,
Chris and Scheideler, Christian}, year={2004}, pages={33--47} }'
chicago: Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable
Monitoring in Dynamic Networks.” In IWIA, 33--47, 2004.
ieee: G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic
Networks,” in IWIA, 2004, pp. 33--47.
mla: Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA,
2004, pp. 33--47.
short: 'G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.'
date_created: 2018-04-03T05:33:37Z
date_updated: 2022-01-06T06:54:50Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T11:38:22Z
date_updated: 2018-04-12T11:38:22Z
file_id: '2317'
file_name: IIAW-04.pdf
file_size: 255111
relation: main_file
file_date_updated: 2018-04-12T11:38:22Z
has_accepted_license: '1'
oa: '1'
page: 33--47
publication: IWIA
status: public
title: Survivable Monitoring in Dynamic Networks
type: conference
urn: '21238'
user_id: '15504'
year: '2004'
...
---
_id: '2124'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. The hyperring: a low-congestion deterministic data
structure for distributed environments. In: SODA. ; 2004:318--327.'
apa: 'Awerbuch, B., & Scheideler, C. (2004). The hyperring: a low-congestion
deterministic data structure for distributed environments. In SODA (pp.
318--327).'
bibtex: '@inproceedings{Awerbuch_Scheideler_2004, title={The hyperring: a low-congestion
deterministic data structure for distributed environments}, booktitle={SODA},
author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={318--327}
}'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion
Deterministic Data Structure for Distributed Environments.” In SODA, 318--327,
2004.'
ieee: 'B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic
data structure for distributed environments,” in SODA, 2004, pp. 318--327.'
mla: 'Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion
Deterministic Data Structure for Distributed Environments.” SODA, 2004,
pp. 318--327.'
short: 'B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.'
date_created: 2018-04-03T05:34:17Z
date_updated: 2022-01-06T06:54:51Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:36:08Z
date_updated: 2018-04-13T08:36:08Z
file_id: '2323'
file_name: SODA-04.pdf
file_size: 193831
relation: main_file
file_date_updated: 2018-04-13T08:36:08Z
has_accepted_license: '1'
oa: '1'
page: 318--327
publication: SODA
status: public
title: 'The hyperring: a low-congestion deterministic data structure for distributed
environments'
type: conference
urn: '21247'
user_id: '15504'
year: '2004'
...
---
_id: '2125'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. Consistent and compact data management in distributed
storage systems. In: SPAA. ; 2004:44--53.'
apa: Awerbuch, B., & Scheideler, C. (2004). Consistent and compact data management
in distributed storage systems. In SPAA (pp. 44--53).
bibtex: '@inproceedings{Awerbuch_Scheideler_2004, title={Consistent and compact
data management in distributed storage systems}, booktitle={SPAA}, author={Awerbuch,
Baruch and Scheideler, Christian}, year={2004}, pages={44--53} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data
Management in Distributed Storage Systems.” In SPAA, 44--53, 2004.
ieee: B. Awerbuch and C. Scheideler, “Consistent and compact data management in
distributed storage systems,” in SPAA, 2004, pp. 44--53.
mla: Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management
in Distributed Storage Systems.” SPAA, 2004, pp. 44--53.
short: 'B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.'
date_created: 2018-04-03T05:34:56Z
date_updated: 2022-01-06T06:54:51Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:41:38Z
date_updated: 2018-04-12T09:41:38Z
file_id: '2315'
file_name: AS-SPAA-04.pdf
file_size: 170429
relation: main_file
file_date_updated: 2018-04-12T09:41:38Z
has_accepted_license: '1'
oa: '1'
page: 44--53
publication: SPAA
status: public
title: Consistent and compact data management in distributed storage systems
type: conference
urn: '21256'
user_id: '15504'
year: '2004'
...
---
_id: '2126'
author:
- first_name: Ankur
full_name: Bhargava, Ankur
last_name: Bhargava
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Chris
full_name: Riley, Chris
last_name: Riley
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Mark
full_name: Thober, Mark
last_name: Thober
citation:
ama: 'Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic
overlay network for routing, data management, and multicasting. In: SPAA.
; 2004:170--179.'
apa: 'Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., & Thober, M.
(2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting.
In SPAA (pp. 170--179).'
bibtex: '@inproceedings{Bhargava_Kothapalli_Riley_Scheideler_Thober_2004, title={Pagoda:
a dynamic overlay network for routing, data management, and multicasting}, booktitle={SPAA},
author={Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler,
Christian and Thober, Mark}, year={2004}, pages={170--179} }'
chicago: 'Bhargava, Ankur, Kishore Kothapalli, Chris Riley, Christian Scheideler,
and Mark Thober. “Pagoda: A Dynamic Overlay Network for Routing, Data Management,
and Multicasting.” In SPAA, 170--179, 2004.'
ieee: 'A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda:
a dynamic overlay network for routing, data management, and multicasting,” in
SPAA, 2004, pp. 170--179.'
mla: 'Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data
Management, and Multicasting.” SPAA, 2004, pp. 170--179.'
short: 'A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA,
2004, pp. 170--179.'
date_created: 2018-04-03T05:35:31Z
date_updated: 2022-01-06T06:54:52Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:40:12Z
date_updated: 2018-04-12T09:40:42Z
file_id: '2314'
file_name: BKRST-SPAA-04.pdf
file_size: 118175
relation: main_file
file_date_updated: 2018-04-12T09:40:42Z
has_accepted_license: '1'
oa: '1'
page: 170--179
publication: SPAA
status: public
title: 'Pagoda: a dynamic overlay network for routing, data management, and multicasting'
type: conference
urn: '21266'
user_id: '15504'
year: '2004'
...
---
_id: '2127'
author:
- first_name: Amitabha
full_name: Bagchi, Amitabha
last_name: Bagchi
- first_name: Ankur
full_name: Bhargava, Ankur
last_name: Bhargava
- first_name: Amitabh
full_name: Chaudhary, Amitabh
last_name: Chaudhary
- first_name: David
full_name: Eppstein, David
last_name: Eppstein
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of
faults on network expansion. In: SPAA. ACM; 2004:286--293.'
apa: Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C.
(2004). The effect of faults on network expansion. In SPAA (pp. 286--293).
ACM.
bibtex: '@inproceedings{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2004, title={The
effect of faults on network expansion}, booktitle={SPAA}, publisher={ACM}, author={Bagchi,
Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler,
Christian}, year={2004}, pages={286--293} }'
chicago: Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and
Christian Scheideler. “The Effect of Faults on Network Expansion.” In SPAA,
286--293. ACM, 2004.
ieee: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The
effect of faults on network expansion,” in SPAA, 2004, pp. 286--293.
mla: Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA,
ACM, 2004, pp. 286--293.
short: 'A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA,
ACM, 2004, pp. 286--293.'
date_created: 2018-04-03T05:36:11Z
date_updated: 2022-01-06T06:54:52Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:21:24Z
date_updated: 2018-04-12T09:21:24Z
file_id: '2313'
file_name: BBCES-SPAA-04.pdf
file_size: 197503
relation: main_file
file_date_updated: 2018-04-12T09:21:24Z
has_accepted_license: '1'
oa: '1'
page: 286--293
publication: SPAA
publisher: ACM
status: public
title: The effect of faults on network expansion
type: conference
urn: '21276'
user_id: '15504'
year: '2004'
...
---
_id: '19790'
abstract:
- lang: eng
text: The advances in Internet technology have led to tremendous improvements in
business, education, and science and have changed the way we think, live, and
communicate. Information exchange has become ubiquitous by the possibilities offered
through modern technologies. We are able to offer information 24 hours a day through
our web sites and can leave messages every time and from anywhere in the world.
This change in communication has led to new challenges. Enterprises have to deal
with an information amount that doubles every year. The technological foundation
to cope with this information explosion is given by Storage Area Networks (SANs),
which are able to connect a great number of storage systems over a fast interconnection
network. However, to be able to use the benefits of a SAN, an easy-to-use and
efficient management support has to be given to the storage administrator. In
this paper, we will suggest new storage management concepts and we will introduce
a new management environment that is able to significantly reduce management costs
and increases the performance and resource utilization of the given SAN infrastructure.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Mario
full_name: Vodisek, Mario
last_name: Vodisek
- first_name: Ulrich
full_name: Rückert, Ulrich
last_name: Rückert
citation:
ama: 'Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M,
Rückert U. Storage Management as Means to cope with Exponential Information Growth.
In: Proceedings of SSGRR 2003. ; 2003.'
apa: Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek,
M., & Rückert, U. (2003). Storage Management as Means to cope with Exponential
Information Growth. In Proceedings of SSGRR 2003.
bibtex: '@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003,
title={Storage Management as Means to cope with Exponential Information Growth},
booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel,
Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario
and Rückert, Ulrich}, year={2003} }'
chicago: Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André
Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to
Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003,
2003.
ieee: C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
and U. Rückert, “Storage Management as Means to cope with Exponential Information
Growth,” in Proceedings of SSGRR 2003, 2003.
mla: Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential
Information Growth.” Proceedings of SSGRR 2003, 2003.
short: 'C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
U. Rückert, in: Proceedings of SSGRR 2003, 2003.'
date_created: 2020-09-30T12:04:14Z
date_updated: 2022-01-06T06:54:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '58'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-30T12:03:57Z
date_updated: 2020-09-30T12:03:57Z
file_id: '19793'
file_name: pub-hni-908.pdf
file_size: 499057
relation: main_file
success: 1
file_date_updated: 2020-09-30T12:03:57Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of SSGRR 2003
status: public
title: Storage Management as Means to cope with Exponential Information Growth
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '2128'
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed
Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science.
Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17'
apa: Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler,
C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171).
Springer. https://doi.org/10.1007/978-3-540-39658-1_17
bibtex: '@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003,
series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity},
volume={2832}, DOI={10.1007/978-3-540-39658-1_17},
booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf
der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian},
year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science}
}'
chicago: Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian
Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA,
2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.
ieee: V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler,
“Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.
mla: Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832,
Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.
short: 'V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler,
in: ESA, Springer, 2003, pp. 161--171.'
date_created: 2018-04-03T05:37:10Z
date_updated: 2022-01-06T06:54:52Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-540-39658-1_17
intvolume: ' 2832'
language:
- iso: eng
page: 161--171
publication: ESA
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Smoothed Motion Complexity
type: conference
user_id: '14955'
volume: 2832
year: '2003'
...
---
_id: '2129'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems:
Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer
Science. Springer; 2003:1153--1168.'
apa: 'Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial
Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168).
Springer.'
bibtex: '@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes
in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission
Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch,
Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168},
collection={Lecture Notes in Computer Science} }'
chicago: 'Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting
in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168.
Lecture Notes in Computer Science. Springer, 2003.'
ieee: 'B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial
Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp.
1153--1168.'
mla: 'Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission
Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.'
short: 'B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp.
1153--1168.'
date_created: 2018-04-03T05:38:36Z
date_updated: 2022-01-06T06:54:53Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:04:48Z
date_updated: 2018-04-12T09:04:48Z
file_id: '2307'
file_name: ICALP-03.pdf
file_size: 154427
relation: main_file
file_date_updated: 2018-04-12T09:04:48Z
has_accepted_license: '1'
intvolume: ' 2719'
language:
- iso: eng
oa: '1'
page: 1153--1168
publication: ICALP
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Anycasting in Adversarial Systems: Routing and Admission Control'
type: conference
urn: '21297'
user_id: '14955'
volume: 2719
year: '2003'
...
---
_id: '2130'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: PODC.
ACM; 2003:123--132.'
apa: Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix
search. In PODC (pp. 123--132). ACM.
bibtex: '@inproceedings{Awerbuch_Scheideler_2003, title={Peer-to-peer systems for
prefix search}, booktitle={PODC}, publisher={ACM}, author={Awerbuch, Baruch and
Scheideler, Christian}, year={2003}, pages={123--132} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix
Search.” In PODC, 123--132. ACM, 2003.
ieee: B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in
PODC, 2003, pp. 123--132.
mla: Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix
Search.” PODC, ACM, 2003, pp. 123--132.
short: 'B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.'
date_created: 2018-04-03T05:39:48Z
date_updated: 2022-01-06T06:54:53Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:10:10Z
date_updated: 2018-04-12T09:10:10Z
file_id: '2308'
file_name: PODC-03.pdf
file_size: 127013
relation: main_file
file_date_updated: 2018-04-12T09:10:10Z
has_accepted_license: '1'
oa: '1'
page: 123--132
publication: PODC
publisher: ACM
status: public
title: Peer-to-peer systems for prefix search
type: conference
urn: '21303'
user_id: '15504'
year: '2003'
...
---
_id: '2131'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Chris
full_name: Riley, Chris
last_name: Riley
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: RANDOM-APPROX.
Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.'
apa: Czumaj, A., Riley, C., & Scheideler, C. (2003). Perfectly Balanced Allocation.
In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.
bibtex: '@inproceedings{Czumaj_Riley_Scheideler_2003, series={Lecture Notes in Computer
Science}, title={Perfectly Balanced Allocation}, volume={2764}, booktitle={RANDOM-APPROX},
publisher={Springer}, author={Czumaj, Artur and Riley, Chris and Scheideler, Christian},
year={2003}, pages={240--251}, collection={Lecture Notes in Computer Science}
}'
chicago: Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced
Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer
Science. Springer, 2003.
ieee: A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in
RANDOM-APPROX, 2003, vol. 2764, pp. 240--251.
mla: Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX,
vol. 2764, Springer, 2003, pp. 240--251.
short: 'A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp.
240--251.'
date_created: 2018-04-03T05:41:01Z
date_updated: 2022-01-06T06:54:54Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:16:17Z
date_updated: 2018-04-12T09:16:17Z
file_id: '2310'
file_name: RANDOM-03.pdf
file_size: 112587
relation: main_file
file_date_updated: 2018-04-12T09:16:17Z
has_accepted_license: '1'
intvolume: ' 2764'
oa: '1'
page: 240--251
publication: RANDOM-APPROX
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Perfectly Balanced Allocation
type: conference
urn: '21313'
user_id: '15504'
volume: 2764
year: '2003'
...
---
_id: '2132'
author:
- first_name: Lujun
full_name: Jia, Lujun
last_name: Jia
- first_name: Rajmohan
full_name: Rajaraman, Rajmohan
last_name: Rajaraman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Jia L, Rajaraman R, Scheideler C. On local algorithms for topology control
and routing in ad hoc networks. In: SPAA. ACM; 2003:220--229.'
apa: Jia, L., Rajaraman, R., & Scheideler, C. (2003). On local algorithms for
topology control and routing in ad hoc networks. In SPAA (pp. 220--229).
ACM.
bibtex: '@inproceedings{Jia_Rajaraman_Scheideler_2003, title={On local algorithms
for topology control and routing in ad hoc networks}, booktitle={SPAA}, publisher={ACM},
author={Jia, Lujun and Rajaraman, Rajmohan and Scheideler, Christian}, year={2003},
pages={220--229} }'
chicago: Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms
for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229.
ACM, 2003.
ieee: L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology
control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229.
mla: Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in
Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.
short: 'L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.'
date_created: 2018-04-03T05:41:53Z
date_updated: 2022-01-06T06:54:54Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:18:55Z
date_updated: 2018-04-12T09:18:55Z
file_id: '2311'
file_name: JRS-SPAA-03.pdf
file_size: 224200
relation: main_file
file_date_updated: 2018-04-12T09:18:55Z
has_accepted_license: '1'
oa: '1'
page: 220--229
publication: SPAA
publisher: ACM
status: public
title: On local algorithms for topology control and routing in ad hoc networks
type: conference
urn: '21320'
user_id: '15504'
year: '2003'
...
---
_id: '2133'
author:
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kothapalli K, Scheideler C. Information gathering in adversarial systems:
lines and cycles. In: SPAA. ACM; 2003:333--342.'
apa: 'Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial
systems: lines and cycles. In SPAA (pp. 333--342). ACM.'
bibtex: '@inproceedings{Kothapalli_Scheideler_2003, title={Information gathering
in adversarial systems: lines and cycles}, booktitle={SPAA}, publisher={ACM},
author={Kothapalli, Kishore and Scheideler, Christian}, year={2003}, pages={333--342}
}'
chicago: 'Kothapalli, Kishore, and Christian Scheideler. “Information Gathering
in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.'
ieee: 'K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems:
lines and cycles,” in SPAA, 2003, pp. 333--342.'
mla: 'Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial
Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.'
short: 'K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.'
date_created: 2018-04-03T05:42:48Z
date_updated: 2022-01-06T06:54:55Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:13:43Z
date_updated: 2018-04-12T09:15:24Z
file_id: '2309'
file_name: KS-SPAA-03.pdf
file_size: 121448
relation: main_file
file_date_updated: 2018-04-12T09:15:24Z
has_accepted_license: '1'
oa: '1'
page: 333--342
publication: SPAA
publisher: ACM
status: public
title: 'Information gathering in adversarial systems: lines and cycles'
type: conference
urn: '21338'
user_id: '15504'
year: '2003'
...
---
_id: '2134'
author:
- first_name: Uriel
full_name: Feige, Uriel
last_name: Feige
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica.
2002;(3):361--399. doi:10.1007/s004930200018
apa: Feige, U., & Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop
Scheduling. Combinatorica, (3), 361--399. https://doi.org/10.1007/s004930200018
bibtex: '@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job
Shop Scheduling}, DOI={10.1007/s004930200018},
number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian},
year={2002}, pages={361--399} }'
chicago: 'Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job
Shop Scheduling.” Combinatorica, no. 3 (2002): 361--399. https://doi.org/10.1007/s004930200018.'
ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,”
Combinatorica, no. 3, pp. 361--399, 2002.
mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop
Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.
short: U. Feige, C. Scheideler, Combinatorica (2002) 361--399.
date_created: 2018-04-03T05:43:36Z
date_updated: 2022-01-06T06:54:55Z
department:
- _id: '79'
doi: 10.1007/s004930200018
issue: '3'
page: 361--399
publication: Combinatorica
status: public
title: Improved Bounds for Acyclic Job Shop Scheduling
type: journal_article
user_id: '15504'
year: '2002'
...
---
_id: '2135'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem.
In: SODA. ACM/SIAM; 2002:184--193.'
apa: Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable
flow problem. In SODA (pp. 184--193). ACM/SIAM.
bibtex: '@inproceedings{Kolman_Scheideler_2002, title={Improved bounds for the unsplittable
flow problem}, booktitle={SODA}, publisher={ACM/SIAM}, author={Kolman, Petr and
Scheideler, Christian}, year={2002}, pages={184--193} }'
chicago: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.
ieee: P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,”
in SODA, 2002, pp. 184--193.
mla: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193.
short: 'P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.'
date_created: 2018-04-03T05:44:11Z
date_updated: 2022-01-06T06:54:55Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:59:58Z
date_updated: 2018-04-12T08:59:58Z
file_id: '2303'
file_name: SODA-02.pdf
file_size: 246604
relation: main_file
file_date_updated: 2018-04-12T08:59:58Z
has_accepted_license: '1'
oa: '1'
page: 184--193
publication: SODA
publisher: ACM/SIAM
status: public
title: Improved bounds for the unsplittable flow problem
type: conference
urn: '21357'
user_id: '15504'
year: '2002'
...
---
_id: '2136'
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes
for non-uniform requirements. In: SPAA. ; 2002:53--62.'
apa: Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive
placement schemes for non-uniform requirements. In SPAA (pp. 53--62).
bibtex: '@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive
placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann,
André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62}
}'
chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive
Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.
ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement
schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.
mla: Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform
Requirements.” SPAA, 2002, pp. 53--62.
short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.'
date_created: 2018-04-03T05:44:56Z
date_updated: 2022-01-06T06:54:56Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:02:22Z
date_updated: 2018-04-12T09:02:22Z
file_id: '2305'
file_name: BSS-SPAA-02.pdf
file_size: 123373
relation: main_file
file_date_updated: 2018-04-12T09:02:22Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 53--62
publication: SPAA
status: public
title: Compact, adaptive placement schemes for non-uniform requirements
type: conference
urn: '21366'
user_id: '14955'
year: '2002'
...
---
_id: '2137'
author:
- first_name: Amitabha
full_name: Bagchi, Amitabha
last_name: Bagchi
- first_name: Amitabh
full_name: Chaudhary, Amitabh
last_name: Chaudhary
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
citation:
ama: 'Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant
routing in circuit switched networks. In: SPAA. ; 2002:265--274.'
apa: Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2002). Algorithms
for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).
bibtex: '@inproceedings{Bagchi_Chaudhary_Scheideler_Kolman_2002, title={Algorithms
for fault-tolerant routing in circuit switched networks}, booktitle={SPAA}, author={Bagchi,
Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2002},
pages={265--274} }'
chicago: Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman.
“Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA,
265--274, 2002.
ieee: A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant
routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.
mla: Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit
Switched Networks.” SPAA, 2002, pp. 265--274.
short: 'A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.'
date_created: 2018-04-03T05:45:44Z
date_updated: 2022-01-06T06:54:57Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:03:44Z
date_updated: 2018-04-12T09:03:44Z
file_id: '2306'
file_name: BCKS-SPAA-02.pdf
file_size: 187124
relation: main_file
file_date_updated: 2018-04-12T09:03:44Z
has_accepted_license: '1'
oa: '1'
page: 265--274
publication: SPAA
status: public
title: Algorithms for fault-tolerant routing in circuit switched networks
type: conference
urn: '21376'
user_id: '15504'
year: '2002'
...
---
_id: '2138'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Models and Techniques for Communication in Dynamic Networks.
In: STACS. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.'
apa: Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks.
In STACS (Vol. 2285, pp. 27--49). Springer.
bibtex: '@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science},
title={Models and Techniques for Communication in Dynamic Networks}, volume={2285},
booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002},
pages={27--49}, collection={Lecture Notes in Computer Science} }'
chicago: Scheideler, Christian. “Models and Techniques for Communication in Dynamic
Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer,
2002.
ieee: C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,”
in STACS, 2002, vol. 2285, pp. 27--49.
mla: Scheideler, Christian. “Models and Techniques for Communication in Dynamic
Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.
short: 'C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.'
date_created: 2018-04-03T05:46:38Z
date_updated: 2022-01-06T06:54:57Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:01:03Z
date_updated: 2018-04-12T09:01:03Z
file_id: '2304'
file_name: STACS-02.pdf
file_size: 273875
relation: main_file
file_date_updated: 2018-04-12T09:01:03Z
has_accepted_license: '1'
intvolume: ' 2285'
oa: '1'
page: 27--49
publication: STACS
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Models and Techniques for Communication in Dynamic Networks
type: conference
urn: '21386'
user_id: '15504'
volume: 2285
year: '2002'
...
---
_id: '2139'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers:
Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138.
doi:10.1007/s004930170007'
apa: 'Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica,
21(1), 95--138. https://doi.org/10.1007/s004930170007'
bibtex: '@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1},
journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler,
Christian}, year={2001}, pages={95--138} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic
Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica
21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.'
ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded
Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21,
no. 1, pp. 95--138, 2001.'
mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica,
vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.'
short: F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
date_created: 2018-04-03T05:47:20Z
date_updated: 2022-01-06T06:54:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s004930170007
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 95--138
publication: Combinatorica
status: public
title: 'Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols'
type: journal_article
user_id: '14955'
volume: 21
year: '2001'
...
---
_id: '2140'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies
for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.'
apa: Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple
Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE
Computer Society.
bibtex: '@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple
Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE
Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann,
André and Scheideler, Christian}, year={2001}, pages={158--167} }'
chicago: Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler.
“Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167.
IEEE Computer Society, 2001.
ieee: B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing
Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.
mla: Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.”
FOCS, IEEE Computer Society, 2001, pp. 158--167.
short: 'B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE
Computer Society, 2001, pp. 158--167.'
date_created: 2018-04-03T05:48:28Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:59:00Z
date_updated: 2018-04-12T08:59:00Z
file_id: '2302'
file_name: FOCS-01.pdf
file_size: 151156
relation: main_file
file_date_updated: 2018-04-12T08:59:00Z
has_accepted_license: '1'
oa: '1'
page: 158--167
publication: FOCS
publisher: IEEE Computer Society
status: public
title: Simple Routing Strategies for Adversarial Systems
type: conference
urn: '21406'
user_id: '15504'
year: '2001'
...
---
_id: '2141'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for
Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.'
apa: Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation
Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer
Society.
bibtex: '@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation
Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer
Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian},
year={2001}, pages={227--234} }'
chicago: Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A
Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE
Computer Society, 2001.
ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment
for Storage Area Networks,” in PDP, 2001, pp. 227--234.
mla: Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area
Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.
short: 'P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society,
2001, pp. 227--234.'
date_created: 2018-04-03T05:49:21Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:39:01Z
date_updated: 2018-04-12T08:39:01Z
file_id: '2298'
file_name: PDP-00.pdf
file_size: 85778
relation: main_file
file_date_updated: 2018-04-12T08:39:01Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 227--234
publication: PDP
publisher: IEEE Computer Society
status: public
title: SIMLAB-A Simulation Environment for Storage Area Networks
type: conference
urn: '21415'
user_id: '14955'
year: '2001'
...
---
_id: '2142'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint
paths problem. In: SPAA. ; 2001:38--47.'
apa: Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the
maximum disjoint paths problem. In SPAA (pp. 38--47).
bibtex: '@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms
for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr
and Scheideler, Christian}, year={2001}, pages={38--47} }'
chicago: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for
the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.
ieee: P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint
paths problem,” in SPAA, 2001, pp. 38--47.
mla: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.
short: 'P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.'
date_created: 2018-04-03T05:50:16Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:58:07Z
date_updated: 2018-04-12T08:58:07Z
file_id: '2301'
file_name: SPAA-01.pdf
file_size: 335171
relation: main_file
file_date_updated: 2018-04-12T08:58:07Z
has_accepted_license: '1'
oa: '1'
page: 38--47
publication: SPAA
status: public
title: Simple on-line algorithms for the maximum disjoint paths problem
type: conference
urn: '21421'
user_id: '15504'
year: '2001'
...
---
_id: '2143'
author:
- first_name: Micah
full_name: Adler, Micah
last_name: Adler
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless
Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006
apa: Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies
for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391.
https://doi.org/10.1007/s002240010006
bibtex: '@article{Adler_Scheideler_2000, title={Efficient Communication Strategies
for Ad Hoc Wireless Networks}, volume={33}, DOI={10.1007/s002240010006},
number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler,
Christian}, year={2000}, pages={337--391} }'
chicago: 'Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000):
337--391. https://doi.org/10.1007/s002240010006.'
ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc
Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391,
2000.
mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6,
2000, pp. 337--391, doi:10.1007/s002240010006.
short: M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
date_created: 2018-04-03T05:51:02Z
date_updated: 2022-01-06T06:54:59Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240010006
intvolume: ' 33'
issue: 5/6
language:
- iso: eng
page: 337--391
publication: Theory Comput. Syst.
status: public
title: Efficient Communication Strategies for Ad Hoc Wireless Networks
type: journal_article
user_id: '14955'
volume: 33
year: '2000'
...
---
_id: '2145'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations
of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431'
apa: 'Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput.,
30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431'
bibtex: '@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={10.1137/S0097539799353431},
number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking,
Berthold}, year={2000}, pages={1126--1155} }'
chicago: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput.
30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.'
ieee: 'C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient
Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol.
30, no. 4, pp. 1126--1155, 2000.'
mla: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput.,
vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.'
short: C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.
date_created: 2018-04-03T06:12:15Z
date_updated: 2022-01-06T06:55:00Z
department:
- _id: '79'
- _id: '63'
doi: 10.1137/S0097539799353431
intvolume: ' 30'
issue: '4'
language:
- iso: eng
page: 1126--1155
publication: SIAM J. Comput.
status: public
title: 'From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward
Protocols'
type: journal_article
user_id: '14955'
volume: 30
year: '2000'
...
---
_id: '2146'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage
Networks. In: PDPTA. ; 2000.'
apa: Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path
Selection for Storage Networks. In PDPTA.
bibtex: '@inproceedings{Berenbrink_Brinkmann_Scheideler_2000, title={Distributed
Path Selection for Storage Networks}, booktitle={PDPTA}, author={Berenbrink, Petra
and Brinkmann, André and Scheideler, Christian}, year={2000} }'
chicago: Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed
Path Selection for Storage Networks.” In PDPTA, 2000.
ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection
for Storage Networks,” in PDPTA, 2000.
mla: Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.”
PDPTA, 2000.
short: 'P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.'
date_created: 2018-04-03T06:13:07Z
date_updated: 2022-01-06T06:55:00Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:47:50Z
date_updated: 2018-04-12T08:47:50Z
file_id: '2299'
file_name: PDPTA-00.pdf
file_size: 168677
relation: main_file
file_date_updated: 2018-04-12T08:47:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: PDPTA
status: public
title: Distributed Path Selection for Storage Networks
type: conference
urn: '21467'
user_id: '14955'
year: '2000'
...
---
_id: '2147'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic
approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.'
apa: 'Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs:
a new algorithmic approach to the general Lovász local lemma. In SODA (pp.
30--39).'
bibtex: '@inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs:
a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA},
author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39}
}'
chicago: 'Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA,
30--39, 2000.'
ieee: 'A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic
approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.'
mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000,
pp. 30--39.'
short: 'A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.'
date_created: 2018-04-03T06:16:48Z
date_updated: 2022-01-06T06:55:00Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:36:17Z
date_updated: 2018-04-12T08:36:17Z
file_id: '2295'
file_name: SODA-00.pdf
file_size: 185001
relation: main_file
file_date_updated: 2018-04-12T08:36:17Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 30--39
publication: SODA
status: public
title: 'Coloring non-uniform hypergraphs: a new algorithmic approach to the general
Lovász local lemma'
type: conference
urn: '21476'
user_id: '14955'
year: '2000'
...
---
_id: '2148'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic
approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.'
apa: 'Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs:
A new algorithmic approach to the general Lovász local lemma. Random Struct.
Algorithms, 17(3–4), 213--237.'
bibtex: '@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs:
A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4},
journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian},
year={2000}, pages={213--237} }'
chicago: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct.
Algorithms 17, no. 3–4 (2000): 213--237.'
ieee: 'A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic
approach to the general Lovász local lemma,” Random Struct. Algorithms,
vol. 17, no. 3–4, pp. 213--237, 2000.'
mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct.
Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.'
short: A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
date_created: 2018-04-03T06:17:52Z
date_updated: 2022-01-06T06:55:00Z
department:
- _id: '79'
- _id: '63'
intvolume: ' 17'
issue: 3-4
language:
- iso: eng
page: 213--237
publication: Random Struct. Algorithms
status: public
title: 'Coloring nonuniform hypergraphs: A new algorithmic approach to the general
Lovász local lemma'
type: journal_article
user_id: '14955'
volume: 17
year: '2000'
...
---
_id: '2149'
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement
strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.'
apa: Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed
data placement strategies for storage area networks (extended abstract). In SPAA
(pp. 119--128).
bibtex: '@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed
data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA},
author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000},
pages={119--128} }'
chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient,
Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).”
In SPAA, 119--128, 2000.
ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data
placement strategies for storage area networks (extended abstract),” in SPAA,
2000, pp. 119--128.
mla: Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies
for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.
short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.'
date_created: 2018-04-03T06:18:45Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:38:13Z
date_updated: 2018-04-12T08:38:13Z
file_id: '2297'
file_name: spaa_00.pdf
file_size: 222176
relation: main_file
file_date_updated: 2018-04-12T08:38:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 119--128
publication: SPAA
status: public
title: Efficient, distributed data placement strategies for storage area networks
(extended abstract)
type: conference
urn: '21493'
user_id: '14955'
year: '2000'
...
---
_id: '2150'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local
lemma with applications to scheduling and satisfiability problems (extended abstract).
In: STOC. ACM; 2000:38--47.'
apa: Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general
Lovász local lemma with applications to scheduling and satisfiability problems
(extended abstract). In STOC (pp. 38--47). ACM.
bibtex: '@inproceedings{Czumaj_Scheideler_2000, title={A new algorithm approach
to the general Lovász local lemma with applications to scheduling and satisfiability
problems (extended abstract)}, booktitle={STOC}, publisher={ACM}, author={Czumaj,
Artur and Scheideler, Christian}, year={2000}, pages={38--47} }'
chicago: Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the
General Lovász Local Lemma with Applications to Scheduling and Satisfiability
Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.
ieee: A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász
local lemma with applications to scheduling and satisfiability problems (extended
abstract),” in STOC, 2000, pp. 38--47.
mla: Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General
Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems
(Extended Abstract).” STOC, ACM, 2000, pp. 38--47.
short: 'A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.'
date_created: 2018-04-03T06:21:11Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:49:23Z
date_updated: 2018-04-12T08:49:23Z
file_id: '2300'
file_name: STOC-00.pdf
file_size: 190083
relation: main_file
file_date_updated: 2018-04-12T08:49:23Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 38--47
publication: STOC
publisher: ACM
status: public
title: A new algorithm approach to the general Lovász local lemma with applications
to scheduling and satisfiability problems (extended abstract)
type: conference
urn: '21509'
user_id: '14955'
year: '2000'
...
---
_id: '2211'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local
Lemma with Applications to Scheduling and Satisfiability Problems . In: 32nd
ACM Symposium on Theory of Computing. ; 2000:38-47.'
apa: Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the
General Lovász Local Lemma with Applications to Scheduling and Satisfiability
Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47).
bibtex: '@inproceedings{Czumaj_Scheideler_2000, title={A New Algorithmic Approach
to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability
Problems }, booktitle={32nd ACM Symposium on Theory of Computing}, author={Czumaj,
Artur and Scheideler, Christian}, year={2000}, pages={38–47} }'
chicago: Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to
the General Lovász Local Lemma with Applications to Scheduling and Satisfiability
Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000.
ieee: A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász
Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in
32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
mla: Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the
General Lovász Local Lemma with Applications to Scheduling and Satisfiability
Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
short: 'A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing,
2000, pp. 38–47.'
date_created: 2018-04-05T07:02:46Z
date_updated: 2022-01-06T06:55:26Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:37:23Z
date_updated: 2018-04-12T08:37:23Z
file_id: '2296'
file_name: STOC-00.pdf
file_size: 190083
relation: main_file
file_date_updated: 2018-04-12T08:37:23Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 38-47
publication: 32nd ACM Symposium on Theory of Computing
status: public
title: 'A New Algorithmic Approach to the General Lovász Local Lemma with Applications
to Scheduling and Satisfiability Problems '
type: conference
urn: '22111'
user_id: '14955'
year: '2000'
...
---
_id: '2151'
author:
- first_name: Michele
full_name: Flammini, Michele
last_name: Flammini
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical
Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123
apa: Flammini, M., & Scheideler, C. (1999). Simple, Efficient Routing Schemes
for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420.
https://doi.org/10.1007/s002240000123
bibtex: '@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes
for All-Optical Networks}, volume={32}, DOI={10.1007/s002240000123},
number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler,
Christian}, year={1999}, pages={387--420} }'
chicago: 'Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing
Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999):
387--420. https://doi.org/10.1007/s002240000123.'
ieee: M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical
Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.
mla: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes
for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999,
pp. 387--420, doi:10.1007/s002240000123.
short: M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
date_created: 2018-04-03T06:22:14Z
date_updated: 2022-01-06T06:55:02Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240000123
intvolume: ' 32'
issue: '3'
language:
- iso: eng
page: 387--420
publication: Theory Comput. Syst.
status: public
title: Simple, Efficient Routing Schemes for All-Optical Networks
type: journal_article
user_id: '14955'
volume: 32
year: '1999'
...
---
_id: '2164'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing
Packets Along Fixed Paths. In: SODA. ; 1999:112--121.'
apa: Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies
for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).
bibtex: '@inproceedings{Berenbrink_Scheideler_1999, title={Locally Efficient On-Line
Strategies for Routing Packets Along Fixed Paths}, booktitle={SODA}, author={Berenbrink,
Petra and Scheideler, Christian}, year={1999}, pages={112--121} }'
chicago: Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line
Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
ieee: P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for
Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.
mla: Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies
for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.
short: 'P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.'
date_created: 2018-04-03T08:56:06Z
date_updated: 2022-01-06T06:55:09Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:34:50Z
date_updated: 2018-04-12T07:34:50Z
file_id: '2288'
file_name: SODA-99.pdf
file_size: 179058
relation: main_file
file_date_updated: 2018-04-12T07:34:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 112--121
publication: SODA
status: public
title: Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
type: conference
urn: '21649'
user_id: '14955'
year: '1999'
...
---
_id: '2165'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Marco
full_name: Riedel, Marco
last_name: Riedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling
Strategies. In: SPAA. ; 1999:33--42.'
apa: Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive
Request Scheduling Strategies. In SPAA (pp. 33--42).
bibtex: '@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Simple Competitive
Request Scheduling Strategies}, booktitle={SPAA}, author={Berenbrink, Petra and
Riedel, Marco and Scheideler, Christian}, year={1999}, pages={33--42} }'
chicago: Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive
Request Scheduling Strategies.” In SPAA, 33--42, 1999.
ieee: P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling
Strategies,” in SPAA, 1999, pp. 33--42.
mla: Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.”
SPAA, 1999, pp. 33--42.
short: 'P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.'
date_created: 2018-04-03T08:56:45Z
date_updated: 2022-01-06T06:55:09Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:36:27Z
date_updated: 2018-04-12T07:36:27Z
file_id: '2290'
file_name: SPAA-99.pdf
file_size: 144422
relation: main_file
file_date_updated: 2018-04-12T07:36:27Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 33--42
publication: SPAA
status: public
title: Simple Competitive Request Scheduling Strategies
type: conference
urn: '21658'
user_id: '14955'
year: '1999'
...
---
_id: '2210'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Marco
full_name: Riedel, Marco
last_name: Riedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage
Network (Extended Abstract). In: International Workshop on Communication and
Data Management in Large Networks (CDMLarge). ; 1999:2-12.'
apa: Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO
Multimedia Storage Network (Extended Abstract). In International Workshop on
Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).
bibtex: '@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Design of the
PRESTO Multimedia Storage Network (Extended Abstract)}, booktitle={International
Workshop on Communication and Data Management in Large Networks (CDMLarge)}, author={Berenbrink,
Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={2–12}
}'
chicago: Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the
PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop
on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.
ieee: P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia
Storage Network (Extended Abstract),” in International Workshop on Communication
and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
mla: Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network
(Extended Abstract).” International Workshop on Communication and Data Management
in Large Networks (CDMLarge), 1999, pp. 2–12.
short: 'P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication
and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.'
date_created: 2018-04-05T07:00:11Z
date_updated: 2022-01-06T06:55:26Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:34:00Z
date_updated: 2018-04-12T08:34:00Z
file_id: '2294'
file_name: CDMLarge-99.pdf
file_size: 211926
relation: main_file
file_date_updated: 2018-04-12T08:34:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 2-12
publication: International Workshop on Communication and Data Management in Large
Networks (CDMLarge)
status: public
title: Design of the PRESTO Multimedia Storage Network (Extended Abstract)
type: conference
urn: '22109'
user_id: '14955'
year: '1999'
...
---
_id: '2166'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations
of Store-and-Forward Protocols. In: STOC. ; 1999:215--224.'
apa: 'Scheideler, C., & Vöcking, B. (1999). From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols. In STOC (pp.
215--224).'
bibtex: '@inproceedings{Scheideler_Vöcking_1999, title={From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols}, booktitle={STOC}, author={Scheideler,
Christian and Vöcking, Berthold}, year={1999}, pages={215--224} }'
chicago: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224,
1999.'
ieee: 'C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient
Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.'
mla: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999,
pp. 215--224.'
short: 'C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.'
date_created: 2018-04-03T08:57:30Z
date_updated: 2022-01-06T06:55:10Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:35:46Z
date_updated: 2018-04-12T07:35:46Z
file_id: '2289'
file_name: STOC-99.pdf
file_size: 227305
relation: main_file
file_date_updated: 2018-04-12T07:35:46Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 215--224
publication: STOC
status: public
title: 'From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward
Protocols'
type: conference
urn: '21668'
user_id: '14955'
year: '1999'
...
---
_id: '2168'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory
Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096
apa: Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies.
Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096
bibtex: '@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies},
volume={31}, DOI={10.1007/s002240000096},
number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and
Vöcking, Berthold}, year={1998}, pages={425--449} }'
chicago: 'Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.'
ieee: C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory
Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.
mla: Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
Strategies.” Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449,
doi:10.1007/s002240000096.
short: C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
date_created: 2018-04-03T08:59:06Z
date_updated: 2022-01-06T06:55:10Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240000096
intvolume: ' 31'
issue: '4'
language:
- iso: eng
page: 425--449
publication: Theory Comput. Syst.
status: public
title: Universal Continuous Routing Strategies
type: journal_article
user_id: '14955'
volume: 31
year: '1998'
...
---
_id: '2169'
author:
- first_name: Micah
full_name: Adler, Micah
last_name: Adler
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless
Networks (Extended Abstract). In: SPAA. ; 1998:259--268.'
apa: Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).
bibtex: '@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler,
Micah and Scheideler, Christian}, year={1998}, pages={259--268} }'
chicago: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.
ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc
Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.
mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.
short: 'M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.'
date_created: 2018-04-03T08:59:55Z
date_updated: 2022-01-06T06:55:10Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:08:12Z
date_updated: 2018-04-12T07:08:12Z
file_id: '2285'
file_name: SPAA98.pdf
file_size: 492778
relation: main_file
file_date_updated: 2018-04-12T07:08:12Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 259--268
publication: SPAA
status: public
title: Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
type: conference
urn: '21699'
user_id: '14955'
year: '1998'
...
---
_id: '2170'
author:
- first_name: Uriel
full_name: Feige, Uriel
last_name: Feige
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended
Abstract). In: STOC. ; 1998:624--633.'
apa: Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop
Scheduling (Extended Abstract). In STOC (pp. 624--633).
bibtex: '@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic
Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel
and Scheideler, Christian}, year={1998}, pages={624--633} }'
chicago: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job
Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.
ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling
(Extended Abstract),” in STOC, 1998, pp. 624--633.
mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop
Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.
short: 'U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.'
date_created: 2018-04-03T09:00:31Z
date_updated: 2022-01-06T06:55:11Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:15:50Z
date_updated: 2018-04-12T07:15:50Z
file_id: '2286'
file_name: STOC98.pdf
file_size: 228487
relation: main_file
file_date_updated: 2018-04-12T07:15:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 624--633
publication: STOC
status: public
title: Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
type: conference
urn: '21705'
user_id: '14955'
year: '1998'
...