---
_id: '16491'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
citation:
ama: 'Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Energy, congestion
and dilation in radio networks. In: Proceedings of the Fourteenth Annual ACM
Symposium on Parallel Algorithms and Architectures - SPAA ’02. ; 2002. doi:10.1145/564870.564910'
apa: Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., & Grünewald, M.
(2002). Energy, congestion and dilation in radio networks. In Proceedings of
the fourteenth annual ACM symposium on Parallel algorithms and architectures
- SPAA ’02. https://doi.org/10.1145/564870.564910
bibtex: '@inproceedings{Meyer auf der Heide_Schindelhauer_Volbert_Grünewald_2002,
title={Energy, congestion and dilation in radio networks}, DOI={10.1145/564870.564910},
booktitle={Proceedings of the fourteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’02}, author={Meyer auf der Heide, Friedhelm and Schindelhauer,
Christian and Volbert, Klaus and Grünewald, Matthias}, year={2002} }'
chicago: Meyer auf der Heide, Friedhelm, Christian Schindelhauer, Klaus Volbert,
and Matthias Grünewald. “Energy, Congestion and Dilation in Radio Networks.” In
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and
Architectures - SPAA ’02, 2002. https://doi.org/10.1145/564870.564910.
ieee: F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Energy,
congestion and dilation in radio networks,” in Proceedings of the fourteenth
annual ACM symposium on Parallel algorithms and architectures - SPAA ’02,
2002.
mla: Meyer auf der Heide, Friedhelm, et al. “Energy, Congestion and Dilation in
Radio Networks.” Proceedings of the Fourteenth Annual ACM Symposium on Parallel
Algorithms and Architectures - SPAA ’02, 2002, doi:10.1145/564870.564910.
short: 'F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, in:
Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and
Architectures - SPAA ’02, 2002.'
date_created: 2020-04-09T10:30:23Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1145/564870.564910
language:
- iso: eng
publication: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA '02
publication_identifier:
isbn:
- '1581135297'
publication_status: published
status: public
title: Energy, congestion and dilation in radio networks
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '16723'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Mohan
full_name: Kumar, Mohan
last_name: Kumar
- first_name: Sotiris
full_name: Nikoletseas, Sotiris
last_name: Nikoletseas
- first_name: Paul
full_name: Spirakis, Paul
last_name: Spirakis
citation:
ama: 'Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing,
Mobile Networks. In: Euro-Par 2002 Parallel Processing. Lecture Notes in
Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45706-2_133'
apa: Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., & Spirakis, P. (2002).
Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing
(Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_133
bibtex: '@inbook{Meyer auf der Heide_Kumar_Nikoletseas_Spirakis_2002, place={Berlin,
Heidelberg}, edition={Lecture Notes in Computer Science, vol 2400}, title={Mobile
Computing, Mobile Networks}, DOI={10.1007/3-540-45706-2_133},
booktitle={Euro-Par 2002 Parallel Processing}, author={Meyer auf der Heide, Friedhelm
and Kumar, Mohan and Nikoletseas, Sotiris and Spirakis, Paul}, year={2002} }'
chicago: Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul
Spirakis. “Mobile Computing, Mobile Networks.” In Euro-Par 2002 Parallel Processing,
Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-45706-2_133.
ieee: F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile
Computing, Mobile Networks,” in Euro-Par 2002 Parallel Processing, Lecture
Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.
mla: Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.”
Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol
2400, 2002, doi:10.1007/3-540-45706-2_133.
short: 'F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, P. Spirakis, in: Euro-Par
2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, Berlin,
Heidelberg, 2002.'
date_created: 2020-04-17T11:40:33Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-45706-2_133
edition: Lecture Notes in Computer Science, vol 2400
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par 2002 Parallel Processing
publication_identifier:
isbn:
- '9783540440499'
- '9783540457060'
issn:
- 0302-9743
publication_status: published
status: public
title: Mobile Computing, Mobile Networks
type: book_chapter
user_id: '15415'
year: '2002'
...
---
_id: '19622'
author:
- first_name: Klaus
full_name: Schröder, Klaus
last_name: Schröder
citation:
ama: 'Schröder K. Balls into Bins: A Paradigm for Job Allocation, Data Distribution
Processes, and Routing. Vol 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2001.'
apa: 'Schröder, K. (2001). Balls into Bins: A Paradigm for Job Allocation, Data
Distribution Processes, and Routing (Vol. 89). Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn.'
bibtex: '@book{Schröder_2001, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Balls into Bins: A Paradigm for Job Allocation, Data Distribution
Processes, and Routing}, volume={89}, publisher={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn}, author={Schröder, Klaus}, year={2001}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: 'Schröder, Klaus. Balls into Bins: A Paradigm for Job Allocation, Data
Distribution Processes, and Routing. Vol. 89. Verlagsschriftenreihe Des Heinz
Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2001.'
ieee: 'K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution
Processes, and Routing, vol. 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2001.'
mla: 'Schröder, Klaus. Balls into Bins: A Paradigm for Job Allocation, Data Distribution
Processes, and Routing. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2001.'
short: 'K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution
Processes, and Routing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2001.'
date_created: 2020-09-22T10:18:39Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 89'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-88-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466-20010101222
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: 'Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes,
and Routing'
type: dissertation
user_id: '5786'
volume: 89
year: '2001'
...
---
_id: '19797'
author:
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Georg
full_name: Hartmann, Georg
last_name: Hartmann
- first_name: Carsten
full_name: Wolff, Carsten
last_name: Wolff
- first_name: Robert
full_name: Preis, Robert
last_name: Preis
citation:
ama: 'Salzwedel K, Hartmann G, Wolff C, Preis R. Efficient Parallel Simulations
of Pulse-Coded Neural Networks (PCNN). In: Proceedings of the PDPTA 2001.
Vol 1. ; 2001:463-470.'
apa: Salzwedel, K., Hartmann, G., Wolff, C., & Preis, R. (2001). Efficient Parallel
Simulations of Pulse-Coded Neural Networks (PCNN). In Proceedings of the PDPTA
2001 (Vol. 1, pp. 463–470).
bibtex: '@inproceedings{Salzwedel_Hartmann_Wolff_Preis_2001, title={Efficient Parallel
Simulations of Pulse-Coded Neural Networks (PCNN)}, volume={1}, booktitle={Proceedings
of the PDPTA 2001}, author={Salzwedel, Kay and Hartmann, Georg and Wolff, Carsten
and Preis, Robert}, year={2001}, pages={463–470} }'
chicago: Salzwedel, Kay, Georg Hartmann, Carsten Wolff, and Robert Preis. “Efficient
Parallel Simulations of Pulse-Coded Neural Networks (PCNN).” In Proceedings
of the PDPTA 2001, 1:463–70, 2001.
ieee: K. Salzwedel, G. Hartmann, C. Wolff, and R. Preis, “Efficient Parallel Simulations
of Pulse-Coded Neural Networks (PCNN),” in Proceedings of the PDPTA 2001,
2001, vol. 1, pp. 463–470.
mla: Salzwedel, Kay, et al. “Efficient Parallel Simulations of Pulse-Coded Neural
Networks (PCNN).” Proceedings of the PDPTA 2001, vol. 1, 2001, pp. 463–70.
short: 'K. Salzwedel, G. Hartmann, C. Wolff, R. Preis, in: Proceedings of the PDPTA
2001, 2001, pp. 463–470.'
date_created: 2020-09-30T12:34:44Z
date_updated: 2022-01-06T06:54:12Z
department:
- _id: '63'
- _id: '70'
intvolume: ' 1'
language:
- iso: eng
page: 463-470
publication: Proceedings of the PDPTA 2001
status: public
title: Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)
type: conference
user_id: '15415'
volume: 1
year: '2001'
...
---
_id: '2139'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers:
Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138.
doi:10.1007/s004930170007'
apa: 'Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica,
21(1), 95--138. https://doi.org/10.1007/s004930170007'
bibtex: '@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1},
journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler,
Christian}, year={2001}, pages={95--138} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic
Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica
21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.'
ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded
Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21,
no. 1, pp. 95--138, 2001.'
mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica,
vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.'
short: F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
date_created: 2018-04-03T05:47:20Z
date_updated: 2022-01-06T06:54:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s004930170007
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 95--138
publication: Combinatorica
status: public
title: 'Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols'
type: journal_article
user_id: '14955'
volume: 21
year: '2001'
...
---
_id: '2141'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for
Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.'
apa: Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation
Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer
Society.
bibtex: '@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation
Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer
Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian},
year={2001}, pages={227--234} }'
chicago: Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A
Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE
Computer Society, 2001.
ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment
for Storage Area Networks,” in PDP, 2001, pp. 227--234.
mla: Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area
Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.
short: 'P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society,
2001, pp. 227--234.'
date_created: 2018-04-03T05:49:21Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:39:01Z
date_updated: 2018-04-12T08:39:01Z
file_id: '2298'
file_name: PDP-00.pdf
file_size: 85778
relation: main_file
file_date_updated: 2018-04-12T08:39:01Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 227--234
publication: PDP
publisher: IEEE Computer Society
status: public
title: SIMLAB-A Simulation Environment for Storage Area Networks
type: conference
urn: '21415'
user_id: '14955'
year: '2001'
...
---
_id: '18749'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: Czumaj A, Sohler C. Testing Hypergraph Coloring. Proceedings of the 28th
International Colloquium on Automata, Languages and Programming (ICALP). 2001:493-505.
doi:10.1007/3-540-48224-5_41
apa: Czumaj, A., & Sohler, C. (2001). Testing Hypergraph Coloring. Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
493–505. https://doi.org/10.1007/3-540-48224-5_41
bibtex: '@article{Czumaj_Sohler_2001, title={Testing Hypergraph Coloring}, DOI={10.1007/3-540-48224-5_41},
journal={Proceedings of the 28th International Colloquium on Automata, Languages
and Programming (ICALP)}, author={Czumaj, Artur and Sohler, Christian}, year={2001},
pages={493–505} }'
chicago: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
2001, 493–505. https://doi.org/10.1007/3-540-48224-5_41.
ieee: A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” Proceedings of
the 28th International Colloquium on Automata, Languages and Programming (ICALP),
pp. 493–505, 2001.
mla: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.
short: A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on
Automata, Languages and Programming (ICALP) (2001) 493–505.
date_created: 2020-09-01T10:48:38Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
doi: 10.1007/3-540-48224-5_41
language:
- iso: eng
page: 493-505
publication: Proceedings of the 28th International Colloquium on Automata, Languages
and Programming (ICALP)
publication_identifier:
isbn:
- '9783540422877'
- '9783540482246'
issn:
- 0302-9743
publication_status: published
status: public
title: Testing Hypergraph Coloring
type: journal_article
user_id: '15415'
year: '2001'
...
---
_id: '18750'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: 'Sohler C, Czumaj A. Soft Kinetic Data Structures. In: Proceedings of the
12th ACM-SIAM Symposium on Discrete Algorithms. ; 2001:865-872.'
apa: Sohler, C., & Czumaj, A. (2001). Soft Kinetic Data Structures. In Proceedings
of the 12th ACM-SIAM Symposium on Discrete Algorithms (pp. 865–872).
bibtex: '@inproceedings{Sohler_Czumaj_2001, title={Soft Kinetic Data Structures},
booktitle={Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms},
author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={865–872} }'
chicago: Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” In
Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 865–72,
2001.
ieee: C. Sohler and A. Czumaj, “Soft Kinetic Data Structures,” in Proceedings
of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.
mla: Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” Proceedings
of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–72.
short: 'C. Sohler, A. Czumaj, in: Proceedings of the 12th ACM-SIAM Symposium on
Discrete Algorithms, 2001, pp. 865–872.'
date_created: 2020-09-01T10:56:39Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
language:
- iso: eng
page: 865-872
publication: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms
status: public
title: Soft Kinetic Data Structures
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '18857'
abstract:
- lang: eng
text: "This paper investigates geometric problems in the context of property testing
algorithms. Property testing is an emerging area in computer science in which
one is aiming at verifying whether a given object has a predetermined property
or is “far” from any object having the property. Although there has been some
research previously done in testing geometric properties, prior works have been
mostly dealing with the study of combinatorial notion of the distance defining
whether an object is “far” or it is “close”; very little research has been done
for geometric notion of distance measures, that is, distance measures that are
based on the geometry underlying input objects.\r\n\r\nThe main objective of this
work is to develop sound models to study geometric problems in the context of
property testing. Comparing to the previous work in property testing, there are
two novel aspects developed in this paper: geometric measures of being close to
an object having the predetermined property, and the use of geometric data structures
as basic primitives to design the testers. We believe that the second aspect is
of special importance in the context of property testing and that the use of specialized
data structures as basic primitives in the testers can be applied to other important
problems in this area.\r\n\r\nWe shall discuss a number of models that in our
opinion fit best geometric problems and apply them to study geometric properties
for three very fundamental and representative problems in the area: testing convex
position, testing map labeling, and testing clusterability."
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: Sohler C, Czumaj A. Property Testing with Geometric Queries. Proceedings
of the 9th Annual European Symposium on Algorithms (ESA`01). 2001:266-277.
doi:10.1007/3-540-44676-1_22
apa: Sohler, C., & Czumaj, A. (2001). Property Testing with Geometric Queries.
Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01),
266–277. https://doi.org/10.1007/3-540-44676-1_22
bibtex: '@article{Sohler_Czumaj_2001, title={Property Testing with Geometric Queries},
DOI={10.1007/3-540-44676-1_22},
journal={Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)},
author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={266–277} }'
chicago: Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.”
Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01),
2001, 266–77. https://doi.org/10.1007/3-540-44676-1_22.
ieee: C. Sohler and A. Czumaj, “Property Testing with Geometric Queries,” Proceedings
of the 9th Annual European Symposium on Algorithms (ESA`01), pp. 266–277,
2001.
mla: Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.”
Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01),
2001, pp. 266–77, doi:10.1007/3-540-44676-1_22.
short: C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on
Algorithms (ESA`01) (2001) 266–277.
date_created: 2020-09-02T12:24:25Z
date_updated: 2022-01-06T06:53:53Z
department:
- _id: '63'
doi: 10.1007/3-540-44676-1_22
language:
- iso: eng
page: 266-277
publication: Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)
status: public
title: Property Testing with Geometric Queries
type: journal_article
user_id: '15415'
year: '2001'
...
---
_id: '18964'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Anil
full_name: Maheshwari, Anil
last_name: Maheshwari
- first_name: Norbert
full_name: Zeh, Norbert
last_name: Zeh
citation:
ama: 'Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and
Its Applications to Proximity Problems. In: Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS. ; 2001. doi:10.1007/3-540-45294-x_21'
apa: Lukovszki, T., Maheshwari, A., & Zeh, N. (2001). I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems. In Proceedings of
the 21st Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2001), LNCS. https://doi.org/10.1007/3-540-45294-x_21
bibtex: '@inproceedings{Lukovszki_Maheshwari_Zeh_2001, title={I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems}, DOI={10.1007/3-540-45294-x_21},
booktitle={Proceedings of the 21st Annual Conference on Foundations of Software
Technology and Theoretical Computer Science (FSTTCS 2001), LNCS}, author={Lukovszki,
Tamás and Maheshwari, Anil and Zeh, Norbert}, year={2001} }'
chicago: Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems.” In Proceedings
of the 21st Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2001), LNCS, 2001. https://doi.org/10.1007/3-540-45294-x_21.
ieee: T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting
and Its Applications to Proximity Problems,” in Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS, 2001.
mla: Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications
to Proximity Problems.” Proceedings of the 21st Annual Conference on Foundations
of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS,
2001, doi:10.1007/3-540-45294-x_21.
short: 'T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS, 2001.'
date_created: 2020-09-03T13:26:01Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1007/3-540-45294-x_21
language:
- iso: eng
publication: Proceedings of the 21st Annual Conference on Foundations of Software
Technology and Theoretical Computer Science (FSTTCS 2001), LNCS
publication_identifier:
isbn:
- '9783540430025'
- '9783540452942'
issn:
- 0302-9743
publication_status: published
status: public
title: I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '23731'
abstract:
- lang: eng
text: "\r\n On 22 May 2000, the factorization of a pseudorandom
polynomial of degree 1 048 543 over the binary field Z\r\n 2\r\n
\ was completed on a 4-processor Linux PC, using roughly 100 CPU-hours.
The basic approach is a combination of the factorization software BIPOLAR and
a parallel version of Cantor's multiplication algorithm. The PUB-library (Paderborn
University BSP library) is used for the implementation of the parallel communication.\r\n
\ "
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Joachim
full_name: von zur Gathen, Joachim
last_name: von zur Gathen
- first_name: Jürgen
full_name: Gerhard, Jürgen
last_name: Gerhard
- first_name: Olaf
full_name: Müller, Olaf
last_name: Müller
citation:
ama: Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial
of degree over one million. ACM SIGSAM Bulletin. 2001:16-18. doi:10.1145/504331.504333
apa: Bonorden, O., von zur Gathen, J., Gerhard, J., & Müller, O. (2001). Factoring
a binary polynomial of degree over one million. ACM SIGSAM Bulletin, 16–18.
https://doi.org/10.1145/504331.504333
bibtex: '@article{Bonorden_von zur Gathen_Gerhard_Müller_2001, title={Factoring
a binary polynomial of degree over one million}, DOI={10.1145/504331.504333},
journal={ACM SIGSAM Bulletin}, author={Bonorden, Olaf and von zur Gathen, Joachim
and Gerhard, Jürgen and Müller, Olaf}, year={2001}, pages={16–18} }'
chicago: Bonorden, Olaf, Joachim von zur Gathen, Jürgen Gerhard, and Olaf Müller.
“Factoring a Binary Polynomial of Degree over One Million.” ACM SIGSAM Bulletin,
2001, 16–18. https://doi.org/10.1145/504331.504333.
ieee: O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary
polynomial of degree over one million,” ACM SIGSAM Bulletin, pp. 16–18,
2001.
mla: Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.”
ACM SIGSAM Bulletin, 2001, pp. 16–18, doi:10.1145/504331.504333.
short: O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin
(2001) 16–18.
date_created: 2021-09-03T09:08:27Z
date_updated: 2022-01-06T06:55:58Z
department:
- _id: '63'
doi: 10.1145/504331.504333
language:
- iso: eng
page: 16-18
publication: ACM SIGSAM Bulletin
publication_identifier:
issn:
- 0163-5824
publication_status: published
status: public
title: Factoring a binary polynomial of degree over one million
type: journal_article
user_id: '15415'
year: '2001'
...
---
_id: '18152'
abstract:
- lang: eng
text: Computing the spectral decomposition of a normal matrix is among the most
frequent tasks to numerical mathematics. A vast range of methods are employed
to do so, but all of them suffer from instabilities when applied to degenerate
matrices, i.e., those having multiple eigenvalues. We investigate the spectral
representation's effectivity properties on the sound formal basis of computable
analysis. It turns out that in general the eigenvectors cannot be computed from
a given matrix. If however the size of the matrix' spectrum (=number of different
eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in
principle the spectral decomposition can be computed under remarkably weak non-degeneracy
conditions.
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: Vasco
full_name: Brattka, Vasco
last_name: Brattka
citation:
ama: 'Ziegler M, Brattka V. A Computable Spectral Theorem. In: Proceedings of
the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol
2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23'
apa: Ziegler, M., & Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)
(Vol. 2064, pp. 378–388). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_23
bibtex: '@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A
Computable Spectral Theorem}, volume={2064}, DOI={10.1007/3-540-45335-0_23},
booktitle={Proceedings of the 4th Workshop on Computability and Complexity in
Analysis (CCA’2000)}, author={Ziegler, Martin and Brattka, Vasco}, year={2001},
pages={378–388} }'
chicago: Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In
Proceedings of the 4th Workshop on Computability and Complexity in Analysis
(CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45335-0_23.
ieee: M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000),
2001, vol. 2064, pp. 378–388.
mla: Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000),
vol. 2064, 2001, pp. 378–88, doi:10.1007/3-540-45335-0_23.
short: 'M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability
and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.'
date_created: 2020-08-24T10:14:06Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.1007/3-540-45335-0_23
intvolume: ' 2064'
language:
- iso: eng
page: 378-388
place: Berlin, Heidelberg
publication: Proceedings of the 4th Workshop on Computability and Complexity in Analysis
(CCA'2000)
publication_identifier:
isbn:
- '9783540421979'
- '9783540453352'
issn:
- 0302-9743
publication_status: published
status: public
title: A Computable Spectral Theorem
type: conference
user_id: '15415'
volume: 2064
year: '2001'
...
---
_id: '18166'
abstract:
- lang: eng
text: What is the maximum number of edges of the d-dimensional hypercube, denoted
by S(d,k), that can be sliced by k many hyperplanes? This question on combinatorial
properties of Euclidean geometry arising from linear separability considerations
in the theory of Perceptrons has become an issue on its own. We use computational
and combinatorial methods to obtain new bounds on S(d,k), s<=8. These strengthen
earlier results on hypercube cut numbers.
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: M. Reza
full_name: Emamy-Khansari, M. Reza
last_name: Emamy-Khansari
citation:
ama: 'Ziegler M, Emamy-Khansari MR. New Bounds for Hypercube Slicing Numbers. In:
Proceedings of the First International Conference on Discrete Models - Combinatorics,
Computation and Geometry (DM-CCG’2001). Vol AA. ; 2001:155-164.'
apa: Ziegler, M., & Emamy-Khansari, M. R. (2001). New Bounds for Hypercube Slicing
Numbers. In Proceedings of the First International Conference on Discrete Models
- Combinatorics, Computation and Geometry (DM-CCG’2001) (Vol. AA, pp. 155–164).
bibtex: '@inproceedings{Ziegler_Emamy-Khansari_2001, title={New Bounds for Hypercube
Slicing Numbers}, volume={AA}, booktitle={Proceedings of the First International
Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)},
author={Ziegler, Martin and Emamy-Khansari, M. Reza}, year={2001}, pages={155–164}
}'
chicago: Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube
Slicing Numbers.” In Proceedings of the First International Conference on Discrete
Models - Combinatorics, Computation and Geometry (DM-CCG’2001), AA:155–64,
2001.
ieee: M. Ziegler and M. R. Emamy-Khansari, “New Bounds for Hypercube Slicing Numbers,”
in Proceedings of the First International Conference on Discrete Models - Combinatorics,
Computation and Geometry (DM-CCG’2001), 2001, vol. AA, pp. 155–164.
mla: Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing
Numbers.” Proceedings of the First International Conference on Discrete Models
- Combinatorics, Computation and Geometry (DM-CCG’2001), vol. AA, 2001, pp.
155–64.
short: 'M. Ziegler, M.R. Emamy-Khansari, in: Proceedings of the First International
Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001),
2001, pp. 155–164.'
date_created: 2020-08-24T11:29:08Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
page: 155-164
publication: Proceedings of the First International Conference on Discrete Models
- Combinatorics, Computation and Geometry (DM-CCG'2001)
status: public
title: New Bounds for Hypercube Slicing Numbers
type: conference
user_id: '15415'
volume: AA
year: '2001'
...
---
_id: '18168'
abstract:
- lang: eng
text: 'We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing
rather than the RealRAM model. Asking for mere computability of a function''s
maximum over some closed domain, we show that the common presumptions ''full-dimensional''
and `bounded'' in fact cannot be omitted: The sound framework of Recursive Analysis
enables us to rigorously prove this folkloristic observation! On the other hand,
convexity of this domain may be weakened to connectedness, and even NON-linear
functions turn out to be effectively optimizable.'
author:
- first_name: Vasco
full_name: Brattka, Vasco
last_name: Brattka
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Brattka V, Ziegler M. Turing Computability of (Non-)Linear Optimization. In:
Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01).
; 2001:181-184.'
apa: Brattka, V., & Ziegler, M. (2001). Turing Computability of (Non-)Linear
Optimization. In Proceedings of the 13th Canadian Conference on Computational
Geometry (CCCG’01) (pp. 181–184).
bibtex: '@inproceedings{Brattka_Ziegler_2001, title={Turing Computability of (Non-)Linear
Optimization}, booktitle={Proceedings of the 13th Canadian Conference on Computational
Geometry (CCCG’01)}, author={Brattka, Vasco and Ziegler, Martin}, year={2001},
pages={181–184} }'
chicago: Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear
Optimization.” In Proceedings of the 13th Canadian Conference on Computational
Geometry (CCCG’01), 181–84, 2001.
ieee: V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,”
in Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01),
2001, pp. 181–184.
mla: Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.”
Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01),
2001, pp. 181–84.
short: 'V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference
on Computational Geometry (CCCG’01), 2001, pp. 181–184.'
date_created: 2020-08-24T11:33:12Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
page: 181-184
publication: Proceedings of the 13th Canadian Conference on Computational Geometry
(CCCG'01)
status: public
title: Turing Computability of (Non-)Linear Optimization
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '18370'
abstract:
- lang: eng
text: We present a new approximate occlusion-culling algorithm that in contrast
to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For
generating a frame, as far as possible only the visible objects are rendered that
can be found quickly by an edge of the graph. The algorithm allows a real-time
navigation with over 20 frames per second in complex scenes consisting of over
10 millions of polygons. Moreover, approximation errors are very low.
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the
3D-Sectorgraph. In: Proc. of 3. GI-Informatiktage 2001. Bad Schussenried;
2001:275-278.'
apa: Klein, J., & Fischer, M. (2001). Occlusion Culling for Virtual Environments
based on the 3D-Sectorgraph. In Proc. of 3. GI-Informatiktage 2001 (pp.
275–278). Bad Schussenried.
bibtex: '@inproceedings{Klein_Fischer_2001, place={Bad Schussenried}, title={Occlusion
Culling for Virtual Environments based on the 3D-Sectorgraph}, booktitle={Proc.
of 3. GI-Informatiktage 2001}, author={Klein, Jan and Fischer, Matthias}, year={2001},
pages={275–278} }'
chicago: Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments
Based on the 3D-Sectorgraph.” In Proc. of 3. GI-Informatiktage 2001, 275–78.
Bad Schussenried, 2001.
ieee: J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based
on the 3D-Sectorgraph,” in Proc. of 3. GI-Informatiktage 2001, 2001, pp.
275–278.
mla: Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments
Based on the 3D-Sectorgraph.” Proc. of 3. GI-Informatiktage 2001, 2001,
pp. 275–78.
short: 'J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried,
2001, pp. 275–278.'
date_created: 2020-08-26T13:08:24Z
date_updated: 2022-01-06T06:53:30Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T13:08:08Z
date_updated: 2020-08-26T13:08:08Z
file_id: '18371'
file_name: hni-id-1450.pdf
file_size: 146136
relation: main_file
success: 1
file_date_updated: 2020-08-26T13:08:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 275 - 278
place: Bad Schussenried
publication: Proc. of 3. GI-Informatiktage 2001
status: public
title: Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '16492'
abstract:
- lang: eng
text: We present a new output-sensitive rendering algorithm, the randomized z-buffer
algorithm. It renders an image of an arbitrary three-dimensional scene consisting
of triangular primitives by reconstruction from a dynamically chosen set of random
surface sample points. This approach is independent of mesh connectivity and topology.
The resulting rendering time grows only logarithmically with the numbers of triangles
in the scene. We were able to render walkthroughs of scenes of up to 10^14 triangles
at interactive frame rates. Automatic identification of low detail scene components
ensures that the rendering speed of the randomized z-buffer cannot drop below
that of conventional z-buffer rendering. Experimental and analytical evidence
is given that the image quality is comparable to that of common approaches like
z-buffer rendering. The precomputed data structures employed by the randomized
z-buffer allow for interactive dynamic updates of the scene. Their memory requirements
grow only linearly with the number of triangles and allow for a scene graph based
instantiation scheme to further reduce memory consumption.
author:
- first_name: Michael
full_name: Wand, Michael
last_name: Wand
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Ingmar
full_name: Peter, Ingmar
last_name: Peter
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Wolfgang
full_name: Straßer, Wolfgang
last_name: Straßer
citation:
ama: 'Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized
z-buffer algorithm. In: Proceedings of the 28th Annual Conference on Computer
Graphics and Interactive Techniques - SIGGRAPH ’01. ; 2001. doi:10.1145/383259.383299'
apa: Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., & Straßer, W.
(2001). The randomized z-buffer algorithm. In Proceedings of the 28th annual
conference on Computer graphics and interactive techniques - SIGGRAPH ’01.
https://doi.org/10.1145/383259.383299
bibtex: '@inproceedings{Wand_Fischer_Peter_Meyer auf der Heide_Straßer_2001, title={The
randomized z-buffer algorithm}, DOI={10.1145/383259.383299},
booktitle={Proceedings of the 28th annual conference on Computer graphics and
interactive techniques - SIGGRAPH ’01}, author={Wand, Michael and Fischer, Matthias
and Peter, Ingmar and Meyer auf der Heide, Friedhelm and Straßer, Wolfgang}, year={2001}
}'
chicago: Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der
Heide, and Wolfgang Straßer. “The Randomized Z-Buffer Algorithm.” In Proceedings
of the 28th Annual Conference on Computer Graphics and Interactive Techniques
- SIGGRAPH ’01, 2001. https://doi.org/10.1145/383259.383299.
ieee: M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The
randomized z-buffer algorithm,” in Proceedings of the 28th annual conference
on Computer graphics and interactive techniques - SIGGRAPH ’01, 2001.
mla: Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” Proceedings of
the 28th Annual Conference on Computer Graphics and Interactive Techniques -
SIGGRAPH ’01, 2001, doi:10.1145/383259.383299.
short: 'M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings
of the 28th Annual Conference on Computer Graphics and Interactive Techniques
- SIGGRAPH ’01, 2001.'
date_created: 2020-04-09T10:36:54Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1145/383259.383299
language:
- iso: eng
publication: Proceedings of the 28th annual conference on Computer graphics and interactive
techniques - SIGGRAPH '01
publication_identifier:
isbn:
- 158113374X
publication_status: published
status: public
title: The randomized z-buffer algorithm
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '16493'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Meyer auf der Heide F. Data Management in Networks. In: Graph-Theoretic
Concepts in Computer Science. Vol 2204. Lecture Notes in Computer Science.
Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2'
apa: Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic
Concepts in Computer Science (Vol. 2204). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_2
bibtex: '@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={
Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204},
DOI={10.1007/3-540-45477-2_2},
booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der
Heide, Friedhelm}, year={2001}, collection={ Lecture Notes in Computer Science}
}'
chicago: Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In Graph-Theoretic
Concepts in Computer Science, Vol. 2204. Lecture Notes in Computer Science.
Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45477-2_2.
ieee: F. Meyer auf der Heide, “Data Management in Networks,” in Graph-Theoretic
Concepts in Computer Science, vol. 2204, Berlin, Heidelberg, 2001.
mla: Meyer auf der Heide, Friedhelm. “Data Management in Networks.” Graph-Theoretic
Concepts in Computer Science, vol. 2204, 2001, doi:10.1007/3-540-45477-2_2.
short: 'F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science,
Berlin, Heidelberg, 2001.'
date_created: 2020-04-09T10:40:48Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/3-540-45477-2_2
intvolume: ' 2204'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Graph-Theoretic Concepts in Computer Science
publication_identifier:
isbn:
- '9783540427070'
- '9783540454779'
issn:
- 0302-9743
publication_status: published
series_title: ' Lecture Notes in Computer Science'
status: public
title: Data Management in Networks
type: book_chapter
user_id: '15415'
volume: 2204
year: '2001'
...
---
_id: '16494'
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. Parallel Bridging Models and Their Impact
on Algorithm Design. In: Computational Science - ICCS 2001. Berlin, Heidelberg;
2001. doi:10.1007/3-540-45718-6_68'
apa: Meyer auf der Heide, F., & Wanka, R. (2001). Parallel Bridging Models and
Their Impact on Algorithm Design. In Computational Science - ICCS 2001.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_68
bibtex: '@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel
Bridging Models and Their Impact on Algorithm Design}, DOI={10.1007/3-540-45718-6_68},
booktitle={Computational Science - ICCS 2001}, author={Meyer auf der Heide, Friedhelm
and Wanka, Rolf}, year={2001} }'
chicago: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models
and Their Impact on Algorithm Design.” In Computational Science - ICCS 2001.
Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45718-6_68.
ieee: F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact
on Algorithm Design,” in Computational Science - ICCS 2001, Berlin, Heidelberg,
2001.
mla: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and
Their Impact on Algorithm Design.” Computational Science - ICCS 2001, 2001,
doi:10.1007/3-540-45718-6_68.
short: 'F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001,
Berlin, Heidelberg, 2001.'
date_created: 2020-04-09T10:51:36Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/3-540-45718-6_68
language:
- iso: eng
place: Berlin, Heidelberg
publication: Computational Science - ICCS 2001
publication_identifier:
isbn:
- '9783540422334'
- '9783540457183'
issn:
- 0302-9743
publication_status: published
status: public
title: Parallel Bridging Models and Their Impact on Algorithm Design
type: book_chapter
user_id: '15415'
year: '2001'
...
---
_id: '16722'
citation:
ama: 'Meyer auf der Heide F, ed. Algorithms — ESA 2001, 9th Annual European Symposium
Århus, Denmark. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin,
Heidelberg: Springer ; 2001. doi:10.1007/3-540-44676-1'
apa: 'Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS,
volume 2161)). Berlin, Heidelberg: Springer . https://doi.org/10.1007/3-540-44676-1'
bibtex: '@book{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, edition={Lecture
Notes in Computer Science (LNCS, volume 2161)}, title={Algorithms — ESA 2001,
9th Annual European Symposium Århus, Denmark}, DOI={10.1007/3-540-44676-1},
publisher={Springer }, year={2001} }'
chicago: 'Meyer auf der Heide, Friedhelm, ed. Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS,
Volume 2161). Berlin, Heidelberg: Springer , 2001. https://doi.org/10.1007/3-540-44676-1.'
ieee: 'F. Meyer auf der Heide, Ed., Algorithms — ESA 2001, 9th Annual European
Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, Volume
2161). Berlin, Heidelberg: Springer , 2001.'
mla: Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS,
Volume 2161), Springer , 2001, doi:10.1007/3-540-44676-1.
short: F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium
Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer
, Berlin, Heidelberg, 2001.
date_created: 2020-04-17T10:59:08Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-44676-1
edition: Lecture Notes in Computer Science (LNCS, volume 2161)
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783540424932'
- '9783540446767'
issn:
- 0302-9743
publication_status: published
publisher: 'Springer '
status: public
title: Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark
type: book_editor
user_id: '15415'
year: '2001'
...
---
_id: '19620'
author:
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
citation:
ama: Rieping I. Communication in Parallel Systems-Models, Algorithms and Implementations.
Vol 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.
apa: Rieping, I. (2000). Communication in Parallel Systems-Models, Algorithms
and Implementations (Vol. 81). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.
bibtex: '@book{Rieping_2000, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Communication in Parallel Systems-Models, Algorithms and Implementations},
volume={81}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Rieping, Ingo}, year={2000}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn} }'
chicago: Rieping, Ingo. Communication in Parallel Systems-Models, Algorithms
and Implementations. Vol. 81. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
ieee: I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations,
vol. 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
mla: Rieping, Ingo. Communication in Parallel Systems-Models, Algorithms and
Implementations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2000.
short: I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
date_created: 2020-09-22T10:06:31Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 81'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-80-9
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: Communication in Parallel Systems-Models, Algorithms and Implementations
type: dissertation
user_id: '5786'
volume: 81
year: '2000'
...