---
_id: '17010'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing
Based Shared Memory Simulations. SIAM Journal on Computing. 2000:1703-1739.
doi:10.1137/s009753979529564x
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (2000). Contention Resolution
in Hashing Based Shared Memory Simulations. SIAM Journal on Computing,
1703–1739. https://doi.org/10.1137/s009753979529564x
bibtex: '@article{Czumaj_Meyer auf der Heide_Stemann_2000, title={Contention Resolution
in Hashing Based Shared Memory Simulations}, DOI={10.1137/s009753979529564x},
journal={SIAM Journal on Computing}, author={Czumaj, Artur and Meyer auf der Heide,
Friedhelm and Stemann, Volker}, year={2000}, pages={1703–1739} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Contention
Resolution in Hashing Based Shared Memory Simulations.” SIAM Journal on Computing,
2000, 1703–39. https://doi.org/10.1137/s009753979529564x.
ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution
in Hashing Based Shared Memory Simulations,” SIAM Journal on Computing,
pp. 1703–1739, 2000.
mla: Czumaj, Artur, et al. “Contention Resolution in Hashing Based Shared Memory
Simulations.” SIAM Journal on Computing, 2000, pp. 1703–39, doi:10.1137/s009753979529564x.
short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, SIAM Journal on Computing
(2000) 1703–1739.
date_created: 2020-05-18T13:47:36Z
date_updated: 2022-01-06T06:53:01Z
department:
- _id: '63'
doi: 10.1137/s009753979529564x
language:
- iso: eng
page: 1703-1739
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: Contention Resolution in Hashing Based Shared Memory Simulations
type: journal_article
user_id: '15415'
year: '2000'
...
---
_id: '16345'
article_type: original
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: Meyer auf der Heide F, Wanka R. Von der Hollerith-Maschine zum Parallelrechner
- Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik.
ForschungsForum Paderborn. 2000:112-116.
apa: Meyer auf der Heide, F., & Wanka, R. (2000). Von der Hollerith-Maschine
zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor
für die Informatik. ForschungsForum Paderborn, 112–116.
bibtex: '@article{Meyer auf der Heide_Wanka_2000, title={Von der Hollerith-Maschine
zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor
für die Informatik}, journal={ForschungsForum Paderborn}, author={Meyer auf der
Heide, Friedhelm and Wanka, Rolf}, year={2000}, pages={112–116} }'
chicago: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine
Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor
Für Die Informatik.” ForschungsForum Paderborn, 2000, 112–16.
ieee: F. Meyer auf der Heide and R. Wanka, “Von der Hollerith-Maschine zum Parallelrechner
- Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik,”
ForschungsForum Paderborn, pp. 112–116, 2000.
mla: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine
Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor
Für Die Informatik.” ForschungsForum Paderborn, 2000, pp. 112–16.
short: F. Meyer auf der Heide, R. Wanka, ForschungsForum Paderborn (2000) 112–116.
date_created: 2020-03-24T10:59:27Z
date_updated: 2022-01-06T06:52:49Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-04T13:17:46Z
date_updated: 2020-08-04T13:17:46Z
file_id: '17588'
file_name: FFP-06-2000.pdf
file_size: 477845
relation: main_file
success: 1
file_date_updated: 2020-08-04T13:17:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 112-116
publication: ForschungsForum Paderborn
publication_identifier:
unknown:
- ISBN 978-3-942647-99-1
status: public
title: Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des
Sortierens als Fortschrittsmotor für die Informatik
type: journal_article
user_id: '15415'
year: '2000'
...
---
_id: '19784'
author:
- first_name: Christian
full_name: Scheideler, Christian
last_name: Scheideler
citation:
ama: Scheideler C. Probabilistic Methods for Coordination Problems.; 2000.
apa: Scheideler, C. (2000). Probabilistic Methods for Coordination Problems.
bibtex: '@book{Scheideler_2000, title={Probabilistic Methods for Coordination Problems},
author={Scheideler, Christian}, year={2000} }'
chicago: Scheideler, Christian. Probabilistic Methods for Coordination Problems,
2000.
ieee: C. Scheideler, Probabilistic Methods for Coordination Problems. 2000.
mla: Scheideler, Christian. Probabilistic Methods for Coordination Problems.
2000.
short: C. Scheideler, Probabilistic Methods for Coordination Problems, 2000.
date_created: 2020-09-30T10:05:34Z
date_updated: 2024-07-12T07:00:50Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-77-9
status: public
title: Probabilistic Methods for Coordination Problems
type: habilitation
user_id: '1112'
year: '2000'
...
---
_id: '19732'
abstract:
- lang: eng
text: The Paderborn University BSP (PUB) library is a parallel C library based on
the BSP model. The basic library supports buffered and unbuffered asynchronous
communication between any pair of processors, and a mechanism for synchronizing
the processors in a barrier style. In ad-dition, it provides routines for collective
communication on arbitrary subsets of processors, partition operations, and a
zero-cost synchronization mechanism. Furthermore, some techniques used in its
implementation deviate significantly from the techniques used in other BSP libraries.
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Bernhardus
full_name: Juurlink, Bernhardus
last_name: Juurlink
- first_name: I.
full_name: Von Otte, I.
last_name: Von Otte
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
citation:
ama: 'Bonorden O, Juurlink B, Von Otte I, Rieping I. The Paderborn university BSP
(PUB) library-design, implementation and performance. In: Proceedings 13th
International Parallel Processing Symposium and 10th Symposium on Parallel and
Distributed Processing. ; 1999:99-104. doi:10.1109/ipps.1999.760442'
apa: Bonorden, O., Juurlink, B., Von Otte, I., & Rieping, I. (1999). The Paderborn
university BSP (PUB) library-design, implementation and performance. Proceedings
13th International Parallel Processing Symposium and 10th Symposium on Parallel
and Distributed Processing, 99–104. https://doi.org/10.1109/ipps.1999.760442
bibtex: '@inproceedings{Bonorden_Juurlink_Von Otte_Rieping_1999, title={The Paderborn
university BSP (PUB) library-design, implementation and performance}, DOI={10.1109/ipps.1999.760442},
booktitle={Proceedings 13th International Parallel Processing Symposium and 10th
Symposium on Parallel and Distributed Processing}, author={Bonorden, Olaf and
Juurlink, Bernhardus and Von Otte, I. and Rieping, Ingo}, year={1999}, pages={99–104}
}'
chicago: Bonorden, Olaf, Bernhardus Juurlink, I. Von Otte, and Ingo Rieping. “The
Paderborn University BSP (PUB) Library-Design, Implementation and Performance.”
In Proceedings 13th International Parallel Processing Symposium and 10th Symposium
on Parallel and Distributed Processing, 99–104, 1999. https://doi.org/10.1109/ipps.1999.760442.
ieee: 'O. Bonorden, B. Juurlink, I. Von Otte, and I. Rieping, “The Paderborn university
BSP (PUB) library-design, implementation and performance,” in Proceedings 13th
International Parallel Processing Symposium and 10th Symposium on Parallel and
Distributed Processing, 1999, pp. 99–104, doi: 10.1109/ipps.1999.760442.'
mla: Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library-Design,
Implementation and Performance.” Proceedings 13th International Parallel Processing
Symposium and 10th Symposium on Parallel and Distributed Processing, 1999,
pp. 99–104, doi:10.1109/ipps.1999.760442.
short: 'O. Bonorden, B. Juurlink, I. Von Otte, I. Rieping, in: Proceedings 13th
International Parallel Processing Symposium and 10th Symposium on Parallel and
Distributed Processing, 1999, pp. 99–104.'
date_created: 2020-09-28T12:11:30Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1109/ipps.1999.760442
language:
- iso: eng
page: 99-104
publication: Proceedings 13th International Parallel Processing Symposium and 10th
Symposium on Parallel and Distributed Processing
publication_identifier:
isbn:
- '0769501435'
publication_status: published
status: public
title: The Paderborn university BSP (PUB) library-design, implementation and performance
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '2151'
author:
- first_name: Michele
full_name: Flammini, Michele
last_name: Flammini
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical
Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123
apa: Flammini, M., & Scheideler, C. (1999). Simple, Efficient Routing Schemes
for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420.
https://doi.org/10.1007/s002240000123
bibtex: '@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes
for All-Optical Networks}, volume={32}, DOI={10.1007/s002240000123},
number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler,
Christian}, year={1999}, pages={387--420} }'
chicago: 'Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing
Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999):
387--420. https://doi.org/10.1007/s002240000123.'
ieee: M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical
Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.
mla: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes
for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999,
pp. 387--420, doi:10.1007/s002240000123.
short: M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
date_created: 2018-04-03T06:22:14Z
date_updated: 2022-01-06T06:55:02Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240000123
intvolume: ' 32'
issue: '3'
language:
- iso: eng
page: 387--420
publication: Theory Comput. Syst.
status: public
title: Simple, Efficient Routing Schemes for All-Optical Networks
type: journal_article
user_id: '14955'
volume: 32
year: '1999'
...
---
_id: '2164'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing
Packets Along Fixed Paths. In: SODA. ; 1999:112--121.'
apa: Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies
for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).
bibtex: '@inproceedings{Berenbrink_Scheideler_1999, title={Locally Efficient On-Line
Strategies for Routing Packets Along Fixed Paths}, booktitle={SODA}, author={Berenbrink,
Petra and Scheideler, Christian}, year={1999}, pages={112--121} }'
chicago: Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line
Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
ieee: P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for
Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.
mla: Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies
for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.
short: 'P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.'
date_created: 2018-04-03T08:56:06Z
date_updated: 2022-01-06T06:55:09Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:34:50Z
date_updated: 2018-04-12T07:34:50Z
file_id: '2288'
file_name: SODA-99.pdf
file_size: 179058
relation: main_file
file_date_updated: 2018-04-12T07:34:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 112--121
publication: SODA
status: public
title: Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
type: conference
urn: '21649'
user_id: '14955'
year: '1999'
...
---
_id: '2165'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Marco
full_name: Riedel, Marco
last_name: Riedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling
Strategies. In: SPAA. ; 1999:33--42.'
apa: Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive
Request Scheduling Strategies. In SPAA (pp. 33--42).
bibtex: '@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Simple Competitive
Request Scheduling Strategies}, booktitle={SPAA}, author={Berenbrink, Petra and
Riedel, Marco and Scheideler, Christian}, year={1999}, pages={33--42} }'
chicago: Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive
Request Scheduling Strategies.” In SPAA, 33--42, 1999.
ieee: P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling
Strategies,” in SPAA, 1999, pp. 33--42.
mla: Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.”
SPAA, 1999, pp. 33--42.
short: 'P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.'
date_created: 2018-04-03T08:56:45Z
date_updated: 2022-01-06T06:55:09Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:36:27Z
date_updated: 2018-04-12T07:36:27Z
file_id: '2290'
file_name: SPAA-99.pdf
file_size: 144422
relation: main_file
file_date_updated: 2018-04-12T07:36:27Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 33--42
publication: SPAA
status: public
title: Simple Competitive Request Scheduling Strategies
type: conference
urn: '21658'
user_id: '14955'
year: '1999'
...
---
_id: '17864'
abstract:
- lang: eng
text: "A geometric spanner with vertex set P in Rd is a sparse approximation of
the complete Euclidean graph determined by P. We introduce the notion of partitioned
neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners
treated in literature. Two important parameters characterizing their properties
are the outdegree k in N and the stretch factor f>1 describing the \x93quality\x94
of approximation. PNGs have been throughly investigated with respect to small
values of f. We present in this work results about small values of k. The aim
of minimizing k rather than f arises from two observations:\r\n\r\n* k determines
the amount of space required for storing PNGs.\r\n\r\n* Many algorithms employing
a (previously constructed) spanner have running times depending on its outdegree.\r\n\r\nOur
results include, for fixed dimensions d as well as asymptotically, upper and lower
bounds on this optimal value of k. The upper bounds are shown constructively and
yield efficient algorithms for actually computing the corresponding PNGs even
in degenerate cases.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Tamas
full_name: Lukovszki, Tamas
last_name: Lukovszki
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Fischer M, Lukovszki T, Ziegler M. Partitioned neighborhood spanners of minimal
outdegree. In: Proceedings of the 11th Canadian Conference on Computational
Geometry. Vancouver; 1999.'
apa: Fischer, M., Lukovszki, T., & Ziegler, M. (1999). Partitioned neighborhood
spanners of minimal outdegree. In Proceedings of the 11th Canadian Conference
on Computational Geometry. Vancouver.
bibtex: '@inproceedings{Fischer_Lukovszki_Ziegler_1999, place={Vancouver}, title={Partitioned
neighborhood spanners of minimal outdegree}, booktitle={Proceedings of the 11th
Canadian Conference on Computational Geometry}, author={Fischer, Matthias and
Lukovszki, Tamas and Ziegler, Martin}, year={1999} }'
chicago: Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood
Spanners of Minimal Outdegree.” In Proceedings of the 11th Canadian Conference
on Computational Geometry. Vancouver, 1999.
ieee: M. Fischer, T. Lukovszki, and M. Ziegler, “Partitioned neighborhood spanners
of minimal outdegree,” in Proceedings of the 11th Canadian Conference on Computational
Geometry, 1999.
mla: Fischer, Matthias, et al. “Partitioned Neighborhood Spanners of Minimal Outdegree.”
Proceedings of the 11th Canadian Conference on Computational Geometry,
1999.
short: 'M. Fischer, T. Lukovszki, M. Ziegler, in: Proceedings of the 11th Canadian
Conference on Computational Geometry, Vancouver, 1999.'
date_created: 2020-08-12T13:12:00Z
date_updated: 2022-01-06T06:53:21Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-27T11:14:43Z
date_updated: 2020-08-27T11:14:43Z
file_id: '18438'
file_name: hni-id-729.pdf
file_size: 209419
relation: main_file
success: 1
file_date_updated: 2020-08-27T11:14:43Z
has_accepted_license: '1'
language:
- iso: eng
place: Vancouver
publication: Proceedings of the 11th Canadian Conference on Computational Geometry
related_material:
link:
- relation: confirmation
url: http://www.cccg.ca/proceedings/1999/fp36.pdf
status: public
title: Partitioned neighborhood spanners of minimal outdegree
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '18747'
abstract:
- lang: eng
text: We present a new ( O(n) ) algorithm to compute good orders for the point set
of a Delaunay triangulation of ( n ) points in the plane. Such a good order makes
reconstruction in ( O(n) ) time with a simple algorithm possible. In contrast
to the algorithm of Snoeyink and van Kreveld cite1, which is based on independent
sets, our algorithm uses a breadth first search (BFS) to obtain these orders.
Both approaches construct such orders by repeatedly removing a constant fraction
of vertices from the current triangulation. The advantage of the BFS approach
is that we can give significantly better bounds on the fraction of removed points
in a phase of the algorithm. We can prove that a single phase of our algorithm
removes at least ( frac13 ) of the points, even if we restrict the degree of the
points (at the time they are removed) to 6. We implemented and compared both algorithms.
Our algorithms is slightly faster and achieves about 15% better vertex data compression
when using a simple variable length code to encode the differences between two
consecutive vertices of the given order.
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Sohler C. Fast Reconstruction of Delaunay Triangulations. In: Proceedings
of the 11th Canadian Conference on Computational Geometry ( CCCG’99). ; 1999:136-141.'
apa: Sohler, C. (1999). Fast Reconstruction of Delaunay Triangulations. In Proceedings
of the 11th Canadian Conference on Computational Geometry ( CCCG’99) (pp.
136–141).
bibtex: '@inproceedings{Sohler_1999, title={Fast Reconstruction of Delaunay Triangulations},
booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry
( CCCG’99)}, author={Sohler, Christian}, year={1999}, pages={136–141} }'
chicago: Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” In
Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99),
136–41, 1999.
ieee: C. Sohler, “Fast Reconstruction of Delaunay Triangulations,” in Proceedings
of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999,
pp. 136–141.
mla: Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” Proceedings
of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999,
pp. 136–41.
short: 'C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational
Geometry ( CCCG’99), 1999, pp. 136–141.'
date_created: 2020-09-01T10:43:10Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
language:
- iso: eng
page: 136-141
publication: Proceedings of the 11th Canadian Conference on Computational Geometry
( CCCG'99)
status: public
title: Fast Reconstruction of Delaunay Triangulations
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '18942'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: Lukovszki T. New Results on Geometric Spanners and Their Applications.
Vol 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1999.
apa: Lukovszki, T. (1999). New Results on Geometric Spanners and Their Applications
(Vol. 63). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Lukovszki_1999, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={New Results on Geometric Spanners and Their Applications},
volume={63}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Lukovszki, Tamás}, year={1999}, collection={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn} }'
chicago: Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications.
Vol. 63. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1999.
ieee: T. Lukovszki, New Results on Geometric Spanners and Their Applications,
vol. 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
mla: Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
short: T. Lukovszki, New Results on Geometric Spanners and Their Applications, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1999.
date_created: 2020-09-03T11:41:51Z
date_updated: 2022-01-06T06:53:55Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-22T13:12:09Z
date_updated: 2020-09-22T13:12:09Z
file_id: '19641'
file_name: pub-hni-495.pdf
file_size: 1077329
relation: main_file
success: 1
file_date_updated: 2020-09-22T13:12:09Z
has_accepted_license: '1'
intvolume: ' 63'
language:
- iso: eng
publication_identifier:
isbn:
- '3-931466-62-0 '
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
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: New Results on Geometric Spanners and Their Applications
type: dissertation
user_id: '5786'
volume: 63
year: '1999'
...
---
_id: '18959'
abstract:
- lang: eng
text: We investigate the problem of constructing spanners for a given set of points
that are tolerant for edge/vertex faults. Let S be a set of $n$ points in the
d-dimensional space and let k be an integer number. A k-edge/vertex fault tolerant
spanner for S has the property that after the deletion of k arbitrary edges/vertices
each pair of points in the remaining graph is still connected by a short path.
Recently
it was shown that for each set S of n points there exists a k-edge/vertex fault
tolerant spanner with O(k^2 n) edges which can be constructed in O(n log n + k^2
n) time. Furthermore, it was shown that for each set S of n points there exists
a k-edge/vertex fault tolerant spanner whose degree is bouned by O(c^k+1) for
some constant c.
Our first contribution is a construction of a k-vertex
fault tolerant spanner with O(kn) edges which is a tight bound. The computation
takes O(n log^d-1 n + k n log log n) time. Then we show that the same k-vertex
fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct
a k-vertex fault tolerant spanner with O(k^2 n) edges whose degree is bounded
by O(k^2). Finally, we give a more natural but stronger definition of k-edge fault
tolerance which not necessarily can be satisfied if one allows only simple edges
between the points of S. We investigate the question whether Steiner points help.
We answer this question affirmatively and prove Theta(kn) bounds on the number
of Steiner points and on the number of edges in such spanners.
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: 'Lukovszki T. New Results on Fault Tolerant Geometric Spanners. In: Proceedings
of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS. ; 1999:193-204.
doi:10.1007/3-540-48447-7_20'
apa: Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In
Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99),
LNCS (pp. 193–204). https://doi.org/10.1007/3-540-48447-7_20
bibtex: '@inproceedings{Lukovszki_1999, title={New Results on Fault Tolerant Geometric
Spanners}, DOI={10.1007/3-540-48447-7_20},
booktitle={Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99),
LNCS}, author={Lukovszki, Tamás}, year={1999}, pages={193–204} }'
chicago: Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” In
Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99),
LNCS, 193–204, 1999. https://doi.org/10.1007/3-540-48447-7_20.
ieee: T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” in Proceedings
of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999,
pp. 193–204.
mla: Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” Proceedings
of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999,
pp. 193–204, doi:10.1007/3-540-48447-7_20.
short: 'T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data
Structures (WADS’99), LNCS, 1999, pp. 193–204.'
date_created: 2020-09-03T13:03:45Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1007/3-540-48447-7_20
language:
- iso: eng
page: 193-204
publication: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99),
LNCS
publication_identifier:
isbn:
- '9783540662792'
- '9783540484479'
issn:
- 0302-9743
publication_status: published
status: public
title: New Results on Fault Tolerant Geometric Spanners
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '18965'
author:
- first_name: Christof
full_name: Krick, Christof
last_name: Krick
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data management
in networks: experimental evaluation of a provably good strategy. In: Proceedings
of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’99. ; 1999:165-174. doi:10.1145/305619.305637'
apa: 'Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann,
M. (1999). Data management in networks: experimental evaluation of a provably
good strategy. In Proceedings of the eleventh annual ACM symposium on Parallel
algorithms and architectures - SPAA ’99 (pp. 165–174). https://doi.org/10.1145/305619.305637'
bibtex: '@inproceedings{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_1999,
title={Data management in networks: experimental evaluation of a provably good
strategy}, DOI={10.1145/305619.305637},
booktitle={Proceedings of the eleventh annual ACM symposium on Parallel algorithms
and architectures - SPAA ’99}, author={Krick, Christof and Meyer auf der Heide,
Friedhelm and Räcke, Harald and Vöcking, Berthold and Westermann, Matthias}, year={1999},
pages={165–174} }'
chicago: 'Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold
Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation
of a Provably Good Strategy.” In Proceedings of the Eleventh Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’99, 165–74, 1999. https://doi.org/10.1145/305619.305637.'
ieee: 'C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann,
“Data management in networks: experimental evaluation of a provably good strategy,”
in Proceedings of the eleventh annual ACM symposium on Parallel algorithms
and architectures - SPAA ’99, 1999, pp. 165–174.'
mla: 'Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation
of a Provably Good Strategy.” Proceedings of the Eleventh Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’99, 1999, pp. 165–74, doi:10.1145/305619.305637.'
short: 'C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in:
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’99, 1999, pp. 165–174.'
date_created: 2020-09-03T14:27:14Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
doi: 10.1145/305619.305637
language:
- iso: eng
page: 165-174
publication: Proceedings of the eleventh annual ACM symposium on Parallel algorithms
and architectures - SPAA '99
publication_identifier:
isbn:
- '1581131240'
publication_status: published
status: public
title: 'Data management in networks: experimental evaluation of a provably good strategy'
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '18576'
abstract:
- lang: eng
text: In this paper we deal with two problems on star-shaped polygons. First, we
present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon
whose vertices are given by a point set ( S ) of ( n ) points in the plane that
does not admit degenerate star-shaped polygons. The expected running time of the
algorithm is ( O(n^2log n) ) and it uses ( O(n) ) memory. We call a star-shaped
polygon degenerate if its kernel has 0 area.
Secondly, we show how to count
all star-shaped polygons whose vertices are a subset of ( S ) in ( O(n^5log n)
) time and ( O(n) ) space. The algorithm can also be used for random uniform generation.
We also present lower and upper bounds on the number of star-shaped polygons.
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Sohler C. Generating Random Star-Shaped Polygons. In: Proceedings of the
11th Canadian Conference on Computational Geometry (''CCCG’99). ; 1999:174-177.'
apa: Sohler, C. (1999). Generating Random Star-Shaped Polygons. In Proceedings
of the 11th Canadian Conference on Computational Geometry ('CCCG’99) (pp.
174–177).
bibtex: '@inproceedings{Sohler_1999, title={Generating Random Star-Shaped Polygons},
booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry
(''CCCG’99)}, author={Sohler, Christian}, year={1999}, pages={174–177} }'
chicago: Sohler, Christian. “Generating Random Star-Shaped Polygons.” In Proceedings
of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 174–77,
1999.
ieee: C. Sohler, “Generating Random Star-Shaped Polygons,” in Proceedings of
the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp.
174–177.
mla: Sohler, Christian. “Generating Random Star-Shaped Polygons.” Proceedings
of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999,
pp. 174–77.
short: 'C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational
Geometry (''CCCG’99), 1999, pp. 174–177.'
date_created: 2020-08-28T14:20:42Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
language:
- iso: eng
page: 174-177
publication: Proceedings of the 11th Canadian Conference on Computational Geometry
('CCCG'99)
status: public
title: Generating Random Star-Shaped Polygons
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '2210'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Marco
full_name: Riedel, Marco
last_name: Riedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage
Network (Extended Abstract). In: International Workshop on Communication and
Data Management in Large Networks (CDMLarge). ; 1999:2-12.'
apa: Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO
Multimedia Storage Network (Extended Abstract). In International Workshop on
Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).
bibtex: '@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Design of the
PRESTO Multimedia Storage Network (Extended Abstract)}, booktitle={International
Workshop on Communication and Data Management in Large Networks (CDMLarge)}, author={Berenbrink,
Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={2–12}
}'
chicago: Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the
PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop
on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.
ieee: P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia
Storage Network (Extended Abstract),” in International Workshop on Communication
and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
mla: Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network
(Extended Abstract).” International Workshop on Communication and Data Management
in Large Networks (CDMLarge), 1999, pp. 2–12.
short: 'P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication
and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.'
date_created: 2018-04-05T07:00:11Z
date_updated: 2022-01-06T06:55:26Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:34:00Z
date_updated: 2018-04-12T08:34:00Z
file_id: '2294'
file_name: CDMLarge-99.pdf
file_size: 211926
relation: main_file
file_date_updated: 2018-04-12T08:34:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 2-12
publication: International Workshop on Communication and Data Management in Large
Networks (CDMLarge)
status: public
title: Design of the PRESTO Multimedia Storage Network (Extended Abstract)
type: conference
urn: '22109'
user_id: '14955'
year: '1999'
...
---
_id: '2166'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations
of Store-and-Forward Protocols. In: STOC. ; 1999:215--224.'
apa: 'Scheideler, C., & Vöcking, B. (1999). From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols. In STOC (pp.
215--224).'
bibtex: '@inproceedings{Scheideler_Vöcking_1999, title={From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols}, booktitle={STOC}, author={Scheideler,
Christian and Vöcking, Berthold}, year={1999}, pages={215--224} }'
chicago: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224,
1999.'
ieee: 'C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient
Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.'
mla: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999,
pp. 215--224.'
short: 'C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.'
date_created: 2018-04-03T08:57:30Z
date_updated: 2022-01-06T06:55:10Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:35:46Z
date_updated: 2018-04-12T07:35:46Z
file_id: '2289'
file_name: STOC-99.pdf
file_size: 227305
relation: main_file
file_date_updated: 2018-04-12T07:35:46Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 215--224
publication: STOC
status: public
title: 'From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward
Protocols'
type: conference
urn: '21668'
user_id: '14955'
year: '1999'
...
---
_id: '16501'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: Meyer auf der Heide F, Vöcking B. Shortest-Path Routing in Arbitrary Networks.
Journal of Algorithms. 1999:105-131. doi:10.1006/jagm.1998.0980
apa: Meyer auf der Heide, F., & Vöcking, B. (1999). Shortest-Path Routing in
Arbitrary Networks. Journal of Algorithms, 105–131. https://doi.org/10.1006/jagm.1998.0980
bibtex: '@article{Meyer auf der Heide_Vöcking_1999, title={Shortest-Path Routing
in Arbitrary Networks}, DOI={10.1006/jagm.1998.0980},
journal={Journal of Algorithms}, author={Meyer auf der Heide, Friedhelm and Vöcking,
Berthold}, year={1999}, pages={105–131} }'
chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing
in Arbitrary Networks.” Journal of Algorithms, 1999, 105–31. https://doi.org/10.1006/jagm.1998.0980.
ieee: F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary
Networks,” Journal of Algorithms, pp. 105–131, 1999.
mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing
in Arbitrary Networks.” Journal of Algorithms, 1999, pp. 105–31, doi:10.1006/jagm.1998.0980.
short: F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.
date_created: 2020-04-14T11:50:52Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1006/jagm.1998.0980
language:
- iso: eng
page: 105-131
publication: Journal of Algorithms
publication_identifier:
issn:
- 0196-6774
publication_status: published
status: public
title: Shortest-Path Routing in Arbitrary Networks
type: journal_article
user_id: '15415'
year: '1999'
...
---
_id: '16502'
author:
- first_name: P.
full_name: Berenbrink, P.
last_name: Berenbrink
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: K.
full_name: Schröder, K.
last_name: Schröder
citation:
ama: Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating Weighted Jobs in
Parallel. Theory of Computing Systems. 1999:281-300. doi:10.1007/s002240000119
apa: Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1999). Allocating
Weighted Jobs in Parallel. Theory of Computing Systems, 281–300. https://doi.org/10.1007/s002240000119
bibtex: '@article{Berenbrink_Meyer auf der Heide_Schröder_1999, title={Allocating
Weighted Jobs in Parallel}, DOI={10.1007/s002240000119},
journal={Theory of Computing Systems}, author={Berenbrink, P. and Meyer auf der
Heide, Friedhelm and Schröder, K.}, year={1999}, pages={281–300} }'
chicago: Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating
Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, 281–300.
https://doi.org/10.1007/s002240000119.
ieee: P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating Weighted
Jobs in Parallel,” Theory of Computing Systems, pp. 281–300, 1999.
mla: Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” Theory of
Computing Systems, 1999, pp. 281–300, doi:10.1007/s002240000119.
short: P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems
(1999) 281–300.
date_created: 2020-04-14T12:00:32Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/s002240000119
language:
- iso: eng
page: 281-300
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: Allocating Weighted Jobs in Parallel
type: journal_article
user_id: '15415'
year: '1999'
...
---
_id: '17052'
author:
- first_name: E. W.
full_name: Mayr, E. W.
last_name: Mayr
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Mayr EW, Meyer auf der Heide F, Wanka R. International Workshop on Communication
and Data Management in Large Networks. In: Informatik Aktuell. ; 1999.
doi:10.1007/978-3-662-01069-3_47'
apa: Mayr, E. W., Meyer auf der Heide, F., & Wanka, R. (1999). International
Workshop on Communication and Data Management in Large Networks. In Informatik
aktuell. https://doi.org/10.1007/978-3-662-01069-3_47
bibtex: '@inbook{Mayr_Meyer auf der Heide_Wanka_1999, place={Berlin, Heidelberg},
title={International Workshop on Communication and Data Management in Large Networks},
DOI={10.1007/978-3-662-01069-3_47},
booktitle={Informatik aktuell}, author={Mayr, E. W. and Meyer auf der Heide, Friedhelm
and Wanka, Rolf}, year={1999} }'
chicago: Mayr, E. W., Friedhelm Meyer auf der Heide, and Rolf Wanka. “International
Workshop on Communication and Data Management in Large Networks.” In Informatik
Aktuell. Berlin, Heidelberg, 1999. https://doi.org/10.1007/978-3-662-01069-3_47.
ieee: E. W. Mayr, F. Meyer auf der Heide, and R. Wanka, “International Workshop
on Communication and Data Management in Large Networks,” in Informatik aktuell,
Berlin, Heidelberg, 1999.
mla: Mayr, E. W., et al. “International Workshop on Communication and Data Management
in Large Networks.” Informatik Aktuell, 1999, doi:10.1007/978-3-662-01069-3_47.
short: 'E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin,
Heidelberg, 1999.'
date_created: 2020-05-20T13:16:56Z
date_updated: 2022-01-06T06:53:03Z
department:
- _id: '63'
doi: 10.1007/978-3-662-01069-3_47
language:
- iso: eng
place: Berlin, Heidelberg
publication: Informatik aktuell
publication_identifier:
isbn:
- '9783540664505'
- '9783662010693'
issn:
- 1431-472X
publication_status: published
status: public
title: International Workshop on Communication and Data Management in Large Networks
type: book_chapter
user_id: '15415'
year: '1999'
...
---
_id: '17053'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Meyer auf der Heide F, Vöcking B, Westermann M. Provably Good and Practical
Strategies for Non-uniform Data Management in Networks. In: Algorithms - ESA’
99. Berlin, Heidelberg; 1999. doi:10.1007/3-540-48481-7_9'
apa: Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1999). Provably
Good and Practical Strategies for Non-uniform Data Management in Networks. In
Algorithms - ESA’ 99. Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_9
bibtex: '@inbook{Meyer auf der Heide_Vöcking_Westermann_1999, place={Berlin, Heidelberg},
title={Provably Good and Practical Strategies for Non-uniform Data Management
in Networks}, DOI={10.1007/3-540-48481-7_9},
booktitle={Algorithms - ESA’ 99}, author={Meyer auf der Heide, Friedhelm and Vöcking,
Berthold and Westermann, Matthias}, year={1999} }'
chicago: Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann.
“Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”
In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999. https://doi.org/10.1007/3-540-48481-7_9.
ieee: F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Provably Good and
Practical Strategies for Non-uniform Data Management in Networks,” in Algorithms
- ESA’ 99, Berlin, Heidelberg, 1999.
mla: Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies
for Non-Uniform Data Management in Networks.” Algorithms - ESA’ 99, 1999,
doi:10.1007/3-540-48481-7_9.
short: 'F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’
99, Berlin, Heidelberg, 1999.'
date_created: 2020-05-20T13:35:49Z
date_updated: 2022-01-06T06:53:03Z
department:
- _id: '63'
doi: 10.1007/3-540-48481-7_9
language:
- iso: eng
place: Berlin, Heidelberg
publication: Algorithms - ESA’ 99
publication_identifier:
isbn:
- '9783540662518'
- '9783540484813'
issn:
- 0302-9743
publication_status: published
status: public
title: Provably Good and Practical Strategies for Non-uniform Data Management in Networks
type: book_chapter
user_id: '15415'
year: '1999'
...
---
_id: '19639'
author:
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: Vöcking B. Static and Dynamic Data Management in Networks. Vol 46. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 1998.
apa: Vöcking, B. (1998). Static and Dynamic Data Management in Networks (Vol.
46). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Vöcking_1998, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Static and Dynamic Data Management in Networks}, volume={46},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Vöcking,
Berthold}, year={1998}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Vöcking, Berthold. Static and Dynamic Data Management in Networks.
Vol. 46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1998.
ieee: B. Vöcking, Static and Dynamic Data Management in Networks, vol. 46.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
mla: Vöcking, Berthold. Static and Dynamic Data Management in Networks. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1998.
short: B. Vöcking, Static and Dynamic Data Management in Networks, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1998.
date_created: 2020-09-22T13:05:43Z
date_updated: 2022-01-06T06:54:09Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-22T13:05:04Z
date_updated: 2020-09-22T13:05:04Z
file_id: '19640'
file_name: pub-hni-478.pdf
file_size: 592479
relation: main_file
success: 1
file_date_updated: 2020-09-22T13:05:04Z
has_accepted_license: '1'
intvolume: ' 46'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-45-0
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
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: Static and Dynamic Data Management in Networks
type: dissertation
user_id: '5786'
volume: 46
year: '1998'
...