---
_id: '2437'
author:
- first_name: Jens
  full_name: Simon, Jens
  id: '15273'
  last_name: Simon
- first_name: Jens-Michael
  full_name: Wierum, Jens-Michael
  last_name: Wierum
citation:
  ama: Simon J, Wierum J-M. The Latency-of-Data-Access model for Analyzing Parallel
    Computation. <i>Information Processing Letters - Special Issue on Models of Computation</i>.
    1998;66(5):255-261. doi:<a href="https://doi.org/10.1016/S0020-0190(98)00062-3">10.1016/S0020-0190(98)00062-3</a>
  apa: Simon, J., &#38; Wierum, J.-M. (1998). The Latency-of-Data-Access model for
    Analyzing Parallel Computation. <i>Information Processing Letters - Special Issue
    on Models of Computation</i>, <i>66</i>(5), 255–261. <a href="https://doi.org/10.1016/S0020-0190(98)00062-3">https://doi.org/10.1016/S0020-0190(98)00062-3</a>
  bibtex: '@article{Simon_Wierum_1998, title={The Latency-of-Data-Access model for
    Analyzing Parallel Computation}, volume={66}, DOI={<a href="https://doi.org/10.1016/S0020-0190(98)00062-3">10.1016/S0020-0190(98)00062-3</a>},
    number={5}, journal={Information Processing Letters - Special Issue on Models
    of Computation}, publisher={Elsevier}, author={Simon, Jens and Wierum, Jens-Michael},
    year={1998}, pages={255–261} }'
  chicago: 'Simon, Jens, and Jens-Michael Wierum. “The Latency-of-Data-Access Model
    for Analyzing Parallel Computation.” <i>Information Processing Letters - Special
    Issue on Models of Computation</i> 66, no. 5 (1998): 255–61. <a href="https://doi.org/10.1016/S0020-0190(98)00062-3">https://doi.org/10.1016/S0020-0190(98)00062-3</a>.'
  ieee: J. Simon and J.-M. Wierum, “The Latency-of-Data-Access model for Analyzing
    Parallel Computation,” <i>Information Processing Letters - Special Issue on Models
    of Computation</i>, vol. 66, no. 5, pp. 255–261, 1998.
  mla: Simon, Jens, and Jens-Michael Wierum. “The Latency-of-Data-Access Model for
    Analyzing Parallel Computation.” <i>Information Processing Letters - Special Issue
    on Models of Computation</i>, vol. 66, no. 5, Elsevier, 1998, pp. 255–61, doi:<a
    href="https://doi.org/10.1016/S0020-0190(98)00062-3">10.1016/S0020-0190(98)00062-3</a>.
  short: J. Simon, J.-M. Wierum, Information Processing Letters - Special Issue on
    Models of Computation 66 (1998) 255–261.
date_created: 2018-04-17T16:09:51Z
date_updated: 2022-01-06T06:56:19Z
department:
- _id: '27'
doi: 10.1016/S0020-0190(98)00062-3
intvolume: '        66'
issue: '5'
page: 255-261
publication: Information Processing Letters - Special Issue on Models of Computation
publication_identifier:
  issn:
  - 0020-0190
publisher: Elsevier
status: public
title: The Latency-of-Data-Access model for Analyzing Parallel Computation
type: journal_article
user_id: '24135'
volume: 66
year: '1998'
...
---
_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. <i>Information Processing
    Letters</i>. 1995:103-110. doi:<a href="https://doi.org/10.1016/s0020-0190(97)00032-x">10.1016/s0020-0190(97)00032-x</a>
  apa: Breslauer, D., Czumaj, A., Dubhashi, D. P., &#38; Meyer auf der Heide, F. (1995).
    Transforming comparison model lower bounds to the parallel-random-access-machine.
    <i>Information Processing Letters</i>, 103–110. <a href="https://doi.org/10.1016/s0020-0190(97)00032-x">https://doi.org/10.1016/s0020-0190(97)00032-x</a>
  bibtex: '@article{Breslauer_Czumaj_Dubhashi_Meyer auf der Heide_1995, title={Transforming
    comparison model lower bounds to the parallel-random-access-machine}, DOI={<a
    href="https://doi.org/10.1016/s0020-0190(97)00032-x">10.1016/s0020-0190(97)00032-x</a>},
    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.”
    <i>Information Processing Letters</i>, 1995, 103–10. <a href="https://doi.org/10.1016/s0020-0190(97)00032-x">https://doi.org/10.1016/s0020-0190(97)00032-x</a>.
  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,” <i>Information
    Processing Letters</i>, pp. 103–110, 1995.
  mla: Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the
    Parallel-Random-Access-Machine.” <i>Information Processing Letters</i>, 1995,
    pp. 103–10, doi:<a href="https://doi.org/10.1016/s0020-0190(97)00032-x">10.1016/s0020-0190(97)00032-x</a>.
  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: '16779'
author:
- first_name: Clemens
  full_name: Lautemann, Clemens
  last_name: Lautemann
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Lautemann C, Meyer auf der Heide F. Lower time bounds for integer programming
    with two variables. <i>Information Processing Letters</i>. 1985:101-105. doi:<a
    href="https://doi.org/10.1016/0020-0190(85)90042-0">10.1016/0020-0190(85)90042-0</a>
  apa: Lautemann, C., &#38; Meyer auf der Heide, F. (1985). Lower time bounds for
    integer programming with two variables. <i>Information Processing Letters</i>,
    101–105. <a href="https://doi.org/10.1016/0020-0190(85)90042-0">https://doi.org/10.1016/0020-0190(85)90042-0</a>
  bibtex: '@article{Lautemann_Meyer auf der Heide_1985, title={Lower time bounds for
    integer programming with two variables}, DOI={<a href="https://doi.org/10.1016/0020-0190(85)90042-0">10.1016/0020-0190(85)90042-0</a>},
    journal={Information Processing Letters}, author={Lautemann, Clemens and Meyer
    auf der Heide, Friedhelm}, year={1985}, pages={101–105} }'
  chicago: Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds
    for Integer Programming with Two Variables.” <i>Information Processing Letters</i>,
    1985, 101–5. <a href="https://doi.org/10.1016/0020-0190(85)90042-0">https://doi.org/10.1016/0020-0190(85)90042-0</a>.
  ieee: C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming
    with two variables,” <i>Information Processing Letters</i>, pp. 101–105, 1985.
  mla: Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for
    Integer Programming with Two Variables.” <i>Information Processing Letters</i>,
    1985, pp. 101–05, doi:<a href="https://doi.org/10.1016/0020-0190(85)90042-0">10.1016/0020-0190(85)90042-0</a>.
  short: C. Lautemann, F. Meyer auf der Heide, Information Processing Letters (1985)
    101–105.
date_created: 2020-04-21T10:15:46Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0020-0190(85)90042-0
language:
- iso: eng
page: 101-105
publication: Information Processing Letters
publication_identifier:
  issn:
  - 0020-0190
publication_status: published
status: public
title: Lower time bounds for integer programming with two variables
type: journal_article
user_id: '15415'
year: '1985'
...
---
_id: '16808'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Meyer auf der Heide F. Infinite cube-connected cycles. <i>Information Processing
    Letters</i>. 1983:1-2. doi:<a href="https://doi.org/10.1016/0020-0190(83)90001-7">10.1016/0020-0190(83)90001-7</a>
  apa: Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. <i>Information
    Processing Letters</i>, 1–2. <a href="https://doi.org/10.1016/0020-0190(83)90001-7">https://doi.org/10.1016/0020-0190(83)90001-7</a>
  bibtex: '@article{Meyer auf der Heide_1983, title={Infinite cube-connected cycles},
    DOI={<a href="https://doi.org/10.1016/0020-0190(83)90001-7">10.1016/0020-0190(83)90001-7</a>},
    journal={Information Processing Letters}, author={Meyer auf der Heide, Friedhelm},
    year={1983}, pages={1–2} }'
  chicago: Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” <i>Information
    Processing Letters</i>, 1983, 1–2. <a href="https://doi.org/10.1016/0020-0190(83)90001-7">https://doi.org/10.1016/0020-0190(83)90001-7</a>.
  ieee: F. Meyer auf der Heide, “Infinite cube-connected cycles,” <i>Information Processing
    Letters</i>, pp. 1–2, 1983.
  mla: Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” <i>Information
    Processing Letters</i>, 1983, pp. 1–2, doi:<a href="https://doi.org/10.1016/0020-0190(83)90001-7">10.1016/0020-0190(83)90001-7</a>.
  short: F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.
date_created: 2020-04-22T08:51:01Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1016/0020-0190(83)90001-7
language:
- iso: eng
page: 1-2
publication: Information Processing Letters
publication_identifier:
  issn:
  - 0020-0190
publication_status: published
status: public
title: Infinite cube-connected cycles
type: journal_article
user_id: '15415'
year: '1983'
...