---
_id: '16568'
abstract:
- lang: eng
text: "We present a data structure problem which describes the requirements of a
simple variant of fully dynamic walk-through animation: We assume the scene to
consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily
large and has to be stored in secondary memory (discs) with relatively slow access.
We allow a visitor to walk in the scene, and a modeler to update the scene by
insertions and deletions of balls. We focus on the realtime requirement of animation
systems: For some t (specified by the computation power of (the rendering hardware
of) the graphic workstation) the data structure has to guarantee that the balls
within distance t of the current visitor's position are presented to the rendering
hardware, 20 times per second. Insertions and deletions should also be available
to the visitor with small delay, independent of the size of the scene. We present
a data structure that fulfills the above task in realtime. Its runtime is output-sensitive,
i.e. linear in a quantity close to the output size of the query. We further present
(preliminary) experimental results indicating that our structure is efficient
in practice.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Willy-Bernhard
full_name: Strothmann, Willy-Bernhard
last_name: Strothmann
citation:
ama: 'Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures
for realtime management of large geometric scenes. In: 5th Annual European
Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science.
Springer; 1997:157-170. doi:10.1007/3-540-63397-9_13'
apa: Fischer, M., Meyer auf der Heide, F., & Strothmann, W.-B. (1997). Dynamic
data structures for realtime management of large geometric scenes. 5th Annual
European Symposium on Algorithms (ESA ’97), 1284, 157–170. https://doi.org/10.1007/3-540-63397-9_13
bibtex: '@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin,
Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures
for realtime management of large geometric scenes}, volume={1284}, DOI={10.1007/3-540-63397-9_13},
booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer},
author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard},
year={1997}, pages={157–170}, collection={Lecture Notes in Computer Science} }'
chicago: 'Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann.
“Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In
5th Annual European Symposium on Algorithms (ESA ’97), 1284:157–70. Lecture
Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. https://doi.org/10.1007/3-540-63397-9_13.'
ieee: 'M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures
for realtime management of large geometric scenes,” in 5th Annual European
Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 157–170, doi: 10.1007/3-540-63397-9_13.'
mla: Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management
of Large Geometric Scenes.” 5th Annual European Symposium on Algorithms (ESA
’97), vol. 1284, Springer, 1997, pp. 157–70, doi:10.1007/3-540-63397-9_13.
short: 'M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European
Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 157–170.'
date_created: 2020-04-15T11:44:36Z
date_updated: 2026-02-23T16:05:33Z
department:
- _id: '63'
doi: 10.1007/3-540-63397-9_13
intvolume: ' 1284'
language:
- iso: eng
page: 157-170
place: Berlin, Heidelberg
publication: 5th Annual European Symposium on Algorithms (ESA '97)
publication_identifier:
isbn:
- '9783540633976'
- '9783540695363'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Dynamic data structures for realtime management of large geometric scenes
type: conference
user_id: '14972'
volume: 1284
year: '1997'
...
---
_id: '19958'
author:
- first_name: Frank
full_name: Schwarze, Frank
last_name: Schwarze
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Klaus
full_name: Schröder, Klaus
last_name: Schröder
citation:
ama: Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical
Crossbars (Extended Abstract). Euro-Par 1996. 1996;I:299-306.
apa: Schwarze, F., Meyer auf der Heide, F., & Schröder, K. (1996). Routing on
Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996, I,
299–306.
bibtex: '@article{Schwarze_Meyer auf der Heide_Schröder_1996, title={Routing on
Networks of Optical Crossbars (Extended Abstract).}, volume={I}, journal={Euro-Par
1996}, author={Schwarze, Frank and Meyer auf der Heide, Friedhelm and Schröder,
Klaus}, year={1996}, pages={299–306} }'
chicago: 'Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing
on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996 I
(1996): 299–306.'
ieee: F. Schwarze, F. Meyer auf der Heide, and K. Schröder, “Routing on Networks
of Optical Crossbars (Extended Abstract).,” Euro-Par 1996, vol. I, pp.
299–306, 1996.
mla: Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended
Abstract).” Euro-Par 1996, vol. I, 1996, pp. 299–306.
short: F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996)
299–306.
date_created: 2020-10-08T12:04:41Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
language:
- iso: eng
page: 299-306
publication: Euro-Par 1996
status: public
title: Routing on Networks of Optical Crossbars (Extended Abstract).
type: journal_article
user_id: '15415'
volume: I
year: '1996'
...
---
_id: '17418'
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.; 1996.
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1996). Contention
Resolution in Hashing Based Shared Memory Simulations.
bibtex: '@book{Czumaj_Meyer auf der Heide_Stemann_1996, series={Technical Report
SFB, University of Paderborn}, title={Contention Resolution in Hashing Based Shared
Memory Simulations}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm
and Stemann, Volker}, year={1996}, collection={Technical Report SFB, University
of Paderborn} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. Contention
Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB,
University of Paderborn, 1996.
ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, Contention Resolution
in Hashing Based Shared Memory Simulations. 1996.
mla: Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory
Simulations. 1996.
short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing
Based Shared Memory Simulations, 1996.
date_created: 2020-07-27T13:03:41Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
language:
- iso: eng
report_number: tr-rsfb-96-005
series_title: Technical Report SFB, University of Paderborn
status: public
title: Contention Resolution in Hashing Based Shared Memory Simulations
type: report
user_id: '15415'
year: '1996'
...
---
_id: '17419'
abstract:
- lang: eng
text: We present a parallel algorithm for the rendering of complex three-dimensional
scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting
of a visualization-node, equipped with a powerful graphics adapter, and cluster
nodes requiring weaker graphics capabilities only. The visualization-node renders
a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes
assist the visualization-node by asynchronous computing of Reliefboards, which
are used to replace and render distant parts of the scene. Our algorithm is capable
of gaining significant speedups if the cluster's nodes provide weak graphics adapters
only. We trade the number of cluster nodes off the scene objects' image quality.
author:
- first_name: Dima
full_name: Grigoriev, Dima
last_name: Grigoriev
- first_name: Marek
full_name: Karpinski, Marek
last_name: Karpinski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Roman
full_name: Smolensky, Roman
last_name: Smolensky
citation:
ama: 'Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound
for randomized algebraic decision trees. In: Proc. of 28th ACM-STOC. Vol
65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics
and Visualization; 1996:612-621.'
apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R.
(1996). A lower bound for randomized algebraic decision trees. In Proc. of
28th ACM-STOC (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel
Graphics and Visualization.
bibtex: '@inproceedings{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1996,
series={Lecture Notes in Computer Science}, title={A lower bound for randomized
algebraic decision trees}, volume={65453}, booktitle={Proc. of 28th ACM-STOC},
publisher={Eurographics Symposium on Parallel Graphics and Visualization}, author={Grigoriev,
Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman},
year={1996}, pages={612–621}, collection={Lecture Notes in Computer Science} }'
chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman
Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc.
of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics
Symposium on Parallel Graphics and Visualization, 1996.
ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower
bound for randomized algebraic decision trees,” in Proc. of 28th ACM-STOC,
1996, vol. 65453, pp. 612–621.
mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”
Proc. of 28th ACM-STOC, vol. 65453, Eurographics Symposium on Parallel
Graphics and Visualization, 1996, pp. 612–21.
short: 'D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc.
of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization,
1996, pp. 612–621.'
date_created: 2020-07-27T13:09:09Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
intvolume: ' 65453'
language:
- iso: eng
page: 612-621
publication: Proc. of 28th ACM-STOC
publisher: Eurographics Symposium on Parallel Graphics and Visualization
series_title: Lecture Notes in Computer Science
status: public
title: A lower bound for randomized algebraic decision trees
type: conference
user_id: '15415'
volume: 65453
year: '1996'
...
---
_id: '17483'
abstract:
- lang: eng
text: "In this paper we develop a model for communication time on parallel computers
consisting of processors and a service network, i.e., a network performing services
like broadcast, synchronization, and global variables. The implementation of the
service network is done on a free configurable Transputer network.\r\nOur cost
model describes the communication time of accesses to global variables and consists
of a multi-linear function. The cost model includes the parameters packet size,
send hot spot, and the number of processors accessing global variables. These
parameters influence the communication time in a high degree and capture important
parameters like contention.\r\nWe implement a Bitonic Sort and a Connected Components
algorithm (among others) and we show that our model is able to predict the communication
time within a 10% error if indirect service networks are used. The applications
show that it is easy for a programmer to determine the parameter values for our
model and that our new cost model precisely predicts the communication time of
parallel algorithms.\r\nFurthermore, we minimize the communication time of accesses
to global variables by finding a balance between the number of messages in the
network and their size. Our model predicts the optimal values for these parameters
which we validate by experiments. A modified implementation of our routing which
determines on-line the optimal parameter values for an access to a global variable
achieves good speed ups."
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Jochen
full_name: Rethmann, Jochen
last_name: Rethmann
- first_name: Alf
full_name: Wachsmann, Alf
last_name: Wachsmann
citation:
ama: 'Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication
Time in Parallel Programs. In: 3rd Workshop on Abstract Machine Models for
Parallel and Distributed Computing (AMW ’96). Amsterdam: IOS Press; 1996:13–27.'
apa: 'Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model
for the Communication Time in Parallel Programs. In 3rd Workshop on Abstract
Machine Models for Parallel and Distributed Computing (AMW ’96) (pp. 13–27).
Amsterdam: IOS Press.'
bibtex: '@inproceedings{Fischer_Rethmann_Wachsmann_1996, place={Amsterdam}, title={A
Realistic Cost Model for the Communication Time in Parallel Programs}, booktitle={3rd
Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW
’96)}, publisher={IOS Press}, author={Fischer, Matthias and Rethmann, Jochen and
Wachsmann, Alf}, year={1996}, pages={13–27} }'
chicago: 'Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “A Realistic Cost
Model for the Communication Time in Parallel Programs.” In 3rd Workshop on
Abstract Machine Models for Parallel and Distributed Computing (AMW ’96),
13–27. Amsterdam: IOS Press, 1996.'
ieee: M. Fischer, J. Rethmann, and A. Wachsmann, “A Realistic Cost Model for the
Communication Time in Parallel Programs,” in 3rd Workshop on Abstract Machine
Models for Parallel and Distributed Computing (AMW ’96), 1996, pp. 13–27.
mla: Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time
in Parallel Programs.” 3rd Workshop on Abstract Machine Models for Parallel
and Distributed Computing (AMW ’96), IOS Press, 1996, pp. 13–27.
short: 'M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine
Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam,
1996, pp. 13–27.'
date_created: 2020-07-30T14:45:12Z
date_updated: 2022-01-06T06:53:13Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T10:15:36Z
date_updated: 2020-08-26T10:15:36Z
file_id: '18354'
file_name: hni-1454.pdf
file_size: 285707
relation: main_file
success: 1
file_date_updated: 2020-08-26T10:15:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 13–27
place: Amsterdam
publication: 3rd Workshop on Abstract Machine Models for Parallel and Distributed
Computing (AMW '96)
publication_identifier:
isbn:
- 905199267X
publisher: IOS Press
status: public
title: A Realistic Cost Model for the Communication Time in Parallel Programs
type: conference
user_id: '15415'
year: '1996'
...
---
_id: '17564'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
- first_name: Wolfgang
full_name: Dittrich, Wolfgang
last_name: Dittrich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
citation:
ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel
algorithms: Priority queue operations and selection for the BSP* Model. In: Lecture
Notes in Computer Science. Berlin, Heidelberg; 1996:369-376. doi:10.1007/bfb0024725'
apa: 'Bäumker, A., Dittrich, W., Meyer auf der Heide, F., & Rieping, I. (1996).
Realistic parallel algorithms: Priority queue operations and selection for the
BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin,
Heidelberg. https://doi.org/10.1007/bfb0024725'
bibtex: '@inbook{Bäumker_Dittrich_Meyer auf der Heide_Rieping_1996, place={Berlin,
Heidelberg}, title={Realistic parallel algorithms: Priority queue operations and
selection for the BSP* Model}, DOI={10.1007/bfb0024725},
booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich,
Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={1996}, pages={369–376}
}'
chicago: 'Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and
Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection
for the BSP* Model.” In Lecture Notes in Computer Science, 369–76. Berlin,
Heidelberg, 1996. https://doi.org/10.1007/bfb0024725.'
ieee: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic
parallel algorithms: Priority queue operations and selection for the BSP* Model,”
in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.'
mla: 'Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations
and Selection for the BSP* Model.” Lecture Notes in Computer Science, 1996,
pp. 369–76, doi:10.1007/bfb0024725.'
short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture
Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.'
date_created: 2020-08-03T13:11:02Z
date_updated: 2022-01-06T06:53:15Z
department:
- _id: '63'
doi: 10.1007/bfb0024725
language:
- iso: eng
page: 369-376
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540616276'
- '9783540706366'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Realistic parallel algorithms: Priority queue operations and selection for
the BSP* Model'
type: book_chapter
user_id: '15415'
year: '1996'
...
---
_id: '18352'
abstract:
- lang: eng
text: "In this report, we develop a cost model for the communication time on parallel
computers consisting of processors and a service network, i.e., a network performing
services like broadcast, synchronization, and global variables. Because we do
not have a parallel computer at our disposal that is equipped with a service network,
we emulate the service network on a reconfigurable Transputer network.\r\nOur
cost model describes the communication time of accesses to global variables and
consists of a multilinear function. The cost model includes the parameters packet
size, send hot spot (the number of messages sent out by one processor), and number
of processors accessing global variables. We show that these parameters influence
the communication time in a high degree and capture important parameters like
network contention.\r\nWe implement a Bitonic Sort, Sample Sort, Matrix Multiplication,
and Connected Components algorithm, and we show that our model is able to predict
the communication time within a 10% error if indirect service networks are used.
The applications show that it is easy for a programer to determine the parameter
values for our model and that our new cost model precisely predicts the communication
time of parallel algorithms.\r\nWe explore the interaction of hot spots and asynchrony
and show that the influence of hot spots to the communication time is not as high
as one would expect from theoretical considerations in a synchronous model. Therefore,
we do not apprehend the hot spot in our cost model.\r\nFurthermore, we minimize
the communication time of accesses to global variables by finding a balance between
the number of messages in the network and their size. Our model predicts the optimal
values for these parameters which we validate by experiments. A modified implementation
of our routing which determines online the optimal parameter values for an access
to a global variable achieves good speed ups.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Jochen
full_name: Rethmann, Jochen
last_name: Rethmann
- first_name: Alf
full_name: Wachsmann, Alf
last_name: Wachsmann
citation:
ama: Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication
Time in Parallel Programs on Parallel Computers Using a Service Hardware.
Universität Paderborn; 1996.
apa: Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost
Model for the Communication Time in Parallel Programs on Parallel Computers Using
a Service Hardware. Universität Paderborn.
bibtex: '@book{Fischer_Rethmann_Wachsmann_1996, place={Universität Paderborn}, title={A
Realistic Cost Model for the Communication Time in Parallel Programs on Parallel
Computers Using a Service Hardware}, author={Fischer, Matthias and Rethmann, Jochen
and Wachsmann, Alf}, year={1996} }'
chicago: Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. A Realistic Cost
Model for the Communication Time in Parallel Programs on Parallel Computers Using
a Service Hardware. Universität Paderborn, 1996.
ieee: M. Fischer, J. Rethmann, and A. Wachsmann, A Realistic Cost Model for the
Communication Time in Parallel Programs on Parallel Computers Using a Service
Hardware. Universität Paderborn, 1996.
mla: Fischer, Matthias, et al. A Realistic Cost Model for the Communication Time
in Parallel Programs on Parallel Computers Using a Service Hardware. 1996.
short: M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication
Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität
Paderborn, 1996.
date_created: 2020-08-26T10:06:31Z
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-26T10:05:35Z
date_updated: 2020-08-26T10:05:35Z
file_id: '18353'
file_name: tr-rsfb-96-007.pdf
file_size: 519632
relation: main_file
success: 1
file_date_updated: 2020-08-26T10:05:35Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
status: public
title: A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel
Computers Using a Service Hardware
type: report
user_id: '15415'
year: '1996'
...
---
_id: '2181'
author:
- first_name: Christian
full_name: Scheideler, Christian
last_name: Scheideler
citation:
ama: Scheideler C. Universal Routing Strategies. University of Paderborn,
Germany; 1996.
apa: Scheideler, C. (1996). Universal routing strategies. University of Paderborn,
Germany.
bibtex: '@book{Scheideler_1996, title={Universal routing strategies}, publisher={University
of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }'
chicago: Scheideler, Christian. Universal Routing Strategies. University
of Paderborn, Germany, 1996.
ieee: C. Scheideler, Universal routing strategies. University of Paderborn,
Germany, 1996.
mla: Scheideler, Christian. Universal Routing Strategies. University of Paderborn,
Germany, 1996.
short: C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany,
1996.
date_created: 2018-04-03T09:29:45Z
date_updated: 2022-01-06T06:55:15Z
department:
- _id: '79'
- _id: '63'
language:
- iso: eng
publisher: University of Paderborn, Germany
status: public
title: Universal routing strategies
type: dissertation
user_id: '14955'
year: '1996'
...
---
_id: '2182'
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
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy
to Speed up Randomized Shared Memory Simulations. Theor Comput Sci. 1996;(2):245--281.
doi:10.1016/0304-3975(96)00032-1
apa: Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting
Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor.
Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1
bibtex: '@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting
Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={10.1016/0304-3975(96)00032-1},
number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281}
}'
chicago: 'Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann.
“Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”
Theor. Comput. Sci., no. 2 (1996): 245--281. https://doi.org/10.1016/0304-3975(96)00032-1.'
ieee: F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage
Redundancy to Speed up Randomized Shared Memory Simulations,” Theor. Comput.
Sci., no. 2, pp. 245--281, 1996.
mla: Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed
up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996,
pp. 245--281, doi:10.1016/0304-3975(96)00032-1.
short: F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996)
245--281.
date_created: 2018-04-03T09:30:20Z
date_updated: 2022-01-06T06:55:16Z
department:
- _id: '79'
- _id: '63'
doi: 10.1016/0304-3975(96)00032-1
issue: '2'
language:
- iso: eng
page: 245--281
publication: Theor. Comput. Sci.
status: public
title: Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
type: journal_article
user_id: '14955'
year: '1996'
...
---
_id: '2183'
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. In: FOCS. ; 1996:370--379.'
apa: 'Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing
with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp.
370--379).'
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1996, title={Deterministic
Routing with Bounded Buffers: Turning Offline into Online Protocols}, booktitle={FOCS},
author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996},
pages={370--379} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic
Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS,
370--379, 1996.'
ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded
Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379.'
mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996,
pp. 370--379.'
short: 'F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.'
date_created: 2018-04-03T09:31:52Z
date_updated: 2022-01-06T06:55:17Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:01:11Z
date_updated: 2018-04-12T07:10:17Z
file_id: '2281'
file_name: FOCS96.pdf
file_size: 248409
relation: main_file
file_date_updated: 2018-04-12T07:10:17Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 370--379
publication: FOCS
status: public
title: 'Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols'
type: conference
urn: '21832'
user_id: '14955'
year: '1996'
...
---
_id: '2184'
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. Communication in Parallel Systems. In:
SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.'
apa: Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel
Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1996, series={Lecture Notes
in Computer Science}, title={Communication in Parallel Systems}, volume={1175},
booktitle={SOFSEM}, publisher={Springer}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian}, year={1996}, pages={16--33}, collection={Lecture Notes
in Computer Science} }'
chicago: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication
in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer
Science. Springer, 1996.
ieee: F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,”
in SOFSEM, 1996, vol. 1175, pp. 16--33.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in
Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.
short: 'F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.'
date_created: 2018-04-03T09:32:47Z
date_updated: 2022-01-06T06:55:17Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:01:59Z
date_updated: 2018-04-12T07:10:36Z
file_id: '2282'
file_name: SOFSEM96.pdf
file_size: 597639
relation: main_file
file_date_updated: 2018-04-12T07:10:36Z
has_accepted_license: '1'
intvolume: ' 1175'
language:
- iso: eng
oa: '1'
page: 16--33
publication: SOFSEM
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Communication in Parallel Systems
type: conference
urn: '21840'
user_id: '14955'
volume: 1175
year: '1996'
...
---
_id: '2186'
author:
- first_name: Robert
full_name: Cypher, Robert
last_name: Cypher
- 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
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms
for Store-and-Forward and Wormhole Routing. In: STOC. ACM; 1996:356--365.'
apa: Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996).
Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC
(pp. 356--365). ACM.
bibtex: '@inproceedings{Cypher_Meyer auf der Heide_Scheideler_Vöcking_1996, title={Universal
Algorithms for Store-and-Forward and Wormhole Routing}, booktitle={STOC}, publisher={ACM},
author={Cypher, Robert and Meyer auf der Heide, Friedhelm and Scheideler, Christian
and Vöcking, Berthold}, year={1996}, pages={356--365} }'
chicago: Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and
Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.”
In STOC, 356--365. ACM, 1996.
ieee: R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal
Algorithms for Store-and-Forward and Wormhole Routing,” in STOC, 1996,
pp. 356--365.
mla: Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole
Routing.” STOC, ACM, 1996, pp. 356--365.
short: 'R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC,
ACM, 1996, pp. 356--365.'
date_created: 2018-04-03T09:39:17Z
date_updated: 2022-01-06T06:55:18Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T06:58:59Z
date_updated: 2018-04-12T07:11:03Z
file_id: '2280'
file_name: STOC96.pdf
file_size: 700595
relation: main_file
file_date_updated: 2018-04-12T07:11:03Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 356--365
publication: STOC
publisher: ACM
status: public
title: Universal Algorithms for Store-and-Forward and Wormhole Routing
type: conference
urn: '21868'
user_id: '14955'
year: '1996'
...
---
_id: '16698'
author:
- first_name: Foued
full_name: Ameur, Foued
last_name: Ameur
- first_name: Paul
full_name: Fischer, Paul
last_name: Fischer
- first_name: Klaus -U.
full_name: Höffgen, Klaus -U.
last_name: Höffgen
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Ameur F, Fischer P, Höffgen K-U, Meyer auf der Heide F. Trial and error. A
new approach to space-bounded learning. Acta Informatica. 1996:621-630.
doi:10.1007/bf03036467
apa: Ameur, F., Fischer, P., Höffgen, K.-U., & Meyer auf der Heide, F. (1996).
Trial and error. A new approach to space-bounded learning. Acta Informatica,
621–630. https://doi.org/10.1007/bf03036467
bibtex: '@article{Ameur_Fischer_Höffgen_Meyer auf der Heide_1996, title={Trial and
error. A new approach to space-bounded learning}, DOI={10.1007/bf03036467},
journal={Acta Informatica}, author={Ameur, Foued and Fischer, Paul and Höffgen,
Klaus -U. and Meyer auf der Heide, Friedhelm}, year={1996}, pages={621–630} }'
chicago: Ameur, Foued, Paul Fischer, Klaus -U. Höffgen, and Friedhelm Meyer auf
der Heide. “Trial and Error. A New Approach to Space-Bounded Learning.” Acta
Informatica, 1996, 621–30. https://doi.org/10.1007/bf03036467.
ieee: F. Ameur, P. Fischer, K.-U. Höffgen, and F. Meyer auf der Heide, “Trial and
error. A new approach to space-bounded learning,” Acta Informatica, pp.
621–630, 1996.
mla: Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.”
Acta Informatica, 1996, pp. 621–30, doi:10.1007/bf03036467.
short: F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica
(1996) 621–630.
date_created: 2020-04-16T11:40:05Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bf03036467
language:
- iso: eng
page: 621-630
publication: Acta Informatica
publication_identifier:
issn:
- 0001-5903
- 1432-0525
publication_status: published
status: public
title: Trial and error. A new approach to space-bounded learning
type: journal_article
user_id: '15415'
year: '1996'
...
---
_id: '16699'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Brigitte
full_name: Oesterdiekhoff, Brigitte
last_name: Oesterdiekhoff
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution.
Algorithmica. Published online 1996:413-427. doi:10.1007/bf01955042
apa: Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1996). Strongly
adaptive token distribution. Algorithmica, 413–427. https://doi.org/10.1007/bf01955042
bibtex: '@article{Meyer auf der Heide_Oesterdiekhoff_Wanka_1996, title={Strongly
adaptive token distribution}, DOI={10.1007/bf01955042},
journal={Algorithmica}, author={Meyer auf der Heide, Friedhelm and Oesterdiekhoff,
Brigitte and Wanka, Rolf}, year={1996}, pages={413–427} }'
chicago: Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka.
“Strongly Adaptive Token Distribution.” Algorithmica, 1996, 413–27. https://doi.org/10.1007/bf01955042.
ieee: 'F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive
token distribution,” Algorithmica, pp. 413–427, 1996, doi: 10.1007/bf01955042.'
mla: Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.”
Algorithmica, 1996, pp. 413–27, doi:10.1007/bf01955042.
short: F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996)
413–427.
date_created: 2020-04-16T11:46:56Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bf01955042
language:
- iso: eng
page: 413-427
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
status: public
title: Strongly adaptive token distribution
type: journal_article
user_id: '15415'
year: '1996'
...
---
_id: '16700'
author:
- first_name: R. M.
full_name: Karp, R. M.
last_name: Karp
- first_name: M.
full_name: Luby, M.
last_name: Luby
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed
memory machine. Algorithmica. 1996:517-542. doi:10.1007/bf01940878
apa: Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1996). Efficient PRAM
simulation on a distributed memory machine. Algorithmica, 517–542. https://doi.org/10.1007/bf01940878
bibtex: '@article{Karp_Luby_Meyer auf der Heide_1996, title={Efficient PRAM simulation
on a distributed memory machine}, DOI={10.1007/bf01940878},
journal={Algorithmica}, author={Karp, R. M. and Luby, M. and Meyer auf der Heide,
Friedhelm}, year={1996}, pages={517–542} }'
chicago: Karp, R. M., M. Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM
Simulation on a Distributed Memory Machine.” Algorithmica, 1996, 517–42.
https://doi.org/10.1007/bf01940878.
ieee: R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation
on a distributed memory machine,” Algorithmica, pp. 517–542, 1996.
mla: Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.”
Algorithmica, 1996, pp. 517–42, doi:10.1007/bf01940878.
short: R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.
date_created: 2020-04-16T11:50:27Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bf01940878
language:
- iso: eng
page: 517-542
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
status: public
title: Efficient PRAM simulation on a distributed memory machine
type: journal_article
user_id: '15415'
year: '1996'
...
---
_id: '16701'
author:
- first_name: Joseph
full_name: Gil, Joseph
last_name: Gil
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Avi
full_name: Wigderson, Avi
last_name: Wigderson
citation:
ama: 'Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower
and Upper Bounds. SIAM Journal on Computing. 1996:936-955. doi:10.1137/s0097539793255722'
apa: 'Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1996). The Tree Model
for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 936–955.
https://doi.org/10.1137/s0097539793255722'
bibtex: '@article{Gil_Meyer auf der Heide_Wigderson_1996, title={The Tree Model
for Hashing: Lower and Upper Bounds}, DOI={10.1137/s0097539793255722},
journal={SIAM Journal on Computing}, author={Gil, Joseph and Meyer auf der Heide,
Friedhelm and Wigderson, Avi}, year={1996}, pages={936–955} }'
chicago: 'Gil, Joseph, Friedhelm Meyer auf der Heide, and Avi Wigderson. “The Tree
Model for Hashing: Lower and Upper Bounds.” SIAM Journal on Computing,
1996, 936–55. https://doi.org/10.1137/s0097539793255722.'
ieee: 'J. Gil, F. Meyer auf der Heide, and A. Wigderson, “The Tree Model for Hashing:
Lower and Upper Bounds,” SIAM Journal on Computing, pp. 936–955, 1996.'
mla: 'Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.”
SIAM Journal on Computing, 1996, pp. 936–55, doi:10.1137/s0097539793255722.'
short: J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996)
936–955.
date_created: 2020-04-16T11:53:57Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1137/s0097539793255722
language:
- iso: eng
page: 936-955
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: 'The Tree Model for Hashing: Lower and Upper Bounds'
type: journal_article
user_id: '15415'
year: '1996'
...
---
_id: '16702'
citation:
ama: Meyer auf der Heide F, Monien B, eds. Automata, Languages and Programming,
23rd International Colloquium, ICALP96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-61440-0
apa: Meyer auf der Heide, F., & Monien, B. (Eds.). (1996). Automata, Languages
and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg.
https://doi.org/10.1007/3-540-61440-0
bibtex: '@book{Meyer auf der Heide_Monien_1996, place={Berlin, Heidelberg}, title={Automata,
Languages and Programming, 23rd International Colloquium, ICALP96}, DOI={10.1007/3-540-61440-0},
year={1996} }'
chicago: Meyer auf der Heide, Friedhelm, and Burkhard Monien, eds. Automata,
Languages and Programming, 23rd International Colloquium, ICALP96. Berlin,
Heidelberg, 1996. https://doi.org/10.1007/3-540-61440-0.
ieee: F. Meyer auf der Heide and B. Monien, Eds., Automata, Languages and Programming,
23rd International Colloquium, ICALP96. Berlin, Heidelberg, 1996.
mla: Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. Automata,
Languages and Programming, 23rd International Colloquium, ICALP96. 1996, doi:10.1007/3-540-61440-0.
short: F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming,
23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.
date_created: 2020-04-16T13:25:51Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-61440-0
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783540614401'
- '9783540685807'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 23rd International Colloquium, ICALP96
type: book_editor
user_id: '15415'
year: '1996'
...
---
_id: '16703'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- 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: 'Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory
simulations. In: STACS 96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-60922-9_16'
apa: Berenbrink, P., Meyer auf der Heide, F., & Stemann, V. (1996). Fault-tolerant
shared memory simulations. In STACS 96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_16
bibtex: '@inbook{Berenbrink_Meyer auf der Heide_Stemann_1996, place={Berlin, Heidelberg},
title={Fault-tolerant shared memory simulations}, DOI={10.1007/3-540-60922-9_16},
booktitle={STACS 96}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm
and Stemann, Volker}, year={1996} }'
chicago: Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant
Shared Memory Simulations.” In STACS 96. Berlin, Heidelberg, 1996. https://doi.org/10.1007/3-540-60922-9_16.
ieee: P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared
memory simulations,” in STACS 96, Berlin, Heidelberg, 1996.
mla: Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” STACS
96, 1996, doi:10.1007/3-540-60922-9_16.
short: 'P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin,
Heidelberg, 1996.'
date_created: 2020-04-16T13:32:22Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-60922-9_16
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 96
publication_identifier:
isbn:
- '9783540609223'
- '9783540497233'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Fault-tolerant shared memory simulations
type: book_chapter
user_id: '15415'
year: '1996'
...
---
_id: '19623'
author:
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations.
Vol 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.
apa: Stemann, V. (1995). Contention Resolution in Hashing Based Shared Memory
Simulations (Vol. 3). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Stemann_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Contention Resolution in Hashing Based Shared Memory Simulations},
volume={3}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Stemann, Volker}, year={1995}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn} }'
chicago: Stemann, Volker. Contention Resolution in Hashing Based Shared Memory
Simulations. Vol. 3. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
ieee: V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations,
vol. 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
mla: Stemann, Volker. Contention Resolution in Hashing Based Shared Memory Simulations.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
short: V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
date_created: 2020-09-22T12:28:47Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 3'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-02-7
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: Contention Resolution in Hashing Based Shared Memory Simulations
type: dissertation
user_id: '5786'
volume: 3
year: '1995'
...
---
_id: '19627'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: 'Czumaj A. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations.
Vol 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.'
apa: 'Czumaj, A. (1995). Parallel Algorithmic Techniques: PRAM Algorithms and
PRAM Simulations (Vol. 8). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.'
bibtex: '@book{Czumaj_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations},
volume={8}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Czumaj, Artur}, year={1995}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn} }'
chicago: 'Czumaj, Artur. Parallel Algorithmic Techniques: PRAM Algorithms and
PRAM Simulations. Vol. 8. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.'
ieee: 'A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations,
vol. 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.'
mla: 'Czumaj, Artur. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM
Simulations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
1995.'
short: 'A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.'
date_created: 2020-09-22T12:38:29Z
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-22T12:38:15Z
date_updated: 2020-09-22T12:38:15Z
file_id: '19629'
file_name: pub-hni-441.pdf
file_size: 801624
relation: main_file
success: 1
file_date_updated: 2020-09-22T12:38:15Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-07-8
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: 'Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations'
type: dissertation
user_id: '5786'
volume: 8
year: '1995'
...