---
_id: '18910'
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
citation:
ama: Bienkowski M. Page Migration in Dynamic Networks. Vol 282. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2010.
apa: Bienkowski, M. (2010). Page migration in dynamic networks (Vol. 282).
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Bienkowski_2010, series={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, title={Page migration in dynamic networks}, volume={282},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bienkowski,
Marcin}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Bienkowski, Marcin. Page Migration in Dynamic Networks. Vol. 282.
Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
ieee: M. Bienkowski, Page migration in dynamic networks, vol. 282. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
mla: Bienkowski, Marcin. Page Migration in Dynamic Networks. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
short: M. Bienkowski, Page Migration in Dynamic Networks, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
date_created: 2020-09-03T07:52:47Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 282'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-01-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2005010135
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Page migration in dynamic networks
type: dissertation
user_id: '5786'
volume: 282
year: '2010'
...
---
_id: '18927'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
citation:
ama: Dynia M. Collective Graph Exploration. Vol 284. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2010.
apa: Dynia, M. (2010). Collective graph exploration (Vol. 284). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Dynia_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Collective graph exploration}, volume={284}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Dynia, Miroslaw}, year={2010},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Dynia, Miroslaw. Collective Graph Exploration. Vol. 284. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2010.
ieee: M. Dynia, Collective graph exploration, vol. 284. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
mla: Dynia, Miroslaw. Collective Graph Exploration. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
short: M. Dynia, Collective Graph Exploration, Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2010.
date_created: 2020-09-03T10:21:10Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 284'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-03-8
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080225031
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Collective graph exploration
type: dissertation
user_id: '5786'
volume: 284
year: '2010'
...
---
_id: '19011'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
citation:
ama: Degener B, Gehweiler J, Lammersen C. Kinetic Facility Location. Algorithmica.
2010;57(3):562-584. doi:10.1007/s00453-008-9250-7
apa: Degener, B., Gehweiler, J., & Lammersen, C. (2010). Kinetic Facility Location.
Algorithmica, 57(3), 562–584. https://doi.org/10.1007/s00453-008-9250-7
bibtex: '@article{Degener_Gehweiler_Lammersen_2010, title={Kinetic Facility Location},
volume={57}, DOI={10.1007/s00453-008-9250-7},
number={3}, journal={Algorithmica}, author={Degener, Bastian and Gehweiler, Joachim
and Lammersen, Christiane}, year={2010}, pages={562–584} }'
chicago: 'Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “Kinetic
Facility Location.” Algorithmica 57, no. 3 (2010): 562–84. https://doi.org/10.1007/s00453-008-9250-7.'
ieee: B. Degener, J. Gehweiler, and C. Lammersen, “Kinetic Facility Location,” Algorithmica,
vol. 57, no. 3, pp. 562–584, 2010.
mla: Degener, Bastian, et al. “Kinetic Facility Location.” Algorithmica,
vol. 57, no. 3, 2010, pp. 562–84, doi:10.1007/s00453-008-9250-7.
short: B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584.
date_created: 2020-09-04T10:35:36Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/s00453-008-9250-7
intvolume: ' 57'
issue: '3'
language:
- iso: eng
page: 562-584
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
status: public
title: Kinetic Facility Location
type: journal_article
user_id: '15415'
volume: 57
year: '2010'
...
---
_id: '19012'
abstract:
- lang: eng
text: 4. Auflage 2014
author:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
id: '104'
last_name: Eke
- first_name: Alo
full_name: Allkemper, Alo
last_name: Allkemper
citation:
ama: 'Eke NO, Allkemper A. Literaturwissenschaft. 3. überarbeitete und erweiterte
Auflage. München: Fink; 2010.'
apa: 'Eke, N. O., & Allkemper, A. (2010). Literaturwissenschaft (3. überarbeitete
und erweiterte Auflage). München: Fink.'
bibtex: '@book{Eke_Allkemper_2010, place={München}, edition={3. überarbeitete und
erweiterte Auflage}, series={UTB Basics}, title={Literaturwissenschaft}, publisher={Fink},
author={Eke, Norbert Otto and Allkemper, Alo}, year={2010}, collection={UTB Basics}
}'
chicago: 'Eke, Norbert Otto, and Alo Allkemper. Literaturwissenschaft. 3.
überarbeitete und erweiterte Auflage. UTB Basics. München: Fink, 2010.'
ieee: 'N. O. Eke and A. Allkemper, Literaturwissenschaft, 3. überarbeitete
und erweiterte Auflage. München: Fink, 2010.'
mla: Eke, Norbert Otto, and Alo Allkemper. Literaturwissenschaft. 3. überarbeitete
und erweiterte Auflage, Fink, 2010.
short: N.O. Eke, A. Allkemper, Literaturwissenschaft, 3. überarbeitete und erweiterte
Auflage, Fink, München, 2010.
date_created: 2020-09-04T10:39:11Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '465'
edition: 3. überarbeitete und erweiterte Auflage
language:
- iso: ger
place: München
publisher: Fink
series_title: UTB Basics
status: public
title: Literaturwissenschaft
type: book
user_id: '14932'
year: '2010'
...
---
_id: '19013'
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Henning
full_name: Meyerhenke, Henning
last_name: Meyerhenke
citation:
ama: 'Gehweiler J, Meyerhenke H. A distributed diffusive heuristic for clustering
a virtual P2P supercomputer. In: Proceeedings of 24th International Parallel
and Distributed Processing Symposium (IPDPS, HPGC). ; 2010. doi:10.1109/ipdpsw.2010.5470922'
apa: Gehweiler, J., & Meyerhenke, H. (2010). A distributed diffusive heuristic
for clustering a virtual P2P supercomputer. In Proceeedings of 24th International
Parallel and Distributed Processing Symposium (IPDPS, HPGC). https://doi.org/10.1109/ipdpsw.2010.5470922
bibtex: '@inproceedings{Gehweiler_Meyerhenke_2010, title={A distributed diffusive
heuristic for clustering a virtual P2P supercomputer}, DOI={10.1109/ipdpsw.2010.5470922},
booktitle={Proceeedings of 24th International Parallel and Distributed Processing
Symposium (IPDPS, HPGC)}, author={Gehweiler, Joachim and Meyerhenke, Henning},
year={2010} }'
chicago: Gehweiler, Joachim, and Henning Meyerhenke. “A Distributed Diffusive Heuristic
for Clustering a Virtual P2P Supercomputer.” In Proceeedings of 24th International
Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010. https://doi.org/10.1109/ipdpsw.2010.5470922.
ieee: J. Gehweiler and H. Meyerhenke, “A distributed diffusive heuristic for clustering
a virtual P2P supercomputer,” in Proceeedings of 24th International Parallel
and Distributed Processing Symposium (IPDPS, HPGC), 2010.
mla: Gehweiler, Joachim, and Henning Meyerhenke. “A Distributed Diffusive Heuristic
for Clustering a Virtual P2P Supercomputer.” Proceeedings of 24th International
Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010, doi:10.1109/ipdpsw.2010.5470922.
short: 'J. Gehweiler, H. Meyerhenke, in: Proceeedings of 24th International Parallel
and Distributed Processing Symposium (IPDPS, HPGC), 2010.'
date_created: 2020-09-04T10:39:37Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1109/ipdpsw.2010.5470922
language:
- iso: eng
publication: Proceeedings of 24th International Parallel and Distributed Processing
Symposium (IPDPS, HPGC)
publication_identifier:
isbn:
- '9781424465330'
publication_status: published
status: public
title: A distributed diffusive heuristic for clustering a virtual P2P supercomputer
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19016'
abstract:
- lang: eng
text: Load balancing is an important requirement for the efficient execu-tion of
parallel numerical simulations. In particular when the simulation domainchanges
over time, the mapping of computational tasks to processors needs tobe modified accordingly. State-of-the-art libraries for this problem are basedon
graph repartitioning. They have a number of drawbacks, including the opti-mized
metric and the difficulty of parallelizing the popular repartitioning heuris-tic
Kernighan-Lin (KL).Here we further explore the very promising diffusion-based
graph partitioningalgorithm DIBAP (Meyerhenke et al., JPDC 69(9):750–761, 2009)
by adaptingDIBAP to the related problem of load balancing. Experiments with graph se-quences
that imitate adaptive numerical simulations demonstrate the applicabilityand high
quality of DIBAP for load balancing by repartitioning. Compared to thefaster state-of-the-art
repartitioners PARMETIS and parallel JOSTLE, DIBAP’ssolutions have partitions
with significantly fewer external edges and boundarynodes and the resulting average migration volume in the important maximumnorm
is also the best in most cases.We also prove that one of DIBAP’s key components
optimizes a relaxed versionof the minimum edge cut problem. Moreover, we hint
at a distributed algorithmbased on ideas used in DIBAP for clustering a virtual
P2P supercomputer.
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Henning
full_name: Meyerhenke, Henning
last_name: Meyerhenke
citation:
ama: 'Gehweiler J, Meyerhenke H. On Dynamic Graph Partitioning and Graph Clustering
using Diffusion. In: Dagstuhl Seminar Proceedings 10261: Algorithm Engineering.
; 2010.'
apa: 'Gehweiler, J., & Meyerhenke, H. (2010). On Dynamic Graph Partitioning
and Graph Clustering using Diffusion. In Dagstuhl Seminar Proceedings 10261:
Algorithm Engineering.'
bibtex: '@inproceedings{Gehweiler_Meyerhenke_2010, title={On Dynamic Graph Partitioning
and Graph Clustering using Diffusion}, booktitle={Dagstuhl Seminar Proceedings
10261: Algorithm Engineering}, author={Gehweiler, Joachim and Meyerhenke, Henning},
year={2010} }'
chicago: 'Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning
and Graph Clustering Using Diffusion.” In Dagstuhl Seminar Proceedings 10261:
Algorithm Engineering, 2010.'
ieee: 'J. Gehweiler and H. Meyerhenke, “On Dynamic Graph Partitioning and Graph
Clustering using Diffusion,” in Dagstuhl Seminar Proceedings 10261: Algorithm
Engineering, 2010.'
mla: 'Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning
and Graph Clustering Using Diffusion.” Dagstuhl Seminar Proceedings 10261:
Algorithm Engineering, 2010.'
short: 'J. Gehweiler, H. Meyerhenke, in: Dagstuhl Seminar Proceedings 10261: Algorithm
Engineering, 2010.'
date_created: 2020-09-04T10:45:47Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
language:
- iso: eng
publication: 'Dagstuhl Seminar Proceedings 10261: Algorithm Engineering'
related_material:
link:
- relation: confirmation
url: https://drops.dagstuhl.de/opus/volltexte/2010/2798/pdf/10261.MeyerhenkeHenning.Paper.2798.pdf
status: public
title: On Dynamic Graph Partitioning and Graph Clustering using Diffusion
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19018'
author:
- first_name: Michael
full_name: Thies, Michael
last_name: Thies
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
citation:
ama: Thies M, Gehweiler J. Thread Migration and Checkpointing in Java.; 2010.
apa: Thies, M., & Gehweiler, J. (2010). Thread Migration and Checkpointing
in Java.
bibtex: '@book{Thies_Gehweiler_2010, title={Thread Migration and Checkpointing in
Java}, author={Thies, Michael and Gehweiler, Joachim}, year={2010} }'
chicago: Thies, Michael, and Joachim Gehweiler. Thread Migration and Checkpointing
in Java, 2010.
ieee: M. Thies and J. Gehweiler, Thread Migration and Checkpointing in Java.
2010.
mla: Thies, Michael, and Joachim Gehweiler. Thread Migration and Checkpointing
in Java. 2010.
short: M. Thies, J. Gehweiler, Thread Migration and Checkpointing in Java, 2010.
date_created: 2020-09-04T10:54:43Z
date_updated: 2022-01-06T06:53:57Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-04T10:54:26Z
date_updated: 2020-09-04T10:54:26Z
file_id: '19020'
file_name: tr-ri-10-315.pdf
file_size: 240725
relation: main_file
success: 1
file_date_updated: 2020-09-04T10:54:26Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Thread Migration and Checkpointing in Java
type: report
user_id: '15415'
year: '2010'
...
---
_id: '19023'
author:
- first_name: Serge
full_name: Kernbach, Serge
last_name: Kernbach
- first_name: Thomas
full_name: Schmickl, Thomas
last_name: Schmickl
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
- first_name: Jürgen
full_name: Stradner, Jürgen
last_name: Stradner
- first_name: Florian
full_name: Schlachter, Florian
last_name: Schlachter
- first_name: Christopher s. F.
full_name: Schwarzer, Christopher s. F.
last_name: Schwarzer
- first_name: Alan F. T.
full_name: Winfield, Alan F. T.
last_name: Winfield
- first_name: Rene
full_name: Matthias, Rene
last_name: Matthias
citation:
ama: 'Kernbach S, Schmickl T, Hamann H, et al. Adaptive Action Selection Mechanisms
for Evolutionary Multimodular Robotics. In: Artificial Life XII (ALife XII).
MIT Press; 2010:781-788.'
apa: Kernbach, S., Schmickl, T., Hamann, H., Stradner, J., Schlachter, F., Schwarzer,
C. s. F., … Matthias, R. (2010). Adaptive Action Selection Mechanisms for Evolutionary
Multimodular Robotics. In Artificial Life XII (ALife XII) (pp. 781–788).
MIT Press.
bibtex: '@inproceedings{Kernbach_Schmickl_Hamann_Stradner_Schlachter_Schwarzer_Winfield_Matthias_2010,
title={Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics},
booktitle={Artificial Life XII (ALife XII)}, publisher={MIT Press}, author={Kernbach,
Serge and Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Schlachter,
Florian and Schwarzer, Christopher s. F. and Winfield, Alan F. T. and Matthias,
Rene}, year={2010}, pages={781–788} }'
chicago: Kernbach, Serge, Thomas Schmickl, Heiko Hamann, Jürgen Stradner, Florian
Schlachter, Christopher s. F. Schwarzer, Alan F. T. Winfield, and Rene Matthias.
“Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.”
In Artificial Life XII (ALife XII), 781–88. MIT Press, 2010.
ieee: S. Kernbach et al., “Adaptive Action Selection Mechanisms for Evolutionary
Multimodular Robotics,” in Artificial Life XII (ALife XII), 2010, pp. 781–788.
mla: Kernbach, Serge, et al. “Adaptive Action Selection Mechanisms for Evolutionary
Multimodular Robotics.” Artificial Life XII (ALife XII), MIT Press, 2010,
pp. 781–88.
short: 'S. Kernbach, T. Schmickl, H. Hamann, J. Stradner, F. Schlachter, C. s. F.
Schwarzer, A.F.T. Winfield, R. Matthias, in: Artificial Life XII (ALife XII),
MIT Press, 2010, pp. 781–788.'
date_created: 2020-09-04T11:53:40Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
page: 781-788
publication: Artificial Life XII (ALife XII)
publication_status: published
publisher: MIT Press
status: public
title: Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '19027'
author:
- first_name: Eva- Maria
full_name: Seng, Eva- Maria
id: '499'
last_name: Seng
citation:
ama: 'Seng E-M. Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung
der durch Politik, Religion und Krieg verursachten Zäsuren. In: Nerdinger W, ed.
Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und
Ausstellungskatalog, Pinakothek der Moderne. München; 2010:78-95 und 224-232.'
apa: 'Seng, E.-M. (2010). Rekonstruktionen von Kontinuität zwischen 1600 und 1800:
Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren. In W.
Nerdinger (Ed.), Geschichte der Rekonstruktion. Konstruktion der Geschichte.
Publikation und Ausstellungskatalog, Pinakothek der Moderne (pp. 78–95 und
224–232). München.'
bibtex: '@inbook{Seng_2010, place={München}, title={Rekonstruktionen von Kontinuität
zwischen 1600 und 1800: Überbrückung der durch Politik, Religion und Krieg verursachten
Zäsuren}, booktitle={Geschichte der Rekonstruktion. Konstruktion der Geschichte.
Publikation und Ausstellungskatalog, Pinakothek der Moderne}, author={Seng, Eva-
Maria}, editor={Nerdinger, WinfriedEditor}, year={2010}, pages={78–95 und 224–232}
}'
chicago: 'Seng, Eva- Maria. “Rekonstruktionen von Kontinuität zwischen 1600 und
1800: Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren.”
In Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation
und Ausstellungskatalog, Pinakothek der Moderne, edited by Winfried Nerdinger,
78–95 und 224–32. München, 2010.'
ieee: 'E.-M. Seng, “Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung
der durch Politik, Religion und Krieg verursachten Zäsuren,” in Geschichte
der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog,
Pinakothek der Moderne, W. Nerdinger, Ed. München, 2010, pp. 78–95 und 224–232.'
mla: 'Seng, Eva-Maria. “Rekonstruktionen von Kontinuität zwischen 1600 und 1800:
Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren.” Geschichte
der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog,
Pinakothek der Moderne, edited by Winfried Nerdinger, 2010, pp. 78–95 und
224–32.'
short: 'E.-M. Seng, in: W. Nerdinger (Ed.), Geschichte der Rekonstruktion. Konstruktion
der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne, München,
2010, pp. 78–95 und 224–232.'
date_created: 2020-09-04T12:02:15Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '443'
editor:
- first_name: Winfried
full_name: Nerdinger, Winfried
last_name: Nerdinger
language:
- iso: ger
page: 78-95 und 224-232
place: München
publication: Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation
und Ausstellungskatalog, Pinakothek der Moderne
status: public
title: 'Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung der
durch Politik, Religion und Krieg verursachten Zäsuren'
type: book_chapter
user_id: '21240'
year: '2010'
...
---
_id: '19029'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Parinya
full_name: Chalermsook, Parinya
last_name: Chalermsook
- first_name: Sanjeev
full_name: Khanna, Sanjeev
last_name: Khanna
- first_name: Bundit
full_name: Laekhanukit, Bundit
last_name: Laekhanukit
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Briest P, Chalermsook P, Khanna S, Laekhanukit B, Nanongkai D. Improved Hardness
of Approximation for Stackelberg Shortest-Path Pricing. In: Workshop on Internet
and Network Economics (WINE). ; 2010. doi:10.1007/978-3-642-17572-5_37'
apa: Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., & Nanongkai,
D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.
In Workshop on Internet and Network Economics (WINE). https://doi.org/10.1007/978-3-642-17572-5_37
bibtex: '@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved
Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={10.1007/978-3-642-17572-5_37},
booktitle={Workshop on Internet and Network Economics (WINE)}, author={Briest,
Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and
Nanongkai, Danupon}, year={2010} }'
chicago: Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit,
and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path
Pricing.” In Workshop on Internet and Network Economics (WINE), 2010. https://doi.org/10.1007/978-3-642-17572-5_37.
ieee: P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved
Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in Workshop
on Internet and Network Economics (WINE), 2010.
mla: Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg
Shortest-Path Pricing.” Workshop on Internet and Network Economics (WINE),
2010, doi:10.1007/978-3-642-17572-5_37.
short: 'P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in:
Workshop on Internet and Network Economics (WINE), 2010.'
date_created: 2020-09-04T12:01:18Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/978-3-642-17572-5_37
language:
- iso: eng
publication: Workshop on Internet and Network Economics (WINE)
publication_identifier:
isbn:
- '9783642175718'
- '9783642175725'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
type: conference
user_id: '15415'
year: '2010'
...
---
_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: '19032'
alternative_title:
- Artikel
author:
- first_name: Eva- Maria
full_name: Seng, Eva- Maria
id: '499'
last_name: Seng
citation:
ama: Seng E-M. Stadtbaukunst. Enzyklopädie der Neuzeit, Stuttgart. 2010.
apa: Seng, E.-M. (2010). Stadtbaukunst. Enzyklopädie der Neuzeit, Stuttgart.
bibtex: '@article{Seng_2010, title={Stadtbaukunst}, journal={Enzyklopädie der Neuzeit,
Stuttgart}, author={Seng, Eva- Maria}, year={2010} }'
chicago: Seng, Eva- Maria. “Stadtbaukunst.” Enzyklopädie der Neuzeit, Stuttgart,
2010.
ieee: E.-M. Seng, “Stadtbaukunst,” Enzyklopädie der Neuzeit, Stuttgart, 2010.
mla: Seng, Eva-Maria. “Stadtbaukunst.” Enzyklopädie der Neuzeit, Stuttgart,
2010.
short: E.-M. Seng, Enzyklopädie der Neuzeit, Stuttgart (2010).
date_created: 2020-09-04T12:10:05Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '443'
language:
- iso: ger
publication: Enzyklopädie der Neuzeit, Stuttgart
status: public
title: Stadtbaukunst
type: journal_article
user_id: '21240'
year: '2010'
...
---
_id: '19033'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Shuchi
full_name: Chawla, Shuchi
last_name: Chawla
- first_name: Robert
full_name: Kleinberg, Robert
last_name: Kleinberg
- first_name: S. Matthew
full_name: Weinberg, S. Matthew
last_name: Weinberg
citation:
ama: 'Briest P, Chawla S, Kleinberg R, Weinberg SM. Pricing Randomized Allocations.
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms.
; 2010. doi:10.1137/1.9781611973075.49'
apa: Briest, P., Chawla, S., Kleinberg, R., & Weinberg, S. M. (2010). Pricing
Randomized Allocations. In Proceedings of the Twenty-First Annual ACM-SIAM
Symposium on Discrete Algorithms. https://doi.org/10.1137/1.9781611973075.49
bibtex: '@inproceedings{Briest_Chawla_Kleinberg_Weinberg_2010, title={Pricing Randomized
Allocations}, DOI={10.1137/1.9781611973075.49},
booktitle={Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete
Algorithms}, author={Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert
and Weinberg, S. Matthew}, year={2010} }'
chicago: Briest, Patrick, Shuchi Chawla, Robert Kleinberg, and S. Matthew Weinberg.
“Pricing Randomized Allocations.” In Proceedings of the Twenty-First Annual
ACM-SIAM Symposium on Discrete Algorithms, 2010. https://doi.org/10.1137/1.9781611973075.49.
ieee: P. Briest, S. Chawla, R. Kleinberg, and S. M. Weinberg, “Pricing Randomized
Allocations,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium
on Discrete Algorithms, 2010.
mla: Briest, Patrick, et al. “Pricing Randomized Allocations.” Proceedings of
the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010, doi:10.1137/1.9781611973075.49.
short: 'P. Briest, S. Chawla, R. Kleinberg, S.M. Weinberg, in: Proceedings of the
Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.'
date_created: 2020-09-04T12:15:39Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1137/1.9781611973075.49
language:
- iso: eng
publication: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete
Algorithms
publication_identifier:
isbn:
- '9780898717013'
- '9781611973075'
publication_status: published
status: public
title: Pricing Randomized Allocations
type: conference
user_id: '15415'
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: '19041'
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
citation:
ama: Mahlmann P. Peer-to-Peer Networks Based on Random Graphs. Vol 283. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2010.
apa: Mahlmann, P. (2010). Peer-to-peer networks based on random graphs (Vol.
283). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Mahlmann_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Peer-to-peer networks based on random graphs}, volume={283},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mahlmann,
Peter}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Vol.
283. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
ieee: P. Mahlmann, Peer-to-peer networks based on random graphs, vol. 283.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
mla: Mahlmann, Peter. Peer-to-Peer Networks Based on Random Graphs. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
short: P. Mahlmann, Peer-to-Peer Networks Based on Random Graphs, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2010.
date_created: 2020-09-04T14:05:30Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 283'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-02-1
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100421015
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Peer-to-peer networks based on random graphs
type: dissertation
user_id: '5786'
volume: 283
year: '2010'
...
---
_id: '19042'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
citation:
ama: Degener B. Local, Distributed Approximation Algorithms for Geometric Assignment
Problems. Vol 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2010.
apa: Degener, B. (2010). Local, distributed approximation algorithms for geometric
assignment problems (Vol. 278). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.
bibtex: '@book{Degener_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Local, distributed approximation algorithms for geometric assignment
problems}, volume={278}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, author={Degener, Bastian}, year={2010}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric
Assignment Problems. Vol. 278. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
ieee: B. Degener, Local, distributed approximation algorithms for geometric assignment
problems, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2010.
mla: Degener, Bastian. Local, Distributed Approximation Algorithms for Geometric
Assignment Problems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2010.
short: B. Degener, Local, Distributed Approximation Algorithms for Geometric Assignment
Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.
date_created: 2020-09-04T14:08:57Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 278'
language:
- iso: eng
publication_identifier:
isbn:
- '978-3-939350-97-2 '
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100429011
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local, distributed approximation algorithms for geometric assignment problems
type: dissertation
user_id: '5786'
volume: 278
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'
...