[{"title":"Temporale Erweiterungen der OCL - Überblick und Aussichten","date_created":"2023-01-24T10:19:57Z","author":[{"last_name":"Flake","full_name":"Flake, Stephan","first_name":"Stephan"},{"first_name":"Wolfgang","last_name":"Müller","id":"16243","full_name":"Müller, Wolfgang"}],"date_updated":"2023-01-24T10:20:03Z","citation":{"short":"S. Flake, W. Müller, (2002).","mla":"Flake, Stephan, and Wolfgang Müller. <i>Temporale Erweiterungen Der OCL - Überblick Und Aussichten</i>. 2002.","bibtex":"@article{Flake_Müller_2002, place={Halle(Saale), Germany}, series={Tagungsband: 2. Workshop “Ablaufmodellierung in ingenieurwissenschaftlichen Anwendungen”}, title={Temporale Erweiterungen der OCL - Überblick und Aussichten}, author={Flake, Stephan and Müller, Wolfgang}, year={2002}, collection={Tagungsband: 2. Workshop “Ablaufmodellierung in ingenieurwissenschaftlichen Anwendungen”} }","apa":"Flake, S., &#38; Müller, W. (2002). <i>Temporale Erweiterungen der OCL - Überblick und Aussichten</i>.","ieee":"S. Flake and W. Müller, “Temporale Erweiterungen der OCL - Überblick und Aussichten.” Halle(Saale), Germany, 2002.","chicago":"Flake, Stephan, and Wolfgang Müller. “Temporale Erweiterungen Der OCL - Überblick Und Aussichten.” Tagungsband: 2. Workshop “Ablaufmodellierung in Ingenieurwissenschaftlichen Anwendungen.” Halle(Saale), Germany, 2002.","ama":"Flake S, Müller W. Temporale Erweiterungen der OCL - Überblick und Aussichten. Published online 2002."},"place":"Halle(Saale), Germany","year":"2002","language":[{"iso":"eng"}],"series_title":"Tagungsband: 2. Workshop \"Ablaufmodellierung in ingenieurwissenschaftlichen Anwendungen\"","user_id":"5786","department":[{"_id":"672"}],"_id":"39402","status":"public","abstract":[{"text":"Die Object Constraint Language (OCL) wurde entwickelt, um Modelleinschränkungen beim objektorientierten Softwareentwurf mit der UML [14] ausdrücken zu können. Sie wird hauptsächlich benutzt, um Invarianten für Objekte sowie Vor-und Nachbedingungen von Operationen zu spezifizieren. Zurzeit bieten OCL und Echtzeiterweiterungen der UML nur bedingt geeignete Mittel, um temporale zeitbehaftete Modelleigenschaften zu beschreiben. Insbesondere kann man mit OCL keine Einschränkunge uber das dynamische Verhalten eines UML-Modells formulieren, die die Reihenfolge von Objektzuständen und Zustandsübergängen betreffen. Um ein korrektes Systemverhalten zu garantieren, ist es jedoch insbesondere bei zeitkritischen Anwendungen notwendig, solche zustandsbasierten zeitbehafteten Einschränkungen in einer formalen Art und Weise ausdrücken zu können. Es sind daher verschiedene Vorschläge veröffentlicht worden, in denen die OCL erweitert worden ist, um Modellierern die Möglichkeit zu geben, temporale Einschränkungen zu formulieren. Dieser Artikel gibt eine Überblick über die zurzeit bekannten Vorschläge und zeigt Ansätze für weitere Entwicklungen in diesem Bereich auf.","lang":"eng"}],"type":"conference"},{"citation":{"ama":"Karl H. Relaying in Wireless Access Networks –   A Capacity and Energy-Efficiency Perspective . In: <i>Proc. Wireless World Research Forum Kickoff Meeting (WWRF)</i>. München; 2001.","ieee":"H. Karl, “Relaying in Wireless Access Networks –   A Capacity and Energy-Efficiency Perspective ,” in <i>Proc. Wireless World Research Forum Kickoff Meeting (WWRF)</i>, 2001.","chicago":"Karl, Holger. “Relaying in Wireless Access Networks –   A Capacity and Energy-Efficiency Perspective .” In <i>Proc. Wireless World Research Forum Kickoff Meeting (WWRF)</i>. München, 2001.","mla":"Karl, Holger. “Relaying in Wireless Access Networks –   A Capacity and Energy-Efficiency Perspective .” <i>Proc. Wireless World Research Forum Kickoff Meeting (WWRF)</i>, 2001.","bibtex":"@inproceedings{Karl_2001, place={München}, title={Relaying in Wireless Access Networks –   A Capacity and Energy-Efficiency Perspective }, booktitle={Proc. Wireless World Research Forum Kickoff Meeting (WWRF)}, author={Karl, Holger}, year={2001} }","short":"H. Karl, in: Proc. Wireless World Research Forum Kickoff Meeting (WWRF), München, 2001.","apa":"Karl, H. (2001). Relaying in Wireless Access Networks –   A Capacity and Energy-Efficiency Perspective . In <i>Proc. Wireless World Research Forum Kickoff Meeting (WWRF)</i>. München."},"year":"2001","place":"München","has_accepted_license":"1","title":"Relaying in Wireless Access Networks –   A Capacity and Energy-Efficiency Perspective ","date_created":"2018-04-26T11:37:09Z","author":[{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"date_updated":"2022-01-06T06:57:06Z","file":[{"date_updated":"2018-04-26T11:37:01Z","creator":"tabu","date_created":"2018-04-26T11:37:01Z","file_size":76436,"file_id":"2553","access_level":"closed","file_name":"karl01relayWirelAccessNetwor.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference","publication":"Proc. Wireless World Research Forum Kickoff Meeting (WWRF)","file_date_updated":"2018-04-26T11:37:01Z","ddc":["000"],"user_id":"15572","department":[{"_id":"75"}],"_id":"2552"},{"title":"Relaying ñ bad for energy,  good for capacity?","date_updated":"2022-01-06T06:57:07Z","publisher":"Eork-in-progress session of mobicom 2001","date_created":"2018-04-26T11:39:05Z","author":[{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"year":"2001","place":"Rom/Italy","citation":{"chicago":"Karl, Holger. “Relaying ñ Bad for Energy,  Good for Capacity?” Rom/Italy: Eork-in-progress session of mobicom 2001, 2001.","ieee":"H. Karl, “Relaying ñ bad for energy,  good for capacity?,” 2001.","ama":"Karl H. Relaying ñ bad for energy,  good for capacity? In: Rom/Italy: Eork-in-progress session of mobicom 2001; 2001.","apa":"Karl, H. (2001). Relaying ñ bad for energy,  good for capacity? Rom/Italy: Eork-in-progress session of mobicom 2001.","short":"H. Karl, in: Eork-in-progress session of mobicom 2001, Rom/Italy, 2001.","mla":"Karl, Holger. <i>Relaying ñ Bad for Energy,  Good for Capacity?</i> Eork-in-progress session of mobicom 2001, 2001.","bibtex":"@inproceedings{Karl_2001, place={Rom/Italy}, title={Relaying ñ bad for energy,  good for capacity?}, publisher={Eork-in-progress session of mobicom 2001}, author={Karl, Holger}, year={2001} }"},"has_accepted_license":"1","ddc":["000"],"file_date_updated":"2018-04-26T11:38:56Z","_id":"2554","department":[{"_id":"75"}],"user_id":"15572","status":"public","file":[{"file_id":"2555","file_name":"karl01relayWIPMobicom.pdf","access_level":"closed","file_size":74397,"creator":"tabu","date_created":"2018-04-26T11:38:56Z","date_updated":"2018-04-26T11:38:56Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"type":"conference"},{"_id":"2556","department":[{"_id":"75"}],"user_id":"15572","ddc":["000"],"file_date_updated":"2018-04-26T11:40:59Z","publication":"Zukunftsperspektiven der Mobilkommunikation, Symposium Bundesministerium für Bildung und Forschung","type":"conference","status":"public","file":[{"file_size":162227,"access_level":"closed","file_name":"mobikom_2001.pdf","file_id":"2557","date_updated":"2018-04-26T11:40:59Z","date_created":"2018-04-26T11:40:59Z","creator":"tabu","success":1,"relation":"main_file","content_type":"application/pdf"}],"date_updated":"2022-01-06T06:57:07Z","author":[{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"},{"last_name":"Hentschel","full_name":"Hentschel, T.","first_name":"T."}],"date_created":"2018-04-26T11:41:07Z","title":"IBMS 2 - Integriertes Bandbreiteneffizientes Mobiles Software-Radio System","has_accepted_license":"1","year":"2001","citation":{"apa":"Karl, H., &#38; Hentschel, T. (2001). IBMS 2 - Integriertes Bandbreiteneffizientes Mobiles Software-Radio System. In <i>Zukunftsperspektiven der Mobilkommunikation, Symposium Bundesministerium für Bildung und Forschung</i>.","short":"H. Karl, T. Hentschel, in: Zukunftsperspektiven Der Mobilkommunikation, Symposium Bundesministerium Für Bildung Und Forschung, 2001.","mla":"Karl, Holger, and T. Hentschel. “IBMS 2 - Integriertes Bandbreiteneffizientes Mobiles Software-Radio System.” <i>Zukunftsperspektiven Der Mobilkommunikation, Symposium Bundesministerium Für Bildung Und Forschung</i>, 2001.","bibtex":"@inproceedings{Karl_Hentschel_2001, title={IBMS 2 - Integriertes Bandbreiteneffizientes Mobiles Software-Radio System}, booktitle={Zukunftsperspektiven der Mobilkommunikation, Symposium Bundesministerium für Bildung und Forschung}, author={Karl, Holger and Hentschel, T.}, year={2001} }","chicago":"Karl, Holger, and T. Hentschel. “IBMS 2 - Integriertes Bandbreiteneffizientes Mobiles Software-Radio System.” In <i>Zukunftsperspektiven Der Mobilkommunikation, Symposium Bundesministerium Für Bildung Und Forschung</i>, 2001.","ieee":"H. Karl and T. Hentschel, “IBMS 2 - Integriertes Bandbreiteneffizientes Mobiles Software-Radio System,” in <i>Zukunftsperspektiven der Mobilkommunikation, Symposium Bundesministerium für Bildung und Forschung</i>, 2001.","ama":"Karl H, Hentschel T. IBMS 2 - Integriertes Bandbreiteneffizientes Mobiles Software-Radio System. In: <i>Zukunftsperspektiven Der Mobilkommunikation, Symposium Bundesministerium Für Bildung Und Forschung</i>. ; 2001."}},{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"26"}],"user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19622","intvolume":"        89","citation":{"apa":"Schröder, K. (2001). <i>Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing</i> (Vol. 89). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Schröder_2001, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing}, volume={89}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schröder, Klaus}, year={2001}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","mla":"Schröder, Klaus. <i>Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","chicago":"Schröder, Klaus. <i>Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing</i>. Vol. 89. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","ieee":"K. Schröder, <i>Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing</i>, vol. 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","ama":"Schröder K. <i>Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing</i>. Vol 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2001."},"year":"2001","related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20010101222"}]},"publication_identifier":{"isbn":["3-931466-88-4"]},"title":"Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing","volume":89,"date_created":"2020-09-22T10:18:39Z","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"author":[{"first_name":"Klaus","full_name":"Schröder, Klaus","last_name":"Schröder"}],"date_updated":"2022-01-06T06:54:08Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"title":"Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)","date_updated":"2022-01-06T06:54:12Z","volume":1,"date_created":"2020-09-30T12:34:44Z","author":[{"first_name":"Kay","full_name":"Salzwedel, Kay","last_name":"Salzwedel"},{"first_name":"Georg","full_name":"Hartmann, Georg","last_name":"Hartmann"},{"last_name":"Wolff","full_name":"Wolff, Carsten","first_name":"Carsten"},{"first_name":"Robert","last_name":"Preis","full_name":"Preis, Robert"}],"year":"2001","intvolume":"         1","page":"463-470","citation":{"apa":"Salzwedel, K., Hartmann, G., Wolff, C., &#38; Preis, R. (2001). Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In <i>Proceedings of the PDPTA 2001</i> (Vol. 1, pp. 463–470).","short":"K. Salzwedel, G. Hartmann, C. Wolff, R. Preis, in: Proceedings of the PDPTA 2001, 2001, pp. 463–470.","mla":"Salzwedel, Kay, et al. “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN).” <i>Proceedings of the PDPTA 2001</i>, vol. 1, 2001, pp. 463–70.","bibtex":"@inproceedings{Salzwedel_Hartmann_Wolff_Preis_2001, title={Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)}, volume={1}, booktitle={Proceedings of the PDPTA 2001}, author={Salzwedel, Kay and Hartmann, Georg and Wolff, Carsten and Preis, Robert}, year={2001}, pages={463–470} }","ama":"Salzwedel K, Hartmann G, Wolff C, Preis R. Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In: <i>Proceedings of the PDPTA 2001</i>. Vol 1. ; 2001:463-470.","chicago":"Salzwedel, Kay, Georg Hartmann, Carsten Wolff, and Robert Preis. “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN).” In <i>Proceedings of the PDPTA 2001</i>, 1:463–70, 2001.","ieee":"K. Salzwedel, G. Hartmann, C. Wolff, and R. Preis, “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN),” in <i>Proceedings of the PDPTA 2001</i>, 2001, vol. 1, pp. 463–470."},"language":[{"iso":"eng"}],"_id":"19797","department":[{"_id":"63"},{"_id":"70"}],"user_id":"15415","status":"public","publication":"Proceedings of the PDPTA 2001","type":"conference"},{"year":"2001","page":"85-91","citation":{"short":"C. Plessl, M. Platzner, in: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA), CSREA Press, 2001, pp. 85–91.","bibtex":"@inproceedings{Plessl_Platzner_2001, title={Instance-Specific Accelerators for Minimum Covering}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Plessl, Christian and Platzner, Marco}, year={2001}, pages={85–91} }","mla":"Plessl, Christian, and Marco Platzner. “Instance-Specific Accelerators for Minimum Covering.” <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, CSREA Press, 2001, pp. 85–91.","apa":"Plessl, C., &#38; Platzner, M. (2001). Instance-Specific Accelerators for Minimum Covering. In <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i> (pp. 85–91). CSREA Press.","ama":"Plessl C, Platzner M. Instance-Specific Accelerators for Minimum Covering. In: <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press; 2001:85-91.","chicago":"Plessl, Christian, and Marco Platzner. “Instance-Specific Accelerators for Minimum Covering.” In <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 85–91. CSREA Press, 2001.","ieee":"C. Plessl and M. Platzner, “Instance-Specific Accelerators for Minimum Covering,” in <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 2001, pp. 85–91."},"title":"Instance-Specific Accelerators for Minimum Covering","publisher":"CSREA Press","date_updated":"2022-01-06T06:56:17Z","author":[{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"date_created":"2018-04-17T15:39:17Z","abstract":[{"text":" In this paper we present instance-specific accelerators for minimum-cost covering problems. We first define the covering problem and discuss a branch&bound algorithm to solve it. Then we describe an instance-specific hardware architecture that implements branch&bound in 3-valued logic and uses reduction techniques usually found in software solvers. Results for small unate covering problems reveal significant raw speedups. ","lang":"eng"}],"status":"public","publication":"Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)","type":"conference","keyword":["minimum covering","accelerator","funding-sundance"],"_id":"2428","department":[{"_id":"518"},{"_id":"78"}],"user_id":"24135"},{"status":"public","type":"journal_article","publication":"iX","_id":"2429","user_id":"24135","department":[{"_id":"518"}],"year":"2001","citation":{"ama":"Plessl C, Wilde E. Server-Side-Techniken im Web – ein Überblick. <i>iX</i>. 2001:88-93.","chicago":"Plessl, Christian, and Erik Wilde. “Server-Side-Techniken Im Web – Ein Überblick.” <i>IX</i>, 2001, 88–93.","ieee":"C. Plessl and E. Wilde, “Server-Side-Techniken im Web – ein Überblick,” <i>iX</i>, pp. 88–93, 2001.","apa":"Plessl, C., &#38; Wilde, E. (2001). Server-Side-Techniken im Web – ein Überblick. <i>IX</i>, 88–93.","short":"C. Plessl, E. Wilde, IX (2001) 88–93.","bibtex":"@article{Plessl_Wilde_2001, title={Server-Side-Techniken im Web – ein Überblick}, journal={iX}, publisher={Heise Verlag}, author={Plessl, Christian and Wilde, Erik}, year={2001}, pages={88–93} }","mla":"Plessl, Christian, and Erik Wilde. “Server-Side-Techniken Im Web – Ein Überblick.” <i>IX</i>, Heise Verlag, 2001, pp. 88–93."},"page":"88-93","title":"Server-Side-Techniken im Web – ein Überblick","date_updated":"2022-01-06T06:56:17Z","publisher":"Heise Verlag","date_created":"2018-04-17T15:43:29Z","author":[{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"},{"full_name":"Wilde, Erik","last_name":"Wilde","first_name":"Erik"}]},{"user_id":"24135","department":[{"_id":"518"}],"_id":"2430","type":"mastersthesis","status":"public","abstract":[{"text":"In this report the design and implementation of an instance-specific accelerator for solving minimum covering problems will be presented. After an introduction to configurable computing in general, the minimum covering problem is defined and a branch and bound algorithm to solve it in software is presented. The remainder of the report shows how this branch and bound algorithm can be adopted to hardware. Specifically it is stressed how the various sophisticated strategies for deducing conditions for variables used by software solvers can be adopted to hardware and how a system which uses 3-valued logic to solve this problem can be designed. In addition to these considerations focusing on the architecture of the system, some important details of the actual implementation are given. A prototype has been implemented for showing the feasibility of the concept and for gaining information about speed and size of the hardware implementation. Cycle-accurate simulations for a set of benchmark problems have been done for determining the performance of the accelerator. The speed of the resulting accelerators has been compared to the time a reference software solver (espresso) needs and the resulting speedups have been calculated. I have shown that a raw speedup of several orders of maginitude can be achieved for many problems; for some problems no speedup is achieved yet. After a discussion of the results, ideas for future work are presented.","lang":"eng"}],"date_created":"2018-04-17T15:47:26Z","author":[{"orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"}],"date_updated":"2022-01-06T06:56:17Z","publisher":"Computer Engineering and Networks Lab, ETH Zurich, Switzerland","title":"Reconfigurable Accelerators for Minimum Covering","citation":{"mla":"Plessl, Christian. <i>Reconfigurable Accelerators for Minimum Covering</i>. Computer Engineering and Networks Lab, ETH Zurich, Switzerland, 2001.","bibtex":"@book{Plessl_2001, title={Reconfigurable Accelerators for Minimum Covering}, publisher={Computer Engineering and Networks Lab, ETH Zurich, Switzerland}, author={Plessl, Christian}, year={2001} }","short":"C. Plessl, Reconfigurable Accelerators for Minimum Covering, Computer Engineering and Networks Lab, ETH Zurich, Switzerland, 2001.","apa":"Plessl, C. (2001). <i>Reconfigurable Accelerators for Minimum Covering</i>. Computer Engineering and Networks Lab, ETH Zurich, Switzerland.","chicago":"Plessl, Christian. <i>Reconfigurable Accelerators for Minimum Covering</i>. Computer Engineering and Networks Lab, ETH Zurich, Switzerland, 2001.","ieee":"C. Plessl, <i>Reconfigurable Accelerators for Minimum Covering</i>. Computer Engineering and Networks Lab, ETH Zurich, Switzerland, 2001.","ama":"Plessl C. <i>Reconfigurable Accelerators for Minimum Covering</i>. Computer Engineering and Networks Lab, ETH Zurich, Switzerland; 2001."},"year":"2001"},{"page":"135-146","intvolume":"      4525","citation":{"chicago":"Enzler, Rolf, Marco Platzner, Christian Plessl, Lothar Thiele, and Gerhard Tröster. “Reconfigurable Processors for Handhelds and Wearables: Application Analysis.” In <i>Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing and Communications III</i>, 4525:135–46. Proc. SPIE, 2001. <a href=\"https://doi.org/10.1117/12.434376\">https://doi.org/10.1117/12.434376</a>.","ieee":"R. Enzler, M. Platzner, C. Plessl, L. Thiele, and G. Tröster, “Reconfigurable Processors for Handhelds and Wearables: Application Analysis,” in <i>Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing and Communications III</i>, 2001, vol. 4525, pp. 135–146.","ama":"Enzler R, Platzner M, Plessl C, Thiele L, Tröster G. Reconfigurable Processors for Handhelds and Wearables: Application Analysis. In: <i>Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing and Communications III</i>. Vol 4525. Proc. SPIE. ; 2001:135-146. doi:<a href=\"https://doi.org/10.1117/12.434376\">10.1117/12.434376</a>","short":"R. Enzler, M. Platzner, C. Plessl, L. Thiele, G. Tröster, in: Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing and Communications III, 2001, pp. 135–146.","mla":"Enzler, Rolf, et al. “Reconfigurable Processors for Handhelds and Wearables: Application Analysis.” <i>Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing and Communications III</i>, vol. 4525, 2001, pp. 135–46, doi:<a href=\"https://doi.org/10.1117/12.434376\">10.1117/12.434376</a>.","bibtex":"@inproceedings{Enzler_Platzner_Plessl_Thiele_Tröster_2001, series={Proc. SPIE}, title={Reconfigurable Processors for Handhelds and Wearables: Application Analysis}, volume={4525}, DOI={<a href=\"https://doi.org/10.1117/12.434376\">10.1117/12.434376</a>}, booktitle={Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing and Communications III}, author={Enzler, Rolf and Platzner, Marco and Plessl, Christian and Thiele, Lothar and Tröster, Gerhard}, year={2001}, pages={135–146}, collection={Proc. SPIE} }","apa":"Enzler, R., Platzner, M., Plessl, C., Thiele, L., &#38; Tröster, G. (2001). Reconfigurable Processors for Handhelds and Wearables: Application Analysis. In <i>Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing and Communications III</i> (Vol. 4525, pp. 135–146). <a href=\"https://doi.org/10.1117/12.434376\">https://doi.org/10.1117/12.434376</a>"},"year":"2001","volume":4525,"date_created":"2018-04-17T15:51:39Z","author":[{"full_name":"Enzler, Rolf","last_name":"Enzler","first_name":"Rolf"},{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"},{"full_name":"Thiele, Lothar","last_name":"Thiele","first_name":"Lothar"},{"first_name":"Gerhard","full_name":"Tröster, Gerhard","last_name":"Tröster"}],"date_updated":"2022-01-06T06:56:17Z","doi":"10.1117/12.434376","title":"Reconfigurable Processors for Handhelds and Wearables: Application Analysis","publication":"Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing and Communications III","type":"conference","status":"public","abstract":[{"text":"In this paper, we present the analysis of applications from the domain of handheld and wearable computing. This analysis is the first step to derive and evaluate design parameters for dynamically reconfigurable processors. We discuss the selection of representative benchmarks for handhelds and wearables and group the applications into multimedia, communications, and cryptography programs. We simulate the applications on a cycle-accurate processor simulator and gather statistical data such as instruction mix, cache hit rates and memory requirements for an embedded processor model. A breakdown of the executed cycles into different functions identifies the most compute-intensive code sections - the kernels. Then, we analyze the applications and discuss parameters that strongly influence the design of dynamically reconfigurable processors. Finally, we outline the construction of a parameterizable simulation model for a reconfigurable unit that is attached to a processor core.","lang":"eng"}],"department":[{"_id":"518"},{"_id":"78"}],"series_title":"Proc. SPIE","user_id":"24135","_id":"2432","keyword":["benchmark"]},{"type":"journal_article","publication":"Acta Inf.","status":"public","_id":"3244","user_id":"29719","department":[{"_id":"77"}],"issue":"3","year":"2001","citation":{"mla":"Rensink, Arend, and Heike Wehrheim. “Process Algebra with Action Dependencies.” <i>Acta Inf.</i>, no. 3, 2001, pp. 155--234, doi:<a href=\"https://doi.org/10.1007/s002360100070\">10.1007/s002360100070</a>.","short":"A. Rensink, H. Wehrheim, Acta Inf. (2001) 155--234.","bibtex":"@article{Rensink_Wehrheim_2001, title={Process algebra with action dependencies}, DOI={<a href=\"https://doi.org/10.1007/s002360100070\">10.1007/s002360100070</a>}, number={3}, journal={Acta Inf.}, author={Rensink, Arend and Wehrheim, Heike}, year={2001}, pages={155--234} }","apa":"Rensink, A., &#38; Wehrheim, H. (2001). Process algebra with action dependencies. <i>Acta Inf.</i>, (3), 155--234. <a href=\"https://doi.org/10.1007/s002360100070\">https://doi.org/10.1007/s002360100070</a>","ieee":"A. Rensink and H. Wehrheim, “Process algebra with action dependencies,” <i>Acta Inf.</i>, no. 3, pp. 155--234, 2001.","chicago":"Rensink, Arend, and Heike Wehrheim. “Process Algebra with Action Dependencies.” <i>Acta Inf.</i>, no. 3 (2001): 155--234. <a href=\"https://doi.org/10.1007/s002360100070\">https://doi.org/10.1007/s002360100070</a>.","ama":"Rensink A, Wehrheim H. Process algebra with action dependencies. <i>Acta Inf</i>. 2001;(3):155--234. doi:<a href=\"https://doi.org/10.1007/s002360100070\">10.1007/s002360100070</a>"},"page":"155--234","date_updated":"2022-01-06T06:59:07Z","author":[{"full_name":"Rensink, Arend","last_name":"Rensink","first_name":"Arend"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_created":"2018-06-14T07:12:39Z","title":"Process algebra with action dependencies","doi":"10.1007/s002360100070"},{"status":"public","type":"journal_article","publication":"Electr. Notes Theor. Comput. Sci.","user_id":"29719","department":[{"_id":"77"}],"_id":"3245","citation":{"mla":"Bartetzko, Detlef, et al. “Jass - Java with Assertions.” <i>Electr. Notes Theor. Comput. Sci.</i>, no. 2, 2001, pp. 103--117, doi:<a href=\"https://doi.org/10.1016/S1571-0661(04)00247-6\">10.1016/S1571-0661(04)00247-6</a>.","bibtex":"@article{Bartetzko_Fischer_Möller_Wehrheim_2001, title={Jass - Java with Assertions}, DOI={<a href=\"https://doi.org/10.1016/S1571-0661(04)00247-6\">10.1016/S1571-0661(04)00247-6</a>}, number={2}, journal={Electr. Notes Theor. Comput. Sci.}, author={Bartetzko, Detlef and Fischer, Clemens and Möller, Michael and Wehrheim, Heike}, year={2001}, pages={103--117} }","short":"D. Bartetzko, C. Fischer, M. Möller, H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2001) 103--117.","apa":"Bartetzko, D., Fischer, C., Möller, M., &#38; Wehrheim, H. (2001). Jass - Java with Assertions. <i>Electr. Notes Theor. Comput. Sci.</i>, (2), 103--117. <a href=\"https://doi.org/10.1016/S1571-0661(04)00247-6\">https://doi.org/10.1016/S1571-0661(04)00247-6</a>","chicago":"Bartetzko, Detlef, Clemens Fischer, Michael Möller, and Heike Wehrheim. “Jass - Java with Assertions.” <i>Electr. Notes Theor. Comput. Sci.</i>, no. 2 (2001): 103--117. <a href=\"https://doi.org/10.1016/S1571-0661(04)00247-6\">https://doi.org/10.1016/S1571-0661(04)00247-6</a>.","ieee":"D. Bartetzko, C. Fischer, M. Möller, and H. Wehrheim, “Jass - Java with Assertions,” <i>Electr. Notes Theor. Comput. Sci.</i>, no. 2, pp. 103--117, 2001.","ama":"Bartetzko D, Fischer C, Möller M, Wehrheim H. Jass - Java with Assertions. <i>Electr Notes Theor Comput Sci</i>. 2001;(2):103--117. doi:<a href=\"https://doi.org/10.1016/S1571-0661(04)00247-6\">10.1016/S1571-0661(04)00247-6</a>"},"page":"103--117","year":"2001","issue":"2","doi":"10.1016/S1571-0661(04)00247-6","title":"Jass - Java with Assertions","date_created":"2018-06-14T07:14:07Z","author":[{"full_name":"Bartetzko, Detlef","last_name":"Bartetzko","first_name":"Detlef"},{"first_name":"Clemens","last_name":"Fischer","full_name":"Fischer, Clemens"},{"first_name":"Michael","last_name":"Möller","full_name":"Möller, Michael"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_updated":"2022-01-06T06:59:07Z"},{"type":"conference","publication":"Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings","status":"public","editor":[{"full_name":"Hu{\\ss}mann, Heinrich","last_name":"Hu{\\ss}mann","first_name":"Heinrich"}],"user_id":"29719","series_title":"Lecture Notes in Computer Science","department":[{"_id":"77"}],"_id":"3246","citation":{"ama":"Fischer C, Olderog E-R, Wehrheim H. A {CSP} View on {UML-RT} Structure Diagrams. In: Hu{\\ss}mann H, ed. <i>Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings</i>. Lecture Notes in Computer Science. ; 2001:91--108. doi:<a href=\"https://doi.org/10.1007/3-540-45314-8_8\">10.1007/3-540-45314-8_8</a>","ieee":"C. Fischer, E.-R. Olderog, and H. Wehrheim, “A {CSP} View on {UML-RT} Structure Diagrams,” in <i>Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings</i>, 2001, pp. 91--108.","chicago":"Fischer, Clemens, Ernst-Rüdiger Olderog, and Heike Wehrheim. “A {CSP} View on {UML-RT} Structure Diagrams.” In <i>Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings</i>, edited by Heinrich Hu{\\ss}mann, 91--108. Lecture Notes in Computer Science, 2001. <a href=\"https://doi.org/10.1007/3-540-45314-8_8\">https://doi.org/10.1007/3-540-45314-8_8</a>.","bibtex":"@inproceedings{Fischer_Olderog_Wehrheim_2001, series={Lecture Notes in Computer Science}, title={A {CSP} View on {UML-RT} Structure Diagrams}, DOI={<a href=\"https://doi.org/10.1007/3-540-45314-8_8\">10.1007/3-540-45314-8_8</a>}, booktitle={Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings}, author={Fischer, Clemens and Olderog, Ernst-Rüdiger and Wehrheim, Heike}, editor={Hu{\\ss}mann, HeinrichEditor}, year={2001}, pages={91--108}, collection={Lecture Notes in Computer Science} }","mla":"Fischer, Clemens, et al. “A {CSP} View on {UML-RT} Structure Diagrams.” <i>Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings</i>, edited by Heinrich Hu{\\ss}mann, 2001, pp. 91--108, doi:<a href=\"https://doi.org/10.1007/3-540-45314-8_8\">10.1007/3-540-45314-8_8</a>.","short":"C. Fischer, E.-R. Olderog, H. Wehrheim, in: H. Hu{\\ss}mann (Ed.), Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings, 2001, pp. 91--108.","apa":"Fischer, C., Olderog, E.-R., &#38; Wehrheim, H. (2001). A {CSP} View on {UML-RT} Structure Diagrams. In H. Hu{\\ss}mann (Ed.), <i>Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings</i> (pp. 91--108). <a href=\"https://doi.org/10.1007/3-540-45314-8_8\">https://doi.org/10.1007/3-540-45314-8_8</a>"},"page":"91--108","year":"2001","author":[{"last_name":"Fischer","full_name":"Fischer, Clemens","first_name":"Clemens"},{"last_name":"Olderog","full_name":"Olderog, Ernst-Rüdiger","first_name":"Ernst-Rüdiger"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_created":"2018-06-14T07:15:07Z","date_updated":"2022-01-06T06:59:07Z","doi":"10.1007/3-540-45314-8_8","title":"A {CSP} View on {UML-RT} Structure Diagrams"},{"language":[{"iso":"eng"}],"_id":"2139","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","status":"public","publication":"Combinatorica","type":"journal_article","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","doi":"10.1007/s004930170007","date_updated":"2022-01-06T06:54:57Z","volume":21,"date_created":"2018-04-03T05:47:20Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"year":"2001","page":"95--138","intvolume":"        21","citation":{"ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>. 2001;21(1):95--138. doi:<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” <i>Combinatorica</i>, vol. 21, no. 1, pp. 95--138, 2001.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” <i>Combinatorica</i> 21, no. 1 (2001): 95--138. <a href=\"https://doi.org/10.1007/s004930170007\">https://doi.org/10.1007/s004930170007</a>.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>, <i>21</i>(1), 95--138. <a href=\"https://doi.org/10.1007/s004930170007\">https://doi.org/10.1007/s004930170007</a>","short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.","bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>}, number={1}, journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2001}, pages={95--138} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” <i>Combinatorica</i>, vol. 21, no. 1, 2001, pp. 95--138, doi:<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>."},"issue":"1"},{"year":"2001","page":"158--167","citation":{"apa":"Awerbuch, B., Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In <i>FOCS</i> (pp. 158--167). IEEE Computer Society.","mla":"Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” <i>FOCS</i>, IEEE Computer Society, 2001, pp. 158--167.","bibtex":"@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={158--167} }","short":"B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.","chicago":"Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In <i>FOCS</i>, 158--167. IEEE Computer Society, 2001.","ieee":"B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in <i>FOCS</i>, 2001, pp. 158--167.","ama":"Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: <i>FOCS</i>. IEEE Computer Society; 2001:158--167."},"has_accepted_license":"1","title":"Simple Routing Strategies for Adversarial Systems","oa":"1","publisher":"IEEE Computer Society","date_updated":"2022-01-06T06:54:59Z","date_created":"2018-04-03T05:48:28Z","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"first_name":"Petra","last_name":"Berenbrink","full_name":"Berenbrink, Petra"},{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"urn":"21406","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2018-04-12T08:59:00Z","creator":"florida","date_updated":"2018-04-12T08:59:00Z","access_level":"open_access","file_name":"FOCS-01.pdf","file_id":"2302","file_size":151156}],"publication":"FOCS","type":"conference","ddc":["040"],"file_date_updated":"2018-04-12T08:59:00Z","_id":"2140","department":[{"_id":"79"}],"user_id":"15504"},{"date_updated":"2022-01-06T06:54:59Z","publisher":"IEEE Computer Society","oa":"1","date_created":"2018-04-03T05:49:21Z","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"title":"SIMLAB-A Simulation Environment for Storage Area Networks","has_accepted_license":"1","year":"2001","citation":{"mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” <i>PDP</i>, IEEE Computer Society, 2001, pp. 227--234.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={227--234} }","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.","apa":"Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In <i>PDP</i> (pp. 227--234). IEEE Computer Society.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: <i>PDP</i>. IEEE Computer Society; 2001:227--234.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In <i>PDP</i>, 227--234. IEEE Computer Society, 2001.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in <i>PDP</i>, 2001, pp. 227--234."},"page":"227--234","_id":"2141","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T08:39:01Z","type":"conference","publication":"PDP","urn":"21415","file":[{"file_id":"2298","file_name":"PDP-00.pdf","access_level":"open_access","file_size":85778,"creator":"florida","date_created":"2018-04-12T08:39:01Z","date_updated":"2018-04-12T08:39:01Z","relation":"main_file","content_type":"application/pdf"}],"status":"public"},{"page":"38--47","citation":{"ama":"Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: <i>SPAA</i>. ; 2001:38--47.","ieee":"P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in <i>SPAA</i>, 2001, pp. 38--47.","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In <i>SPAA</i>, 38--47, 2001.","apa":"Kolman, P., &#38; Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In <i>SPAA</i> (pp. 38--47).","short":"P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.","bibtex":"@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr and Scheideler, Christian}, year={2001}, pages={38--47} }","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” <i>SPAA</i>, 2001, pp. 38--47."},"year":"2001","has_accepted_license":"1","title":"Simple on-line algorithms for the maximum disjoint paths problem","date_created":"2018-04-03T05:50:16Z","author":[{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T06:54:59Z","oa":"1","status":"public","file":[{"relation":"main_file","content_type":"application/pdf","file_name":"SPAA-01.pdf","access_level":"open_access","file_id":"2301","file_size":335171,"creator":"florida","date_created":"2018-04-12T08:58:07Z","date_updated":"2018-04-12T08:58:07Z"}],"urn":"21421","publication":"SPAA","type":"conference","file_date_updated":"2018-04-12T08:58:07Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"2142"},{"publication_status":"published","publication_identifier":{"isbn":["9783540422877","9783540482246"],"issn":["0302-9743"]},"year":"2001","citation":{"short":"A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) (2001) 493–505.","bibtex":"@article{Czumaj_Sohler_2001, title={Testing Hypergraph Coloring}, DOI={<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>}, journal={Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)}, author={Czumaj, Artur and Sohler, Christian}, year={2001}, pages={493–505} }","mla":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2001, pp. 493–505, doi:<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>.","apa":"Czumaj, A., &#38; Sohler, C. (2001). Testing Hypergraph Coloring. <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 493–505. <a href=\"https://doi.org/10.1007/3-540-48224-5_41\">https://doi.org/10.1007/3-540-48224-5_41</a>","ama":"Czumaj A, Sohler C. Testing Hypergraph Coloring. <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>. 2001:493-505. doi:<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>","chicago":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2001, 493–505. <a href=\"https://doi.org/10.1007/3-540-48224-5_41\">https://doi.org/10.1007/3-540-48224-5_41</a>.","ieee":"A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, pp. 493–505, 2001."},"page":"493-505","date_updated":"2022-01-06T06:53:51Z","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"}],"date_created":"2020-09-01T10:48:38Z","title":"Testing Hypergraph Coloring","doi":"10.1007/3-540-48224-5_41","type":"journal_article","publication":"Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)","status":"public","_id":"18749","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"year":"2001","page":"865-872","citation":{"ieee":"C. Sohler and A. Czumaj, “Soft Kinetic Data Structures,” in <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 2001, pp. 865–872.","chicago":"Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” In <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 865–72, 2001.","ama":"Sohler C, Czumaj A. Soft Kinetic Data Structures. In: <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>. ; 2001:865-872.","apa":"Sohler, C., &#38; Czumaj, A. (2001). Soft Kinetic Data Structures. In <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 865–872).","mla":"Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 2001, pp. 865–72.","short":"C. Sohler, A. Czumaj, in: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.","bibtex":"@inproceedings{Sohler_Czumaj_2001, title={Soft Kinetic Data Structures}, booktitle={Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms}, author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={865–872} }"},"date_updated":"2022-01-06T06:53:51Z","date_created":"2020-09-01T10:56:39Z","author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"}],"title":"Soft Kinetic Data Structures","publication":"Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms","type":"conference","status":"public","_id":"18750","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"doi":"10.1007/3-540-44676-1_22","title":"Property Testing with Geometric Queries","author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"}],"date_created":"2020-09-02T12:24:25Z","date_updated":"2022-01-06T06:53:53Z","page":"266-277","citation":{"apa":"Sohler, C., &#38; Czumaj, A. (2001). Property Testing with Geometric Queries. <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, 266–277. <a href=\"https://doi.org/10.1007/3-540-44676-1_22\">https://doi.org/10.1007/3-540-44676-1_22</a>","short":"C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01) (2001) 266–277.","bibtex":"@article{Sohler_Czumaj_2001, title={Property Testing with Geometric Queries}, DOI={<a href=\"https://doi.org/10.1007/3-540-44676-1_22\">10.1007/3-540-44676-1_22</a>}, journal={Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)}, author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={266–277} }","mla":"Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.” <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, 2001, pp. 266–77, doi:<a href=\"https://doi.org/10.1007/3-540-44676-1_22\">10.1007/3-540-44676-1_22</a>.","ieee":"C. Sohler and A. Czumaj, “Property Testing with Geometric Queries,” <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, pp. 266–277, 2001.","chicago":"Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.” <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, 2001, 266–77. <a href=\"https://doi.org/10.1007/3-540-44676-1_22\">https://doi.org/10.1007/3-540-44676-1_22</a>.","ama":"Sohler C, Czumaj A. Property Testing with Geometric Queries. <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>. 2001:266-277. doi:<a href=\"https://doi.org/10.1007/3-540-44676-1_22\">10.1007/3-540-44676-1_22</a>"},"year":"2001","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18857","status":"public","abstract":[{"lang":"eng","text":"This paper investigates geometric problems in the context of property testing algorithms. Property testing is an emerging area in computer science in which one is aiming at verifying whether a given object has a predetermined property or is “far” from any object having the property. Although there has been some research previously done in testing geometric properties, prior works have been mostly dealing with the study of combinatorial notion of the distance defining whether an object is “far” or it is “close”; very little research has been done for geometric notion of distance measures, that is, distance measures that are based on the geometry underlying input objects.\r\n\r\nThe main objective of this work is to develop sound models to study geometric problems in the context of property testing. Comparing to the previous work in property testing, there are two novel aspects developed in this paper: geometric measures of being close to an object having the predetermined property, and the use of geometric data structures as basic primitives to design the testers. We believe that the second aspect is of special importance in the context of property testing and that the use of specialized data structures as basic primitives in the testers can be applied to other important problems in this area.\r\n\r\nWe shall discuss a number of models that in our opinion fit best geometric problems and apply them to study geometric properties for three very fundamental and representative problems in the area: testing convex position, testing map labeling, and testing clusterability."}],"publication":"Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)","type":"journal_article"}]