[{"author":[{"first_name":"Olaf","full_name":"Bonorden, Olaf","last_name":"Bonorden"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Wanka, Rolf","last_name":"Wanka","first_name":"Rolf"}],"date_created":"2020-09-28T10:49:50Z","date_updated":"2022-01-06T06:54:10Z","title":"Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example","citation":{"ieee":"O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example,” in <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2002, pp. 2202–2208.","chicago":"Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” In <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2202–8, 2002.","ama":"Bonorden O, Meyer auf der Heide F, Wanka R. Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In: <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>. ; 2002:2202-2208.","short":"O. Bonorden, F. Meyer auf der Heide, R. Wanka, in: Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.","bibtex":"@inproceedings{Bonorden_Meyer auf der Heide_Wanka_2002, title={Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example}, booktitle={Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2002}, pages={2202–2208} }","mla":"Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2002, pp. 2202–08.","apa":"Bonorden, O., Meyer auf der Heide, F., &#38; Wanka, R. (2002). Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i> (pp. 2202–2208)."},"page":"2202-2208","year":"2002","user_id":"15415","department":[{"_id":"63"}],"_id":"19727","language":[{"iso":"eng"}],"type":"conference","publication":"Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)","status":"public"},{"doi":"10.1007/3-540-36379-3_36","title":"Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal","author":[{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"}],"date_created":"2020-10-02T11:16:31Z","date_updated":"2022-01-06T06:54:13Z","page":"413-420","citation":{"short":"R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Berlin, Heidelberg, 2002, pp. 413–420.","mla":"Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>, 2002, pp. 413–20, doi:<a href=\"https://doi.org/10.1007/3-540-36379-3_36\">10.1007/3-540-36379-3_36</a>.","bibtex":"@inproceedings{Wanka_2002, place={Berlin, Heidelberg}, title={Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal}, DOI={<a href=\"https://doi.org/10.1007/3-540-36379-3_36\">10.1007/3-540-36379-3_36</a>}, booktitle={Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)}, author={Wanka, Rolf}, year={2002}, pages={413–420} }","apa":"Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i> (pp. 413–420). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-36379-3_36\">https://doi.org/10.1007/3-540-36379-3_36</a>","chicago":"Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” In <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>, 413–20. Berlin, Heidelberg, 2002. <a href=\"https://doi.org/10.1007/3-540-36379-3_36\">https://doi.org/10.1007/3-540-36379-3_36</a>.","ieee":"R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal,” in <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>, 2002, pp. 413–420.","ama":"Wanka R. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In: <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>. Berlin, Heidelberg; 2002:413-420. doi:<a href=\"https://doi.org/10.1007/3-540-36379-3_36\">10.1007/3-540-36379-3_36</a>"},"place":"Berlin, Heidelberg","year":"2002","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540003311","9783540363798"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"19850","status":"public","publication":"Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)","type":"conference"},{"date_updated":"2022-01-06T06:54:14Z","date_created":"2020-10-05T09:51:08Z","author":[{"last_name":"Klein","full_name":"Klein, Jan","first_name":"Jan"},{"first_name":"Jens","full_name":"Krokowski, Jens","last_name":"Krokowski"},{"last_name":"Cuntz","full_name":"Cuntz, Nicolas","first_name":"Nicolas"}],"title":"Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression","year":"2002","citation":{"apa":"Klein, J., Krokowski, J., &#38; Cuntz, N. (2002). Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression. In <i>Proc. of 4. GI-Informatiktage</i> (pp. 224–229).","bibtex":"@inproceedings{Klein_Krokowski_Cuntz_2002, title={Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression}, booktitle={Proc. of 4. GI-Informatiktage}, author={Klein, Jan and Krokowski, Jens and Cuntz, Nicolas}, year={2002}, pages={224–229} }","short":"J. Klein, J. Krokowski, N. Cuntz, in: Proc. of 4. GI-Informatiktage, 2002, pp. 224–229.","mla":"Klein, Jan, et al. “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression.” <i>Proc. of 4. GI-Informatiktage</i>, 2002, pp. 224–29.","ieee":"J. Klein, J. Krokowski, and N. Cuntz, “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression,” in <i>Proc. of 4. GI-Informatiktage</i>, 2002, pp. 224–229.","chicago":"Klein, Jan, Jens Krokowski, and Nicolas Cuntz. “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression.” In <i>Proc. of 4. GI-Informatiktage</i>, 224–29, 2002.","ama":"Klein J, Krokowski J, Cuntz N. Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression. In: <i>Proc. of 4. GI-Informatiktage</i>. ; 2002:224-229."},"page":"224-229","_id":"19873","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proc. of 4. GI-Informatiktage","abstract":[{"lang":"eng","text":"We present a new and easy to use framework for navigating through scenes of arbitrary complexity and topology. In the preprocessing, images for discrete viewpoints and viewing directions are rendered and stored on an external volume. During navigation each image can be displayed within a very short time by loading it from the volume. For acceleration, our prefetching strategy loads possibly needed images for the next few frames if the viewer takes a break. The measurements show that we achieve interactive frame rates, whereby the difference between the minimal and maximal display time is very small. Our system works well with scenes modelled by polygons, but also digital photos can easily be used for describing a 3D scene."}],"status":"public"},{"date_created":"2018-04-17T15:13:50Z","author":[{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"},{"full_name":"Enzler, Rolf","last_name":"Enzler","first_name":"Rolf"},{"full_name":"Walder, Herbert","last_name":"Walder","first_name":"Herbert"},{"first_name":"Jan","last_name":"Beutel","full_name":"Beutel, Jan"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"},{"first_name":"Lothar","last_name":"Thiele","full_name":"Thiele, Lothar"}],"date_updated":"2022-01-06T06:56:13Z","publisher":"IEEE Computer Society","doi":"10.1109/ISWC.2002.1167250","title":"Reconfigurable Hardware in Wearable Computing Nodes","publication_identifier":{"isbn":["0-7695-1816-8"]},"page":"215-222","citation":{"ieee":"C. Plessl, R. Enzler, H. Walder, J. Beutel, M. Platzner, and L. Thiele, “Reconfigurable Hardware in Wearable Computing Nodes,” in <i>Proc. Int. Symp. on Wearable Computers (ISWC)</i>, 2002, pp. 215–222.","chicago":"Plessl, Christian, Rolf Enzler, Herbert Walder, Jan Beutel, Marco Platzner, and Lothar Thiele. “Reconfigurable Hardware in Wearable Computing Nodes.” In <i>Proc. Int. Symp. on Wearable Computers (ISWC)</i>, 215–22. IEEE Computer Society, 2002. <a href=\"https://doi.org/10.1109/ISWC.2002.1167250\">https://doi.org/10.1109/ISWC.2002.1167250</a>.","ama":"Plessl C, Enzler R, Walder H, Beutel J, Platzner M, Thiele L. Reconfigurable Hardware in Wearable Computing Nodes. In: <i>Proc. Int. Symp. on Wearable Computers (ISWC)</i>. IEEE Computer Society; 2002:215-222. doi:<a href=\"https://doi.org/10.1109/ISWC.2002.1167250\">10.1109/ISWC.2002.1167250</a>","apa":"Plessl, C., Enzler, R., Walder, H., Beutel, J., Platzner, M., &#38; Thiele, L. (2002). Reconfigurable Hardware in Wearable Computing Nodes. In <i>Proc. Int. Symp. on Wearable Computers (ISWC)</i> (pp. 215–222). IEEE Computer Society. <a href=\"https://doi.org/10.1109/ISWC.2002.1167250\">https://doi.org/10.1109/ISWC.2002.1167250</a>","bibtex":"@inproceedings{Plessl_Enzler_Walder_Beutel_Platzner_Thiele_2002, title={Reconfigurable Hardware in Wearable Computing Nodes}, DOI={<a href=\"https://doi.org/10.1109/ISWC.2002.1167250\">10.1109/ISWC.2002.1167250</a>}, booktitle={Proc. Int. Symp. on Wearable Computers (ISWC)}, publisher={IEEE Computer Society}, author={Plessl, Christian and Enzler, Rolf and Walder, Herbert and Beutel, Jan and Platzner, Marco and Thiele, Lothar}, year={2002}, pages={215–222} }","short":"C. Plessl, R. Enzler, H. Walder, J. Beutel, M. Platzner, L. Thiele, in: Proc. Int. Symp. on Wearable Computers (ISWC), IEEE Computer Society, 2002, pp. 215–222.","mla":"Plessl, Christian, et al. “Reconfigurable Hardware in Wearable Computing Nodes.” <i>Proc. Int. Symp. on Wearable Computers (ISWC)</i>, IEEE Computer Society, 2002, pp. 215–22, doi:<a href=\"https://doi.org/10.1109/ISWC.2002.1167250\">10.1109/ISWC.2002.1167250</a>."},"year":"2002","department":[{"_id":"518"},{"_id":"78"}],"user_id":"24135","_id":"2423","keyword":["wearable computing"],"publication":"Proc. Int. Symp. on Wearable Computers (ISWC)","type":"conference","status":"public","abstract":[{"text":"Wearable computers are embedded into the mobile environment of the human body. A design challenge for wearable systems is to combine the high performance required for tasks such as video decoding with low energy consumption required to maximize battery runtimes and the flexibility demanded by the dynamics of the environment and the applications. In this paper, we demonstrate that reconfigurable hardware technology is able to answer this challenge. We present the concept and the prototype implementation of an autonomous wearable unit with reconfigurable modules (WURM). We discuss two experiments that show the uses of reconfigurable hardware in WURM: ASICs-on-demand and adaptive interfaces. Finally, we develop and evaluate task placement techniques used in the operating system layer of WURM.","lang":"eng"}]},{"year":"2002","citation":{"apa":"Dyer, M., Plessl, C., &#38; Platzner, M. (2002). Partially Reconfigurable Cores for Xilinx Virtex. In <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i> (Vol. 2438, pp. 292–301). Springer. <a href=\"https://doi.org/10.1007/3-540-46117-5\">https://doi.org/10.1007/3-540-46117-5</a>","short":"M. Dyer, C. Plessl, M. Platzner, in: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL), Springer, 2002, pp. 292–301.","bibtex":"@inproceedings{Dyer_Plessl_Platzner_2002, series={Lecture Notes in Computer Science (LNCS)}, title={Partially Reconfigurable Cores for Xilinx Virtex}, volume={2438}, DOI={<a href=\"https://doi.org/10.1007/3-540-46117-5\">10.1007/3-540-46117-5</a>}, booktitle={Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}, publisher={Springer}, author={Dyer, Matthias and Plessl, Christian and Platzner, Marco}, year={2002}, pages={292–301}, collection={Lecture Notes in Computer Science (LNCS)} }","mla":"Dyer, Matthias, et al. “Partially Reconfigurable Cores for Xilinx Virtex.” <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, vol. 2438, Springer, 2002, pp. 292–301, doi:<a href=\"https://doi.org/10.1007/3-540-46117-5\">10.1007/3-540-46117-5</a>.","ama":"Dyer M, Plessl C, Platzner M. Partially Reconfigurable Cores for Xilinx Virtex. In: <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. Vol 2438. Lecture Notes in Computer Science (LNCS). Springer; 2002:292-301. doi:<a href=\"https://doi.org/10.1007/3-540-46117-5\">10.1007/3-540-46117-5</a>","chicago":"Dyer, Matthias, Christian Plessl, and Marco Platzner. “Partially Reconfigurable Cores for Xilinx Virtex.” In <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, 2438:292–301. Lecture Notes in Computer Science (LNCS). Springer, 2002. <a href=\"https://doi.org/10.1007/3-540-46117-5\">https://doi.org/10.1007/3-540-46117-5</a>.","ieee":"M. Dyer, C. Plessl, and M. Platzner, “Partially Reconfigurable Cores for Xilinx Virtex,” in <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, 2002, vol. 2438, pp. 292–301."},"page":"292-301","intvolume":"      2438","title":"Partially Reconfigurable Cores for Xilinx Virtex","doi":"10.1007/3-540-46117-5","publisher":"Springer","date_updated":"2022-01-06T06:56:13Z","date_created":"2018-04-17T15:14:39Z","author":[{"first_name":"Matthias","last_name":"Dyer","full_name":"Dyer, Matthias"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"volume":2438,"abstract":[{"text":" Recent generations of high-density and high-speed FPGAs provide a sufficient capacity for implementing complete configurable systems on a chip (CSoCs). Hybrid CPUs that combine standard CPU cores with reconfigurable coprocessors are an important subclass of CSoCs. With partially reconfigurable FPGAs, coprocessors can be loaded on demand while the CPU remains running. However, the lack of high-level design tools for partial reconfiguration makes practical implementations a challenging task. In this paper, we introduce a design flow to implement hybrid processors on Xilinx Virtex. The design flow is based on two techniques, virtual sockets and feed-through components, and can efficiently generate partial configurations from industry-quality cores. We discuss the design flow and present a fully operational audio streaming prototype to demonstrate its feasibility. ","lang":"eng"}],"status":"public","type":"conference","publication":"Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)","keyword":["partial reconfiguration"],"_id":"2424","series_title":"Lecture Notes in Computer Science (LNCS)","user_id":"24135","department":[{"_id":"518"},{"_id":"78"}]},{"publication":"Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)","type":"conference","abstract":[{"text":" We present instance-specific custom computing machines for the set covering problem. Four accelerator architectures are developed that implement branch \\& bound in 3-valued logic and many of the deduction techniques found in software solvers. We use set covering benchmarks from two-level logic minimization and Steiner triple systems to derive and discuss experimental results. The resulting raw speedups are in the order of four magnitudes on average. Finally, we propose a hybrid solver architecture that combines the raw speed of instance-specific reconfigurable hardware with flexible bounding schemes implemented in software. ","lang":"eng"}],"status":"public","_id":"2425","department":[{"_id":"518"},{"_id":"78"}],"user_id":"24135","year":"2002","page":"163-172","citation":{"bibtex":"@inproceedings{Plessl_Platzner_2002, title={Custom Computing Machines for the Set Covering Problem}, DOI={<a href=\"https://doi.org/10.1109/FPGA.2002.1106671\">10.1109/FPGA.2002.1106671</a>}, booktitle={Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)}, publisher={IEEE Computer Society}, author={Plessl, Christian and Platzner, Marco}, year={2002}, pages={163–172} }","short":"C. Plessl, M. Platzner, in: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM), IEEE Computer Society, 2002, pp. 163–172.","mla":"Plessl, Christian, and Marco Platzner. “Custom Computing Machines for the Set Covering Problem.” <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>, IEEE Computer Society, 2002, pp. 163–72, doi:<a href=\"https://doi.org/10.1109/FPGA.2002.1106671\">10.1109/FPGA.2002.1106671</a>.","apa":"Plessl, C., &#38; Platzner, M. (2002). Custom Computing Machines for the Set Covering Problem. In <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i> (pp. 163–172). IEEE Computer Society. <a href=\"https://doi.org/10.1109/FPGA.2002.1106671\">https://doi.org/10.1109/FPGA.2002.1106671</a>","ama":"Plessl C, Platzner M. Custom Computing Machines for the Set Covering Problem. In: <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>. IEEE Computer Society; 2002:163-172. doi:<a href=\"https://doi.org/10.1109/FPGA.2002.1106671\">10.1109/FPGA.2002.1106671</a>","chicago":"Plessl, Christian, and Marco Platzner. “Custom Computing Machines for the Set Covering Problem.” In <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>, 163–72. IEEE Computer Society, 2002. <a href=\"https://doi.org/10.1109/FPGA.2002.1106671\">https://doi.org/10.1109/FPGA.2002.1106671</a>.","ieee":"C. Plessl and M. Platzner, “Custom Computing Machines for the Set Covering Problem,” in <i>Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)</i>, 2002, pp. 163–172."},"publisher":"IEEE Computer Society","date_updated":"2022-01-06T06:56:13Z","date_created":"2018-04-17T15:15:44Z","author":[{"first_name":"Christian","full_name":"Plessl, Christian","id":"16153","orcid":"0000-0001-5728-9982","last_name":"Plessl"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"title":"Custom Computing Machines for the Set Covering Problem","doi":"10.1109/FPGA.2002.1106671"},{"_id":"24336","user_id":"15415","department":[{"_id":"63"}],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2021-09-14T09:09:28Z","type":"journal_article","publication":"Proc. of 10th International Workshop on Abstract State Machines, LNCS","abstract":[{"lang":"eng","text":"We  define  here  a  distributed  abstract state  machine (DASM)  [7]  of \r\nthe network or routing layer of mobile ad hoc networks [13]. Such networks re-\r\nquire routing strategies substantially different from those used in static commu-\r\nnication  networks,  since  storing  and  updating  large  routing  tables  at  mobile \r\nhosts  would  congest  the  network  with  administration  packets  very  fast.  In  [1], \r\nthe  hypercubic  location  service  is  presented,  which  considers  a  very  strong \r\ndefinition  of  fault-tolerance  thereby  improving  state-of-the-art  ad  hoc  routing \r\nprotocols in several respects. Our goal in modeling the protocols for the distrib-\r\nuted location service and the position based routing is twofold. First, we support \r\nthe  definition  and  validation  of  wireless  communication  protocols  and  imple-\r\nmentations based thereon. Second, we feel that the abstract computation model \r\nnaturally reflects the layering principle of communication architectures in com-\r\nbination with an uncompromisingly local view of the application domain. Thus \r\nwe can identify fundamental semantic concepts, such as concurrency, reactivity \r\nand  asynchronism,  directly  with  the  related  concepts  as  imposed  by  the  given \r\napplication context. "}],"file":[{"creator":"koala","date_created":"2021-09-14T09:09:28Z","date_updated":"2021-09-14T09:09:28Z","file_id":"24337","file_name":"asm03.pdf","access_level":"closed","file_size":162215,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","date_updated":"2022-01-06T06:56:18Z","date_created":"2021-09-14T08:51:39Z","author":[{"first_name":"András","last_name":" Benczúr","full_name":" Benczúr, András"},{"first_name":"Uwe","full_name":"Glässer, Uwe","last_name":"Glässer"},{"full_name":"Lukovszki, Tamás","last_name":"Lukovszki","first_name":"Tamás"}],"title":"Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks","publication_status":"published","has_accepted_license":"1","year":"2002","citation":{"short":"A.  Benczúr, U. Glässer, T. Lukovszki, Proc. of 10th International Workshop on Abstract State Machines, LNCS (2002).","bibtex":"@article{ Benczúr_Glässer_Lukovszki_2002, title={Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks}, journal={Proc. of 10th International Workshop on Abstract State Machines, LNCS}, author={ Benczúr, András and Glässer, Uwe and Lukovszki, Tamás}, year={2002} }","mla":"Benczúr, András, et al. “Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks.” <i>Proc. of 10th International Workshop on Abstract State Machines, LNCS</i>, 2002.","apa":"Benczúr, A., Glässer, U., &#38; Lukovszki, T. (2002). Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks. <i>Proc. of 10th International Workshop on Abstract State Machines, LNCS</i>.","ama":"Benczúr A, Glässer U, Lukovszki T. Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks. <i>Proc of 10th International Workshop on Abstract State Machines, LNCS</i>. Published online 2002.","chicago":"Benczúr, András, Uwe Glässer, and Tamás Lukovszki. “Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks.” <i>Proc. of 10th International Workshop on Abstract State Machines, LNCS</i>, 2002.","ieee":"A.  Benczúr, U. Glässer, and T. Lukovszki, “Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks,” <i>Proc. of 10th International Workshop on Abstract State Machines, LNCS</i>, 2002."}},{"date_updated":"2022-01-06T06:56:18Z","author":[{"full_name":"Grünewald, Matthias","last_name":"Grünewald","first_name":"Matthias"},{"first_name":"Tamás","full_name":"Lukovszki, Tamás","last_name":"Lukovszki"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"},{"first_name":"Klaus","full_name":"Volbert, Klaus","last_name":"Volbert"}],"date_created":"2021-09-14T09:15:57Z","title":"Distributed Maintenance of Resource Efficient Wireless Network Topologies","doi":"10.1007/3-540-45706-2_134","publication_status":"published","publication_identifier":{"issn":["0302-9743"]},"year":"2002","place":"Paderborn, Germany","citation":{"apa":"Grünewald, M., Lukovszki, T., Schindelhauer, C., &#38; Volbert, K. (2002). Distributed Maintenance of Resource Efficient Wireless Network Topologies. <i>Proceedings of the 8th International Euro-Par Conference</i>. <a href=\"https://doi.org/10.1007/3-540-45706-2_134\">https://doi.org/10.1007/3-540-45706-2_134</a>","short":"M. Grünewald, T. Lukovszki, C. Schindelhauer, K. Volbert, in: Proceedings of the 8th International Euro-Par Conference, Paderborn, Germany, 2002.","bibtex":"@inproceedings{Grünewald_Lukovszki_Schindelhauer_Volbert_2002, place={Paderborn, Germany}, title={Distributed Maintenance of Resource Efficient Wireless Network Topologies}, DOI={<a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>}, booktitle={Proceedings of the 8th International Euro-Par Conference}, author={Grünewald, Matthias and Lukovszki, Tamás and Schindelhauer, Christian and Volbert, Klaus}, year={2002} }","mla":"Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.” <i>Proceedings of the 8th International Euro-Par Conference</i>, 2002, doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>.","ieee":"M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed Maintenance of Resource Efficient Wireless Network Topologies,” 2002, doi: <a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>.","chicago":"Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.” In <i>Proceedings of the 8th International Euro-Par Conference</i>. Paderborn, Germany, 2002. <a href=\"https://doi.org/10.1007/3-540-45706-2_134\">https://doi.org/10.1007/3-540-45706-2_134</a>.","ama":"Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance of Resource Efficient Wireless Network Topologies. In: <i>Proceedings of the 8th International Euro-Par Conference</i>. ; 2002. doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>"},"_id":"24338","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 8th International Euro-Par Conference","status":"public"},{"status":"public","type":"conference","publication":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"},{"_id":"26"}],"_id":"26412","citation":{"mla":"Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector Subdivision.” <i>Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing</i>, 2002, doi:<a href=\"https://doi.org/10.1109/empdp.2002.994324\">10.1109/empdp.2002.994324</a>.","bibtex":"@inproceedings{Volbert_2002, title={A simulation environment for ad hoc networks using sector subdivision}, DOI={<a href=\"https://doi.org/10.1109/empdp.2002.994324\">10.1109/empdp.2002.994324</a>}, booktitle={Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing}, author={Volbert, Klaus}, year={2002} }","short":"K. Volbert, in: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, 2002.","apa":"Volbert, K. (2002). A simulation environment for ad hoc networks using sector subdivision. <i>Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing</i>. <a href=\"https://doi.org/10.1109/empdp.2002.994324\">https://doi.org/10.1109/empdp.2002.994324</a>","chicago":"Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector Subdivision.” In <i>Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing</i>, 2002. <a href=\"https://doi.org/10.1109/empdp.2002.994324\">https://doi.org/10.1109/empdp.2002.994324</a>.","ieee":"K. Volbert, “A simulation environment for ad hoc networks using sector subdivision,” 2002, doi: <a href=\"https://doi.org/10.1109/empdp.2002.994324\">10.1109/empdp.2002.994324</a>.","ama":"Volbert K. A simulation environment for ad hoc networks using sector subdivision. In: <i>Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing</i>. ; 2002. doi:<a href=\"https://doi.org/10.1109/empdp.2002.994324\">10.1109/empdp.2002.994324</a>"},"year":"2002","publication_status":"published","doi":"10.1109/empdp.2002.994324","title":"A simulation environment for ad hoc networks using sector subdivision","author":[{"last_name":"Volbert","full_name":"Volbert, Klaus","first_name":"Klaus"}],"date_created":"2021-10-18T15:45:20Z","date_updated":"2022-01-06T06:57:20Z"},{"year":"2002","citation":{"apa":"Wehrheim, H. (2002). Relating State-based and Behaviour-oriented Subtyping. <i>Nord. J. Comput.</i>, (4), 405--435.","short":"H. Wehrheim, Nord. J. Comput. (2002) 405--435.","bibtex":"@article{Wehrheim_2002, title={Relating State-based and Behaviour-oriented Subtyping}, number={4}, journal={Nord. J. Comput.}, author={Wehrheim, Heike}, year={2002}, pages={405--435} }","mla":"Wehrheim, Heike. “Relating State-Based and Behaviour-Oriented Subtyping.” <i>Nord. J. Comput.</i>, no. 4, 2002, pp. 405--435.","ama":"Wehrheim H. Relating State-based and Behaviour-oriented Subtyping. <i>Nord J Comput</i>. 2002;(4):405--435.","ieee":"H. Wehrheim, “Relating State-based and Behaviour-oriented Subtyping,” <i>Nord. J. Comput.</i>, no. 4, pp. 405--435, 2002.","chicago":"Wehrheim, Heike. “Relating State-Based and Behaviour-Oriented Subtyping.” <i>Nord. J. Comput.</i>, no. 4 (2002): 405--435."},"page":"405--435","issue":"4","title":"Relating State-based and Behaviour-oriented Subtyping","date_updated":"2022-01-06T06:59:07Z","author":[{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2018-06-14T06:56:20Z","status":"public","type":"journal_article","publication":"Nord. J. Comput.","_id":"3241","user_id":"29719","department":[{"_id":"77"}]},{"editor":[{"last_name":"S. de Boer","full_name":"S. de Boer, Frank","first_name":"Frank"},{"last_name":"M. Bonsangue","full_name":"M. Bonsangue, Marcello","first_name":"Marcello"},{"first_name":"Susanne","full_name":"Graf, Susanne","last_name":"Graf"},{"last_name":"P. de Roever","full_name":"P. de Roever, Willem","first_name":"Willem"}],"status":"public","publication":"Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures","type":"conference","_id":"3242","department":[{"_id":"77"}],"user_id":"29719","series_title":"Lecture Notes in Computer Science","year":"2002","page":"361--379","citation":{"ama":"Olderog E-R, Wehrheim H. Specification and Inheritance in {CSP-OZ}. In: S. de Boer F, M. Bonsangue M, Graf S, P. de Roever W, eds. <i>Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures</i>. Lecture Notes in Computer Science. ; 2002:361--379. doi:<a href=\"https://doi.org/10.1007/978-3-540-39656-7_15\">10.1007/978-3-540-39656-7_15</a>","ieee":"E.-R. Olderog and H. Wehrheim, “Specification and Inheritance in {CSP-OZ},” in <i>Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures</i>, 2002, pp. 361--379.","chicago":"Olderog, Ernst-Rüdiger, and Heike Wehrheim. “Specification and Inheritance in {CSP-OZ}.” In <i>Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures</i>, edited by Frank S. de Boer, Marcello M. Bonsangue, Susanne Graf, and Willem P. de Roever, 361--379. Lecture Notes in Computer Science, 2002. <a href=\"https://doi.org/10.1007/978-3-540-39656-7_15\">https://doi.org/10.1007/978-3-540-39656-7_15</a>.","bibtex":"@inproceedings{Olderog_Wehrheim_2002, series={Lecture Notes in Computer Science}, title={Specification and Inheritance in {CSP-OZ}}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-39656-7_15\">10.1007/978-3-540-39656-7_15</a>}, booktitle={Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures}, author={Olderog, Ernst-Rüdiger and Wehrheim, Heike}, editor={S. de Boer, Frank and M. Bonsangue, Marcello and Graf, Susanne and P. de Roever, WillemEditors}, year={2002}, pages={361--379}, collection={Lecture Notes in Computer Science} }","mla":"Olderog, Ernst-Rüdiger, and Heike Wehrheim. “Specification and Inheritance in {CSP-OZ}.” <i>Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures</i>, edited by Frank S. de Boer et al., 2002, pp. 361--379, doi:<a href=\"https://doi.org/10.1007/978-3-540-39656-7_15\">10.1007/978-3-540-39656-7_15</a>.","short":"E.-R. Olderog, H. Wehrheim, in: F. S. de Boer, M. M. Bonsangue, S. Graf, W. P. de Roever (Eds.), Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures, 2002, pp. 361--379.","apa":"Olderog, E.-R., &#38; Wehrheim, H. (2002). Specification and Inheritance in {CSP-OZ}. In F. S. de Boer, M. M. Bonsangue, S. Graf, &#38; W. P. de Roever (Eds.), <i>Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures</i> (pp. 361--379). <a href=\"https://doi.org/10.1007/978-3-540-39656-7_15\">https://doi.org/10.1007/978-3-540-39656-7_15</a>"},"title":"Specification and Inheritance in {CSP-OZ}","doi":"10.1007/978-3-540-39656-7_15","date_updated":"2022-01-06T06:59:07Z","author":[{"last_name":"Olderog","full_name":"Olderog, Ernst-Rüdiger","first_name":"Ernst-Rüdiger"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2018-06-14T07:10:28Z"},{"date_updated":"2022-01-06T06:59:07Z","date_created":"2018-06-14T07:11:33Z","author":[{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"title":"Checking Behavioural Subtypes via Refinement","year":"2002","page":"79--93","citation":{"ama":"Wehrheim H. Checking Behavioural Subtypes via Refinement. In: Jacobs B, Rensink A, eds. <i>Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands</i>. {IFIP} Conference Proceedings. ; 2002:79--93.","chicago":"Wehrheim, Heike. “Checking Behavioural Subtypes via Refinement.” In <i>Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands</i>, edited by Bart Jacobs and Arend Rensink, 79--93. {IFIP} Conference Proceedings, 2002.","ieee":"H. Wehrheim, “Checking Behavioural Subtypes via Refinement,” in <i>Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands</i>, 2002, pp. 79--93.","bibtex":"@inproceedings{Wehrheim_2002, series={{IFIP} Conference Proceedings}, title={Checking Behavioural Subtypes via Refinement}, booktitle={Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands}, author={Wehrheim, Heike}, editor={Jacobs, Bart and Rensink, ArendEditors}, year={2002}, pages={79--93}, collection={{IFIP} Conference Proceedings} }","short":"H. Wehrheim, in: B. Jacobs, A. Rensink (Eds.), Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands, 2002, pp. 79--93.","mla":"Wehrheim, Heike. “Checking Behavioural Subtypes via Refinement.” <i>Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands</i>, edited by Bart Jacobs and Arend Rensink, 2002, pp. 79--93.","apa":"Wehrheim, H. (2002). Checking Behavioural Subtypes via Refinement. In B. Jacobs &#38; A. Rensink (Eds.), <i>Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands</i> (pp. 79--93)."},"_id":"3243","department":[{"_id":"77"}],"user_id":"29719","series_title":"{IFIP} Conference Proceedings","publication":"Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands","type":"conference","editor":[{"first_name":"Bart","last_name":"Jacobs","full_name":"Jacobs, Bart"},{"full_name":"Rensink, Arend","last_name":"Rensink","first_name":"Arend"}],"status":"public"},{"file_date_updated":"2018-06-05T08:37:48Z","extern":"1","user_id":"25078","department":[{"_id":"64"}],"_id":"3034","status":"public","type":"journal_article","doi":"10.1109/18.556670","author":[{"last_name":"Albanese","full_name":"Albanese, Andres","first_name":"Andres"},{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"first_name":"Jeff","full_name":"Edmonds, Jeff","last_name":"Edmonds"},{"last_name":"Luby","full_name":"Luby, Michael","first_name":"Michael"},{"full_name":"Sudan, Madhu","last_name":"Sudan","first_name":"Madhu"}],"volume":42,"date_updated":"2022-01-06T06:58:53Z","citation":{"ieee":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” <i>IEEE Transactions on Information Theory</i>, vol. 42, no. 6, pp. 1737–1744, 2002.","chicago":"Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu Sudan. “Priority Encoding Transmission.” <i>IEEE Transactions on Information Theory</i> 42, no. 6 (2002): 1737–44. <a href=\"https://doi.org/10.1109/18.556670\">https://doi.org/10.1109/18.556670</a>.","ama":"Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. <i>IEEE Transactions on Information Theory</i>. 2002;42(6):1737-1744. doi:<a href=\"https://doi.org/10.1109/18.556670\">10.1109/18.556670</a>","apa":"Albanese, A., Blömer, J., Edmonds, J., Luby, M., &#38; Sudan, M. (2002). Priority encoding transmission. <i>IEEE Transactions on Information Theory</i>, <i>42</i>(6), 1737–1744. <a href=\"https://doi.org/10.1109/18.556670\">https://doi.org/10.1109/18.556670</a>","mla":"Albanese, Andres, et al. “Priority Encoding Transmission.” <i>IEEE Transactions on Information Theory</i>, vol. 42, no. 6, Institute of Electrical and Electronics Engineers (IEEE), 2002, pp. 1737–44, doi:<a href=\"https://doi.org/10.1109/18.556670\">10.1109/18.556670</a>.","short":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, IEEE Transactions on Information Theory 42 (2002) 1737–1744.","bibtex":"@article{Albanese_Blömer_Edmonds_Luby_Sudan_2002, title={Priority encoding transmission}, volume={42}, DOI={<a href=\"https://doi.org/10.1109/18.556670\">10.1109/18.556670</a>}, number={6}, journal={IEEE Transactions on Information Theory}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Albanese, Andres and Blömer, Johannes and Edmonds, Jeff and Luby, Michael and Sudan, Madhu}, year={2002}, pages={1737–1744} }"},"page":"1737-1744","intvolume":"        42","publication_status":"published","publication_identifier":{"issn":["0018-9448"]},"has_accepted_license":"1","ddc":["000"],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"feidens","date_created":"2018-06-05T08:37:48Z","date_updated":"2018-06-05T08:37:48Z","file_name":"pet.pdf","file_id":"3035","access_level":"closed","file_size":260143}],"publication":"IEEE Transactions on Information Theory","title":"Priority encoding transmission","date_created":"2018-06-05T08:36:14Z","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","year":"2002","issue":"6"},{"status":"public","type":"conference","publication":"Proceedings 35th Annual Symposium on Foundations of Computer Science","extern":"1","_id":"3040","user_id":"25078","department":[{"_id":"64"}],"year":"2002","citation":{"mla":"Albanese, A., et al. “Priority Encoding Transmission.” <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>, IEEE Comput. Soc. Press, 2002, doi:<a href=\"https://doi.org/10.1109/sfcs.1994.365731\">10.1109/sfcs.1994.365731</a>.","bibtex":"@inproceedings{Albanese_Blömer_Edmonds_Luby_Sudan_2002, title={Priority encoding transmission}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1994.365731\">10.1109/sfcs.1994.365731</a>}, booktitle={Proceedings 35th Annual Symposium on Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Albanese, A. and Blömer, Johannes and Edmonds, J. and Luby, M. and Sudan, M.}, year={2002} }","short":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, in: Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.","apa":"Albanese, A., Blömer, J., Edmonds, J., Luby, M., &#38; Sudan, M. (2002). Priority encoding transmission. In <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>. IEEE Comput. Soc. Press. <a href=\"https://doi.org/10.1109/sfcs.1994.365731\">https://doi.org/10.1109/sfcs.1994.365731</a>","ieee":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” in <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>, 2002.","chicago":"Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority Encoding Transmission.” In <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>. IEEE Comput. Soc. Press, 2002. <a href=\"https://doi.org/10.1109/sfcs.1994.365731\">https://doi.org/10.1109/sfcs.1994.365731</a>.","ama":"Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. In: <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>. IEEE Comput. Soc. Press; 2002. doi:<a href=\"https://doi.org/10.1109/sfcs.1994.365731\">10.1109/sfcs.1994.365731</a>"},"publication_status":"published","publication_identifier":{"isbn":["0818665807"]},"title":"Priority encoding transmission","doi":"10.1109/sfcs.1994.365731","publisher":"IEEE Comput. Soc. Press","date_updated":"2022-01-06T06:58:53Z","author":[{"first_name":"A.","last_name":"Albanese","full_name":"Albanese, A."},{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Edmonds","full_name":"Edmonds, J.","first_name":"J."},{"last_name":"Luby","full_name":"Luby, M.","first_name":"M."},{"first_name":"M.","last_name":"Sudan","full_name":"Sudan, M."}],"date_created":"2018-06-05T08:43:13Z"},{"status":"public","type":"journal_article","publication":"Combinatorica","user_id":"15504","department":[{"_id":"79"}],"_id":"2134","citation":{"chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” <i>Combinatorica</i>, no. 3 (2002): 361--399. <a href=\"https://doi.org/10.1007/s004930200018\">https://doi.org/10.1007/s004930200018</a>.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” <i>Combinatorica</i>, no. 3, pp. 361--399, 2002.","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. <i>Combinatorica</i>. 2002;(3):361--399. doi:<a href=\"https://doi.org/10.1007/s004930200018\">10.1007/s004930200018</a>","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.” <i>Combinatorica</i>, no. 3, 2002, pp. 361--399, doi:<a href=\"https://doi.org/10.1007/s004930200018\">10.1007/s004930200018</a>.","short":"U. Feige, C. Scheideler, Combinatorica (2002) 361--399.","bibtex":"@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job Shop Scheduling}, DOI={<a href=\"https://doi.org/10.1007/s004930200018\">10.1007/s004930200018</a>}, number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian}, year={2002}, pages={361--399} }","apa":"Feige, U., &#38; Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. <i>Combinatorica</i>, (3), 361--399. <a href=\"https://doi.org/10.1007/s004930200018\">https://doi.org/10.1007/s004930200018</a>"},"page":"361--399","year":"2002","issue":"3","doi":"10.1007/s004930200018","title":"Improved Bounds for Acyclic Job Shop Scheduling","date_created":"2018-04-03T05:43:36Z","author":[{"last_name":"Feige","full_name":"Feige, Uriel","first_name":"Uriel"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T06:54:55Z"},{"_id":"2135","department":[{"_id":"79"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-04-12T08:59:58Z","publication":"SODA","type":"conference","urn":"21357","status":"public","file":[{"relation":"main_file","content_type":"application/pdf","file_size":246604,"access_level":"open_access","file_id":"2303","file_name":"SODA-02.pdf","date_updated":"2018-04-12T08:59:58Z","creator":"florida","date_created":"2018-04-12T08:59:58Z"}],"publisher":"ACM/SIAM","date_updated":"2022-01-06T06:54:55Z","oa":"1","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2018-04-03T05:44:11Z","title":"Improved bounds for the unsplittable flow problem","has_accepted_license":"1","year":"2002","page":"184--193","citation":{"ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: <i>SODA</i>. ACM/SIAM; 2002:184--193.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In <i>SODA</i>, 184--193. ACM/SIAM, 2002.","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in <i>SODA</i>, 2002, pp. 184--193.","apa":"Kolman, P., &#38; Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In <i>SODA</i> (pp. 184--193). ACM/SIAM.","short":"P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.","bibtex":"@inproceedings{Kolman_Scheideler_2002, title={Improved bounds for the unsplittable flow problem}, booktitle={SODA}, publisher={ACM/SIAM}, author={Kolman, Petr and Scheideler, Christian}, year={2002}, pages={184--193} }","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” <i>SODA</i>, ACM/SIAM, 2002, pp. 184--193."}},{"urn":"21366","status":"public","file":[{"date_updated":"2018-04-12T09:02:22Z","creator":"florida","date_created":"2018-04-12T09:02:22Z","file_size":123373,"file_name":"BSS-SPAA-02.pdf","file_id":"2305","access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"publication":"SPAA","type":"conference","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T09:02:22Z","_id":"2136","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","year":"2002","page":"53--62","citation":{"chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In <i>SPAA</i>, 53--62, 2002.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in <i>SPAA</i>, 2002, pp. 53--62.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: <i>SPAA</i>. ; 2002:53--62.","apa":"Brinkmann, A., Salzwedel, K., &#38; Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In <i>SPAA</i> (pp. 53--62).","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62} }","mla":"Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” <i>SPAA</i>, 2002, pp. 53--62.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62."},"has_accepted_license":"1","title":"Compact, adaptive placement schemes for non-uniform requirements","date_updated":"2022-01-06T06:54:56Z","oa":"1","date_created":"2018-04-03T05:44:56Z","author":[{"full_name":"Brinkmann, André","last_name":"Brinkmann","first_name":"André"},{"full_name":"Salzwedel, Kay","last_name":"Salzwedel","first_name":"Kay"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}]},{"status":"public","file":[{"file_size":187124,"file_name":"BCKS-SPAA-02.pdf","access_level":"open_access","file_id":"2306","date_updated":"2018-04-12T09:03:44Z","creator":"florida","date_created":"2018-04-12T09:03:44Z","relation":"main_file","content_type":"application/pdf"}],"urn":"21376","publication":"SPAA","type":"conference","file_date_updated":"2018-04-12T09:03:44Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"2137","page":"265--274","citation":{"ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: <i>SPAA</i>. ; 2002:265--274.","chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In <i>SPAA</i>, 265--274, 2002.","ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in <i>SPAA</i>, 2002, pp. 265--274.","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., &#38; Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In <i>SPAA</i> (pp. 265--274).","bibtex":"@inproceedings{Bagchi_Chaudhary_Scheideler_Kolman_2002, title={Algorithms for fault-tolerant routing in circuit switched networks}, booktitle={SPAA}, author={Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2002}, pages={265--274} }","mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” <i>SPAA</i>, 2002, pp. 265--274.","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274."},"year":"2002","has_accepted_license":"1","title":"Algorithms for fault-tolerant routing in circuit switched networks","author":[{"full_name":"Bagchi, Amitabha","last_name":"Bagchi","first_name":"Amitabha"},{"last_name":"Chaudhary","full_name":"Chaudhary, Amitabh","first_name":"Amitabh"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"}],"date_created":"2018-04-03T05:45:44Z","date_updated":"2022-01-06T06:54:57Z","oa":"1"},{"department":[{"_id":"79"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","_id":"2138","file_date_updated":"2018-04-12T09:01:03Z","type":"conference","status":"public","urn":"21386","volume":2285,"author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T06:54:57Z","oa":"1","has_accepted_license":"1","page":"27--49","intvolume":"      2285","citation":{"apa":"Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In <i>STACS</i> (Vol. 2285, pp. 27--49). Springer.","bibtex":"@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science}, title={Models and Techniques for Communication in Dynamic Networks}, volume={2285}, booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002}, pages={27--49}, collection={Lecture Notes in Computer Science} }","short":"C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.","mla":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” <i>STACS</i>, vol. 2285, Springer, 2002, pp. 27--49.","ama":"Scheideler C. Models and Techniques for Communication in Dynamic Networks. In: <i>STACS</i>. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.","ieee":"C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in <i>STACS</i>, 2002, vol. 2285, pp. 27--49.","chicago":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In <i>STACS</i>, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002."},"ddc":["040"],"publication":"STACS","file":[{"file_id":"2304","file_name":"STACS-02.pdf","access_level":"open_access","file_size":273875,"date_created":"2018-04-12T09:01:03Z","creator":"florida","date_updated":"2018-04-12T09:01:03Z","relation":"main_file","content_type":"application/pdf"}],"date_created":"2018-04-03T05:46:38Z","publisher":"Springer","title":"Models and Techniques for Communication in Dynamic Networks","year":"2002"},{"citation":{"ieee":"C. Sohler and A. Czumaj, “Abstract Combinatorial Programs and Efficient Property Testers,” <i>Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)</i>, pp. 83–92, 2002.","chicago":"Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient Property Testers.” <i>Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)</i>, 2002, 83–92.","ama":"Sohler C, Czumaj A. Abstract Combinatorial Programs and Efficient Property Testers. <i>Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)</i>. 2002:83-92.","apa":"Sohler, C., &#38; Czumaj, A. (2002). Abstract Combinatorial Programs and Efficient Property Testers. <i>Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)</i>, 83–92.","mla":"Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient Property Testers.” <i>Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)</i>, 2002, pp. 83–92.","bibtex":"@article{Sohler_Czumaj_2002, title={Abstract Combinatorial Programs and Efficient Property Testers}, journal={Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)}, author={Sohler, Christian and Czumaj, Artur}, year={2002}, pages={83–92} }","short":"C. Sohler, A. Czumaj, Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS) (2002) 83–92."},"page":"83-92","year":"2002","title":"Abstract Combinatorial Programs and Efficient Property Testers","date_created":"2020-09-02T12:08:22Z","author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"}],"date_updated":"2022-01-06T06:53:52Z","status":"public","type":"journal_article","publication":"Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18853"}]