---
_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: '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: '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'
...