---
_id: '3000'
author:
- first_name: Jonas
full_name: Schrieb, Jonas
last_name: Schrieb
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Schrieb J, Wehrheim H, Wonisch D. Three-Valued Spotlight Abstractions. In:
FM 2009: Formal Methods. Berlin, Heidelberg: Springer Berlin Heidelberg;
2009:106-122. doi:10.1007/978-3-642-05089-3_8'
apa: 'Schrieb, J., Wehrheim, H., & Wonisch, D. (2009). Three-Valued Spotlight
Abstractions. In FM 2009: Formal Methods (pp. 106–122). Berlin, Heidelberg:
Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-05089-3_8'
bibtex: '@inbook{Schrieb_Wehrheim_Wonisch_2009, place={Berlin, Heidelberg}, title={Three-Valued
Spotlight Abstractions}, DOI={10.1007/978-3-642-05089-3_8},
booktitle={FM 2009: Formal Methods}, publisher={Springer Berlin Heidelberg}, author={Schrieb,
Jonas and Wehrheim, Heike and Wonisch, Daniel}, year={2009}, pages={106–122} }'
chicago: 'Schrieb, Jonas, Heike Wehrheim, and Daniel Wonisch. “Three-Valued Spotlight
Abstractions.” In FM 2009: Formal Methods, 106–22. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2009. https://doi.org/10.1007/978-3-642-05089-3_8.'
ieee: 'J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,”
in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg,
2009, pp. 106–122.'
mla: 'Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.” FM 2009:
Formal Methods, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:10.1007/978-3-642-05089-3_8.'
short: 'J. Schrieb, H. Wehrheim, D. Wonisch, in: FM 2009: Formal Methods, Springer
Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 106–122.'
date_created: 2018-06-05T08:09:11Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-642-05089-3_8
page: 106-122
place: Berlin, Heidelberg
publication: 'FM 2009: Formal Methods'
publication_identifier:
isbn:
- '9783642050886'
- '9783642050893'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Three-Valued Spotlight Abstractions
type: book_chapter
user_id: '25078'
year: '2009'
...
---
_id: '3142'
author:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Jörg
full_name: Schwenk, Jörg
last_name: Schwenk
citation:
ama: 'Jager T, Schwenk J. On the Analysis of Cryptographic Assumptions in the Generic
Ring Model. In: Advances in Cryptology - ASIACRYPT 2009, 15th International
Conference on the Theory and Application of Cryptology and Information Security,
Tokyo, Japan, December 6-10, 2009. Proceedings. ; 2009:399--416. doi:10.1007/978-3-642-10366-7_24'
apa: Jager, T., & Schwenk, J. (2009). On the Analysis of Cryptographic Assumptions
in the Generic Ring Model. In Advances in Cryptology - ASIACRYPT 2009, 15th
International Conference on the Theory and Application of Cryptology and Information
Security, Tokyo, Japan, December 6-10, 2009. Proceedings (pp. 399--416). https://doi.org/10.1007/978-3-642-10366-7_24
bibtex: '@inproceedings{Jager_Schwenk_2009, title={On the Analysis of Cryptographic
Assumptions in the Generic Ring Model}, DOI={10.1007/978-3-642-10366-7_24},
booktitle={Advances in Cryptology - ASIACRYPT 2009, 15th International Conference
on the Theory and Application of Cryptology and Information Security, Tokyo, Japan,
December 6-10, 2009. Proceedings}, author={Jager, Tibor and Schwenk, Jörg}, year={2009},
pages={399--416} }'
chicago: Jager, Tibor, and Jörg Schwenk. “On the Analysis of Cryptographic Assumptions
in the Generic Ring Model.” In Advances in Cryptology - ASIACRYPT 2009, 15th
International Conference on the Theory and Application of Cryptology and Information
Security, Tokyo, Japan, December 6-10, 2009. Proceedings, 399--416, 2009.
https://doi.org/10.1007/978-3-642-10366-7_24.
ieee: T. Jager and J. Schwenk, “On the Analysis of Cryptographic Assumptions in
the Generic Ring Model,” in Advances in Cryptology - ASIACRYPT 2009, 15th International
Conference on the Theory and Application of Cryptology and Information Security,
Tokyo, Japan, December 6-10, 2009. Proceedings, 2009, pp. 399--416.
mla: Jager, Tibor, and Jörg Schwenk. “On the Analysis of Cryptographic Assumptions
in the Generic Ring Model.” Advances in Cryptology - ASIACRYPT 2009, 15th International
Conference on the Theory and Application of Cryptology and Information Security,
Tokyo, Japan, December 6-10, 2009. Proceedings, 2009, pp. 399--416, doi:10.1007/978-3-642-10366-7_24.
short: 'T. Jager, J. Schwenk, in: Advances in Cryptology - ASIACRYPT 2009, 15th
International Conference on the Theory and Application of Cryptology and Information
Security, Tokyo, Japan, December 6-10, 2009. Proceedings, 2009, pp. 399--416.'
date_created: 2018-06-07T09:30:18Z
date_updated: 2022-01-06T06:58:58Z
department:
- _id: '558'
doi: 10.1007/978-3-642-10366-7_24
extern: '1'
page: 399--416
publication: Advances in Cryptology - ASIACRYPT 2009, 15th International Conference
on the Theory and Application of Cryptology and Information Security, Tokyo, Japan,
December 6-10, 2009. Proceedings
status: public
title: On the Analysis of Cryptographic Assumptions in the Generic Ring Model
type: conference
user_id: '38235'
year: '2009'
...
---
_id: '20937'
author:
- first_name: Matthias
full_name: Meyer, Matthias
last_name: Meyer
citation:
ama: Meyer M. Musterbasiertes Re-Engineering von Softwaresystemen. Universitaetsbibliothek
Paderborn; 2009.
apa: Meyer, M. (2009). Musterbasiertes Re-Engineering von Softwaresystemen.
Universitaetsbibliothek Paderborn.
bibtex: '@book{Meyer_2009, title={Musterbasiertes Re-Engineering von Softwaresystemen},
publisher={Universitaetsbibliothek Paderborn}, author={Meyer, Matthias}, year={2009}
}'
chicago: Meyer, Matthias. Musterbasiertes Re-Engineering von Softwaresystemen.
Universitaetsbibliothek Paderborn, 2009.
ieee: M. Meyer, Musterbasiertes Re-Engineering von Softwaresystemen. Universitaetsbibliothek
Paderborn, 2009.
mla: Meyer, Matthias. Musterbasiertes Re-Engineering von Softwaresystemen.
Universitaetsbibliothek Paderborn, 2009.
short: M. Meyer, Musterbasiertes Re-Engineering von Softwaresystemen, Universitaetsbibliothek
Paderborn, 2009.
date_created: 2021-01-13T10:02:36Z
date_updated: 2022-01-06T06:54:41Z
department:
- _id: '76'
language:
- iso: eng
main_file_link:
- url: http://ubdok.uni-paderborn.de/servlets/DocumentServlet?id=11678
publisher: Universitaetsbibliothek Paderborn
status: public
title: Musterbasiertes Re-Engineering von Softwaresystemen
type: dissertation
user_id: '5786'
year: '2009'
...
---
_id: '17453'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Franz-Josef
full_name: Rammig, Franz-Josef
last_name: Rammig
citation:
ama: 'Meyer auf der Heide F, Rammig F-J. Self-Organisation and Self-Optimization.
Public Service Review: Science and Technology. 2009;04.'
apa: 'Meyer auf der Heide, F., & Rammig, F.-J. (2009). Self-Organisation and
Self-Optimization. Public Service Review: Science and Technology, 04.'
bibtex: '@article{Meyer auf der Heide_Rammig_2009, title={Self-Organisation and
Self-Optimization}, volume={04}, journal={Public Service Review: Science and Technology},
author={Meyer auf der Heide, Friedhelm and Rammig, Franz-Josef}, year={2009} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation
and Self-Optimization.” Public Service Review: Science and Technology 04
(2009).'
ieee: 'F. Meyer auf der Heide and F.-J. Rammig, “Self-Organisation and Self-Optimization,”
Public Service Review: Science and Technology, vol. 04, 2009.'
mla: 'Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation
and Self-Optimization.” Public Service Review: Science and Technology,
vol. 04, 2009.'
short: 'F. Meyer auf der Heide, F.-J. Rammig, Public Service Review: Science and
Technology 04 (2009).'
date_created: 2020-07-29T13:51:54Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
intvolume: ' 4'
language:
- iso: eng
publication: 'Public Service Review: Science and Technology'
status: public
title: Self-Organisation and Self-Optimization
type: journal_article
user_id: '15415'
volume: '04'
year: '2009'
...
---
_id: '19031'
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
citation:
ama: Briest P. Algorithmische und komplexitätstheoretische Aspekte kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). it
- Information Technology. 2009;51(1):62-65. doi:10.1524/itit.2009.0524
apa: Briest, P. (2009). Algorithmische und komplexitätstheoretische Aspekte kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). It
- Information Technology, 51(1), 62–65. https://doi.org/10.1524/itit.2009.0524
bibtex: '@article{Briest_2009, title={Algorithmische und komplexitätstheoretische
Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial
Pricing Problems)}, volume={51}, DOI={10.1524/itit.2009.0524},
number={1}, journal={it - Information Technology}, author={Briest, Patrick}, year={2009},
pages={62–65} }'
chicago: 'Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte
Kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing
Problems).” It - Information Technology 51, no. 1 (2009): 62–65. https://doi.org/10.1524/itit.2009.0524.'
ieee: P. Briest, “Algorithmische und komplexitätstheoretische Aspekte kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems),” it
- Information Technology, vol. 51, no. 1, pp. 62–65, 2009.
mla: Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte Kombinatorischer
Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).” It
- Information Technology, vol. 51, no. 1, 2009, pp. 62–65, doi:10.1524/itit.2009.0524.
short: P. Briest, It - Information Technology 51 (2009) 62–65.
date_created: 2020-09-04T12:05:57Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1524/itit.2009.0524
intvolume: ' 51'
issue: '1'
language:
- iso: eng
page: 62-65
publication: it - Information Technology
publication_identifier:
issn:
- 1611-2776
publication_status: published
status: public
title: Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung
(Computational Aspects of Combinatorial Pricing Problems)
type: journal_article
user_id: '15415'
volume: 51
year: '2009'
...
---
_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: '2353'
abstract:
- lang: eng
text: 'Wireless Sensor Networks (WSNs) are unique embedded computation systems for
distributed sensing of a dispersed phenomenon. While being a strongly concurrent
distributed system, its embedded aspects with severe resource limitations and
the wireless communication requires a fusion of technologies and methodologies
from very different fields. As WSNs are deployed in remote locations for long-term
unattended operation, assurance of correct functioning of the system is of prime
concern. Thus, the design and development of WSNs requires specialized tools to
allow for testing and debugging the system. To this end, we present a framework
for analyzing and checking WSNs based on collected events during system operation.
It allows for abstracting from the event trace by means of behavioral queries
and uses assertions for checking the accordance of an execution to its specification.
The framework is independent from WSN test platforms, applications and logging
semantics and thus generally applicable for analyzing event logs of WSN test executions. '
author:
- first_name: Matthias
full_name: Woehrle, Matthias
last_name: Woehrle
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Lothar
full_name: Thiele, Lothar
last_name: Thiele
citation:
ama: 'Woehrle M, Plessl C, Thiele L. Rupeas: Ruby Powered Event Analysis DSL.
Computer Engineering and Networks Lab, ETH Zurich; 2009.'
apa: 'Woehrle, M., Plessl, C., & Thiele, L. (2009). Rupeas: Ruby Powered
Event Analysis DSL. Computer Engineering and Networks Lab, ETH Zurich.'
bibtex: '@book{Woehrle_Plessl_Thiele_2009, place={Computer Engineering and Networks
Lab, ETH Zurich}, title={Rupeas: Ruby Powered Event Analysis DSL}, author={Woehrle,
Matthias and Plessl, Christian and Thiele, Lothar}, year={2009} }'
chicago: 'Woehrle, Matthias, Christian Plessl, and Lothar Thiele. Rupeas: Ruby
Powered Event Analysis DSL. Computer Engineering and Networks Lab, ETH Zurich,
2009.'
ieee: 'M. Woehrle, C. Plessl, and L. Thiele, Rupeas: Ruby Powered Event Analysis
DSL. Computer Engineering and Networks Lab, ETH Zurich, 2009.'
mla: 'Woehrle, Matthias, et al. Rupeas: Ruby Powered Event Analysis DSL.
2009.'
short: 'M. Woehrle, C. Plessl, L. Thiele, Rupeas: Ruby Powered Event Analysis DSL,
Computer Engineering and Networks Lab, ETH Zurich, 2009.'
date_created: 2018-04-16T15:09:19Z
date_updated: 2022-01-06T06:55:56Z
department:
- _id: '27'
- _id: '518'
extern: '1'
keyword:
- Rupeas
- DSL
- WSN
- testing
language:
- iso: eng
place: Computer Engineering and Networks Lab, ETH Zurich
report_number: TIK-Report 290
status: public
title: 'Rupeas: Ruby Powered Event Analysis DSL'
type: report
user_id: '16153'
year: '2009'
...
---
_id: '23744'
abstract:
- lang: eng
text: "In a Stackelberg pricing game a leader aims to set prices on a subset of
a given collection of items, such as to maximize her revenue from a follower purchasing
a feasible subset of the items. We focus on the case of computationally bounded
followers who cannot optimize exactly over the range of all feasible subsets,
but apply some publicly known algorithm to determine the set of items to purchase.
This corresponds to general multi-dimensional pricing assuming that consumers
cannot optimize over the full domain of their valuation functions but still aim
to act rationally to the best of their ability.\r\n\r\nWe consider two versions
of this novel type of Stackelberg pricing games. Assuming that items are weighted
objects and the follower seeks to purchase a min-cost selection of objects of
some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate
algorithm, we show how an extension of the known single-price algorithm can be
used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s
revenue maximization problem based on so-called near-uniform price assignments.
We also prove the problem to be strongly NP-hard.\r\n\r\nConsidering the case
that items are subsets of some ground set which the follower seeks to cover (the
Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform
price assignments fail to yield a good approximation guarantee. However, in the
special case of elements with frequency 2 (the Vertex-Cover problem) it turns
out that exact revenue maximization can be done in polynomial-time. This stands
in sharp contrast to the fact that revenue maximization becomes APX-hard already
for elements with frequency 3."
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Martin
full_name: Hoefer, Martin
last_name: Hoefer
- first_name: Luciano
full_name: Gualà, Luciano
last_name: Gualà
- first_name: Carmine
full_name: Ventre, Carmine
last_name: Ventre
citation:
ama: 'Briest P, Hoefer M, Gualà L, Ventre C. On Stackelberg Pricing with Computationally
Bounded Consumers. In: Lecture Notes in Computer Science. Berlin, Heidelberg;
2009. doi:10.1007/978-3-642-10841-9_6'
apa: Briest, P., Hoefer, M., Gualà, L., & Ventre, C. (2009). On Stackelberg
Pricing with Computationally Bounded Consumers. In Lecture Notes in Computer
Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_6
bibtex: '@inbook{Briest_Hoefer_Gualà_Ventre_2009, place={Berlin, Heidelberg}, title={On
Stackelberg Pricing with Computationally Bounded Consumers}, DOI={10.1007/978-3-642-10841-9_6},
booktitle={Lecture Notes in Computer Science}, author={Briest, Patrick and Hoefer,
Martin and Gualà, Luciano and Ventre, Carmine}, year={2009} }'
chicago: Briest, Patrick, Martin Hoefer, Luciano Gualà, and Carmine Ventre. “On
Stackelberg Pricing with Computationally Bounded Consumers.” In Lecture Notes
in Computer Science. Berlin, Heidelberg, 2009. https://doi.org/10.1007/978-3-642-10841-9_6.
ieee: P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with
Computationally Bounded Consumers,” in Lecture Notes in Computer Science,
Berlin, Heidelberg, 2009.
mla: Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded
Consumers.” Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-10841-9_6.
short: 'P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer
Science, Berlin, Heidelberg, 2009.'
date_created: 2021-09-03T10:55:38Z
date_updated: 2022-01-06T06:55:59Z
department:
- _id: '63'
doi: 10.1007/978-3-642-10841-9_6
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: On Stackelberg Pricing with Computationally Bounded Consumers
type: book_chapter
user_id: '15415'
year: '2009'
...
---
_id: '18138'
abstract:
- lang: eng
text: Modern companies are nowadays confronted with an increasing demand of multiple
products, where they need to perform more flexible every day. Cost-intensive decisions
are to be confirmed in short times, in order to minimize risks and secure efficient
production programs as well as material flows. Tools for this digital planning
via simulation methods are one well established possibility to receive decision
support. Nevertheless, the creation of the necessary simulation models is a complicated
and error-prone process, where complexity of modeling, validation and verification
depends on the used tool and its functionalities. This paper presents implemented
concepts for an innovative user support in his tasks of verification and validation
of simulation models during the execution of a simulation run. Time-intensive
procedures like stopping simulation, parameterization and restarting within the
problem analysis are simplified. So the user is able to focus on the real problem
solving task.
author:
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Laroque C, Fischer M, Dangelmaier W. Concepts for Model Verification and Validation
during Simulation Runtime. In: European Simulation and Modelling Conference
(ESM 2009). EUROSIS-ETI; 2009.'
apa: Laroque, C., Fischer, M., & Dangelmaier, W. (2009). Concepts for Model
Verification and Validation during Simulation Runtime. In European Simulation
and Modelling Conference (ESM 2009). EUROSIS-ETI.
bibtex: '@inproceedings{Laroque_Fischer_Dangelmaier_2009, title={Concepts for Model
Verification and Validation during Simulation Runtime}, booktitle={European Simulation
and Modelling Conference (ESM 2009)}, publisher={EUROSIS-ETI}, author={Laroque,
Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2009} }'
chicago: Laroque, Christoph, Matthias Fischer, and Wilhelm Dangelmaier. “Concepts
for Model Verification and Validation during Simulation Runtime.” In European
Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI, 2009.
ieee: C. Laroque, M. Fischer, and W. Dangelmaier, “Concepts for Model Verification
and Validation during Simulation Runtime,” in European Simulation and Modelling
Conference (ESM 2009), 2009.
mla: Laroque, Christoph, et al. “Concepts for Model Verification and Validation
during Simulation Runtime.” European Simulation and Modelling Conference (ESM
2009), EUROSIS-ETI, 2009.
short: 'C. Laroque, M. Fischer, W. Dangelmaier, in: European Simulation and Modelling
Conference (ESM 2009), EUROSIS-ETI, 2009.'
date_created: 2020-08-24T07:28:23Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
publication: European Simulation and Modelling Conference (ESM 2009)
publisher: EUROSIS-ETI
status: public
title: Concepts for Model Verification and Validation during Simulation Runtime
type: conference
user_id: '15415'
year: '2009'
...
---
_id: '1828'
author:
- first_name: Tobias
full_name: Volkhausen, Tobias
last_name: Volkhausen
- first_name: Dereje H.
full_name: Woldegebreal, Dereje H.
last_name: Woldegebreal
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Volkhausen T, Woldegebreal DH, Karl H. Improving Network Coded Cooperation
by Soft Information. In: 2009 6th IEEE Annual Communications Society Conference
on Sensor, Mesh and Ad Hoc Communications and Networks Workshops. IEEE; 2009.
doi:10.1109/sahcnw.2009.5172938'
apa: Volkhausen, T., Woldegebreal, D. H., & Karl, H. (2009). Improving Network
Coded Cooperation by Soft Information. In 2009 6th IEEE Annual Communications
Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops.
IEEE. https://doi.org/10.1109/sahcnw.2009.5172938
bibtex: '@inproceedings{Volkhausen_Woldegebreal_Karl_2009, title={Improving Network
Coded Cooperation by Soft Information}, DOI={10.1109/sahcnw.2009.5172938},
booktitle={2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh
and Ad Hoc Communications and Networks Workshops}, publisher={IEEE}, author={Volkhausen,
Tobias and Woldegebreal, Dereje H. and Karl, Holger}, year={2009} }'
chicago: Volkhausen, Tobias, Dereje H. Woldegebreal, and Holger Karl. “Improving
Network Coded Cooperation by Soft Information.” In 2009 6th IEEE Annual Communications
Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops.
IEEE, 2009. https://doi.org/10.1109/sahcnw.2009.5172938.
ieee: T. Volkhausen, D. H. Woldegebreal, and H. Karl, “Improving Network Coded Cooperation
by Soft Information,” in 2009 6th IEEE Annual Communications Society Conference
on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, 2009.
mla: Volkhausen, Tobias, et al. “Improving Network Coded Cooperation by Soft Information.”
2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and
Ad Hoc Communications and Networks Workshops, IEEE, 2009, doi:10.1109/sahcnw.2009.5172938.
short: 'T. Volkhausen, D.H. Woldegebreal, H. Karl, in: 2009 6th IEEE Annual Communications
Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops,
IEEE, 2009.'
date_created: 2018-03-27T12:25:03Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '75'
doi: 10.1109/sahcnw.2009.5172938
publication: 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh
and Ad Hoc Communications and Networks Workshops
publication_identifier:
isbn:
- '9781424439386'
publication_status: published
publisher: IEEE
status: public
title: Improving Network Coded Cooperation by Soft Information
type: conference
user_id: '15572'
year: '2009'
...
---
_id: '1829'
author:
- first_name: S.
full_name: Valentin, S.
last_name: Valentin
- first_name: D. H.
full_name: Woldegebreal, D. H.
last_name: Woldegebreal
- first_name: T.
full_name: Volkhausen, T.
last_name: Volkhausen
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Valentin S, Woldegebreal DH, Volkhausen T, Karl H. Combining for Cooperative
WLANs - A Reality Check Based on Prototype Measurements. In: 2009 IEEE International
Conference on Communications Workshops. IEEE; 2009. doi:10.1109/iccw.2009.5208050'
apa: Valentin, S., Woldegebreal, D. H., Volkhausen, T., & Karl, H. (2009). Combining
for Cooperative WLANs - A Reality Check Based on Prototype Measurements. In 2009
IEEE International Conference on Communications Workshops. IEEE. https://doi.org/10.1109/iccw.2009.5208050
bibtex: '@inproceedings{Valentin_Woldegebreal_Volkhausen_Karl_2009, title={Combining
for Cooperative WLANs - A Reality Check Based on Prototype Measurements}, DOI={10.1109/iccw.2009.5208050},
booktitle={2009 IEEE International Conference on Communications Workshops}, publisher={IEEE},
author={Valentin, S. and Woldegebreal, D. H. and Volkhausen, T. and Karl, Holger},
year={2009} }'
chicago: Valentin, S., D. H. Woldegebreal, T. Volkhausen, and Holger Karl. “Combining
for Cooperative WLANs - A Reality Check Based on Prototype Measurements.” In 2009
IEEE International Conference on Communications Workshops. IEEE, 2009. https://doi.org/10.1109/iccw.2009.5208050.
ieee: S. Valentin, D. H. Woldegebreal, T. Volkhausen, and H. Karl, “Combining for
Cooperative WLANs - A Reality Check Based on Prototype Measurements,” in 2009
IEEE International Conference on Communications Workshops, 2009.
mla: Valentin, S., et al. “Combining for Cooperative WLANs - A Reality Check Based
on Prototype Measurements.” 2009 IEEE International Conference on Communications
Workshops, IEEE, 2009, doi:10.1109/iccw.2009.5208050.
short: 'S. Valentin, D.H. Woldegebreal, T. Volkhausen, H. Karl, in: 2009 IEEE International
Conference on Communications Workshops, IEEE, 2009.'
date_created: 2018-03-27T12:27:29Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '75'
doi: 10.1109/iccw.2009.5208050
publication: 2009 IEEE International Conference on Communications Workshops
publication_identifier:
isbn:
- '9781424434374'
publication_status: published
publisher: IEEE
status: public
title: Combining for Cooperative WLANs - A Reality Check Based on Prototype Measurements
type: conference
user_id: '15572'
year: '2009'
...
---
_id: '18291'
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Huber, Daniel
last_name: Huber
- first_name: 'Christoph '
full_name: 'Laroque, Christoph '
last_name: Laroque
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Suess T, Fischer M, Huber D, Laroque C, Dangelmaier W. Ein System zur aggregierten
Visualisierung verteilter Materialflusssimulationen. In: Augmented & Virtual
Reality in Der Produktentstehung. Vol 252. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2009:111--126.'
apa: Suess, T., Fischer, M., Huber, D., Laroque, C., & Dangelmaier, W. (2009).
Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen.
In Augmented & Virtual Reality in der Produktentstehung (Vol. 252,
pp. 111--126). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@inbook{Suess_Fischer_Huber_Laroque_Dangelmaier_2009, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Ein System zur aggregierten Visualisierung
verteilter Materialflusssimulationen}, volume={252}, booktitle={Augmented &
Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn}, author={Suess, Tim and Fischer, Matthias
and Huber, Daniel and Laroque, Christoph and Dangelmaier, Wilhelm}, year={2009},
pages={111--126}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Suess, Tim, Matthias Fischer, Daniel Huber, Christoph Laroque, and Wilhelm
Dangelmaier. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.”
In Augmented & Virtual Reality in Der Produktentstehung, 252:111--126.
Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009.
ieee: T. Suess, M. Fischer, D. Huber, C. Laroque, and W. Dangelmaier, “Ein System
zur aggregierten Visualisierung verteilter Materialflusssimulationen,” in Augmented
& Virtual Reality in der Produktentstehung, vol. 252, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.
mla: Suess, Tim, et al. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.”
Augmented & Virtual Reality in Der Produktentstehung, vol. 252, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.
short: 'T. Suess, M. Fischer, D. Huber, C. Laroque, W. Dangelmaier, in: Augmented
& Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 2009, pp. 111--126.'
date_created: 2020-08-25T14:25:41Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 252'
language:
- iso: eng
page: 111--126
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen
type: book_chapter
user_id: '5786'
volume: 252
year: '2009'
...