---
_id: '50458'
abstract:
- lang: eng
  text: <jats:title>Abstract</jats:title><jats:p>Consider a set of jobs connected
    to a directed acyclic task graph with a fixed source and sink. The edges of this
    graph model precedence constraints and the jobs have to be scheduled with respect
    to those. We introduce the server cloud scheduling problem, in which the jobs
    have to be processed either on a single local machine or on one of infinitely
    many cloud machines. For each job, processing times both on the server and in
    the cloud are given. Furthermore, for each edge in the task graph, a communication
    delay is included in the input and has to be taken into account if one of the
    two jobs is scheduled on the server and the other in the cloud. The server processes
    jobs sequentially, whereas the cloud can serve as many as needed in parallel,
    but induces costs. We consider both makespan and cost minimization. The main results
    are an FPTAS for the makespan objective for graphs with a constant source and
    sink dividing cut and strong hardness for the case with unit processing times
    and delays.</jats:p>
author:
- first_name: Marten
  full_name: Maack, Marten
  id: '88252'
  last_name: Maack
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Simon
  full_name: Pukrop, Simon
  id: '44428'
  last_name: Pukrop
citation:
  ama: Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. <i>Algorithmica</i>.
    Published online 2023. doi:<a href="https://doi.org/10.1007/s00453-023-01189-x">10.1007/s00453-023-01189-x</a>
  apa: Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2023). Server Cloud Scheduling.
    <i>Algorithmica</i>. <a href="https://doi.org/10.1007/s00453-023-01189-x">https://doi.org/10.1007/s00453-023-01189-x</a>
  bibtex: '@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling},
    DOI={<a href="https://doi.org/10.1007/s00453-023-01189-x">10.1007/s00453-023-01189-x</a>},
    journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack,
    Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }'
  chicago: Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server
    Cloud Scheduling.” <i>Algorithmica</i>, 2023. <a href="https://doi.org/10.1007/s00453-023-01189-x">https://doi.org/10.1007/s00453-023-01189-x</a>.
  ieee: 'M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,”
    <i>Algorithmica</i>, 2023, doi: <a href="https://doi.org/10.1007/s00453-023-01189-x">10.1007/s00453-023-01189-x</a>.'
  mla: Maack, Marten, et al. “Server Cloud Scheduling.” <i>Algorithmica</i>, Springer
    Science and Business Media LLC, 2023, doi:<a href="https://doi.org/10.1007/s00453-023-01189-x">10.1007/s00453-023-01189-x</a>.
  short: M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).
date_created: 2024-01-11T11:10:53Z
date_updated: 2024-01-11T11:19:33Z
department:
- _id: '63'
doi: 10.1007/s00453-023-01189-x
extern: '1'
keyword:
- Applied Mathematics
- Computer Science Applications
- General Computer Science
language:
- iso: eng
project:
- _id: '1'
  grant_number: '160364472'
  name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
    in dynamischen Märkten '
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
  grant_number: '160364472'
  name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
    Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
publication: Algorithmica
publication_identifier:
  issn:
  - 0178-4617
  - 1432-0541
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Server Cloud Scheduling
type: journal_article
user_id: '44428'
year: '2023'
...
---
_id: '31479'
author:
- first_name: Surender
  full_name: Baswana, Surender
  last_name: Baswana
- first_name: Shiv
  full_name: Gupta, Shiv
  last_name: Gupta
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
citation:
  ama: Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the
    Insertion of an Edge. <i>Algorithmica</i>. Published online 2022. doi:<a href="https://doi.org/10.1007/s00453-022-00978-0">10.1007/s00453-022-00978-0</a>
  apa: Baswana, S., Gupta, S., &#38; Knollmann, T. (2022). Mincut Sensitivity Data
    Structures for the Insertion of an Edge. <i>Algorithmica</i>. <a href="https://doi.org/10.1007/s00453-022-00978-0">https://doi.org/10.1007/s00453-022-00978-0</a>
  bibtex: '@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures
    for the Insertion of an Edge}, DOI={<a href="https://doi.org/10.1007/s00453-022-00978-0">10.1007/s00453-022-00978-0</a>},
    journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana,
    Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }'
  chicago: Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity
    Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, 2022. <a href="https://doi.org/10.1007/s00453-022-00978-0">https://doi.org/10.1007/s00453-022-00978-0</a>.
  ieee: 'S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures
    for the Insertion of an Edge,” <i>Algorithmica</i>, 2022, doi: <a href="https://doi.org/10.1007/s00453-022-00978-0">10.1007/s00453-022-00978-0</a>.'
  mla: Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion
    of an Edge.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2022,
    doi:<a href="https://doi.org/10.1007/s00453-022-00978-0">10.1007/s00453-022-00978-0</a>.
  short: S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).
date_created: 2022-05-27T10:09:24Z
date_updated: 2022-05-27T10:14:27Z
department:
- _id: '63'
doi: 10.1007/s00453-022-00978-0
genbank:
- tillk
keyword:
- Applied Mathematics
- Computer Science Applications
- General Computer Science
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Algorithmica
publication_identifier:
  issn:
  - 0178-4617
  - 1432-0541
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Mincut Sensitivity Data Structures for the Insertion of an Edge
type: journal_article
user_id: '39241'
year: '2022'
...
---
_id: '48854'
abstract:
- lang: eng
  text: We contribute to the theoretical understanding of randomized search heuristics
    for dynamic problems. We consider the classical vertex coloring problem on graphs
    and investigate the dynamic setting where edges are added to the current graph.
    We then analyze the expected time for randomized search heuristics to recompute
    high quality solutions. The (1+1) Evolutionary Algorithm and RLS operate in a
    setting where the number of colors is bounded and we are minimizing the number
    of conflicts. Iterated local search algorithms use an unbounded color palette
    and aim to use the smallest colors and, consequently, the smallest number of colors.
    We identify classes of bipartite graphs where reoptimization is as hard as or
    even harder than optimization from scratch, i.e., starting with a random initialization.
    Even adding a single edge can lead to hard symmetry problems. However, graph classes
    that are hard for one algorithm turn out to be easy for others. In most cases
    our bounds show that reoptimization is faster than optimizing from scratch. We
    further show that tailoring mutation operators to parts of the graph where changes
    have occurred can significantly reduce the expected reoptimization time. In most
    settings the expected reoptimization time for such tailored algorithms is linear
    in the number of added edges. However, tailored algorithms cannot prevent exponential
    times in settings where the original algorithm is inefficient.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Frank
  full_name: Neumann, Frank
  last_name: Neumann
- first_name: Pan
  full_name: Peng, Pan
  last_name: Peng
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
citation:
  ama: Bossek J, Neumann F, Peng P, Sudholt D. Time Complexity Analysis of Randomized
    Search Heuristics for the Dynamic Graph Coloring Problem. <i>Algorithmica</i>.
    2021;83(10):3148–3179. doi:<a href="https://doi.org/10.1007/s00453-021-00838-3">10.1007/s00453-021-00838-3</a>
  apa: Bossek, J., Neumann, F., Peng, P., &#38; Sudholt, D. (2021). Time Complexity
    Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.
    <i>Algorithmica</i>, <i>83</i>(10), 3148–3179. <a href="https://doi.org/10.1007/s00453-021-00838-3">https://doi.org/10.1007/s00453-021-00838-3</a>
  bibtex: '@article{Bossek_Neumann_Peng_Sudholt_2021, title={Time Complexity Analysis
    of Randomized Search Heuristics for the Dynamic Graph Coloring Problem}, volume={83},
    DOI={<a href="https://doi.org/10.1007/s00453-021-00838-3">10.1007/s00453-021-00838-3</a>},
    number={10}, journal={Algorithmica}, author={Bossek, Jakob and Neumann, Frank
    and Peng, Pan and Sudholt, Dirk}, year={2021}, pages={3148–3179} }'
  chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Time Complexity
    Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.”
    <i>Algorithmica</i> 83, no. 10 (2021): 3148–3179. <a href="https://doi.org/10.1007/s00453-021-00838-3">https://doi.org/10.1007/s00453-021-00838-3</a>.'
  ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Time Complexity Analysis
    of Randomized Search Heuristics for the Dynamic Graph Coloring Problem,” <i>Algorithmica</i>,
    vol. 83, no. 10, pp. 3148–3179, 2021, doi: <a href="https://doi.org/10.1007/s00453-021-00838-3">10.1007/s00453-021-00838-3</a>.'
  mla: Bossek, Jakob, et al. “Time Complexity Analysis of Randomized Search Heuristics
    for the Dynamic Graph Coloring Problem.” <i>Algorithmica</i>, vol. 83, no. 10,
    2021, pp. 3148–3179, doi:<a href="https://doi.org/10.1007/s00453-021-00838-3">10.1007/s00453-021-00838-3</a>.
  short: J. Bossek, F. Neumann, P. Peng, D. Sudholt, Algorithmica 83 (2021) 3148–3179.
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:51:34Z
department:
- _id: '819'
doi: 10.1007/s00453-021-00838-3
intvolume: '        83'
issue: '10'
keyword:
- Dynamic optimization
- Evolutionary algorithms
- Running time analysis
language:
- iso: eng
page: 3148–3179
publication: Algorithmica
publication_identifier:
  issn:
  - 0178-4617
status: public
title: Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph
  Coloring Problem
type: journal_article
user_id: '102979'
volume: 83
year: '2021'
...
---
_id: '19011'
author:
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Joachim
  full_name: Gehweiler, Joachim
  last_name: Gehweiler
- first_name: Christiane
  full_name: Lammersen, Christiane
  last_name: Lammersen
citation:
  ama: Degener B, Gehweiler J, Lammersen C. Kinetic Facility Location. <i>Algorithmica</i>.
    2010;57(3):562-584. doi:<a href="https://doi.org/10.1007/s00453-008-9250-7">10.1007/s00453-008-9250-7</a>
  apa: Degener, B., Gehweiler, J., &#38; Lammersen, C. (2010). Kinetic Facility Location.
    <i>Algorithmica</i>, <i>57</i>(3), 562–584. <a href="https://doi.org/10.1007/s00453-008-9250-7">https://doi.org/10.1007/s00453-008-9250-7</a>
  bibtex: '@article{Degener_Gehweiler_Lammersen_2010, title={Kinetic Facility Location},
    volume={57}, DOI={<a href="https://doi.org/10.1007/s00453-008-9250-7">10.1007/s00453-008-9250-7</a>},
    number={3}, journal={Algorithmica}, author={Degener, Bastian and Gehweiler, Joachim
    and Lammersen, Christiane}, year={2010}, pages={562–584} }'
  chicago: 'Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “Kinetic
    Facility Location.” <i>Algorithmica</i> 57, no. 3 (2010): 562–84. <a href="https://doi.org/10.1007/s00453-008-9250-7">https://doi.org/10.1007/s00453-008-9250-7</a>.'
  ieee: B. Degener, J. Gehweiler, and C. Lammersen, “Kinetic Facility Location,” <i>Algorithmica</i>,
    vol. 57, no. 3, pp. 562–584, 2010.
  mla: Degener, Bastian, et al. “Kinetic Facility Location.” <i>Algorithmica</i>,
    vol. 57, no. 3, 2010, pp. 562–84, doi:<a href="https://doi.org/10.1007/s00453-008-9250-7">10.1007/s00453-008-9250-7</a>.
  short: B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584.
date_created: 2020-09-04T10:35:36Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/s00453-008-9250-7
intvolume: '        57'
issue: '3'
language:
- iso: eng
page: 562-584
publication: Algorithmica
publication_identifier:
  issn:
  - 0178-4617
  - 1432-0541
publication_status: published
status: public
title: Kinetic Facility Location
type: journal_article
user_id: '15415'
volume: 57
year: '2010'
...
---
_id: '35857'
author:
- first_name: J.
  full_name: Blömer, J.
  last_name: Blömer
citation:
  ama: Blömer J. Denesting by Bounded Degree Radicals. <i>Algorithmica</i>. 2002;28(1):2-15.
    doi:<a href="https://doi.org/10.1007/s004530010028">10.1007/s004530010028</a>
  apa: Blömer, J. (2002). Denesting by Bounded Degree Radicals. <i>Algorithmica</i>,
    <i>28</i>(1), 2–15. <a href="https://doi.org/10.1007/s004530010028">https://doi.org/10.1007/s004530010028</a>
  bibtex: '@article{Blömer_2002, title={Denesting by Bounded Degree Radicals}, volume={28},
    DOI={<a href="https://doi.org/10.1007/s004530010028">10.1007/s004530010028</a>},
    number={1}, journal={Algorithmica}, publisher={Springer Science and Business Media
    LLC}, author={Blömer, J.}, year={2002}, pages={2–15} }'
  chicago: 'Blömer, J. “Denesting by Bounded Degree Radicals.” <i>Algorithmica</i>
    28, no. 1 (2002): 2–15. <a href="https://doi.org/10.1007/s004530010028">https://doi.org/10.1007/s004530010028</a>.'
  ieee: 'J. Blömer, “Denesting by Bounded Degree Radicals,” <i>Algorithmica</i>, vol.
    28, no. 1, pp. 2–15, 2002, doi: <a href="https://doi.org/10.1007/s004530010028">10.1007/s004530010028</a>.'
  mla: Blömer, J. “Denesting by Bounded Degree Radicals.” <i>Algorithmica</i>, vol.
    28, no. 1, Springer Science and Business Media LLC, 2002, pp. 2–15, doi:<a href="https://doi.org/10.1007/s004530010028">10.1007/s004530010028</a>.
  short: J. Blömer, Algorithmica 28 (2002) 2–15.
date_created: 2023-01-10T13:44:28Z
date_updated: 2023-01-10T13:48:53Z
department:
- _id: '64'
doi: 10.1007/s004530010028
intvolume: '        28'
issue: '1'
keyword:
- Applied Mathematics
- Computer Science Applications
- General Computer Science
language:
- iso: eng
page: 2-15
publication: Algorithmica
publication_identifier:
  issn:
  - 0178-4617
  - 1432-0541
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Denesting by Bounded Degree Radicals
type: journal_article
user_id: '23'
volume: 28
year: '2002'
...
---
_id: '18962'
author:
- first_name: Sathish
  full_name: Govindarajan, Sathish
  last_name: Govindarajan
- first_name: Tamas
  full_name: Lukovszki, Tamas
  last_name: Lukovszki
- first_name: Anil
  full_name: Maheshwari, Anil
  last_name: Maheshwari
- first_name: Norbert
  full_name: Zeh, Norbert
  last_name: Zeh
citation:
  ama: 'Govindarajan S, Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Well-Separated
    Pair Decomposition and Applications. In: <i>Proceedings of the 8th Annual European
    Symposium on Algorithms (ESA 2000), LNCS</i>. ; 2000:585-614. doi:<a href="https://doi.org/10.1007/s00453-005-1197-3">10.1007/s00453-005-1197-3</a>'
  apa: Govindarajan, S., Lukovszki, T., Maheshwari, A., &#38; Zeh, N. (2000). I/O-Efficient
    Well-Separated Pair Decomposition and Applications. In <i>Proceedings of the 8th
    Annual European Symposium on Algorithms (ESA 2000), LNCS</i> (pp. 585–614). <a
    href="https://doi.org/10.1007/s00453-005-1197-3">https://doi.org/10.1007/s00453-005-1197-3</a>
  bibtex: '@inproceedings{Govindarajan_Lukovszki_Maheshwari_Zeh_2000, title={I/O-Efficient
    Well-Separated Pair Decomposition and Applications}, DOI={<a href="https://doi.org/10.1007/s00453-005-1197-3">10.1007/s00453-005-1197-3</a>},
    booktitle={Proceedings of the 8th Annual European Symposium on Algorithms (ESA
    2000), LNCS}, author={Govindarajan, Sathish and Lukovszki, Tamas and Maheshwari,
    Anil and Zeh, Norbert}, year={2000}, pages={585–614} }'
  chicago: Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh.
    “I/O-Efficient Well-Separated Pair Decomposition and Applications.” In <i>Proceedings
    of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>, 585–614,
    2000. <a href="https://doi.org/10.1007/s00453-005-1197-3">https://doi.org/10.1007/s00453-005-1197-3</a>.
  ieee: S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated
    Pair Decomposition and Applications,” in <i>Proceedings of the 8th Annual European
    Symposium on Algorithms (ESA 2000), LNCS</i>, 2000, pp. 585–614.
  mla: Govindarajan, Sathish, et al. “I/O-Efficient Well-Separated Pair Decomposition
    and Applications.” <i>Proceedings of the 8th Annual European Symposium on Algorithms
    (ESA 2000), LNCS</i>, 2000, pp. 585–614, doi:<a href="https://doi.org/10.1007/s00453-005-1197-3">10.1007/s00453-005-1197-3</a>.
  short: 'S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of
    the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.'
date_created: 2020-09-03T13:21:02Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1007/s00453-005-1197-3
language:
- iso: eng
page: 585-614
publication: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000),
  LNCS
publication_identifier:
  issn:
  - 0178-4617
  - 1432-0541
publication_status: published
status: public
title: I/O-Efficient Well-Separated Pair Decomposition and Applications
type: conference
user_id: '15415'
year: '2000'
...
---
_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.
    <i>Algorithmica</i>. Published online 1996:413-427. doi:<a href="https://doi.org/10.1007/bf01955042">10.1007/bf01955042</a>
  apa: Meyer auf der Heide, F., Oesterdiekhoff, B., &#38; Wanka, R. (1996). Strongly
    adaptive token distribution. <i>Algorithmica</i>, 413–427. <a href="https://doi.org/10.1007/bf01955042">https://doi.org/10.1007/bf01955042</a>
  bibtex: '@article{Meyer auf der Heide_Oesterdiekhoff_Wanka_1996, title={Strongly
    adaptive token distribution}, DOI={<a href="https://doi.org/10.1007/bf01955042">10.1007/bf01955042</a>},
    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.” <i>Algorithmica</i>, 1996, 413–27. <a
    href="https://doi.org/10.1007/bf01955042">https://doi.org/10.1007/bf01955042</a>.
  ieee: 'F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive
    token distribution,” <i>Algorithmica</i>, pp. 413–427, 1996, doi: <a href="https://doi.org/10.1007/bf01955042">10.1007/bf01955042</a>.'
  mla: Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.”
    <i>Algorithmica</i>, 1996, pp. 413–27, doi:<a href="https://doi.org/10.1007/bf01955042">10.1007/bf01955042</a>.
  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. <i>Algorithmica</i>. 1996:517-542. doi:<a href="https://doi.org/10.1007/bf01940878">10.1007/bf01940878</a>
  apa: Karp, R. M., Luby, M., &#38; Meyer auf der Heide, F. (1996). Efficient PRAM
    simulation on a distributed memory machine. <i>Algorithmica</i>, 517–542. <a href="https://doi.org/10.1007/bf01940878">https://doi.org/10.1007/bf01940878</a>
  bibtex: '@article{Karp_Luby_Meyer auf der Heide_1996, title={Efficient PRAM simulation
    on a distributed memory machine}, DOI={<a href="https://doi.org/10.1007/bf01940878">10.1007/bf01940878</a>},
    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.” <i>Algorithmica</i>, 1996, 517–42.
    <a href="https://doi.org/10.1007/bf01940878">https://doi.org/10.1007/bf01940878</a>.
  ieee: R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation
    on a distributed memory machine,” <i>Algorithmica</i>, pp. 517–542, 1996.
  mla: Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.”
    <i>Algorithmica</i>, 1996, pp. 517–42, doi:<a href="https://doi.org/10.1007/bf01940878">10.1007/bf01940878</a>.
  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'
...