[{"language":[{"iso":"eng"}],"department":[{"_id":"672"}],"series_title":"Mobis 2000","user_id":"5786","_id":"39434","status":"public","abstract":[{"lang":"eng","text":"In diesem Artikel stellen wir die Anwendung von Modellprüfung für ein\r\nFertigungssystem mit freifahrenden Transportfahrzeugen vor. Dabei konzentrieren wir\r\nuns darauf, den Materialfluss in einem Systemmodell auf die Einhaltung quantitativer\r\nund zeitlicher Bedingungen hin zu überprüfen. Zur Modellentwicklung setzen wir die\r\ngraphische Beschreibungsmethode MFERT ein, die sich bereits mehrfach in\r\nIndustrieprojekten bewährt hat. Wir präsentieren eine Abbildung von MFERT in\r\nzeitannotierte Zustandsübergangssysteme, die für ein bereits existierendes Werkzeug zur\r\nModellprüfung als Eingabe einer Modellbeschreibung dienen. Bei der Modellprüfung\r\nwird diese Beschreibung auf die Einhaltung von Eigenschaften überprüft, die in einer\r\ntemporalen Logik oder einer davon abstrahierten Form spezifiziert werden."}],"type":"conference","title":"Modellprüfung für den Entwurf von Fertigungssteuerungssystemen","date_created":"2023-01-24T10:49:52Z","author":[{"last_name":"Flake","full_name":"Flake, Stephan","first_name":"Stephan"},{"id":"16243","full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang"},{"last_name":"Pape","full_name":"Pape, Ulrich","first_name":"Ulrich"},{"full_name":"Ruf, Jürgen","last_name":"Ruf","first_name":"Jürgen"}],"date_updated":"2023-01-24T10:49:57Z","citation":{"apa":"Flake, S., Müller, W., Pape, U., &#38; Ruf, J. (2000). <i>Modellprüfung für den Entwurf von Fertigungssteuerungssystemen</i>.","bibtex":"@article{Flake_Müller_Pape_Ruf_2000, place={Siegen}, series={Mobis 2000}, title={Modellprüfung für den Entwurf von Fertigungssteuerungssystemen}, author={Flake, Stephan and Müller, Wolfgang and Pape, Ulrich and Ruf, Jürgen}, year={2000}, collection={Mobis 2000} }","mla":"Flake, Stephan, et al. <i>Modellprüfung Für Den Entwurf von Fertigungssteuerungssystemen</i>. 2000.","short":"S. Flake, W. Müller, U. Pape, J. Ruf, (2000).","ama":"Flake S, Müller W, Pape U, Ruf J. Modellprüfung für den Entwurf von Fertigungssteuerungssystemen. Published online 2000.","ieee":"S. Flake, W. Müller, U. Pape, and J. Ruf, “Modellprüfung für den Entwurf von Fertigungssteuerungssystemen.” Siegen, 2000.","chicago":"Flake, Stephan, Wolfgang Müller, Ulrich Pape, and Jürgen Ruf. “Modellprüfung Für Den Entwurf von Fertigungssteuerungssystemen.” Mobis 2000. Siegen, 2000."},"place":"Siegen","year":"2000"},{"author":[{"first_name":"A.","full_name":"Braatz, A.","last_name":"Braatz"},{"first_name":"Stephan","last_name":"Flake","full_name":"Flake, Stephan"},{"last_name":"Müller","full_name":"Müller, Wolfgang","id":"16243","first_name":"Wolfgang"},{"full_name":"Westkämper, E.","last_name":"Westkämper","first_name":"E."}],"date_created":"2023-01-24T11:09:42Z","date_updated":"2023-01-24T11:09:46Z","title":"Prototyping einer Fahrzeug-steuerung in einer virtuellen 3D-Umgebung","citation":{"short":"A. Braatz, S. Flake, W. Müller, E. Westkämper, (2000).","mla":"Braatz, A., et al. <i>Prototyping Einer Fahrzeug-Steuerung in Einer Virtuellen 3D-Umgebung</i>. 2000.","bibtex":"@article{Braatz_Flake_Müller_Westkämper_2000, place={Magdeburg, Germany}, series={Simulation und Visualisierung 2000}, title={Prototyping einer Fahrzeug-steuerung in einer virtuellen 3D-Umgebung}, author={Braatz, A. and Flake, Stephan and Müller, Wolfgang and Westkämper, E.}, year={2000}, collection={Simulation und Visualisierung 2000} }","apa":"Braatz, A., Flake, S., Müller, W., &#38; Westkämper, E. (2000). <i>Prototyping einer Fahrzeug-steuerung in einer virtuellen 3D-Umgebung</i>.","chicago":"Braatz, A., Stephan Flake, Wolfgang Müller, and E. Westkämper. “Prototyping Einer Fahrzeug-Steuerung in Einer Virtuellen 3D-Umgebung.” Simulation Und Visualisierung 2000. Magdeburg, Germany, 2000.","ieee":"A. Braatz, S. Flake, W. Müller, and E. Westkämper, “Prototyping einer Fahrzeug-steuerung in einer virtuellen 3D-Umgebung.” Magdeburg, Germany, 2000.","ama":"Braatz A, Flake S, Müller W, Westkämper E. Prototyping einer Fahrzeug-steuerung in einer virtuellen 3D-Umgebung. Published online 2000."},"place":"Magdeburg, Germany","year":"2000","department":[{"_id":"672"}],"user_id":"5786","series_title":"Simulation und Visualisierung 2000","_id":"39444","language":[{"iso":"eng"}],"type":"conference","status":"public","abstract":[{"text":"Prototyping mit 3D-Modellen in virtueller Umgebung ist eine kostengünstige Alternative zur Entwicklung von physikalischen Modellen und Mock-ups. Für einige Anwendungen ergeben sich erhebliche Vorteile durch die Validierung in einer virtuellen Umgebung. In diesem Artikel stellen wir den Einsatz einer 3D-Animation zur Entwicklung und zum Test einer Fahrzeugsteuerung vor. Basierend auf dem Prinzip der schrittweisen Verfeinerung kann die Steuerung zunächst nur unter Berücksichtigung der Kommunikation zwischen den Basiskomponenten entworfen werden. Im zweiten Schritt wird die Ansteuerung der Aktoren unter Auswertung der Sensoren berücksichtigt. Letztendlich ist das System unter Einflussnahme der physikalischen Größen zu validieren. Wir stellen die Schnittstelle exemplarisch anhand einer Steuerung für fahrerlose Transportfahrzeuge im Szenario eines holonischen Transportsystems vor. ","lang":"eng"}]},{"place":"Frankfurt","year":"2000","citation":{"apa":"Flake, S., Müller, W., &#38; Ruf, J. (2000). <i>Structured English for Model Checking Specification</i>.","bibtex":"@article{Flake_Müller_Ruf_2000, place={Frankfurt}, series={Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen}, title={Structured English for Model Checking Specification}, author={Flake, Stephan and Müller, Wolfgang and Ruf, Jürgen}, year={2000}, collection={Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen} }","short":"S. Flake, W. Müller, J. Ruf, (2000).","mla":"Flake, Stephan, et al. <i>Structured English for Model Checking Specification</i>. 2000.","ama":"Flake S, Müller W, Ruf J. Structured English for Model Checking Specification. Published online 2000.","ieee":"S. Flake, W. Müller, and J. Ruf, “Structured English for Model Checking Specification.” Frankfurt, 2000.","chicago":"Flake, Stephan, Wolfgang Müller, and Jürgen Ruf. “Structured English for Model Checking Specification.” Methoden Und Beschreibungssprachen Zur Modellierung Und Verifikation von Schaltungen Und Systemen. Frankfurt, 2000."},"title":"Structured English for Model Checking Specification","date_updated":"2023-01-24T11:13:33Z","date_created":"2023-01-24T11:13:28Z","author":[{"last_name":"Flake","full_name":"Flake, Stephan","first_name":"Stephan"},{"id":"16243","full_name":"Müller, Wolfgang","last_name":"Müller","first_name":"Wolfgang"},{"first_name":"Jürgen","full_name":"Ruf, Jürgen","last_name":"Ruf"}],"abstract":[{"text":"Model checking has received wide acceptance as a valuable technique in the field of electronic\r\ndesign automation and is currently of growing interest in general systems design. Though its\r\nconcepts and applications are well understood it often turns out that engineers have severe\r\nproblems with the specification process and the underlying notation, i.e., formulation and\r\nunderstanding of specifications through means of temporal logic formulae. In this article, we\r\npresent an approach for a natural language–oriented representation of temporal logic formulae\r\nby introducing patterns of structured English sentences for Clocked CTL (CCTL) specification.\r\nAfter outlining the basic patterns of the sentences we give their semantics by a translation to\r\nCCTL. A final example demonstrates their application.","lang":"eng"}],"status":"public","type":"conference","language":[{"iso":"eng"}],"_id":"39461","department":[{"_id":"672"}],"series_title":"Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen","user_id":"5786"},{"year":"2000","place":"Seattle, Washington, USA","citation":{"ieee":"W. Müller, A. Meyer, and H. Zabel, “A Visual Framework for the Scripting of Parallel Agents,” 2000.","chicago":"Müller, Wolfgang, Arne Meyer, and Henning Zabel. “A Visual Framework for the Scripting of Parallel Agents.” In <i>Proceedings of the IEEE Symposium on Visual Languages</i>. Seattle, Washington, USA, 2000.","ama":"Müller W, Meyer A, Zabel H. A Visual Framework for the Scripting of Parallel Agents. In: <i>Proceedings of the IEEE Symposium on Visual Languages</i>. ; 2000.","bibtex":"@inproceedings{Müller_Meyer_Zabel_2000, place={Seattle, Washington, USA}, title={A Visual Framework for the Scripting of Parallel Agents}, booktitle={Proceedings of the IEEE Symposium on Visual Languages}, author={Müller, Wolfgang and Meyer, Arne and Zabel, Henning}, year={2000} }","short":"W. Müller, A. Meyer, H. Zabel, in: Proceedings of the IEEE Symposium on Visual Languages, Seattle, Washington, USA, 2000.","mla":"Müller, Wolfgang, et al. “A Visual Framework for the Scripting of Parallel Agents.” <i>Proceedings of the IEEE Symposium on Visual Languages</i>, 2000.","apa":"Müller, W., Meyer, A., &#38; Zabel, H. (2000). A Visual Framework for the Scripting of Parallel Agents. <i>Proceedings of the IEEE Symposium on Visual Languages</i>."},"date_updated":"2023-01-24T10:51:41Z","date_created":"2023-01-24T10:51:23Z","author":[{"last_name":"Müller","full_name":"Müller, Wolfgang","id":"16243","first_name":"Wolfgang"},{"last_name":"Meyer","full_name":"Meyer, Arne","first_name":"Arne"},{"last_name":"Zabel","full_name":"Zabel, Henning","first_name":"Henning"}],"title":"A Visual Framework for the Scripting of Parallel Agents","publication":"Proceedings of the IEEE Symposium on Visual Languages","type":"conference","abstract":[{"text":"This article presents SAL (Synchronous Agent Language), a general-purpose grid{based 2D programming language for parallel system specication, implementation, and visualization. SAL agents have a depiction and a behavior. The behavior is dened by the means of state transition rules. The depiction is given by the drawing area on its surface. Actions in rules can execute drawing operations for dynamically changing the depiction during runtime. For a broader range of applications, SAL incorporates mobile code, code modication during runtime, and tool integration facilities.","lang":"eng"}],"status":"public","_id":"39435","department":[{"_id":"672"}],"user_id":"5786","language":[{"iso":"eng"}]},{"type":"conference","publication":"Proceedings of IECON 2000","status":"public","user_id":"5786","department":[{"_id":"672"}],"_id":"39439","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Bhatt_Müller_2000, place={Nagoya, Japan}, title={A Methodology for the Protocol-Centered Design of Agent-Based Systems}, booktitle={Proceedings of IECON 2000}, author={Bhatt, P. C. P. and Müller, Wolfgang}, year={2000} }","short":"P.C.P. Bhatt, W. Müller, in: Proceedings of IECON 2000, Nagoya, Japan, 2000.","mla":"Bhatt, P. C. P., and Wolfgang Müller. “A Methodology for the Protocol-Centered Design of Agent-Based Systems.” <i>Proceedings of IECON 2000</i>, 2000.","apa":"Bhatt, P. C. P., &#38; Müller, W. (2000). A Methodology for the Protocol-Centered Design of Agent-Based Systems. <i>Proceedings of IECON 2000</i>.","chicago":"Bhatt, P. C. P., and Wolfgang Müller. “A Methodology for the Protocol-Centered Design of Agent-Based Systems.” In <i>Proceedings of IECON 2000</i>. Nagoya, Japan, 2000.","ieee":"P. C. P. Bhatt and W. Müller, “A Methodology for the Protocol-Centered Design of Agent-Based Systems,” 2000.","ama":"Bhatt PCP, Müller W. A Methodology for the Protocol-Centered Design of Agent-Based Systems. In: <i>Proceedings of IECON 2000</i>. ; 2000."},"place":"Nagoya, Japan","year":"2000","date_created":"2023-01-24T10:53:23Z","author":[{"first_name":"P. C. P.","full_name":"Bhatt, P. C. P.","last_name":"Bhatt"},{"full_name":"Müller, Wolfgang","id":"16243","last_name":"Müller","first_name":"Wolfgang"}],"date_updated":"2023-01-24T10:53:27Z","title":"A Methodology for the Protocol-Centered Design of Agent-Based Systems"},{"date_updated":"2023-01-24T10:55:00Z","date_created":"2023-01-24T10:54:54Z","author":[{"first_name":"P. C. P.","full_name":"Bhatt, P. C. P.","last_name":"Bhatt"},{"last_name":"Müller","full_name":"Müller, Wolfgang","id":"16243","first_name":"Wolfgang"}],"title":"Morphic Nets: Model Based Design Diagrams","year":"2000","place":"Durham, UK","citation":{"apa":"Bhatt, P. C. P., &#38; Müller, W. (2000). Morphic Nets: Model Based Design Diagrams. <i>Proceedings of UKPEW 2000</i>.","mla":"Bhatt, P. C. P., and Wolfgang Müller. “Morphic Nets: Model Based Design Diagrams.” <i>Proceedings of UKPEW 2000</i>, 2000.","short":"P.C.P. Bhatt, W. Müller, in: Proceedings of UKPEW 2000, Durham, UK, 2000.","bibtex":"@inproceedings{Bhatt_Müller_2000, place={Durham, UK}, title={Morphic Nets: Model Based Design Diagrams}, booktitle={Proceedings of UKPEW 2000}, author={Bhatt, P. C. P. and Müller, Wolfgang}, year={2000} }","ama":"Bhatt PCP, Müller W. Morphic Nets: Model Based Design Diagrams. In: <i>Proceedings of UKPEW 2000</i>. ; 2000.","ieee":"P. C. P. Bhatt and W. Müller, “Morphic Nets: Model Based Design Diagrams,” 2000.","chicago":"Bhatt, P. C. P., and Wolfgang Müller. “Morphic Nets: Model Based Design Diagrams.” In <i>Proceedings of UKPEW 2000</i>. Durham, UK, 2000."},"_id":"39442","user_id":"5786","department":[{"_id":"672"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of UKPEW 2000","status":"public"},{"date_updated":"2023-01-24T11:14:59Z","date_created":"2023-01-24T11:14:51Z","author":[{"full_name":"Flake, Stephan","last_name":"Flake","first_name":"Stephan"},{"last_name":"Müller","id":"16243","full_name":"Müller, Wolfgang","first_name":"Wolfgang"},{"first_name":"Jürgen","last_name":"Ruf","full_name":"Ruf, Jürgen"}],"title":"An Advanced Visual Capture for Model Checking Specifications","place":"Palermo, Italy","year":"2000","citation":{"bibtex":"@inproceedings{Flake_Müller_Ruf_2000, place={Palermo, Italy}, title={An Advanced Visual Capture for Model Checking Specifications}, booktitle={Proceedings of AVI 2000}, author={Flake, Stephan and Müller, Wolfgang and Ruf, Jürgen}, year={2000} }","mla":"Flake, Stephan, et al. “An Advanced Visual Capture for Model Checking Specifications.” <i>Proceedings of AVI 2000</i>, 2000.","short":"S. Flake, W. Müller, J. Ruf, in: Proceedings of AVI 2000, Palermo, Italy, 2000.","apa":"Flake, S., Müller, W., &#38; Ruf, J. (2000). An Advanced Visual Capture for Model Checking Specifications. <i>Proceedings of AVI 2000</i>.","chicago":"Flake, Stephan, Wolfgang Müller, and Jürgen Ruf. “An Advanced Visual Capture for Model Checking Specifications.” In <i>Proceedings of AVI 2000</i>. Palermo, Italy, 2000.","ieee":"S. Flake, W. Müller, and J. Ruf, “An Advanced Visual Capture for Model Checking Specifications,” 2000.","ama":"Flake S, Müller W, Ruf J. An Advanced Visual Capture for Model Checking Specifications. In: <i>Proceedings of AVI 2000</i>. ; 2000."},"_id":"39464","user_id":"5786","department":[{"_id":"672"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of AVI 2000","status":"public"},{"publication":"Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing","type":"conference","status":"public","abstract":[{"text":"The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In ad-dition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in its implementation deviate significantly from the techniques used in other BSP libraries.","lang":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"19732","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0769501435"]},"publication_status":"published","page":"99-104","citation":{"bibtex":"@inproceedings{Bonorden_Juurlink_Von Otte_Rieping_1999, title={The Paderborn university BSP (PUB) library-design, implementation and performance}, DOI={<a href=\"https://doi.org/10.1109/ipps.1999.760442\">10.1109/ipps.1999.760442</a>}, booktitle={Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing}, author={Bonorden, Olaf and Juurlink, Bernhardus and Von Otte, I. and Rieping, Ingo}, year={1999}, pages={99–104} }","mla":"Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.” <i>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</i>, 1999, pp. 99–104, doi:<a href=\"https://doi.org/10.1109/ipps.1999.760442\">10.1109/ipps.1999.760442</a>.","short":"O. Bonorden, B. Juurlink, I. Von Otte, I. Rieping, in: Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104.","apa":"Bonorden, O., Juurlink, B., Von Otte, I., &#38; Rieping, I. (1999). The Paderborn university BSP (PUB) library-design, implementation and performance. <i>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</i>, 99–104. <a href=\"https://doi.org/10.1109/ipps.1999.760442\">https://doi.org/10.1109/ipps.1999.760442</a>","ieee":"O. Bonorden, B. Juurlink, I. Von Otte, and I. Rieping, “The Paderborn university BSP (PUB) library-design, implementation and performance,” in <i>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</i>, 1999, pp. 99–104, doi: <a href=\"https://doi.org/10.1109/ipps.1999.760442\">10.1109/ipps.1999.760442</a>.","chicago":"Bonorden, Olaf, Bernhardus Juurlink, I. Von Otte, and Ingo Rieping. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.” In <i>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</i>, 99–104, 1999. <a href=\"https://doi.org/10.1109/ipps.1999.760442\">https://doi.org/10.1109/ipps.1999.760442</a>.","ama":"Bonorden O, Juurlink B, Von Otte I, Rieping I. The Paderborn university BSP (PUB) library-design, implementation and performance. In: <i>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</i>. ; 1999:99-104. doi:<a href=\"https://doi.org/10.1109/ipps.1999.760442\">10.1109/ipps.1999.760442</a>"},"year":"1999","date_created":"2020-09-28T12:11:30Z","author":[{"last_name":"Bonorden","full_name":"Bonorden, Olaf","first_name":"Olaf"},{"last_name":"Juurlink","full_name":"Juurlink, Bernhardus","first_name":"Bernhardus"},{"first_name":"I.","last_name":"Von Otte","full_name":"Von Otte, I."},{"last_name":"Rieping","full_name":"Rieping, Ingo","first_name":"Ingo"}],"date_updated":"2022-01-06T06:54:10Z","doi":"10.1109/ipps.1999.760442","title":"The Paderborn university BSP (PUB) library-design, implementation and performance"},{"doi":"10.1016/s0166-218x(99)00055-4","title":"Resolution remains hard under equivalence","date_created":"2020-10-01T08:13:12Z","author":[{"first_name":"Hans","full_name":"Kleine Büning, Hans","last_name":"Kleine Büning"},{"first_name":"Theodor","orcid":"0000-0001-5859-2457","last_name":"Lettmann","id":"315","full_name":"Lettmann, Theodor"}],"date_updated":"2022-01-06T06:54:13Z","page":"139-148","citation":{"chicago":"Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under Equivalence.” <i>Discrete Applied Mathematics</i>, 1999, 139–48. <a href=\"https://doi.org/10.1016/s0166-218x(99)00055-4\">https://doi.org/10.1016/s0166-218x(99)00055-4</a>.","ieee":"H. Kleine Büning and T. Lettmann, “Resolution remains hard under equivalence,” <i>Discrete Applied Mathematics</i>, pp. 139–148, 1999.","ama":"Kleine Büning H, Lettmann T. Resolution remains hard under equivalence. <i>Discrete Applied Mathematics</i>. 1999:139-148. doi:<a href=\"https://doi.org/10.1016/s0166-218x(99)00055-4\">10.1016/s0166-218x(99)00055-4</a>","mla":"Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under Equivalence.” <i>Discrete Applied Mathematics</i>, 1999, pp. 139–48, doi:<a href=\"https://doi.org/10.1016/s0166-218x(99)00055-4\">10.1016/s0166-218x(99)00055-4</a>.","short":"H. Kleine Büning, T. Lettmann, Discrete Applied Mathematics (1999) 139–148.","bibtex":"@article{Kleine Büning_Lettmann_1999, title={Resolution remains hard under equivalence}, DOI={<a href=\"https://doi.org/10.1016/s0166-218x(99)00055-4\">10.1016/s0166-218x(99)00055-4</a>}, journal={Discrete Applied Mathematics}, author={Kleine Büning, Hans and Lettmann, Theodor}, year={1999}, pages={139–148} }","apa":"Kleine Büning, H., &#38; Lettmann, T. (1999). Resolution remains hard under equivalence. <i>Discrete Applied Mathematics</i>, 139–148. <a href=\"https://doi.org/10.1016/s0166-218x(99)00055-4\">https://doi.org/10.1016/s0166-218x(99)00055-4</a>"},"year":"1999","publication_identifier":{"issn":["0166-218X"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"user_id":"315","_id":"19815","status":"public","publication":"Discrete Applied Mathematics","type":"journal_article"},{"title":"Partial order reductions for failures refinement","doi":"10.1016/S1571-0661(05)80296-8","date_updated":"2022-01-06T06:59:07Z","author":[{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2018-06-14T07:26:58Z","year":"1999","citation":{"bibtex":"@article{Wehrheim_1999, title={Partial order reductions for failures refinement}, DOI={<a href=\"https://doi.org/10.1016/S1571-0661(05)80296-8\">10.1016/S1571-0661(05)80296-8</a>}, journal={Electr. Notes Theor. Comput. Sci.}, author={Wehrheim, Heike}, year={1999}, pages={71--84} }","short":"H. Wehrheim, Electr. Notes Theor. Comput. Sci. (1999) 71--84.","mla":"Wehrheim, Heike. “Partial Order Reductions for Failures Refinement.” <i>Electr. Notes Theor. Comput. Sci.</i>, 1999, pp. 71--84, doi:<a href=\"https://doi.org/10.1016/S1571-0661(05)80296-8\">10.1016/S1571-0661(05)80296-8</a>.","apa":"Wehrheim, H. (1999). Partial order reductions for failures refinement. <i>Electr. Notes Theor. Comput. Sci.</i>, 71--84. <a href=\"https://doi.org/10.1016/S1571-0661(05)80296-8\">https://doi.org/10.1016/S1571-0661(05)80296-8</a>","ieee":"H. Wehrheim, “Partial order reductions for failures refinement,” <i>Electr. Notes Theor. Comput. Sci.</i>, pp. 71--84, 1999.","chicago":"Wehrheim, Heike. “Partial Order Reductions for Failures Refinement.” <i>Electr. Notes Theor. Comput. Sci.</i>, 1999, 71--84. <a href=\"https://doi.org/10.1016/S1571-0661(05)80296-8\">https://doi.org/10.1016/S1571-0661(05)80296-8</a>.","ama":"Wehrheim H. Partial order reductions for failures refinement. <i>Electr Notes Theor Comput Sci</i>. 1999:71--84. doi:<a href=\"https://doi.org/10.1016/S1571-0661(05)80296-8\">10.1016/S1571-0661(05)80296-8</a>"},"page":"71--84","_id":"3252","user_id":"29719","department":[{"_id":"77"}],"status":"public","type":"journal_article","publication":"Electr. Notes Theor. Comput. Sci."},{"doi":"10.1007/3-540-48118-4_5","title":"Data Abstraction for {CSP-OZ}","date_created":"2018-06-14T07:32:05Z","author":[{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2022-01-06T06:59:07Z","citation":{"apa":"Wehrheim, H. (1999). Data Abstraction for {CSP-OZ}. In J. M. Wing, J. Woodcock, &#38; J. Davies (Eds.), <i>FM’99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}</i> (pp. 1028--1047). <a href=\"https://doi.org/10.1007/3-540-48118-4_5\">https://doi.org/10.1007/3-540-48118-4_5</a>","mla":"Wehrheim, Heike. “Data Abstraction for {CSP-OZ}.” <i>FM’99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}</i>, edited by Jeannette M. Wing et al., 1999, pp. 1028--1047, doi:<a href=\"https://doi.org/10.1007/3-540-48118-4_5\">10.1007/3-540-48118-4_5</a>.","bibtex":"@inproceedings{Wehrheim_1999, series={Lecture Notes in Computer Science}, title={Data Abstraction for {CSP-OZ}}, DOI={<a href=\"https://doi.org/10.1007/3-540-48118-4_5\">10.1007/3-540-48118-4_5</a>}, booktitle={FM’99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}}, author={Wehrheim, Heike}, editor={M. Wing, Jeannette and Woodcock, Jim and Davies, JimEditors}, year={1999}, pages={1028--1047}, collection={Lecture Notes in Computer Science} }","short":"H. Wehrheim, in: J. M. Wing, J. Woodcock, J. Davies (Eds.), FM’99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}, 1999, pp. 1028--1047.","ieee":"H. Wehrheim, “Data Abstraction for {CSP-OZ},” in <i>FM’99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}</i>, 1999, pp. 1028--1047.","chicago":"Wehrheim, Heike. “Data Abstraction for {CSP-OZ}.” In <i>FM’99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}</i>, edited by Jeannette M. Wing, Jim Woodcock, and Jim Davies, 1028--1047. Lecture Notes in Computer Science, 1999. <a href=\"https://doi.org/10.1007/3-540-48118-4_5\">https://doi.org/10.1007/3-540-48118-4_5</a>.","ama":"Wehrheim H. Data Abstraction for {CSP-OZ}. In: M. Wing J, Woodcock J, Davies J, eds. <i>FM’99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}</i>. Lecture Notes in Computer Science. ; 1999:1028--1047. doi:<a href=\"https://doi.org/10.1007/3-540-48118-4_5\">10.1007/3-540-48118-4_5</a>"},"page":"1028--1047","year":"1999","series_title":"Lecture Notes in Computer Science","user_id":"29719","department":[{"_id":"77"}],"_id":"3253","status":"public","editor":[{"first_name":"Jeannette","full_name":"M. Wing, Jeannette","last_name":"M. Wing"},{"first_name":"Jim","full_name":"Woodcock, Jim","last_name":"Woodcock"},{"first_name":"Jim","last_name":"Davies","full_name":"Davies, Jim"}],"type":"conference","publication":"FM'99 - Formal Methods, World Congress on Formal Methods in the Development of Computing Systems, Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}"},{"type":"conference","publication":"Integrated Formal Methods, Proceedings of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999","editor":[{"first_name":"Keijiro","full_name":"Araki, Keijiro","last_name":"Araki"},{"first_name":"Andy","last_name":"Galloway","full_name":"Galloway, Andy"},{"last_name":"Taguchi","full_name":"Taguchi, Kenji","first_name":"Kenji"}],"status":"public","_id":"3254","user_id":"29719","department":[{"_id":"77"}],"year":"1999","citation":{"ama":"Fischer C, Wehrheim H. Model-Checking {CSP-OZ} Specifications with {FDR}. In: Araki K, Galloway A, Taguchi K, eds. <i>Integrated Formal Methods, Proceedings of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999</i>. ; 1999:315--334.","ieee":"C. Fischer and H. Wehrheim, “Model-Checking {CSP-OZ} Specifications with {FDR},” in <i>Integrated Formal Methods, Proceedings of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999</i>, 1999, pp. 315--334.","chicago":"Fischer, Clemens, and Heike Wehrheim. “Model-Checking {CSP-OZ} Specifications with {FDR}.” In <i>Integrated Formal Methods, Proceedings of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999</i>, edited by Keijiro Araki, Andy Galloway, and Kenji Taguchi, 315--334, 1999.","mla":"Fischer, Clemens, and Heike Wehrheim. “Model-Checking {CSP-OZ} Specifications with {FDR}.” <i>Integrated Formal Methods, Proceedings of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999</i>, edited by Keijiro Araki et al., 1999, pp. 315--334.","bibtex":"@inproceedings{Fischer_Wehrheim_1999, title={Model-Checking {CSP-OZ} Specifications with {FDR}}, booktitle={Integrated Formal Methods, Proceedings of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999}, author={Fischer, Clemens and Wehrheim, Heike}, editor={Araki, Keijiro and Galloway, Andy and Taguchi, KenjiEditors}, year={1999}, pages={315--334} }","short":"C. Fischer, H. Wehrheim, in: K. Araki, A. Galloway, K. Taguchi (Eds.), Integrated Formal Methods, Proceedings of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999, 1999, pp. 315--334.","apa":"Fischer, C., &#38; Wehrheim, H. (1999). Model-Checking {CSP-OZ} Specifications with {FDR}. In K. Araki, A. Galloway, &#38; K. Taguchi (Eds.), <i>Integrated Formal Methods, Proceedings of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999</i> (pp. 315--334)."},"page":"315--334","date_updated":"2022-01-06T06:59:07Z","author":[{"first_name":"Clemens","full_name":"Fischer, Clemens","last_name":"Fischer"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2018-06-14T07:33:10Z","title":"Model-Checking {CSP-OZ} Specifications with {FDR}"},{"language":[{"iso":"eng"}],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","_id":"2151","status":"public","publication":"Theory Comput. Syst.","type":"journal_article","doi":"10.1007/s002240000123","title":"Simple, Efficient Routing Schemes for All-Optical Networks","volume":32,"date_created":"2018-04-03T06:22:14Z","author":[{"full_name":"Flammini, Michele","last_name":"Flammini","first_name":"Michele"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:55:02Z","intvolume":"        32","page":"387--420","citation":{"chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” <i>Theory Comput. Syst.</i> 32, no. 3 (1999): 387--420. <a href=\"https://doi.org/10.1007/s002240000123\">https://doi.org/10.1007/s002240000123</a>.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” <i>Theory Comput. Syst.</i>, vol. 32, no. 3, pp. 387--420, 1999.","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. <i>Theory Comput Syst</i>. 1999;32(3):387--420. doi:<a href=\"https://doi.org/10.1007/s002240000123\">10.1007/s002240000123</a>","apa":"Flammini, M., &#38; Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. <i>Theory Comput. Syst.</i>, <i>32</i>(3), 387--420. <a href=\"https://doi.org/10.1007/s002240000123\">https://doi.org/10.1007/s002240000123</a>","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” <i>Theory Comput. Syst.</i>, vol. 32, no. 3, 1999, pp. 387--420, doi:<a href=\"https://doi.org/10.1007/s002240000123\">10.1007/s002240000123</a>.","short":"M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.","bibtex":"@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes for All-Optical Networks}, volume={32}, DOI={<a href=\"https://doi.org/10.1007/s002240000123\">10.1007/s002240000123</a>}, number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler, Christian}, year={1999}, pages={387--420} }"},"year":"1999","issue":"3"},{"page":"112--121","citation":{"apa":"Berenbrink, P., &#38; Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In <i>SODA</i> (pp. 112--121).","mla":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” <i>SODA</i>, 1999, pp. 112--121.","bibtex":"@inproceedings{Berenbrink_Scheideler_1999, title={Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths}, booktitle={SODA}, author={Berenbrink, Petra and Scheideler, Christian}, year={1999}, pages={112--121} }","short":"P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.","ama":"Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: <i>SODA</i>. ; 1999:112--121.","ieee":"P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in <i>SODA</i>, 1999, pp. 112--121.","chicago":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In <i>SODA</i>, 112--121, 1999."},"year":"1999","has_accepted_license":"1","title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths","author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2018-04-03T08:56:06Z","date_updated":"2022-01-06T06:55:09Z","oa":"1","status":"public","file":[{"creator":"florida","date_created":"2018-04-12T07:34:50Z","date_updated":"2018-04-12T07:34:50Z","file_name":"SODA-99.pdf","file_id":"2288","access_level":"open_access","file_size":179058,"content_type":"application/pdf","relation":"main_file"}],"urn":"21649","publication":"SODA","type":"conference","language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T07:34:50Z","ddc":["040"],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","_id":"2164"},{"date_updated":"2022-01-06T06:55:09Z","oa":"1","author":[{"first_name":"Petra","last_name":"Berenbrink","full_name":"Berenbrink, Petra"},{"full_name":"Riedel, Marco","last_name":"Riedel","first_name":"Marco"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2018-04-03T08:56:45Z","title":"Simple Competitive Request Scheduling Strategies","has_accepted_license":"1","year":"1999","citation":{"apa":"Berenbrink, P., Riedel, M., &#38; Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In <i>SPAA</i> (pp. 33--42).","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Simple Competitive Request Scheduling Strategies}, booktitle={SPAA}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={33--42} }","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.","mla":"Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” <i>SPAA</i>, 1999, pp. 33--42.","ama":"Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: <i>SPAA</i>. ; 1999:33--42.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in <i>SPAA</i>, 1999, pp. 33--42.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In <i>SPAA</i>, 33--42, 1999."},"page":"33--42","_id":"2165","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T07:36:27Z","type":"conference","publication":"SPAA","urn":"21658","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T07:36:27Z","date_created":"2018-04-12T07:36:27Z","creator":"florida","file_size":144422,"access_level":"open_access","file_id":"2290","file_name":"SPAA-99.pdf"}],"status":"public"},{"year":"1999","place":"Vancouver","citation":{"mla":"Fischer, Matthias, et al. “Partitioned Neighborhood Spanners of Minimal Outdegree.” <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>, 1999.","bibtex":"@inproceedings{Fischer_Lukovszki_Ziegler_1999, place={Vancouver}, title={Partitioned neighborhood spanners of minimal outdegree}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin}, year={1999} }","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, 1999.","apa":"Fischer, M., Lukovszki, T., &#38; Ziegler, M. (1999). Partitioned neighborhood spanners of minimal outdegree. In <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>. Vancouver.","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Partitioned neighborhood spanners of minimal outdegree,” in <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>, 1999.","chicago":"Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood Spanners of Minimal Outdegree.” In <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>. Vancouver, 1999.","ama":"Fischer M, Lukovszki T, Ziegler M. Partitioned neighborhood spanners of minimal outdegree. In: <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>. Vancouver; 1999."},"has_accepted_license":"1","related_material":{"link":[{"relation":"confirmation","url":"http://www.cccg.ca/proceedings/1999/fp36.pdf"}]},"title":"Partitioned neighborhood spanners of minimal outdegree","date_updated":"2022-01-06T06:53:21Z","author":[{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"last_name":"Lukovszki","full_name":"Lukovszki, Tamas","first_name":"Tamas"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_created":"2020-08-12T13:12:00Z","abstract":[{"lang":"eng","text":"A geometric spanner with vertex set P in Rd is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k in N and the stretch factor f>1 describing the “quality” of approximation. PNGs have been throughly investigated with respect to small values of f. We present in this work results about small values of k. The aim of minimizing k rather than f arises from two observations:\r\n\r\n* k determines the amount of space required for storing PNGs.\r\n\r\n* Many algorithms employing a (previously constructed) spanner have running times depending on its outdegree.\r\n\r\nOur results include, for fixed dimensions d as well as asymptotically, upper and lower bounds on this optimal value of k. The upper bounds are shown constructively and yield efficient algorithms for actually computing the corresponding PNGs even in degenerate cases.\r\n"}],"file":[{"file_size":209419,"file_name":"hni-id-729.pdf","file_id":"18438","access_level":"closed","date_updated":"2020-08-27T11:14:43Z","creator":"koala","date_created":"2020-08-27T11:14:43Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 11th Canadian Conference on Computational Geometry","ddc":["000"],"file_date_updated":"2020-08-27T11:14:43Z","language":[{"iso":"eng"}],"_id":"17864","user_id":"15415","department":[{"_id":"63"}]},{"year":"1999","page":"136-141","citation":{"ieee":"C. Sohler, “Fast Reconstruction of Delaunay Triangulations,” in <i>Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)</i>, 1999, pp. 136–141.","chicago":"Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” In <i>Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)</i>, 136–41, 1999.","ama":"Sohler C. Fast Reconstruction of Delaunay Triangulations. In: <i>Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)</i>. ; 1999:136-141.","mla":"Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” <i>Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)</i>, 1999, pp. 136–41.","bibtex":"@inproceedings{Sohler_1999, title={Fast Reconstruction of Delaunay Triangulations}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)}, author={Sohler, Christian}, year={1999}, pages={136–141} }","short":"C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141.","apa":"Sohler, C. (1999). Fast Reconstruction of Delaunay Triangulations. In <i>Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)</i> (pp. 136–141)."},"date_updated":"2022-01-06T06:53:51Z","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"date_created":"2020-09-01T10:43:10Z","title":"Fast Reconstruction of Delaunay Triangulations","publication":"Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG'99)","type":"conference","abstract":[{"lang":"eng","text":"We present a new ( O(n) ) algorithm to compute good orders for the point set of a Delaunay triangulation of ( n ) points in the plane. Such a good order makes reconstruction in ( O(n) ) time with a simple algorithm possible. In contrast to the algorithm of Snoeyink and van Kreveld cite1, which is based on independent sets, our algorithm uses a breadth first search (BFS) to obtain these orders. Both approaches construct such orders by repeatedly removing a constant fraction of vertices from the current triangulation. The advantage of the BFS approach is that we can give significantly better bounds on the fraction of removed points in a phase of the algorithm. We can prove that a single phase of our algorithm removes at least ( frac13 ) of the points, even if we restrict the degree of the points (at the time they are removed) to 6. We implemented and compared both algorithms. Our algorithms is slightly faster and achieves about 15% better vertex data compression when using a simple variable length code to encode the differences between two consecutive vertices of the given order."}],"status":"public","_id":"18747","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2020-09-22T13:12:09Z","creator":"koala","date_updated":"2020-09-22T13:12:09Z","file_name":"pub-hni-495.pdf","file_id":"19641","access_level":"closed","file_size":1077329}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"1999","title":"New Results on Geometric Spanners and Their Applications","date_created":"2020-09-03T11:41:51Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","status":"public","type":"dissertation","file_date_updated":"2020-09-22T13:12:09Z","department":[{"_id":"63"},{"_id":"26"}],"user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18942","intvolume":"        63","citation":{"ama":"Lukovszki T. <i>New Results on Geometric Spanners and Their Applications</i>. Vol 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1999.","chicago":"Lukovszki, Tamás. <i>New Results on Geometric Spanners and Their Applications</i>. Vol. 63. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","ieee":"T. Lukovszki, <i>New Results on Geometric Spanners and Their Applications</i>, vol. 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","short":"T. Lukovszki, New Results on Geometric Spanners and Their Applications, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","bibtex":"@book{Lukovszki_1999, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={New Results on Geometric Spanners and Their Applications}, volume={63}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Lukovszki, Tamás}, year={1999}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Lukovszki, Tamás. <i>New Results on Geometric Spanners and Their Applications</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","apa":"Lukovszki, T. (1999). <i>New Results on Geometric Spanners and Their Applications</i> (Vol. 63). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"has_accepted_license":"1","publication_identifier":{"isbn":["3-931466-62-0 "]},"volume":63,"author":[{"last_name":"Lukovszki","full_name":"Lukovszki, Tamás","first_name":"Tamás"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:53:55Z"},{"title":"New Results on Fault Tolerant Geometric Spanners","doi":"10.1007/3-540-48447-7_20","date_updated":"2022-01-06T06:53:55Z","date_created":"2020-09-03T13:03:45Z","author":[{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"}],"year":"1999","citation":{"ieee":"T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” in <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>, 1999, pp. 193–204.","chicago":"Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” In <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>, 193–204, 1999. <a href=\"https://doi.org/10.1007/3-540-48447-7_20\">https://doi.org/10.1007/3-540-48447-7_20</a>.","ama":"Lukovszki T. New Results on Fault Tolerant Geometric Spanners. In: <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>. ; 1999:193-204. doi:<a href=\"https://doi.org/10.1007/3-540-48447-7_20\">10.1007/3-540-48447-7_20</a>","apa":"Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i> (pp. 193–204). <a href=\"https://doi.org/10.1007/3-540-48447-7_20\">https://doi.org/10.1007/3-540-48447-7_20</a>","short":"T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.","mla":"Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>, 1999, pp. 193–204, doi:<a href=\"https://doi.org/10.1007/3-540-48447-7_20\">10.1007/3-540-48447-7_20</a>.","bibtex":"@inproceedings{Lukovszki_1999, title={New Results on Fault Tolerant Geometric Spanners}, DOI={<a href=\"https://doi.org/10.1007/3-540-48447-7_20\">10.1007/3-540-48447-7_20</a>}, booktitle={Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS}, author={Lukovszki, Tamás}, year={1999}, pages={193–204} }"},"page":"193-204","publication_status":"published","publication_identifier":{"isbn":["9783540662792","9783540484479"],"issn":["0302-9743"]},"language":[{"iso":"eng"}],"_id":"18959","user_id":"15415","department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S be a set of $n$ points in the d-dimensional space and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path.<br><br>Recently it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner with O(k^2 n) edges which can be constructed in O(n log n + k^2 n) time. Furthermore, it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner whose degree is bouned by O(c^k+1) for some constant c.<br><br>Our first contribution is a construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound. The computation takes O(n log^d-1 n + k n log log n) time. Then we show that the same k-vertex fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct a k-vertex fault tolerant spanner with O(k^2 n) edges whose degree is bounded by O(k^2). Finally, we give a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S. We investigate the question whether Steiner points help. We answer this question affirmatively and prove Theta(kn) bounds on the number of Steiner points and on the number of edges in such spanners."}],"status":"public","type":"conference","publication":"Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS"},{"language":[{"iso":"eng"}],"_id":"18965","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"conference","publication":"Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '99","title":"Data management in networks: experimental evaluation of a provably good strategy","doi":"10.1145/305619.305637","date_updated":"2022-01-06T06:53:56Z","date_created":"2020-09-03T14:27:14Z","author":[{"last_name":"Krick","full_name":"Krick, Christof","first_name":"Christof"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Harald","full_name":"Räcke, Harald","last_name":"Räcke"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"},{"first_name":"Matthias","last_name":"Westermann","full_name":"Westermann, Matthias"}],"year":"1999","citation":{"apa":"Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &#38; Westermann, M. (1999). Data management in networks: experimental evaluation of a provably good strategy. In <i>Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99</i> (pp. 165–174). <a href=\"https://doi.org/10.1145/305619.305637\">https://doi.org/10.1145/305619.305637</a>","bibtex":"@inproceedings{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_1999, title={Data management in networks: experimental evaluation of a provably good strategy}, DOI={<a href=\"https://doi.org/10.1145/305619.305637\">10.1145/305619.305637</a>}, booktitle={Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99}, author={Krick, Christof and Meyer auf der Heide, Friedhelm and Räcke, Harald and Vöcking, Berthold and Westermann, Matthias}, year={1999}, pages={165–174} }","short":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99, 1999, pp. 165–174.","mla":"Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” <i>Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99</i>, 1999, pp. 165–74, doi:<a href=\"https://doi.org/10.1145/305619.305637\">10.1145/305619.305637</a>.","chicago":"Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” In <i>Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99</i>, 165–74, 1999. <a href=\"https://doi.org/10.1145/305619.305637\">https://doi.org/10.1145/305619.305637</a>.","ieee":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann, “Data management in networks: experimental evaluation of a provably good strategy,” in <i>Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’99</i>, 1999, pp. 165–174.","ama":"Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data management in networks: experimental evaluation of a provably good strategy. In: <i>Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’99</i>. ; 1999:165-174. doi:<a href=\"https://doi.org/10.1145/305619.305637\">10.1145/305619.305637</a>"},"page":"165-174","publication_status":"published","publication_identifier":{"isbn":["1581131240"]}}]