[{"status":"public","_id":"50458","publisher":"Springer Science and Business Media LLC","user_id":"44428","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>","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} }","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>.","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>.","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).","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>","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>."},"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472","_id":"16"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"id":"88252","first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"id":"44428","first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon"}],"year":"2023","title":"Server Cloud Scheduling","publication_status":"published","date_updated":"2024-01-11T11:19:33Z","language":[{"iso":"eng"}],"doi":"10.1007/s00453-023-01189-x","publication":"Algorithmica","extern":"1","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>"}],"date_created":"2024-01-11T11:10:53Z","department":[{"_id":"63"}],"type":"journal_article","keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"]},{"publisher":"Springer Science and Business Media LLC","_id":"31479","language":[{"iso":"eng"}],"genbank":["tillk"],"doi":"10.1007/s00453-022-00978-0","user_id":"39241","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"last_name":"Baswana","first_name":"Surender","full_name":"Baswana, Surender"},{"full_name":"Gupta, Shiv","last_name":"Gupta","first_name":"Shiv"},{"full_name":"Knollmann, Till","last_name":"Knollmann","first_name":"Till","orcid":"0000-0003-2014-4696","id":"39241"}],"title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","year":"2022","status":"public","date_updated":"2022-05-27T10:14:27Z","publication_status":"published","date_created":"2022-05-27T10:09:24Z","department":[{"_id":"63"}],"type":"journal_article","keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"citation":{"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>","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>.","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>.","short":"S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).","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>.","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>","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} }"},"publication":"Algorithmica","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}]},{"intvolume":"        83","date_updated":"2023-12-13T10:51:34Z","author":[{"full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","id":"102979"},{"first_name":"Frank","last_name":"Neumann","full_name":"Neumann, Frank"},{"full_name":"Peng, Pan","first_name":"Pan","last_name":"Peng"},{"full_name":"Sudholt, Dirk","last_name":"Sudholt","first_name":"Dirk"}],"publication_identifier":{"issn":["0178-4617"]},"year":"2021","title":"Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem","doi":"10.1007/s00453-021-00838-3","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"issue":"10","publication":"Algorithmica","department":[{"_id":"819"}],"type":"journal_article","keyword":["Dynamic optimization","Evolutionary algorithms","Running time analysis"],"date_created":"2023-11-14T15:58:54Z","status":"public","volume":83,"user_id":"102979","_id":"48854","page":"3148–3179","citation":{"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>.","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} }","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>","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>.","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>","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>.","short":"J. Bossek, F. Neumann, P. Peng, D. Sudholt, Algorithmica 83 (2021) 3148–3179."}},{"language":[{"iso":"eng"}],"doi":"10.1007/s00453-008-9250-7","author":[{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"last_name":"Lammersen","first_name":"Christiane","full_name":"Lammersen, Christiane"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"year":"2010","title":"Kinetic Facility Location","intvolume":"        57","publication_status":"published","date_updated":"2022-01-06T06:53:57Z","date_created":"2020-09-04T10:35:36Z","department":[{"_id":"63"}],"type":"journal_article","publication":"Algorithmica","issue":"3","_id":"19011","page":"562-584","volume":57,"user_id":"15415","status":"public","citation":{"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>","ieee":"B. Degener, J. Gehweiler, and C. Lammersen, “Kinetic Facility Location,” <i>Algorithmica</i>, vol. 57, no. 3, pp. 562–584, 2010.","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>.","short":"B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584.","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>.","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>","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} }"}},{"volume":28,"user_id":"23","_id":"35857","publisher":"Springer Science and Business Media LLC","page":"2-15","status":"public","citation":{"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>.","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>","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} }","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>","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>.","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>.","short":"J. Blömer, Algorithmica 28 (2002) 2–15."},"doi":"10.1007/s004530010028","language":[{"iso":"eng"}],"intvolume":"        28","date_updated":"2023-01-10T13:48:53Z","publication_status":"published","author":[{"full_name":"Blömer, J.","last_name":"Blömer","first_name":"J."}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"year":"2002","title":"Denesting by Bounded Degree Radicals","department":[{"_id":"64"}],"type":"journal_article","keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"date_created":"2023-01-10T13:44:28Z","issue":"1","publication":"Algorithmica"},{"citation":{"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>.","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>","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} }","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>","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.","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.","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>."},"publication":"Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS","date_created":"2020-09-03T13:21:02Z","department":[{"_id":"63"}],"type":"conference","author":[{"last_name":"Govindarajan","first_name":"Sathish","full_name":"Govindarajan, Sathish"},{"last_name":"Lukovszki","first_name":"Tamas","full_name":"Lukovszki, Tamas"},{"full_name":"Maheshwari, Anil","first_name":"Anil","last_name":"Maheshwari"},{"full_name":"Zeh, Norbert","last_name":"Zeh","first_name":"Norbert"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"year":"2000","title":"I/O-Efficient Well-Separated Pair Decomposition and Applications","status":"public","publication_status":"published","date_updated":"2022-01-06T06:53:55Z","_id":"18962","language":[{"iso":"eng"}],"page":"585-614","user_id":"15415","doi":"10.1007/s00453-005-1197-3"},{"publication":"Algorithmica","citation":{"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>.","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>","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} }","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>","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>.","short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 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>."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-16T11:46:56Z","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","year":"1996","title":"Strongly adaptive token distribution","status":"public","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Oesterdiekhoff, Brigitte","last_name":"Oesterdiekhoff","first_name":"Brigitte"},{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}],"user_id":"15415","doi":"10.1007/bf01955042","page":"413-427","language":[{"iso":"eng"}],"_id":"16699"},{"publication":"Algorithmica","citation":{"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>.","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} }","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>","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.","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>","short":"R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 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>."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-16T11:50:27Z","date_updated":"2022-01-06T06:52:54Z","publication_status":"published","year":"1996","status":"public","title":"Efficient PRAM simulation on a distributed memory machine","author":[{"last_name":"Karp","first_name":"R. M.","full_name":"Karp, R. M."},{"full_name":"Luby, M.","first_name":"M.","last_name":"Luby"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"doi":"10.1007/bf01940878","user_id":"15415","page":"517-542","language":[{"iso":"eng"}],"_id":"16700"}]