---
_id: '19630'
author:
- first_name: Alf
full_name: Wachsmann, Alf
last_name: Wachsmann
citation:
ama: 'Wachsmann A. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing,
Synchronisation, Gemeinsamer Speicher. Vol 6. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn; 1995.'
apa: 'Wachsmann, A. (1995). Eine Bibliothek von Basisdiensten für Parallelrechner:
Routing, Synchronisation, gemeinsamer Speicher (Vol. 6). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.'
bibtex: '@book{Wachsmann_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Eine Bibliothek von Basisdiensten für Parallelrechner: Routing,
Synchronisation, gemeinsamer Speicher}, volume={6}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Wachsmann, Alf}, year={1995},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: 'Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner:
Routing, Synchronisation, Gemeinsamer Speicher. Vol. 6. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 1995.'
ieee: 'A. Wachsmann, Eine Bibliothek von Basisdiensten für Parallelrechner: Routing,
Synchronisation, gemeinsamer Speicher, vol. 6. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 1995.'
mla: 'Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner:
Routing, Synchronisation, Gemeinsamer Speicher. Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn, 1995.'
short: 'A. Wachsmann, Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing,
Synchronisation, Gemeinsamer Speicher, Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 1995.'
date_created: 2020-09-22T12:40:46Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 6'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-05-1
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: 'Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation,
gemeinsamer Speicher'
type: dissertation
user_id: '5786'
volume: 6
year: '1995'
...
---
_id: '19634'
author:
- first_name: Foued
full_name: Ameur, Foued
last_name: Ameur
citation:
ama: Ameur F. Space-Bounded Learning Algorithms. Vol 10. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 1995.
apa: Ameur, F. (1995). Space-Bounded Learning Algorithms (Vol. 10). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Ameur_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Space-Bounded Learning Algorithms}, volume={10}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Ameur, Foued}, year={1995}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Ameur, Foued. Space-Bounded Learning Algorithms. Vol. 10. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 1995.
ieee: F. Ameur, Space-Bounded Learning Algorithms, vol. 10. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1995.
mla: Ameur, Foued. Space-Bounded Learning Algorithms. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1995.
short: F. Ameur, Space-Bounded Learning Algorithms, Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 1995.
date_created: 2020-09-22T12:50:36Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 10'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-09-4
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: Space-Bounded Learning Algorithms
type: dissertation
user_id: '5786'
volume: 10
year: '1995'
...
---
_id: '17482'
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. Simulating shared memory in real
time: On the computation power of reconfigurable meshes. In: Proceedings of
the 2nd IEEE Workshop on Reconfigurable Architectures. ; 1995:46--59.'
apa: 'Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Simulating
shared memory in real time: On the computation power of reconfigurable meshes.
In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures
(pp. 46--59).'
bibtex: '@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Simulating
shared memory in real time: On the computation power of reconfigurable meshes},
booktitle={Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures},
author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker},
year={1995}, pages={46--59} }'
chicago: 'Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating
Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.”
In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures,
46--59, 1995.'
ieee: 'A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating shared memory
in real time: On the computation power of reconfigurable meshes,” in Proceedings
of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.'
mla: 'Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation
Power of Reconfigurable Meshes.” Proceedings of the 2nd IEEE Workshop on Reconfigurable
Architectures, 1995, pp. 46--59.'
short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings of the 2nd
IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.'
date_created: 2020-07-30T14:09:45Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
language:
- iso: eng
page: 46--59
publication: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures
status: public
title: 'Simulating shared memory in real time: On the computation power of reconfigurable
meshes'
type: conference
user_id: '15415'
year: '1995'
...
---
_id: '2187'
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. Routing with Bounded Buffers and Hot-Potato
Routing in Vertex-Symmetric Networks. In: ESA. Lecture Notes in Computer
Science. ; 1995:341--354. doi:10.1007/3-540-60313-1_154'
apa: Meyer auf der Heide, F., & Scheideler, C. (1995). Routing with Bounded
Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp.
341--354). https://doi.org/10.1007/3-540-60313-1_154
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1995, series={Lecture Notes
in Computer Science}, title={Routing with Bounded Buffers and Hot-Potato Routing
in Vertex-Symmetric Networks}, DOI={10.1007/3-540-60313-1_154},
booktitle={ESA}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian},
year={1995}, pages={341--354}, collection={Lecture Notes in Computer Science}
}'
chicago: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with
Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” In ESA,
341--354. Lecture Notes in Computer Science, 1995. https://doi.org/10.1007/3-540-60313-1_154.
ieee: F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and
Hot-Potato Routing in Vertex-Symmetric Networks,” in ESA, 1995, pp. 341--354.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded
Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” ESA, 1995,
pp. 341--354, doi:10.1007/3-540-60313-1_154.
short: 'F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.'
date_created: 2018-04-03T09:40:55Z
date_updated: 2022-01-06T06:55:18Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1007/3-540-60313-1_154
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T06:57:17Z
date_updated: 2018-04-12T07:09:35Z
file_id: '2279'
file_name: ESA95.pdf
file_size: 177256
relation: main_file
file_date_updated: 2018-04-12T07:09:35Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 341--354
publication: ESA
series_title: Lecture Notes in Computer Science
status: public
title: Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
type: conference
urn: '21878'
user_id: '14955'
year: '1995'
...
---
_id: '2207'
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. Space-Efficient Routing in Vertex-Symmetric
Networks (Extended Abstract). In: SPAA. ; 1995:137--146.'
apa: Meyer auf der Heide, F., & Scheideler, C. (1995). Space-Efficient Routing
in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1995, title={Space-Efficient
Routing in Vertex-Symmetric Networks (Extended Abstract)}, booktitle={SPAA}, author={Meyer
auf der Heide, Friedhelm and Scheideler, Christian}, year={1995}, pages={137--146}
}'
chicago: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient
Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146,
1995.
ieee: F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric
Networks (Extended Abstract),” in SPAA, 1995, pp. 137--146.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient
Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995,
pp. 137--146.
short: 'F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.'
date_created: 2018-04-04T12:43:41Z
date_updated: 2022-01-06T06:55:24Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T06:56:32Z
date_updated: 2018-04-12T07:09:52Z
file_id: '2278'
file_name: SPAA95.pdf
file_size: 284222
relation: main_file
file_date_updated: 2018-04-12T07:09:52Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 137--146
publication: SPAA
status: public
title: Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)
type: conference
urn: '22075'
user_id: '14955'
year: '1995'
...
---
_id: '2208'
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. In: STACS. ; 1995:267--278.'
apa: Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1995). Exploiting
Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS
(pp. 267--278).
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_Stemann_1995, title={Exploiting
Storage Redundancy to Speed Up Randomized Shared Memory Simulations}, booktitle={STACS},
author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann,
Volker}, year={1995}, pages={267--278} }'
chicago: Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann.
“Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.”
In STACS, 267--278, 1995.
ieee: F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage
Redundancy to Speed Up Randomized Shared Memory Simulations,” in STACS,
1995, pp. 267--278.
mla: Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed
Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.
short: 'F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp.
267--278.'
date_created: 2018-04-04T12:44:26Z
date_updated: 2022-01-06T06:55:24Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T06:54:40Z
date_updated: 2018-04-12T07:09:13Z
file_id: '2277'
file_name: STACS95.pdf
file_size: 407467
relation: main_file
file_date_updated: 2018-04-12T07:09:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 267--278
publication: STACS
status: public
title: Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations
type: conference
urn: '22085'
user_id: '14955'
year: '1995'
...
---
_id: '16566'
author:
- first_name: Dany
full_name: Breslauer, Dany
last_name: Breslauer
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Devdatt P.
full_name: Dubhashi, Devdatt P.
last_name: Dubhashi
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison
model lower bounds to the parallel-random-access-machine. Information Processing
Letters. 1995:103-110. doi:10.1016/s0020-0190(97)00032-x
apa: Breslauer, D., Czumaj, A., Dubhashi, D. P., & Meyer auf der Heide, F. (1995).
Transforming comparison model lower bounds to the parallel-random-access-machine.
Information Processing Letters, 103–110. https://doi.org/10.1016/s0020-0190(97)00032-x
bibtex: '@article{Breslauer_Czumaj_Dubhashi_Meyer auf der Heide_1995, title={Transforming
comparison model lower bounds to the parallel-random-access-machine}, DOI={10.1016/s0020-0190(97)00032-x},
journal={Information Processing Letters}, author={Breslauer, Dany and Czumaj,
Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}, year={1995},
pages={103–110} }'
chicago: Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer
auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.”
Information Processing Letters, 1995, 103–10. https://doi.org/10.1016/s0020-0190(97)00032-x.
ieee: D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming
comparison model lower bounds to the parallel-random-access-machine,” Information
Processing Letters, pp. 103–110, 1995.
mla: Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the
Parallel-Random-Access-Machine.” Information Processing Letters, 1995,
pp. 103–10, doi:10.1016/s0020-0190(97)00032-x.
short: D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information
Processing Letters (1995) 103–110.
date_created: 2020-04-15T11:28:35Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1016/s0020-0190(97)00032-x
language:
- iso: eng
page: 103-110
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
status: public
title: Transforming comparison model lower bounds to the parallel-random-access-machine
type: journal_article
user_id: '15415'
year: '1995'
...
---
_id: '16704'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary
networks. In: STACS 95. Berlin, Heidelberg; 1995. doi:10.1007/3-540-59042-0_81'
apa: Meyer auf der Heide, F., & Vöcking, B. (1995). A packet routing protocol
for arbitrary networks. In STACS 95. Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_81
bibtex: '@inbook{Meyer auf der Heide_Vöcking_1995, place={Berlin, Heidelberg}, title={A
packet routing protocol for arbitrary networks}, DOI={10.1007/3-540-59042-0_81},
booktitle={STACS 95}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold},
year={1995} }'
chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing
Protocol for Arbitrary Networks.” In STACS 95. Berlin, Heidelberg, 1995.
https://doi.org/10.1007/3-540-59042-0_81.
ieee: F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary
networks,” in STACS 95, Berlin, Heidelberg, 1995.
mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol
for Arbitrary Networks.” STACS 95, 1995, doi:10.1007/3-540-59042-0_81.
short: 'F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.'
date_created: 2020-04-16T13:36:32Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-59042-0_81
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 95
publication_identifier:
isbn:
- '9783540590422'
- '9783540491750'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A packet routing protocol for arbitrary networks
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16705'
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. Shared memory simulations with
triple-logarithmic delay. In: Lecture Notes in Computer Science. Berlin,
Heidelberg; 1995. doi:10.1007/3-540-60313-1_133'
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Shared memory
simulations with triple-logarithmic delay. In Lecture Notes in Computer Science.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133
bibtex: '@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg},
title={Shared memory simulations with triple-logarithmic delay}, DOI={10.1007/3-540-60313-1_133},
booktitle={Lecture Notes in Computer Science}, author={Czumaj, Artur and Meyer
auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared
Memory Simulations with Triple-Logarithmic Delay.” In Lecture Notes in Computer
Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60313-1_133.
ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations
with triple-logarithmic delay,” in Lecture Notes in Computer Science, Berlin,
Heidelberg, 1995.
mla: Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.”
Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.
short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer
Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-16T13:40:52Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-60313-1_133
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540603139'
- '9783540449133'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Shared memory simulations with triple-logarithmic delay
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16706'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Martin
full_name: Storch, Martin
last_name: Storch
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size
and slowdown for universal parallel networks. In: Proceedings of the Seventh
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95.
; 1995. doi:10.1145/215399.215430'
apa: Meyer auf der Heide, F., Storch, M., & Wanka, R. (1995). Optimal trade-offs
between size and slowdown for universal parallel networks. In Proceedings of
the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA
’95. https://doi.org/10.1145/215399.215430
bibtex: '@inproceedings{Meyer auf der Heide_Storch_Wanka_1995, title={Optimal trade-offs
between size and slowdown for universal parallel networks}, DOI={10.1145/215399.215430},
booktitle={Proceedings of the seventh annual ACM symposium on Parallel algorithms
and architectures - SPAA ’95}, author={Meyer auf der Heide, Friedhelm and Storch,
Martin and Wanka, Rolf}, year={1995} }'
chicago: Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal
Trade-Offs between Size and Slowdown for Universal Parallel Networks.” In Proceedings
of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’95, 1995. https://doi.org/10.1145/215399.215430.
ieee: F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal trade-offs between
size and slowdown for universal parallel networks,” in Proceedings of the seventh
annual ACM symposium on Parallel algorithms and architectures - SPAA ’95,
1995.
mla: Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and
Slowdown for Universal Parallel Networks.” Proceedings of the Seventh Annual
ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995,
doi:10.1145/215399.215430.
short: 'F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995.'
date_created: 2020-04-16T13:47:15Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1145/215399.215430
language:
- iso: eng
publication: Proceedings of the seventh annual ACM symposium on Parallel algorithms
and architectures - SPAA '95
publication_identifier:
isbn:
- '0897917170'
publication_status: published
status: public
title: Optimal trade-offs between size and slowdown for universal parallel networks
type: conference
user_id: '15415'
year: '1995'
...
---
_id: '16707'
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. Improved optimal shared memory
simulations, and the power of reconfiguration. In: Proceedings Third Israel
Symposium on the Theory of Computing and Systems. ; 1995. doi:10.1109/istcs.1995.377051'
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Improved optimal
shared memory simulations, and the power of reconfiguration. Proceedings Third
Israel Symposium on the Theory of Computing and Systems. https://doi.org/10.1109/istcs.1995.377051
bibtex: '@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Improved
optimal shared memory simulations, and the power of reconfiguration}, DOI={10.1109/istcs.1995.377051},
booktitle={Proceedings Third Israel Symposium on the Theory of Computing and Systems},
author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker},
year={1995} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved
Optimal Shared Memory Simulations, and the Power of Reconfiguration.” In Proceedings
Third Israel Symposium on the Theory of Computing and Systems, 1995. https://doi.org/10.1109/istcs.1995.377051.
ieee: 'A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared
memory simulations, and the power of reconfiguration,” 1995, doi: 10.1109/istcs.1995.377051.'
mla: Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the
Power of Reconfiguration.” Proceedings Third Israel Symposium on the Theory
of Computing and Systems, 1995, doi:10.1109/istcs.1995.377051.
short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel
Symposium on the Theory of Computing and Systems, 1995.'
date_created: 2020-04-16T13:49:13Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1109/istcs.1995.377051
language:
- iso: eng
publication: Proceedings Third Israel Symposium on the Theory of Computing and Systems
publication_identifier:
isbn:
- '0818669152'
publication_status: published
status: public
title: Improved optimal shared memory simulations, and the power of reconfiguration
type: conference
user_id: '15415'
year: '1995'
...
---
_id: '16717'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional
tori. In: Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg;
1995. doi:10.1007/3-540-60618-1_77'
apa: Meyer auf der Heide, F., & Westermann, M. (1995). Hot-potato routing on
multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77
bibtex: '@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg},
title={Hot-potato routing on multi-dimensional tori}, DOI={10.1007/3-540-60618-1_77},
booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der
Heide, Friedhelm and Westermann, Matthias}, year={1995} }'
chicago: Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing
on Multi-Dimensional Tori.” In Graph-Theoretic Concepts in Computer Science.
Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60618-1_77.
ieee: F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional
tori,” in Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg,
1995.
mla: Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing
on Multi-Dimensional Tori.” Graph-Theoretic Concepts in Computer Science,
1995, doi:10.1007/3-540-60618-1_77.
short: 'F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer
Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-17T07:46:18Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-60618-1_77
language:
- iso: eng
place: Berlin, Heidelberg
publication: Graph-Theoretic Concepts in Computer Science
publication_identifier:
isbn:
- '9783540606185'
- '9783540484875'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Hot-potato routing on multi-dimensional tori
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16874'
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
citation:
ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms:
c-optimal multisearch for an extension of the BSP model. In: Lecture Notes
in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_131'
apa: 'Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1995). Truly efficient
parallel algorithms: c-optimal multisearch for an extension of the BSP model.
In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_131'
bibtex: '@inbook{Bäumker_Dittrich_Meyer auf der Heide_1995, place={Berlin, Heidelberg},
title={Truly efficient parallel algorithms: c-optimal multisearch for an extension
of the BSP model}, DOI={10.1007/3-540-60313-1_131},
booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich,
Wolfgang and Meyer auf der Heide, Friedhelm}, year={1995} }'
chicago: 'Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide.
“Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of
the BSP Model.” In Lecture Notes in Computer Science. Berlin, Heidelberg,
1995. https://doi.org/10.1007/3-540-60313-1_131.'
ieee: 'A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel
algorithms: c-optimal multisearch for an extension of the BSP model,” in Lecture
Notes in Computer Science, Berlin, Heidelberg, 1995.'
mla: 'Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch
for an Extension of the BSP Model.” Lecture Notes in Computer Science,
1995, doi:10.1007/3-540-60313-1_131.'
short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer
Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-27T13:59:05Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '63'
doi: 10.1007/3-540-60313-1_131
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540603139'
- '9783540449133'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Truly efficient parallel algorithms: c-optimal multisearch for an extension
of the BSP model'
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '19624'
author:
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: Wanka R. Paralleles Sortieren Auf Mehrdimensionalen Gittern. Universität
Paderborn; 1994.
apa: Wanka, R. (1994). Paralleles Sortieren auf mehrdimensionalen Gittern.
Universität Paderborn.
bibtex: '@book{Wanka_1994, place={Universität Paderborn}, title={Paralleles Sortieren
auf mehrdimensionalen Gittern}, author={Wanka, Rolf}, year={1994} }'
chicago: Wanka, Rolf. Paralleles Sortieren Auf Mehrdimensionalen Gittern.
Universität Paderborn, 1994.
ieee: R. Wanka, Paralleles Sortieren auf mehrdimensionalen Gittern. Universität
Paderborn, 1994.
mla: Wanka, Rolf. Paralleles Sortieren Auf Mehrdimensionalen Gittern. 1994.
short: R. Wanka, Paralleles Sortieren Auf Mehrdimensionalen Gittern, Universität
Paderborn, 1994.
date_created: 2020-09-22T12:32:48Z
date_updated: 2022-01-06T06:54:09Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-22T12:32:33Z
date_updated: 2020-09-22T12:32:33Z
file_id: '19625'
file_name: pub-hni-9686.pdf
file_size: 967735
relation: main_file
success: 1
file_date_updated: 2020-09-22T12:32:33Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Paralleles Sortieren auf mehrdimensionalen Gittern
type: dissertation
user_id: '15415'
year: '1994'
...
---
_id: '16728'
author:
- first_name: Martin
full_name: Dietzfelbinger, Martin
last_name: Dietzfelbinger
- first_name: Anna
full_name: Karlin, Anna
last_name: Karlin
- first_name: Kurt
full_name: Mehlhorn, Kurt
last_name: Mehlhorn
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Hans
full_name: Rohnert, Hans
last_name: Rohnert
- first_name: Robert E.
full_name: Tarjan, Robert E.
last_name: Tarjan
citation:
ama: 'Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H,
Tarjan RE. Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on
Computing. 1994:738-761. doi:10.1137/s0097539791194094'
apa: 'Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert,
H., & Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds.
SIAM Journal on Computing, 738–761. https://doi.org/10.1137/s0097539791194094'
bibtex: '@article{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1994,
title={Dynamic Perfect Hashing: Upper and Lower Bounds}, DOI={10.1137/s0097539791194094},
journal={SIAM Journal on Computing}, author={Dietzfelbinger, Martin and Karlin,
Anna and Mehlhorn, Kurt and Meyer auf der Heide, Friedhelm and Rohnert, Hans and
Tarjan, Robert E.}, year={1994}, pages={738–761} }'
chicago: 'Dietzfelbinger, Martin, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf
der Heide, Hans Rohnert, and Robert E. Tarjan. “Dynamic Perfect Hashing: Upper
and Lower Bounds.” SIAM Journal on Computing, 1994, 738–61. https://doi.org/10.1137/s0097539791194094.'
ieee: 'M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert,
and R. E. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds,” SIAM Journal
on Computing, pp. 738–761, 1994.'
mla: 'Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.”
SIAM Journal on Computing, 1994, pp. 738–61, doi:10.1137/s0097539791194094.'
short: M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert,
R.E. Tarjan, SIAM Journal on Computing (1994) 738–761.
date_created: 2020-04-20T10:19:33Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1137/s0097539791194094
language:
- iso: eng
page: 738-761
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: 'Dynamic Perfect Hashing: Upper and Lower Bounds'
type: journal_article
user_id: '15415'
year: '1994'
...
---
_id: '17477'
citation:
ama: 'Meyer auf der Heide F, Monien B, Rosenberg AL, eds. Parallel Architectures
and Their Efficient Use. Berlin, Heidelberg: Springer; 1993. doi:10.1007/3-540-56731-3'
apa: 'Meyer auf der Heide, F., Monien, B., & Rosenberg, A. L. (Eds.). (1993).
Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer.
https://doi.org/10.1007/3-540-56731-3'
bibtex: '@book{Meyer auf der Heide_Monien_Rosenberg_1993, place={Berlin, Heidelberg},
title={Parallel Architectures and Their Efficient Use}, DOI={10.1007/3-540-56731-3},
publisher={Springer}, year={1993} }'
chicago: 'Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. Parallel
Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.
https://doi.org/10.1007/3-540-56731-3.'
ieee: 'F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., Parallel
Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.'
mla: Meyer auf der Heide, Friedhelm, et al., editors. Parallel Architectures
and Their Efficient Use. Springer, 1993, doi:10.1007/3-540-56731-3.
short: F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures
and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.
date_created: 2020-07-30T09:49:20Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
doi: 10.1007/3-540-56731-3
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: B.
full_name: Monien, B.
last_name: Monien
- first_name: A. L.
full_name: Rosenberg, A. L.
last_name: Rosenberg
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783540567318'
- '9783540476375'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Parallel Architectures and Their Efficient Use
type: book_editor
user_id: '15415'
year: '1993'
...
---
_id: '17479'
author:
- first_name: Uwe
full_name: Kastens, Uwe
last_name: Kastens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Alf
full_name: Wachsmann, Alf
last_name: Wachsmann
- first_name: Friedrich
full_name: Wichmann, Friedrich
last_name: Wichmann
citation:
ama: 'Kastens U, Meyer auf der Heide F, Wachsmann A, Wichmann F. OCCAM-light: A
Language Combining Shared Memory and Message Passing (A First Report). In: Proc.
3rd PASA Workshop, PARS Mitteilungen. ; 1993:50-55.'
apa: 'Kastens, U., Meyer auf der Heide, F., Wachsmann, A., & Wichmann, F. (1993).
OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report).
In Proc. 3rd PASA Workshop, PARS Mitteilungen (pp. 50–55).'
bibtex: '@inproceedings{Kastens_Meyer auf der Heide_Wachsmann_Wichmann_1993, title={OCCAM-light:
A Language Combining Shared Memory and Message Passing (A First Report)}, booktitle={Proc.
3rd PASA Workshop, PARS Mitteilungen}, author={Kastens, Uwe and Meyer auf der
Heide, Friedhelm and Wachsmann, Alf and Wichmann, Friedrich}, year={1993}, pages={50–55}
}'
chicago: 'Kastens, Uwe, Friedhelm Meyer auf der Heide, Alf Wachsmann, and Friedrich
Wichmann. “OCCAM-Light: A Language Combining Shared Memory and Message Passing
(A First Report).” In Proc. 3rd PASA Workshop, PARS Mitteilungen, 50–55,
1993.'
ieee: 'U. Kastens, F. Meyer auf der Heide, A. Wachsmann, and F. Wichmann, “OCCAM-light:
A Language Combining Shared Memory and Message Passing (A First Report),” in Proc.
3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.'
mla: 'Kastens, Uwe, et al. “OCCAM-Light: A Language Combining Shared Memory and
Message Passing (A First Report).” Proc. 3rd PASA Workshop, PARS Mitteilungen,
1993, pp. 50–55.'
short: 'U. Kastens, F. Meyer auf der Heide, A. Wachsmann, F. Wichmann, in: Proc.
3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.'
date_created: 2020-07-30T10:54:52Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
language:
- iso: eng
page: 50-55
publication: Proc. 3rd PASA Workshop, PARS Mitteilungen
status: public
title: 'OCCAM-light: A Language Combining Shared Memory and Message Passing (A First
Report)'
type: conference
user_id: '15415'
year: '1993'
...
---
_id: '16729'
author:
- first_name: M.
full_name: Dietzfelbinger, M.
last_name: Dietzfelbinger
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Dietzfelbinger M, Meyer auf der Heide F. An Optimal Parallel Dictionary. Information
and Computation. 1993:196-217. doi:10.1006/inco.1993.1007
apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). An Optimal Parallel
Dictionary. Information and Computation, 196–217. https://doi.org/10.1006/inco.1993.1007
bibtex: '@article{Dietzfelbinger_Meyer auf der Heide_1993, title={An Optimal Parallel
Dictionary}, DOI={10.1006/inco.1993.1007},
journal={Information and Computation}, author={Dietzfelbinger, M. and Meyer auf
der Heide, Friedhelm}, year={1993}, pages={196–217} }'
chicago: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel
Dictionary.” Information and Computation, 1993, 196–217. https://doi.org/10.1006/inco.1993.1007.
ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “An Optimal Parallel Dictionary,”
Information and Computation, pp. 196–217, 1993.
mla: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel
Dictionary.” Information and Computation, 1993, pp. 196–217, doi:10.1006/inco.1993.1007.
short: M. Dietzfelbinger, F. Meyer auf der Heide, Information and Computation (1993)
196–217.
date_created: 2020-04-20T10:31:51Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1006/inco.1993.1007
language:
- iso: eng
page: 196-217
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
status: public
title: An Optimal Parallel Dictionary
type: journal_article
user_id: '15415'
year: '1993'
...
---
_id: '16730'
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. In: Automata, Languages and Programming. Berlin, Heidelberg;
1993. doi:10.1007/3-540-56939-1_89'
apa: Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1993). Strongly
adaptive token distribution. In Automata, Languages and Programming. Berlin,
Heidelberg. https://doi.org/10.1007/3-540-56939-1_89
bibtex: '@inbook{Meyer auf der Heide_Oesterdiekhoff_Wanka_1993, place={Berlin, Heidelberg},
title={Strongly adaptive token distribution}, DOI={10.1007/3-540-56939-1_89},
booktitle={Automata, Languages and Programming}, author={Meyer auf der Heide,
Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1993} }'
chicago: Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka.
“Strongly Adaptive Token Distribution.” In Automata, Languages and Programming.
Berlin, Heidelberg, 1993. https://doi.org/10.1007/3-540-56939-1_89.
ieee: F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive
token distribution,” in Automata, Languages and Programming, Berlin, Heidelberg,
1993.
mla: Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.”
Automata, Languages and Programming, 1993, doi:10.1007/3-540-56939-1_89.
short: 'F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages
and Programming, Berlin, Heidelberg, 1993.'
date_created: 2020-04-20T10:33:56Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-56939-1_89
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '9783540569398'
- '9783540478263'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Strongly adaptive token distribution
type: book_chapter
user_id: '15415'
year: '1993'
...
---
_id: '16731'
author:
- first_name: Martin
full_name: Dietzfelbinger, Martin
last_name: Dietzfelbinger
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Dietzfelbinger M, Meyer auf der Heide F. Simple, efficient shared memory simulations.
In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and
Architectures - SPAA ’93. ; 1993. doi:10.1145/165231.165246'
apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). Simple, efficient
shared memory simulations. In Proceedings of the fifth annual ACM symposium
on Parallel algorithms and architectures - SPAA ’93. https://doi.org/10.1145/165231.165246
bibtex: '@inproceedings{Dietzfelbinger_Meyer auf der Heide_1993, title={Simple,
efficient shared memory simulations}, DOI={10.1145/165231.165246},
booktitle={Proceedings of the fifth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’93}, author={Dietzfelbinger, Martin and Meyer auf der
Heide, Friedhelm}, year={1993} }'
chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient
Shared Memory Simulations.” In Proceedings of the Fifth Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’93, 1993. https://doi.org/10.1145/165231.165246.
ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “Simple, efficient shared memory
simulations,” in Proceedings of the fifth annual ACM symposium on Parallel
algorithms and architectures - SPAA ’93, 1993.
mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient
Shared Memory Simulations.” Proceedings of the Fifth Annual ACM Symposium on
Parallel Algorithms and Architectures - SPAA ’93, 1993, doi:10.1145/165231.165246.
short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Fifth
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’93, 1993.'
date_created: 2020-04-20T10:35:49Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/165231.165246
language:
- iso: eng
publication: Proceedings of the fifth annual ACM symposium on Parallel algorithms
and architectures - SPAA '93
publication_identifier:
isbn:
- '0897915992'
publication_status: published
status: public
title: Simple, efficient shared memory simulations
type: conference
user_id: '15415'
year: '1993'
...