---
_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: <i>Lecture Notes in Computer Science</i>. Berlin,
    Heidelberg; 1995. doi:<a href="https://doi.org/10.1007/3-540-60313-1_133">10.1007/3-540-60313-1_133</a>'
  apa: Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Shared memory
    simulations with triple-logarithmic delay. In <i>Lecture Notes in Computer Science</i>.
    Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-60313-1_133">https://doi.org/10.1007/3-540-60313-1_133</a>
  bibtex: '@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg},
    title={Shared memory simulations with triple-logarithmic delay}, DOI={<a href="https://doi.org/10.1007/3-540-60313-1_133">10.1007/3-540-60313-1_133</a>},
    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 <i>Lecture Notes in Computer
    Science</i>. Berlin, Heidelberg, 1995. <a href="https://doi.org/10.1007/3-540-60313-1_133">https://doi.org/10.1007/3-540-60313-1_133</a>.
  ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations
    with triple-logarithmic delay,” in <i>Lecture Notes in Computer Science</i>, Berlin,
    Heidelberg, 1995.
  mla: Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.”
    <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href="https://doi.org/10.1007/3-540-60313-1_133">10.1007/3-540-60313-1_133</a>.
  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: '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: <i>Lecture Notes
    in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href="https://doi.org/10.1007/3-540-60313-1_131">10.1007/3-540-60313-1_131</a>'
  apa: 'Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1995). Truly efficient
    parallel algorithms: c-optimal multisearch for an extension of the BSP model.
    In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-60313-1_131">https://doi.org/10.1007/3-540-60313-1_131</a>'
  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={<a href="https://doi.org/10.1007/3-540-60313-1_131">10.1007/3-540-60313-1_131</a>},
    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 <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg,
    1995. <a href="https://doi.org/10.1007/3-540-60313-1_131">https://doi.org/10.1007/3-540-60313-1_131</a>.'
  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 <i>Lecture
    Notes in Computer Science</i>, Berlin, Heidelberg, 1995.'
  mla: 'Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch
    for an Extension of the BSP Model.” <i>Lecture Notes in Computer Science</i>,
    1995, doi:<a href="https://doi.org/10.1007/3-540-60313-1_131">10.1007/3-540-60313-1_131</a>.'
  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'
...