[{"_id":"2425","user_id":"24135","department":[{"_id":"518"},{"_id":"78"}],"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","type":"conference","publication":"Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)","title":"Custom Computing Machines for the Set Covering Problem","doi":"10.1109/FPGA.2002.1106671","publisher":"IEEE Computer Society","date_updated":"2022-01-06T06:56:13Z","author":[{"first_name":"Christian","full_name":"Plessl, Christian","id":"16153","orcid":"0000-0001-5728-9982","last_name":"Plessl"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_created":"2018-04-17T15:15:44Z","year":"2002","citation":{"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.","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>","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>","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>."},"page":"163-172"},{"file_date_updated":"2021-09-14T09:09:28Z","language":[{"iso":"eng"}],"ddc":["000"],"department":[{"_id":"63"}],"user_id":"15415","_id":"24336","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":162215,"file_id":"24337","file_name":"asm03.pdf","access_level":"closed","date_updated":"2021-09-14T09:09:28Z","date_created":"2021-09-14T09:09:28Z","creator":"koala"}],"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. "}],"publication":"Proc. of 10th International Workshop on Abstract State Machines, LNCS","type":"journal_article","title":"Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks","author":[{"last_name":" Benczúr","full_name":" Benczúr, András","first_name":"András"},{"last_name":"Glässer","full_name":"Glässer, Uwe","first_name":"Uwe"},{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"}],"date_created":"2021-09-14T08:51:39Z","date_updated":"2022-01-06T06:56:18Z","citation":{"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.","short":"A.  Benczúr, U. Glässer, T. Lukovszki, Proc. of 10th International Workshop on Abstract State Machines, LNCS (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.","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.","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."},"year":"2002","has_accepted_license":"1","publication_status":"published"},{"year":"2002","place":"Paderborn, Germany","citation":{"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>.","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>.","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>","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>.","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>"},"publication_status":"published","publication_identifier":{"issn":["0302-9743"]},"title":"Distributed Maintenance of Resource Efficient Wireless Network Topologies","doi":"10.1007/3-540-45706-2_134","date_updated":"2022-01-06T06:56:18Z","author":[{"first_name":"Matthias","last_name":"Grünewald","full_name":"Grünewald, Matthias"},{"first_name":"Tamás","full_name":"Lukovszki, Tamás","last_name":"Lukovszki"},{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"},{"last_name":"Volbert","full_name":"Volbert, Klaus","first_name":"Klaus"}],"date_created":"2021-09-14T09:15:57Z","status":"public","type":"conference","publication":"Proceedings of the 8th International Euro-Par Conference","language":[{"iso":"eng"}],"_id":"24338","user_id":"15415","department":[{"_id":"63"}]},{"publication_status":"published","citation":{"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>","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>.","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>.","short":"K. Volbert, in: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, 2002.","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} }","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>.","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>"},"year":"2002","date_created":"2021-10-18T15:45:20Z","author":[{"last_name":"Volbert","full_name":"Volbert, Klaus","first_name":"Klaus"}],"date_updated":"2022-01-06T06:57:20Z","doi":"10.1109/empdp.2002.994324","title":"A simulation environment for ad hoc networks using sector subdivision","publication":"Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing","type":"conference","status":"public","department":[{"_id":"63"},{"_id":"26"}],"user_id":"15415","_id":"26412","language":[{"iso":"eng"}]},{"type":"journal_article","publication":"Nord. J. Comput.","status":"public","_id":"3241","user_id":"29719","department":[{"_id":"77"}],"issue":"4","year":"2002","citation":{"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.","ama":"Wehrheim H. Relating State-based and Behaviour-oriented Subtyping. <i>Nord J Comput</i>. 2002;(4):405--435.","apa":"Wehrheim, H. (2002). Relating State-based and Behaviour-oriented Subtyping. <i>Nord. J. Comput.</i>, (4), 405--435.","mla":"Wehrheim, Heike. “Relating State-Based and Behaviour-Oriented Subtyping.” <i>Nord. J. Comput.</i>, no. 4, 2002, pp. 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} }","short":"H. Wehrheim, Nord. J. Comput. (2002) 405--435."},"page":"405--435","date_updated":"2022-01-06T06:59:07Z","author":[{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_created":"2018-06-14T06:56:20Z","title":"Relating State-based and Behaviour-oriented Subtyping"},{"date_updated":"2022-01-06T06:59:07Z","date_created":"2018-06-14T07:10:28Z","author":[{"first_name":"Ernst-Rüdiger","full_name":"Olderog, Ernst-Rüdiger","last_name":"Olderog"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"title":"Specification and Inheritance in {CSP-OZ}","doi":"10.1007/978-3-540-39656-7_15","year":"2002","page":"361--379","citation":{"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.","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} }","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>","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>."},"_id":"3242","department":[{"_id":"77"}],"user_id":"29719","series_title":"Lecture Notes in Computer Science","publication":"Formal Methods for Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures","type":"conference","editor":[{"first_name":"Frank","full_name":"S. de Boer, Frank","last_name":"S. de Boer"},{"first_name":"Marcello","full_name":"M. Bonsangue, Marcello","last_name":"M. Bonsangue"},{"first_name":"Susanne","full_name":"Graf, Susanne","last_name":"Graf"},{"first_name":"Willem","full_name":"P. de Roever, Willem","last_name":"P. de Roever"}],"status":"public"},{"user_id":"29719","series_title":"{IFIP} Conference Proceedings","department":[{"_id":"77"}],"_id":"3243","status":"public","editor":[{"first_name":"Bart","full_name":"Jacobs, Bart","last_name":"Jacobs"},{"last_name":"Rensink","full_name":"Rensink, Arend","first_name":"Arend"}],"type":"conference","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","title":"Checking Behavioural Subtypes via Refinement","date_created":"2018-06-14T07:11:33Z","author":[{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:59:07Z","citation":{"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.","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.","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} }","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).","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."},"page":"79--93","year":"2002"},{"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_created":"2018-06-05T08:36:14Z","title":"Priority encoding transmission","issue":"6","year":"2002","ddc":["000"],"publication":"IEEE Transactions on Information Theory","file":[{"file_size":260143,"access_level":"closed","file_id":"3035","file_name":"pet.pdf","date_updated":"2018-06-05T08:37:48Z","creator":"feidens","date_created":"2018-06-05T08:37:48Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"date_updated":"2022-01-06T06:58:53Z","volume":42,"author":[{"first_name":"Andres","full_name":"Albanese, Andres","last_name":"Albanese"},{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"full_name":"Edmonds, Jeff","last_name":"Edmonds","first_name":"Jeff"},{"full_name":"Luby, Michael","last_name":"Luby","first_name":"Michael"},{"full_name":"Sudan, Madhu","last_name":"Sudan","first_name":"Madhu"}],"doi":"10.1109/18.556670","publication_identifier":{"issn":["0018-9448"]},"has_accepted_license":"1","publication_status":"published","intvolume":"        42","page":"1737-1744","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>","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} }","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."},"_id":"3034","department":[{"_id":"64"}],"user_id":"25078","file_date_updated":"2018-06-05T08:37:48Z","extern":"1","type":"journal_article","status":"public"},{"year":"2002","citation":{"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>","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>.","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.","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.","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} }","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>.","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>"},"publication_identifier":{"isbn":["0818665807"]},"publication_status":"published","title":"Priority encoding transmission","doi":"10.1109/sfcs.1994.365731","publisher":"IEEE Comput. Soc. Press","date_updated":"2022-01-06T06:58:53Z","author":[{"full_name":"Albanese, A.","last_name":"Albanese","first_name":"A."},{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"full_name":"Edmonds, J.","last_name":"Edmonds","first_name":"J."},{"first_name":"M.","full_name":"Luby, M.","last_name":"Luby"},{"full_name":"Sudan, M.","last_name":"Sudan","first_name":"M."}],"date_created":"2018-06-05T08:43:13Z","status":"public","publication":"Proceedings 35th Annual Symposium on Foundations of Computer Science","type":"conference","extern":"1","_id":"3040","department":[{"_id":"64"}],"user_id":"25078"},{"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"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:54:55Z","page":"361--399","citation":{"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>","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} }","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” <i>Combinatorica</i>, no. 3, pp. 361--399, 2002.","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>.","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>"},"year":"2002","issue":"3","department":[{"_id":"79"}],"user_id":"15504","_id":"2134","status":"public","publication":"Combinatorica","type":"journal_article"},{"department":[{"_id":"79"}],"user_id":"15504","_id":"2135","file_date_updated":"2018-04-12T08:59:58Z","ddc":["040"],"publication":"SODA","type":"conference","status":"public","file":[{"date_updated":"2018-04-12T08:59:58Z","date_created":"2018-04-12T08:59:58Z","creator":"florida","file_size":246604,"file_name":"SODA-02.pdf","access_level":"open_access","file_id":"2303","content_type":"application/pdf","relation":"main_file"}],"urn":"21357","author":[{"first_name":"Petr","last_name":"Kolman","full_name":"Kolman, Petr"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T05:44:11Z","publisher":"ACM/SIAM","date_updated":"2022-01-06T06:54:55Z","oa":"1","title":"Improved bounds for the unsplittable flow problem","has_accepted_license":"1","page":"184--193","citation":{"apa":"Kolman, P., &#38; Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In <i>SODA</i> (pp. 184--193). ACM/SIAM.","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} }","short":"P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” <i>SODA</i>, ACM/SIAM, 2002, pp. 184--193.","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: <i>SODA</i>. ACM/SIAM; 2002:184--193.","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in <i>SODA</i>, 2002, pp. 184--193.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In <i>SODA</i>, 184--193. ACM/SIAM, 2002."},"year":"2002"},{"_id":"2136","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-04-12T09:02:22Z","language":[{"iso":"eng"}],"type":"conference","publication":"SPAA","urn":"21366","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T09:02:22Z","date_created":"2018-04-12T09:02:22Z","creator":"florida","file_size":123373,"access_level":"open_access","file_name":"BSS-SPAA-02.pdf","file_id":"2305"}],"status":"public","date_updated":"2022-01-06T06:54:56Z","oa":"1","author":[{"full_name":"Brinkmann, André","last_name":"Brinkmann","first_name":"André"},{"last_name":"Salzwedel","full_name":"Salzwedel, Kay","first_name":"Kay"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_created":"2018-04-03T05:44:56Z","title":"Compact, adaptive placement schemes for non-uniform requirements","has_accepted_license":"1","year":"2002","citation":{"ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: <i>SPAA</i>. ; 2002:53--62.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in <i>SPAA</i>, 2002, pp. 53--62.","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In <i>SPAA</i>, 53--62, 2002.","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.","apa":"Brinkmann, A., Salzwedel, K., &#38; Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In <i>SPAA</i> (pp. 53--62)."},"page":"53--62"},{"_id":"2137","user_id":"15504","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-04-12T09:03:44Z","type":"conference","publication":"SPAA","urn":"21376","file":[{"relation":"main_file","content_type":"application/pdf","file_size":187124,"file_id":"2306","file_name":"BCKS-SPAA-02.pdf","access_level":"open_access","date_updated":"2018-04-12T09:03:44Z","creator":"florida","date_created":"2018-04-12T09:03:44Z"}],"status":"public","oa":"1","date_updated":"2022-01-06T06:54:57Z","date_created":"2018-04-03T05:45:44Z","author":[{"full_name":"Bagchi, Amitabha","last_name":"Bagchi","first_name":"Amitabha"},{"first_name":"Amitabh","full_name":"Chaudhary, Amitabh","last_name":"Chaudhary"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"}],"title":"Algorithms for fault-tolerant routing in circuit switched networks","has_accepted_license":"1","year":"2002","citation":{"mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” <i>SPAA</i>, 2002, 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} }","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 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).","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.","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.","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."},"page":"265--274"},{"urn":"21386","status":"public","type":"conference","file_date_updated":"2018-04-12T09:01:03Z","_id":"2138","department":[{"_id":"79"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","intvolume":"      2285","page":"27--49","citation":{"apa":"Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In <i>STACS</i> (Vol. 2285, pp. 27--49). Springer.","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.","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} }","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.","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.","ieee":"C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in <i>STACS</i>, 2002, vol. 2285, pp. 27--49."},"has_accepted_license":"1","oa":"1","date_updated":"2022-01-06T06:54:57Z","volume":2285,"author":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"file":[{"date_created":"2018-04-12T09:01:03Z","creator":"florida","date_updated":"2018-04-12T09:01:03Z","access_level":"open_access","file_id":"2304","file_name":"STACS-02.pdf","file_size":273875,"content_type":"application/pdf","relation":"main_file"}],"publication":"STACS","ddc":["040"],"year":"2002","title":"Models and Techniques for Communication in Dynamic Networks","publisher":"Springer","date_created":"2018-04-03T05:46:38Z"},{"publication":"Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)","type":"journal_article","status":"public","_id":"18853","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"year":"2002","page":"83-92","citation":{"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.","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.","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."},"date_updated":"2022-01-06T06:53:52Z","author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"}],"date_created":"2020-09-02T12:08:22Z","title":"Abstract Combinatorial Programs and Efficient Property Testers"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18961","status":"public","type":"report","title":"A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing","date_created":"2020-09-03T13:16:48Z","author":[{"first_name":"Tamás","full_name":"Lukovszki, Tamás","last_name":"Lukovszki"},{"first_name":"A.","full_name":"Benczúr, A.","last_name":"Benczúr"}],"date_updated":"2022-01-06T06:53:55Z","citation":{"apa":"Lukovszki, T., &#38; Benczúr, A. (2002). <i>A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn.","mla":"Lukovszki, Tamás, and A. Benczúr. <i>A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. 2002.","short":"T. Lukovszki, A. Benczúr, A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing, Paderborn, 2002.","bibtex":"@book{Lukovszki_Benczúr_2002, place={Paderborn}, title={A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing}, author={Lukovszki, Tamás and Benczúr, A.}, year={2002} }","chicago":"Lukovszki, Tamás, and A. Benczúr. <i>A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn, 2002.","ieee":"T. Lukovszki and A. Benczúr, <i>A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn, 2002.","ama":"Lukovszki T, Benczúr A. <i>A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn; 2002."},"place":"Paderborn","year":"2002"},{"citation":{"ieee":"T. Ngo-Quynh, H. Karl, A. Wolisz, and K. Rebensburg, “New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network ,” in <i>Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.</i>, 2002.","chicago":"Ngo-Quynh, Thu, Holger Karl, Adam Wolisz, and Klaus Rebensburg. “New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network .” In <i>Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.</i>, 2002.","ama":"Ngo-Quynh T, Karl H, Wolisz A, Rebensburg K. New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network . In: <i>Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.</i> ; 2002.","apa":"Ngo-Quynh, T., Karl, H., Wolisz, A., &#38; Rebensburg, K. (2002). New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network . In <i>Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.</i>","bibtex":"@inproceedings{Ngo-Quynh_Karl_Wolisz_Rebensburg_2002, title={New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network }, booktitle={Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.}, author={Ngo-Quynh, Thu and Karl, Holger and Wolisz, Adam and Rebensburg, Klaus}, year={2002} }","short":"T. Ngo-Quynh, H. Karl, A. Wolisz, K. Rebensburg, in: Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002., 2002.","mla":"Ngo-Quynh, Thu, et al. “New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network .” <i>Proc. IST Mobile &#38; Wireless Telecommunications Summit 2002.</i>, 2002."},"year":"2002","author":[{"first_name":"Thu","last_name":"Ngo-Quynh","full_name":"Ngo-Quynh, Thu"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"},{"full_name":"Wolisz, Adam","last_name":"Wolisz","first_name":"Adam"},{"last_name":"Rebensburg","full_name":"Rebensburg, Klaus","first_name":"Klaus"}],"date_created":"2018-03-28T11:36:45Z","date_updated":"2022-01-06T06:54:00Z","title":"New Scheduling Algorithm for Providing Proportional Jitter in  Differentiated Service Network ","type":"conference","publication":"Proc. IST Mobile & Wireless Telecommunications Summit 2002.","status":"public","user_id":"15572","department":[{"_id":"75"}],"_id":"1921"},{"volume":115,"date_created":"2020-08-24T11:36:55Z","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_updated":"2022-01-06T06:53:26Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","title":"Zur Berechenbarkeit reeller geometrischer Probleme","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101320","relation":"confirmation"}]},"publication_identifier":{"isbn":["3-935433-24-7"]},"intvolume":"       115","citation":{"short":"M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","bibtex":"@book{Ziegler_2002, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Zur Berechenbarkeit reeller geometrischer Probleme}, volume={115}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Ziegler, Martin}, year={2002}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Ziegler, Martin. <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","apa":"Ziegler, M. (2002). <i>Zur Berechenbarkeit reeller geometrischer Probleme</i> (Vol. 115). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"M. Ziegler, <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>, vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","chicago":"Ziegler, Martin. <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>. Vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","ama":"Ziegler M. <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>. Vol 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2002."},"year":"2002","department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","_id":"18169","language":[{"iso":"ger"}],"type":"dissertation","status":"public","abstract":[{"text":"Die Implementierung von Algorithmen zur Lösung geometrischer Probleme im Euklidischen Raum (z.B. Berechnung der konvexen Hülle oder des Durchschnitts zweier Polyeder) stellt sich oftmals als hochgradig nichttrivial heraus. Ob und unter welchen Voraussetzungen die verursachenden numerischen Instabilitäten überhaupt ini den Griff zu kriegen oder vielmehr dem Problem inhärent sind, untersucht diese Arbeit in einem auf Turing zurückgehenden Rechenmodell. Im Gegensatz zu algebraischen Ansätzen geht jenes nicht von der Verfügbarkeit exakter Tests auf z.B. Gleichheit reeller Zahlen aus, sondern berücksichtigt die auf Digitalcomputern tatsächlich realisierbare Approximation durch rationale Zahlen. In diesem Rahmen werden beweisbar stabile Algorithmen zum Lösen linearer Gleichungssysteme, zur Matrix-Diagonalisierung und zur linearen wie nichtlinearen Optimierung präsentiert. Als wichtiges technisches Hilfsmittel dient ein neuer Berechenbarkeitsbegriff für reguläre unendliche Mengen reller Zahlen, der sich aus dem systematischen Vergleich verschiedener der Literatur entnommener ad-hoc Ansätze ergibt.","lang":"ger"},{"lang":"eng","text":"Quite often, the implementation of well-known algorithms for solving geometric problems in Euclidean space (such as convex hull computation or intersecting two polyhedra) turns out to be a highly nontrivial task. Whether and under what prerequisites the underlying numerical numerical instabilities can be avoided or are rather inherent to the problem is investigated by the present work in a model of computation dating back to Alan Turing himself. Other than algebraic approaches, this does not rely on (volatile) exact tests for, e.g., equality of real numbers but reflects the property of actual digital computers to only approximate real numbers by rationals. In this framework, we devise and present provably stable algorithms for solving systems of linear equations, matrix diagonalization, and lineare as well as non-linear optimization. As major technical tool, a new notion of computability for regular infinite sets of real numbers is introduced that arises from formalizing and systematically comparing several ad-hoc notions found in previous literature."}]},{"type":"journal_article","publication":"Mathematical Logic Quarterly (MLQ)","status":"public","_id":"18176","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0942-5616","1521-3870"]},"issue":"S1","year":"2002","citation":{"ama":"Ziegler M. Computability on Regular Subsets of Euclidean Space. <i>Mathematical Logic Quarterly (MLQ)</i>. 2002;48(S1):157-181. doi:<a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>","chicago":"Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” <i>Mathematical Logic Quarterly (MLQ)</i> 48, no. S1 (2002): 157–81. <a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>.","ieee":"M. Ziegler, “Computability on Regular Subsets of Euclidean Space,” <i>Mathematical Logic Quarterly (MLQ)</i>, vol. 48, no. S1, pp. 157–181, 2002.","apa":"Ziegler, M. (2002). Computability on Regular Subsets of Euclidean Space. <i>Mathematical Logic Quarterly (MLQ)</i>, <i>48</i>(S1), 157–181. <a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>","bibtex":"@article{Ziegler_2002, title={Computability on Regular Subsets of Euclidean Space}, volume={48}, DOI={<a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>}, number={S1}, journal={Mathematical Logic Quarterly (MLQ)}, author={Ziegler, Martin}, year={2002}, pages={157–181} }","short":"M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181.","mla":"Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” <i>Mathematical Logic Quarterly (MLQ)</i>, vol. 48, no. S1, 2002, pp. 157–81, doi:<a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>."},"page":"157-181","intvolume":"        48","date_updated":"2022-01-06T06:53:26Z","date_created":"2020-08-24T12:05:40Z","author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"volume":48,"title":"Computability on Regular Subsets of Euclidean Space","doi":"10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4"},{"title":"Point Location Algorithms of Minimum Size","date_created":"2020-08-24T12:09:15Z","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"},{"first_name":"Valentina","full_name":"Damerow, Valentina","last_name":"Damerow"},{"first_name":"Lukas","last_name":"Finschi","full_name":"Finschi, Lukas"}],"date_updated":"2022-01-06T06:53:26Z","citation":{"ama":"Ziegler M, Damerow V, Finschi L. Point Location Algorithms of Minimum Size. In: <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>. ; 2002.","ieee":"M. Ziegler, V. Damerow, and L. Finschi, “Point Location Algorithms of Minimum Size,” in <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>, 2002.","chicago":"Ziegler, Martin, Valentina Damerow, and Lukas Finschi. “Point Location Algorithms of Minimum Size.” In <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>, 2002.","apa":"Ziegler, M., Damerow, V., &#38; Finschi, L. (2002). Point Location Algorithms of Minimum Size. In <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>.","short":"M. Ziegler, V. Damerow, L. Finschi, in: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.","bibtex":"@inproceedings{Ziegler_Damerow_Finschi_2002, title={Point Location Algorithms of Minimum Size}, booktitle={Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)}, author={Ziegler, Martin and Damerow, Valentina and Finschi, Lukas}, year={2002} }","mla":"Ziegler, Martin, et al. “Point Location Algorithms of Minimum Size.” <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>, 2002."},"year":"2002","publication_status":"published","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18177","status":"public","abstract":[{"text":"Consider the classical point location problem: for a fixed arrangement of m hyperplanes and its induced partition of d-space report, upon input of some point, which face it lies in. With sufficient memory, this is easy to solve in logarithmic time O(log m). But how fast can algorithms (formalized as Linear Decision Trees) of *minimum* size be? The present work gives lower and upper bounds for the time complexity of point location under this constraint. They show that, in addition to m, the maximum number w of walls of a cell turns out to be a crucial parameter. We also consider a relaxation of the strict minimum-size condition allowing for constant factor overhead.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG'02)"}]