[{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"_id":"18910","department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","year":"2010","intvolume":"       282","citation":{"ama":"Bienkowski M. <i>Page Migration in Dynamic Networks</i>. Vol 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","ieee":"M. Bienkowski, <i>Page migration in dynamic networks</i>, vol. 282. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","chicago":"Bienkowski, Marcin. <i>Page Migration in Dynamic Networks</i>. Vol. 282. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"M. Bienkowski, Page Migration in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","bibtex":"@book{Bienkowski_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Page migration in dynamic networks}, volume={282}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bienkowski, Marcin}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Bienkowski, Marcin. <i>Page Migration in Dynamic Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","apa":"Bienkowski, M. (2010). <i>Page migration in dynamic networks</i> (Vol. 282). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"publication_identifier":{"isbn":["978-3-942647-01-4"]},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-2005010135","relation":"confirmation"}]},"title":"Page migration in dynamic networks","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:54Z","volume":282,"date_created":"2020-09-03T07:52:47Z","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"}]},{"volume":284,"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-09-03T10:21:10Z","author":[{"full_name":"Dynia, Miroslaw","last_name":"Dynia","first_name":"Miroslaw"}],"date_updated":"2022-01-06T06:53:54Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","title":"Collective graph exploration","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080225031","relation":"confirmation"}]},"publication_identifier":{"isbn":["978-3-942647-03-8"]},"intvolume":"       284","citation":{"ieee":"M. Dynia, <i>Collective graph exploration</i>, vol. 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","chicago":"Dynia, Miroslaw. <i>Collective Graph Exploration</i>. Vol. 284. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ama":"Dynia M. <i>Collective Graph Exploration</i>. Vol 284. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","apa":"Dynia, M. (2010). <i>Collective graph exploration</i> (Vol. 284). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Dynia_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Collective graph exploration}, volume={284}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Dynia, Miroslaw}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"M. Dynia, Collective Graph Exploration, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","mla":"Dynia, Miroslaw. <i>Collective Graph Exploration</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010."},"year":"2010","department":[{"_id":"63"},{"_id":"26"}],"user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18927","language":[{"iso":"eng"}],"type":"dissertation","status":"public"},{"doi":"10.1007/s00453-008-9250-7","title":"Kinetic Facility Location","volume":57,"author":[{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"},{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"last_name":"Lammersen","full_name":"Lammersen, Christiane","first_name":"Christiane"}],"date_created":"2020-09-04T10:35:36Z","date_updated":"2022-01-06T06:53:57Z","page":"562-584","intvolume":"        57","citation":{"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>.","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>","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>.","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} }","short":"B. Degener, J. Gehweiler, C. Lammersen, Algorithmica 57 (2010) 562–584."},"year":"2010","issue":"3","publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"19011","status":"public","publication":"Algorithmica","type":"journal_article"},{"abstract":[{"text":"4. Auflage 2014","lang":"eng"}],"status":"public","type":"book","language":[{"iso":"ger"}],"_id":"19012","user_id":"14932","series_title":"UTB Basics","department":[{"_id":"465"}],"year":"2010","place":"München","citation":{"apa":"Eke, N. O., &#38; Allkemper, A. (2010). <i>Literaturwissenschaft</i> (3. überarbeitete und erweiterte Auflage). München: Fink.","mla":"Eke, Norbert Otto, and Alo Allkemper. <i>Literaturwissenschaft</i>. 3. überarbeitete und erweiterte Auflage, Fink, 2010.","short":"N.O. Eke, A. Allkemper, Literaturwissenschaft, 3. überarbeitete und erweiterte Auflage, Fink, München, 2010.","bibtex":"@book{Eke_Allkemper_2010, place={München}, edition={3. überarbeitete und erweiterte Auflage}, series={UTB Basics}, title={Literaturwissenschaft}, publisher={Fink}, author={Eke, Norbert Otto and Allkemper, Alo}, year={2010}, collection={UTB Basics} }","ieee":"N. O. Eke and A. Allkemper, <i>Literaturwissenschaft</i>, 3. überarbeitete und erweiterte Auflage. München: Fink, 2010.","chicago":"Eke, Norbert Otto, and Alo Allkemper. <i>Literaturwissenschaft</i>. 3. überarbeitete und erweiterte Auflage. UTB Basics. München: Fink, 2010.","ama":"Eke NO, Allkemper A. <i>Literaturwissenschaft</i>. 3. überarbeitete und erweiterte Auflage. München: Fink; 2010."},"edition":"3. überarbeitete und erweiterte Auflage","title":"Literaturwissenschaft","date_updated":"2022-01-06T06:53:57Z","publisher":"Fink","date_created":"2020-09-04T10:39:11Z","author":[{"full_name":"Eke, Norbert Otto","id":"104","last_name":"Eke","first_name":"Norbert Otto"},{"first_name":"Alo","last_name":"Allkemper","full_name":"Allkemper, Alo"}]},{"type":"conference","publication":"Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)","status":"public","_id":"19013","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781424465330"]},"year":"2010","citation":{"chicago":"Gehweiler, Joachim, and Henning Meyerhenke. “A Distributed Diffusive Heuristic for Clustering a Virtual P2P Supercomputer.” In <i>Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)</i>, 2010. <a href=\"https://doi.org/10.1109/ipdpsw.2010.5470922\">https://doi.org/10.1109/ipdpsw.2010.5470922</a>.","ieee":"J. Gehweiler and H. Meyerhenke, “A distributed diffusive heuristic for clustering a virtual P2P supercomputer,” in <i>Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)</i>, 2010.","ama":"Gehweiler J, Meyerhenke H. A distributed diffusive heuristic for clustering a virtual P2P supercomputer. In: <i>Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1109/ipdpsw.2010.5470922\">10.1109/ipdpsw.2010.5470922</a>","apa":"Gehweiler, J., &#38; Meyerhenke, H. (2010). A distributed diffusive heuristic for clustering a virtual P2P supercomputer. In <i>Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)</i>. <a href=\"https://doi.org/10.1109/ipdpsw.2010.5470922\">https://doi.org/10.1109/ipdpsw.2010.5470922</a>","short":"J. Gehweiler, H. Meyerhenke, in: Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010.","bibtex":"@inproceedings{Gehweiler_Meyerhenke_2010, title={A distributed diffusive heuristic for clustering a virtual P2P supercomputer}, DOI={<a href=\"https://doi.org/10.1109/ipdpsw.2010.5470922\">10.1109/ipdpsw.2010.5470922</a>}, booktitle={Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)}, author={Gehweiler, Joachim and Meyerhenke, Henning}, year={2010} }","mla":"Gehweiler, Joachim, and Henning Meyerhenke. “A Distributed Diffusive Heuristic for Clustering a Virtual P2P Supercomputer.” <i>Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)</i>, 2010, doi:<a href=\"https://doi.org/10.1109/ipdpsw.2010.5470922\">10.1109/ipdpsw.2010.5470922</a>."},"date_updated":"2022-01-06T06:53:57Z","author":[{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"last_name":"Meyerhenke","full_name":"Meyerhenke, Henning","first_name":"Henning"}],"date_created":"2020-09-04T10:39:37Z","title":"A distributed diffusive heuristic for clustering a virtual P2P supercomputer","doi":"10.1109/ipdpsw.2010.5470922"},{"type":"conference","publication":"Dagstuhl Seminar Proceedings 10261: Algorithm Engineering","abstract":[{"text":"Load balancing is an important requirement for the efficient execu-tion of parallel numerical simulations. In particular when the simulation domainchanges over time, the mapping of computational tasks to processors needs tobe  modified  accordingly.  State-of-the-art  libraries  for  this  problem  are  basedon graph repartitioning. They have a number of drawbacks, including the opti-mized metric and the difficulty of parallelizing the popular repartitioning heuris-tic Kernighan-Lin (KL).Here we further explore the very promising diffusion-based graph partitioningalgorithm DIBAP (Meyerhenke et al., JPDC 69(9):750–761, 2009) by adaptingDIBAP  to  the  related  problem  of  load  balancing.  Experiments  with  graph  se-quences that imitate adaptive numerical simulations demonstrate the applicabilityand high quality of DIBAP for load balancing by repartitioning. Compared to thefaster state-of-the-art repartitioners PARMETIS and parallel JOSTLE, DIBAP’ssolutions have partitions with significantly fewer external edges and boundarynodes  and  the  resulting  average  migration  volume  in  the  important  maximumnorm is also the best in most cases.We also prove that one of DIBAP’s key components optimizes a relaxed versionof the minimum edge cut problem. Moreover, we hint at a distributed algorithmbased on ideas used in DIBAP for clustering a virtual P2P supercomputer.","lang":"eng"}],"status":"public","_id":"19016","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"related_material":{"link":[{"url":"https://drops.dagstuhl.de/opus/volltexte/2010/2798/pdf/10261.MeyerhenkeHenning.Paper.2798.pdf","relation":"confirmation"}]},"year":"2010","citation":{"ieee":"J. Gehweiler and H. Meyerhenke, “On Dynamic Graph Partitioning and Graph Clustering using Diffusion,” in <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>, 2010.","chicago":"Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning and Graph Clustering Using Diffusion.” In <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>, 2010.","ama":"Gehweiler J, Meyerhenke H. On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In: <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>. ; 2010.","apa":"Gehweiler, J., &#38; Meyerhenke, H. (2010). On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>.","mla":"Gehweiler, Joachim, and Henning Meyerhenke. “On Dynamic Graph Partitioning and Graph Clustering Using Diffusion.” <i>Dagstuhl Seminar Proceedings 10261: Algorithm Engineering</i>, 2010.","short":"J. Gehweiler, H. Meyerhenke, in: Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010.","bibtex":"@inproceedings{Gehweiler_Meyerhenke_2010, title={On Dynamic Graph Partitioning and Graph Clustering using Diffusion}, booktitle={Dagstuhl Seminar Proceedings 10261: Algorithm Engineering}, author={Gehweiler, Joachim and Meyerhenke, Henning}, year={2010} }"},"date_updated":"2022-01-06T06:53:57Z","date_created":"2020-09-04T10:45:47Z","author":[{"first_name":"Joachim","full_name":"Gehweiler, Joachim","last_name":"Gehweiler"},{"full_name":"Meyerhenke, Henning","last_name":"Meyerhenke","first_name":"Henning"}],"title":"On Dynamic Graph Partitioning and Graph Clustering using Diffusion"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"19018","file_date_updated":"2020-09-04T10:54:26Z","language":[{"iso":"eng"}],"ddc":["000"],"type":"report","file":[{"access_level":"closed","file_name":"tr-ri-10-315.pdf","file_id":"19020","file_size":240725,"date_created":"2020-09-04T10:54:26Z","creator":"koala","date_updated":"2020-09-04T10:54:26Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","date_created":"2020-09-04T10:54:43Z","author":[{"last_name":"Thies","full_name":"Thies, Michael","first_name":"Michael"},{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"}],"date_updated":"2022-01-06T06:53:57Z","title":"Thread Migration and Checkpointing in Java","has_accepted_license":"1","citation":{"ieee":"M. Thies and J. Gehweiler, <i>Thread Migration and Checkpointing in Java</i>. 2010.","chicago":"Thies, Michael, and Joachim Gehweiler. <i>Thread Migration and Checkpointing in Java</i>, 2010.","ama":"Thies M, Gehweiler J. <i>Thread Migration and Checkpointing in Java</i>.; 2010.","apa":"Thies, M., &#38; Gehweiler, J. (2010). <i>Thread Migration and Checkpointing in Java</i>.","bibtex":"@book{Thies_Gehweiler_2010, title={Thread Migration and Checkpointing in Java}, author={Thies, Michael and Gehweiler, Joachim}, year={2010} }","short":"M. Thies, J. Gehweiler, Thread Migration and Checkpointing in Java, 2010.","mla":"Thies, Michael, and Joachim Gehweiler. <i>Thread Migration and Checkpointing in Java</i>. 2010."},"year":"2010"},{"type":"conference","publication":"Artificial Life XII (ALife XII)","status":"public","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"19023","language":[{"iso":"eng"}],"publication_status":"published","citation":{"short":"S. Kernbach, T. Schmickl, H. Hamann, J. Stradner, F. Schlachter, C. s. F. Schwarzer, A.F.T. Winfield, R. Matthias, in: Artificial Life XII (ALife XII), MIT Press, 2010, pp. 781–788.","bibtex":"@inproceedings{Kernbach_Schmickl_Hamann_Stradner_Schlachter_Schwarzer_Winfield_Matthias_2010, title={Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics}, booktitle={Artificial Life XII (ALife XII)}, publisher={MIT Press}, author={Kernbach, Serge and Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Schlachter, Florian and Schwarzer, Christopher s. F. and Winfield, Alan F. T. and Matthias, Rene}, year={2010}, pages={781–788} }","mla":"Kernbach, Serge, et al. “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.” <i>Artificial Life XII (ALife XII)</i>, MIT Press, 2010, pp. 781–88.","apa":"Kernbach, S., Schmickl, T., Hamann, H., Stradner, J., Schlachter, F., Schwarzer, C. s. F., … Matthias, R. (2010). Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics. In <i>Artificial Life XII (ALife XII)</i> (pp. 781–788). MIT Press.","chicago":"Kernbach, Serge, Thomas Schmickl, Heiko Hamann, Jürgen Stradner, Florian Schlachter, Christopher s. F. Schwarzer, Alan F. T. Winfield, and Rene Matthias. “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics.” In <i>Artificial Life XII (ALife XII)</i>, 781–88. MIT Press, 2010.","ieee":"S. Kernbach <i>et al.</i>, “Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics,” in <i>Artificial Life XII (ALife XII)</i>, 2010, pp. 781–788.","ama":"Kernbach S, Schmickl T, Hamann H, et al. Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics. In: <i>Artificial Life XII (ALife XII)</i>. MIT Press; 2010:781-788."},"page":"781-788","year":"2010","date_created":"2020-09-04T11:53:40Z","author":[{"full_name":"Kernbach, Serge","last_name":"Kernbach","first_name":"Serge"},{"first_name":"Thomas","full_name":"Schmickl, Thomas","last_name":"Schmickl"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"full_name":"Stradner, Jürgen","last_name":"Stradner","first_name":"Jürgen"},{"first_name":"Florian","full_name":"Schlachter, Florian","last_name":"Schlachter"},{"first_name":"Christopher s. F.","full_name":"Schwarzer, Christopher s. F.","last_name":"Schwarzer"},{"full_name":"Winfield, Alan F. T.","last_name":"Winfield","first_name":"Alan F. T."},{"first_name":"Rene","last_name":"Matthias","full_name":"Matthias, Rene"}],"publisher":"MIT Press","date_updated":"2022-01-06T06:53:57Z","title":"Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics"},{"title":"Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren","date_created":"2020-09-04T12:02:15Z","author":[{"last_name":"Seng","id":"499","full_name":"Seng, Eva- Maria","first_name":"Eva- Maria"}],"date_updated":"2022-01-06T06:53:57Z","citation":{"short":"E.-M. Seng, in: W. Nerdinger (Ed.), Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne, München, 2010, pp. 78–95 und 224–232.","bibtex":"@inbook{Seng_2010, place={München}, title={Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren}, booktitle={Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne}, author={Seng, Eva- Maria}, editor={Nerdinger, WinfriedEditor}, year={2010}, pages={78–95 und 224–232} }","mla":"Seng, Eva-Maria. “Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren.” <i>Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne</i>, edited by Winfried Nerdinger, 2010, pp. 78–95 und 224–32.","apa":"Seng, E.-M. (2010). Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren. In W. Nerdinger (Ed.), <i>Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne</i> (pp. 78–95 und 224–232). München.","ama":"Seng E-M. Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren. In: Nerdinger W, ed. <i>Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne</i>. München; 2010:78-95 und 224-232.","chicago":"Seng, Eva- Maria. “Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren.” In <i>Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne</i>, edited by Winfried Nerdinger, 78–95 und 224–32. München, 2010.","ieee":"E.-M. Seng, “Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren,” in <i>Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne</i>, W. Nerdinger, Ed. München, 2010, pp. 78–95 und 224–232."},"page":"78-95 und 224-232","year":"2010","place":"München","language":[{"iso":"ger"}],"user_id":"21240","department":[{"_id":"443"}],"_id":"19027","status":"public","editor":[{"last_name":"Nerdinger","full_name":"Nerdinger, Winfried","first_name":"Winfried"}],"type":"book_chapter","publication":"Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne"},{"publication_identifier":{"isbn":["9783642175718","9783642175725"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"2010","citation":{"chicago":"Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” In <i>Workshop on Internet and Network Economics (WINE)</i>, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>.","ieee":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in <i>Workshop on Internet and Network Economics (WINE)</i>, 2010.","ama":"Briest P, Chalermsook P, Khanna S, Laekhanukit B, Nanongkai D. Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In: <i>Workshop on Internet and Network Economics (WINE)</i>. ; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>","apa":"Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., &#38; Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In <i>Workshop on Internet and Network Economics (WINE)</i>. <a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">https://doi.org/10.1007/978-3-642-17572-5_37</a>","short":"P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, D. Nanongkai, in: Workshop on Internet and Network Economics (WINE), 2010.","bibtex":"@inproceedings{Briest_Chalermsook_Khanna_Laekhanukit_Nanongkai_2010, title={Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>}, booktitle={Workshop on Internet and Network Economics (WINE)}, author={Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}, year={2010} }","mla":"Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.” <i>Workshop on Internet and Network Economics (WINE)</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17572-5_37\">10.1007/978-3-642-17572-5_37</a>."},"date_updated":"2022-01-06T06:53:57Z","date_created":"2020-09-04T12:01:18Z","author":[{"last_name":"Briest","full_name":"Briest, Patrick","first_name":"Patrick"},{"first_name":"Parinya","full_name":"Chalermsook, Parinya","last_name":"Chalermsook"},{"first_name":"Sanjeev","full_name":"Khanna, Sanjeev","last_name":"Khanna"},{"full_name":"Laekhanukit, Bundit","last_name":"Laekhanukit","first_name":"Bundit"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"title":"Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing","doi":"10.1007/978-3-642-17572-5_37","publication":"Workshop on Internet and Network Economics (WINE)","type":"conference","status":"public","_id":"19029","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","_id":"1903","status":"public","publication":"Informatik Spektrum","type":"journal_article","doi":"10.1007/s00287-010-0470-2","title":"Algorithmische Grundlagen verteilter Speichersysteme","date_created":"2018-03-28T07:21:50Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T06:53:57Z","page":"468--474","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” <i>Informatik Spektrum</i>, no. 5 (2010): 468--474. <a href=\"https://doi.org/10.1007/s00287-010-0470-2\">https://doi.org/10.1007/s00287-010-0470-2</a>.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Algorithmische Grundlagen verteilter Speichersysteme,” <i>Informatik Spektrum</i>, no. 5, pp. 468--474, 2010.","ama":"Meyer auf der Heide F, Scheideler C. Algorithmische Grundlagen verteilter Speichersysteme. <i>Informatik Spektrum</i>. 2010;(5):468--474. doi:<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. <i>Informatik Spektrum</i>, (5), 468--474. <a href=\"https://doi.org/10.1007/s00287-010-0470-2\">https://doi.org/10.1007/s00287-010-0470-2</a>","bibtex":"@article{Meyer auf der Heide_Scheideler_2010, title={Algorithmische Grundlagen verteilter Speichersysteme}, DOI={<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>}, number={5}, journal={Informatik Spektrum}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2010}, pages={468--474} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.” <i>Informatik Spektrum</i>, no. 5, 2010, pp. 468--474, doi:<a href=\"https://doi.org/10.1007/s00287-010-0470-2\">10.1007/s00287-010-0470-2</a>.","short":"F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474."},"year":"2010","issue":"5"},{"year":"2010","citation":{"ama":"Seng E-M. Stadtbaukunst. <i>Enzyklopädie der Neuzeit, Stuttgart</i>. 2010.","ieee":"E.-M. Seng, “Stadtbaukunst,” <i>Enzyklopädie der Neuzeit, Stuttgart</i>, 2010.","chicago":"Seng, Eva- Maria. “Stadtbaukunst.” <i>Enzyklopädie der Neuzeit, Stuttgart</i>, 2010.","bibtex":"@article{Seng_2010, title={Stadtbaukunst}, journal={Enzyklopädie der Neuzeit, Stuttgart}, author={Seng, Eva- Maria}, year={2010} }","short":"E.-M. Seng, Enzyklopädie der Neuzeit, Stuttgart (2010).","mla":"Seng, Eva-Maria. “Stadtbaukunst.” <i>Enzyklopädie der Neuzeit, Stuttgart</i>, 2010.","apa":"Seng, E.-M. (2010). Stadtbaukunst. <i>Enzyklopädie der Neuzeit, Stuttgart</i>."},"title":"Stadtbaukunst","date_updated":"2022-01-06T06:53:57Z","author":[{"id":"499","full_name":"Seng, Eva- Maria","last_name":"Seng","first_name":"Eva- Maria"}],"date_created":"2020-09-04T12:10:05Z","status":"public","type":"journal_article","publication":"Enzyklopädie der Neuzeit, Stuttgart","alternative_title":["Artikel"],"language":[{"iso":"ger"}],"_id":"19032","user_id":"21240","department":[{"_id":"443"}]},{"year":"2010","citation":{"mla":"Briest, Patrick, et al. “Pricing Randomized Allocations.” <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2010, doi:<a href=\"https://doi.org/10.1137/1.9781611973075.49\">10.1137/1.9781611973075.49</a>.","bibtex":"@inproceedings{Briest_Chawla_Kleinberg_Weinberg_2010, title={Pricing Randomized Allocations}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973075.49\">10.1137/1.9781611973075.49</a>}, booktitle={Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert and Weinberg, S. Matthew}, year={2010} }","short":"P. Briest, S. Chawla, R. Kleinberg, S.M. Weinberg, in: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010.","apa":"Briest, P., Chawla, S., Kleinberg, R., &#38; Weinberg, S. M. (2010). Pricing Randomized Allocations. In <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>. <a href=\"https://doi.org/10.1137/1.9781611973075.49\">https://doi.org/10.1137/1.9781611973075.49</a>","ama":"Briest P, Chawla S, Kleinberg R, Weinberg SM. Pricing Randomized Allocations. In: <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>. ; 2010. doi:<a href=\"https://doi.org/10.1137/1.9781611973075.49\">10.1137/1.9781611973075.49</a>","chicago":"Briest, Patrick, Shuchi Chawla, Robert Kleinberg, and S. Matthew Weinberg. “Pricing Randomized Allocations.” In <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2010. <a href=\"https://doi.org/10.1137/1.9781611973075.49\">https://doi.org/10.1137/1.9781611973075.49</a>.","ieee":"P. Briest, S. Chawla, R. Kleinberg, and S. M. Weinberg, “Pricing Randomized Allocations,” in <i>Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2010."},"publication_status":"published","publication_identifier":{"isbn":["9780898717013","9781611973075"]},"title":"Pricing Randomized Allocations","doi":"10.1137/1.9781611973075.49","date_updated":"2022-01-06T06:53:57Z","date_created":"2020-09-04T12:15:39Z","author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"},{"first_name":"Shuchi","last_name":"Chawla","full_name":"Chawla, Shuchi"},{"full_name":"Kleinberg, Robert","last_name":"Kleinberg","first_name":"Robert"},{"first_name":"S. Matthew","last_name":"Weinberg","full_name":"Weinberg, S. Matthew"}],"status":"public","type":"conference","publication":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","language":[{"iso":"eng"}],"_id":"19033","user_id":"15415","department":[{"_id":"63"}]},{"citation":{"bibtex":"@article{Gavoille_Patt-Shamir_Scheideler_2010, title={Foreword}, DOI={<a href=\"https://doi.org/10.1007/s00224-010-9284-5\">10.1007/s00224-010-9284-5</a>}, number={4}, journal={Theory of Computing Systems}, author={Gavoille, Cyril and Patt-Shamir, Boaz and Scheideler, Christian}, year={2010}, pages={809--810} }","short":"C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010) 809--810.","mla":"Gavoille, Cyril, et al. “Foreword.” <i>Theory of Computing Systems</i>, no. 4, 2010, pp. 809--810, doi:<a href=\"https://doi.org/10.1007/s00224-010-9284-5\">10.1007/s00224-010-9284-5</a>.","apa":"Gavoille, C., Patt-Shamir, B., &#38; Scheideler, C. (2010). Foreword. <i>Theory of Computing Systems</i>, (4), 809--810. <a href=\"https://doi.org/10.1007/s00224-010-9284-5\">https://doi.org/10.1007/s00224-010-9284-5</a>","ama":"Gavoille C, Patt-Shamir B, Scheideler C. Foreword. <i>Theory of Computing Systems</i>. 2010;(4):809--810. doi:<a href=\"https://doi.org/10.1007/s00224-010-9284-5\">10.1007/s00224-010-9284-5</a>","chicago":"Gavoille, Cyril, Boaz Patt-Shamir, and Christian Scheideler. “Foreword.” <i>Theory of Computing Systems</i>, no. 4 (2010): 809--810. <a href=\"https://doi.org/10.1007/s00224-010-9284-5\">https://doi.org/10.1007/s00224-010-9284-5</a>.","ieee":"C. Gavoille, B. Patt-Shamir, and C. Scheideler, “Foreword,” <i>Theory of Computing Systems</i>, no. 4, pp. 809--810, 2010."},"page":"809--810","year":"2010","issue":"4","doi":"10.1007/s00224-010-9284-5","title":"Foreword","author":[{"first_name":"Cyril","full_name":"Gavoille, Cyril","last_name":"Gavoille"},{"last_name":"Patt-Shamir","full_name":"Patt-Shamir, Boaz","first_name":"Boaz"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2018-03-28T07:22:21Z","date_updated":"2022-01-06T06:53:57Z","status":"public","type":"journal_article","publication":"Theory of Computing Systems","user_id":"15504","department":[{"_id":"79"}],"_id":"1904"},{"_id":"19041","user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"language":[{"iso":"eng"}],"type":"dissertation","status":"public","date_updated":"2022-01-06T06:53:57Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Mahlmann, Peter","last_name":"Mahlmann","first_name":"Peter"}],"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-09-04T14:05:30Z","volume":283,"title":"Peer-to-peer networks based on random graphs","publication_identifier":{"isbn":["978-3-942647-02-1"]},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100421015","relation":"confirmation"}]},"year":"2010","citation":{"chicago":"Mahlmann, Peter. <i>Peer-to-Peer Networks Based on Random Graphs</i>. Vol. 283. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ieee":"P. Mahlmann, <i>Peer-to-peer networks based on random graphs</i>, vol. 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ama":"Mahlmann P. <i>Peer-to-Peer Networks Based on Random Graphs</i>. Vol 283. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","short":"P. Mahlmann, Peer-to-Peer Networks Based on Random Graphs, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","mla":"Mahlmann, Peter. <i>Peer-to-Peer Networks Based on Random Graphs</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","bibtex":"@book{Mahlmann_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Peer-to-peer networks based on random graphs}, volume={283}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mahlmann, Peter}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Mahlmann, P. (2010). <i>Peer-to-peer networks based on random graphs</i> (Vol. 283). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"intvolume":"       283"},{"type":"dissertation","status":"public","department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","_id":"19042","language":[{"iso":"eng"}],"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20100429011","relation":"confirmation"}]},"publication_identifier":{"isbn":["978-3-939350-97-2 "]},"intvolume":"       278","citation":{"chicago":"Degener, Bastian. <i>Local, Distributed Approximation Algorithms for Geometric Assignment Problems</i>. Vol. 278. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ieee":"B. Degener, <i>Local, distributed approximation algorithms for geometric assignment problems</i>, vol. 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","ama":"Degener B. <i>Local, Distributed Approximation Algorithms for Geometric Assignment Problems</i>. Vol 278. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2010.","apa":"Degener, B. (2010). <i>Local, distributed approximation algorithms for geometric assignment problems</i> (Vol. 278). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Degener, Bastian. <i>Local, Distributed Approximation Algorithms for Geometric Assignment Problems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","short":"B. Degener, Local, Distributed Approximation Algorithms for Geometric Assignment Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2010.","bibtex":"@book{Degener_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Local, distributed approximation algorithms for geometric assignment problems}, volume={278}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Degener, Bastian}, year={2010}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"year":"2010","volume":278,"author":[{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"}],"supervisor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-09-04T14:08:57Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:57Z","title":"Local, distributed approximation algorithms for geometric assignment problems"},{"date_created":"2018-03-28T07:22:42Z","author":[{"first_name":"Dominik","last_name":"Gall","full_name":"Gall, Dominik"},{"full_name":"Jacob, Riko","last_name":"Jacob","first_name":"Riko"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Täubig","full_name":"Täubig, Hanjo","first_name":"Hanjo"}],"volume":6034,"date_updated":"2022-01-06T06:53:57Z","publisher":"Springer","doi":"10.1007/978-3-642-12200-2_27","title":"Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization","publication_identifier":{"isbn":["978-3-642-12199-9"]},"citation":{"ama":"Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In: <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>. Vol 6034. Lecture Notes in Computer Science. Springer; 2010:294--305. doi:<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.” In <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, 6034:294--305. Lecture Notes in Computer Science. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">https://doi.org/10.1007/978-3-642-12200-2_27</a>.","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization,” in <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, 2010, vol. 6034, pp. 294--305.","bibtex":"@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2010, series={Lecture Notes in Computer Science}, title={Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization}, volume={6034}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>}, booktitle={LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2010}, pages={294--305}, collection={Lecture Notes in Computer Science} }","short":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, Springer, 2010, pp. 294--305.","mla":"Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.” <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, vol. 6034, Springer, 2010, pp. 294--305, doi:<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>.","apa":"Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &#38; Täubig, H. (2010). Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i> (Vol. 6034, pp. 294--305). Springer. <a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">https://doi.org/10.1007/978-3-642-12200-2_27</a>"},"intvolume":"      6034","page":"294--305","year":"2010","series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"79"}],"_id":"1905","type":"conference","publication":"LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings","status":"public"},{"publication_identifier":{"isbn":["978-1-60558-888-9"]},"page":"114--115","citation":{"ama":"Richa AW, Zhang J, Scheideler C, Schmid S. Brief announcement: towards robust medium access in multi-hop networks. In: <i>Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010</i>. ACM; 2010:114--115. doi:<a href=\"https://doi.org/10.1145/1835698.1835726\">10.1145/1835698.1835726</a>","chicago":"Richa, Andrea W., Jin Zhang, Christian Scheideler, and Stefan Schmid. “Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” In <i>Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010</i>, 114--115. ACM, 2010. <a href=\"https://doi.org/10.1145/1835698.1835726\">https://doi.org/10.1145/1835698.1835726</a>.","ieee":"A. W. Richa, J. Zhang, C. Scheideler, and S. Schmid, “Brief announcement: towards robust medium access in multi-hop networks,” in <i>Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010</i>, 2010, pp. 114--115.","mla":"Richa, Andrea W., et al. “Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” <i>Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010</i>, ACM, 2010, pp. 114--115, doi:<a href=\"https://doi.org/10.1145/1835698.1835726\">10.1145/1835698.1835726</a>.","short":"A.W. Richa, J. Zhang, C. Scheideler, S. Schmid, in: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115.","bibtex":"@inproceedings{Richa_Zhang_Scheideler_Schmid_2010, title={Brief announcement: towards robust medium access in multi-hop networks}, DOI={<a href=\"https://doi.org/10.1145/1835698.1835726\">10.1145/1835698.1835726</a>}, booktitle={Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010}, publisher={ACM}, author={Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid, Stefan}, year={2010}, pages={114--115} }","apa":"Richa, A. W., Zhang, J., Scheideler, C., &#38; Schmid, S. (2010). Brief announcement: towards robust medium access in multi-hop networks. In <i>Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010</i> (pp. 114--115). ACM. <a href=\"https://doi.org/10.1145/1835698.1835726\">https://doi.org/10.1145/1835698.1835726</a>"},"year":"2010","author":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"date_created":"2018-03-28T07:23:32Z","date_updated":"2022-01-06T06:53:57Z","publisher":"ACM","doi":"10.1145/1835698.1835726","title":"Brief announcement: towards robust medium access in multi-hop networks","publication":"Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010","type":"conference","status":"public","department":[{"_id":"79"}],"user_id":"15504","_id":"1906"},{"date_updated":"2022-01-06T06:53:58Z","publisher":"Springer","author":[{"full_name":"Richa, Andrea W.","last_name":"Richa","first_name":"Andrea W."},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"}],"date_created":"2018-03-28T07:24:22Z","volume":6343,"title":"A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks","doi":"10.1007/978-3-642-15763-9_17","publication_identifier":{"isbn":["978-3-642-15762-2"]},"year":"2010","citation":{"mla":"Richa, Andrea W., et al. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, vol. 6343, Springer, 2010, pp. 179--193, doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_17\">10.1007/978-3-642-15763-9_17</a>.","short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 2010, pp. 179--193.","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2010, series={Lecture Notes in Computer Science}, title={A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks}, volume={6343}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15763-9_17\">10.1007/978-3-642-15763-9_17</a>}, booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2010}, pages={179--193}, collection={Lecture Notes in Computer Science} }","apa":"Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2010). A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i> (Vol. 6343, pp. 179--193). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_17\">https://doi.org/10.1007/978-3-642-15763-9_17</a>","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In: <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>. Vol 6343. Lecture Notes in Computer Science. Springer; 2010:179--193. doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_17\">10.1007/978-3-642-15763-9_17</a>","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks,” in <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, 2010, vol. 6343, pp. 179--193.","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” In <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, 6343:179--193. Lecture Notes in Computer Science. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_17\">https://doi.org/10.1007/978-3-642-15763-9_17</a>."},"intvolume":"      6343","page":"179--193","_id":"1907","series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"79"}],"type":"conference","publication":"Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings","status":"public"},{"volume":6343,"author":[{"first_name":"Benjamin","full_name":"Doerr, Benjamin","last_name":"Doerr"},{"first_name":"Leslie","last_name":"Ann Goldberg","full_name":"Ann Goldberg, Leslie"},{"first_name":"Lorenz","last_name":"Minder","full_name":"Minder, Lorenz"},{"full_name":"Sauerwald, Thomas","last_name":"Sauerwald","first_name":"Thomas"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-28T07:25:45Z","publisher":"Springer","date_updated":"2022-01-06T06:53:58Z","doi":"10.1007/978-3-642-15763-9_50","title":"Brief Announcement: Stabilizing Consensus with the Power of Two Choices","intvolume":"      6343","page":"528--530","citation":{"short":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 2010, pp. 528--530.","bibtex":"@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2010, series={Lecture Notes in Computer Science}, title={Brief Announcement: Stabilizing Consensus with the Power of Two Choices}, volume={6343}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15763-9_50\">10.1007/978-3-642-15763-9_50</a>}, booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2010}, pages={528--530}, collection={Lecture Notes in Computer Science} }","mla":"Doerr, Benjamin, et al. “Brief Announcement: Stabilizing Consensus with the Power of Two Choices.” <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, vol. 6343, Springer, 2010, pp. 528--530, doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_50\">10.1007/978-3-642-15763-9_50</a>.","apa":"Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., &#38; Scheideler, C. (2010). Brief Announcement: Stabilizing Consensus with the Power of Two Choices. In <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i> (Vol. 6343, pp. 528--530). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_50\">https://doi.org/10.1007/978-3-642-15763-9_50</a>","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Brief Announcement: Stabilizing Consensus with the Power of Two Choices.” In <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, 6343:528--530. Lecture Notes in Computer Science. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15763-9_50\">https://doi.org/10.1007/978-3-642-15763-9_50</a>.","ieee":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Brief Announcement: Stabilizing Consensus with the Power of Two Choices,” in <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>, 2010, vol. 6343, pp. 528--530.","ama":"Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Brief Announcement: Stabilizing Consensus with the Power of Two Choices. In: <i>Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings</i>. Vol 6343. Lecture Notes in Computer Science. Springer; 2010:528--530. doi:<a href=\"https://doi.org/10.1007/978-3-642-15763-9_50\">10.1007/978-3-642-15763-9_50</a>"},"year":"2010","department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","_id":"1908","publication":"Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings","type":"conference","status":"public"}]