---
_id: '39434'
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."
author:
- first_name: Stephan
full_name: Flake, Stephan
last_name: Flake
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Ulrich
full_name: Pape, Ulrich
last_name: Pape
- first_name: Jürgen
full_name: Ruf, Jürgen
last_name: Ruf
citation:
ama: Flake S, Müller W, Pape U, Ruf J. Modellprüfung für den Entwurf von Fertigungssteuerungssystemen.
Published online 2000.
apa: Flake, S., Müller, W., Pape, U., & Ruf, J. (2000). Modellprüfung für
den Entwurf von Fertigungssteuerungssystemen.
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} }'
chicago: Flake, Stephan, Wolfgang Müller, Ulrich Pape, and Jürgen Ruf. “Modellprüfung
Für Den Entwurf von Fertigungssteuerungssystemen.” Mobis 2000. Siegen, 2000.
ieee: S. Flake, W. Müller, U. Pape, and J. Ruf, “Modellprüfung für den Entwurf von
Fertigungssteuerungssystemen.” Siegen, 2000.
mla: Flake, Stephan, et al. Modellprüfung Für Den Entwurf von Fertigungssteuerungssystemen.
2000.
short: S. Flake, W. Müller, U. Pape, J. Ruf, (2000).
date_created: 2023-01-24T10:49:52Z
date_updated: 2023-01-24T10:49:57Z
department:
- _id: '672'
language:
- iso: eng
place: Siegen
series_title: Mobis 2000
status: public
title: Modellprüfung für den Entwurf von Fertigungssteuerungssystemen
type: conference
user_id: '5786'
year: '2000'
...
---
_id: '39444'
abstract:
- lang: eng
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. '
author:
- first_name: A.
full_name: Braatz, A.
last_name: Braatz
- first_name: Stephan
full_name: Flake, Stephan
last_name: Flake
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: E.
full_name: Westkämper, E.
last_name: Westkämper
citation:
ama: Braatz A, Flake S, Müller W, Westkämper E. Prototyping einer Fahrzeug-steuerung
in einer virtuellen 3D-Umgebung. Published online 2000.
apa: Braatz, A., Flake, S., Müller, W., & Westkämper, E. (2000). Prototyping
einer Fahrzeug-steuerung in einer virtuellen 3D-Umgebung.
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} }'
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.
mla: Braatz, A., et al. Prototyping Einer Fahrzeug-Steuerung in Einer Virtuellen
3D-Umgebung. 2000.
short: A. Braatz, S. Flake, W. Müller, E. Westkämper, (2000).
date_created: 2023-01-24T11:09:42Z
date_updated: 2023-01-24T11:09:46Z
department:
- _id: '672'
language:
- iso: eng
place: Magdeburg, Germany
series_title: Simulation und Visualisierung 2000
status: public
title: Prototyping einer Fahrzeug-steuerung in einer virtuellen 3D-Umgebung
type: conference
user_id: '5786'
year: '2000'
...
---
_id: '39461'
abstract:
- lang: eng
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."
author:
- first_name: Stephan
full_name: Flake, Stephan
last_name: Flake
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Jürgen
full_name: Ruf, Jürgen
last_name: Ruf
citation:
ama: Flake S, Müller W, Ruf J. Structured English for Model Checking Specification.
Published online 2000.
apa: Flake, S., Müller, W., & Ruf, J. (2000). Structured English for Model
Checking Specification.
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} }'
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.
ieee: S. Flake, W. Müller, and J. Ruf, “Structured English for Model Checking Specification.”
Frankfurt, 2000.
mla: Flake, Stephan, et al. Structured English for Model Checking Specification.
2000.
short: S. Flake, W. Müller, J. Ruf, (2000).
date_created: 2023-01-24T11:13:28Z
date_updated: 2023-01-24T11:13:33Z
department:
- _id: '672'
language:
- iso: eng
place: Frankfurt
series_title: Methoden und Beschreibungssprachen zur Modellierung und Verifikation
von Schaltungen und Systemen
status: public
title: Structured English for Model Checking Specification
type: conference
user_id: '5786'
year: '2000'
...
---
_id: '39435'
abstract:
- lang: eng
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.
author:
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Arne
full_name: Meyer, Arne
last_name: Meyer
- first_name: Henning
full_name: Zabel, Henning
last_name: Zabel
citation:
ama: 'Müller W, Meyer A, Zabel H. A Visual Framework for the Scripting of Parallel
Agents. In: Proceedings of the IEEE Symposium on Visual Languages. ; 2000.'
apa: Müller, W., Meyer, A., & Zabel, H. (2000). A Visual Framework for the Scripting
of Parallel Agents. Proceedings of the IEEE Symposium on Visual Languages.
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} }'
chicago: Müller, Wolfgang, Arne Meyer, and Henning Zabel. “A Visual Framework for
the Scripting of Parallel Agents.” In Proceedings of the IEEE Symposium on
Visual Languages. Seattle, Washington, USA, 2000.
ieee: W. Müller, A. Meyer, and H. Zabel, “A Visual Framework for the Scripting of
Parallel Agents,” 2000.
mla: Müller, Wolfgang, et al. “A Visual Framework for the Scripting of Parallel
Agents.” Proceedings of the IEEE Symposium on Visual Languages, 2000.
short: 'W. Müller, A. Meyer, H. Zabel, in: Proceedings of the IEEE Symposium on
Visual Languages, Seattle, Washington, USA, 2000.'
date_created: 2023-01-24T10:51:23Z
date_updated: 2023-01-24T10:51:41Z
department:
- _id: '672'
language:
- iso: eng
place: Seattle, Washington, USA
publication: Proceedings of the IEEE Symposium on Visual Languages
status: public
title: A Visual Framework for the Scripting of Parallel Agents
type: conference
user_id: '5786'
year: '2000'
...
---
_id: '39439'
author:
- first_name: P. C. P.
full_name: Bhatt, P. C. P.
last_name: Bhatt
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Bhatt PCP, Müller W. A Methodology for the Protocol-Centered Design of Agent-Based
Systems. In: Proceedings of IECON 2000. ; 2000.'
apa: Bhatt, P. C. P., & Müller, W. (2000). A Methodology for the Protocol-Centered
Design of Agent-Based Systems. Proceedings of IECON 2000.
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} }'
chicago: Bhatt, P. C. P., and Wolfgang Müller. “A Methodology for the Protocol-Centered
Design of Agent-Based Systems.” In Proceedings of IECON 2000. Nagoya, Japan,
2000.
ieee: P. C. P. Bhatt and W. Müller, “A Methodology for the Protocol-Centered Design
of Agent-Based Systems,” 2000.
mla: Bhatt, P. C. P., and Wolfgang Müller. “A Methodology for the Protocol-Centered
Design of Agent-Based Systems.” Proceedings of IECON 2000, 2000.
short: 'P.C.P. Bhatt, W. Müller, in: Proceedings of IECON 2000, Nagoya, Japan, 2000.'
date_created: 2023-01-24T10:53:23Z
date_updated: 2023-01-24T10:53:27Z
department:
- _id: '672'
language:
- iso: eng
place: Nagoya, Japan
publication: Proceedings of IECON 2000
status: public
title: A Methodology for the Protocol-Centered Design of Agent-Based Systems
type: conference
user_id: '5786'
year: '2000'
...
---
_id: '39442'
author:
- first_name: P. C. P.
full_name: Bhatt, P. C. P.
last_name: Bhatt
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Bhatt PCP, Müller W. Morphic Nets: Model Based Design Diagrams. In: Proceedings
of UKPEW 2000. ; 2000.'
apa: 'Bhatt, P. C. P., & Müller, W. (2000). Morphic Nets: Model Based Design
Diagrams. Proceedings of UKPEW 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} }'
chicago: 'Bhatt, P. C. P., and Wolfgang Müller. “Morphic Nets: Model Based Design
Diagrams.” In Proceedings of UKPEW 2000. Durham, UK, 2000.'
ieee: 'P. C. P. Bhatt and W. Müller, “Morphic Nets: Model Based Design Diagrams,”
2000.'
mla: 'Bhatt, P. C. P., and Wolfgang Müller. “Morphic Nets: Model Based Design Diagrams.”
Proceedings of UKPEW 2000, 2000.'
short: 'P.C.P. Bhatt, W. Müller, in: Proceedings of UKPEW 2000, Durham, UK, 2000.'
date_created: 2023-01-24T10:54:54Z
date_updated: 2023-01-24T10:55:00Z
department:
- _id: '672'
language:
- iso: eng
place: Durham, UK
publication: Proceedings of UKPEW 2000
status: public
title: 'Morphic Nets: Model Based Design Diagrams'
type: conference
user_id: '5786'
year: '2000'
...
---
_id: '39464'
author:
- first_name: Stephan
full_name: Flake, Stephan
last_name: Flake
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Jürgen
full_name: Ruf, Jürgen
last_name: Ruf
citation:
ama: 'Flake S, Müller W, Ruf J. An Advanced Visual Capture for Model Checking Specifications.
In: Proceedings of AVI 2000. ; 2000.'
apa: Flake, S., Müller, W., & Ruf, J. (2000). An Advanced Visual Capture for
Model Checking Specifications. Proceedings of AVI 2000.
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}
}'
chicago: Flake, Stephan, Wolfgang Müller, and Jürgen Ruf. “An Advanced Visual Capture
for Model Checking Specifications.” In Proceedings of AVI 2000. Palermo,
Italy, 2000.
ieee: S. Flake, W. Müller, and J. Ruf, “An Advanced Visual Capture for Model Checking
Specifications,” 2000.
mla: Flake, Stephan, et al. “An Advanced Visual Capture for Model Checking Specifications.”
Proceedings of AVI 2000, 2000.
short: 'S. Flake, W. Müller, J. Ruf, in: Proceedings of AVI 2000, Palermo, Italy,
2000.'
date_created: 2023-01-24T11:14:51Z
date_updated: 2023-01-24T11:14:59Z
department:
- _id: '672'
language:
- iso: eng
place: Palermo, Italy
publication: Proceedings of AVI 2000
status: public
title: An Advanced Visual Capture for Model Checking Specifications
type: conference
user_id: '5786'
year: '2000'
...
---
_id: '19732'
abstract:
- lang: eng
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.
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Bernhardus
full_name: Juurlink, Bernhardus
last_name: Juurlink
- first_name: I.
full_name: Von Otte, I.
last_name: Von Otte
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
citation:
ama: 'Bonorden O, Juurlink B, Von Otte I, Rieping I. The Paderborn university BSP
(PUB) library-design, implementation and performance. In: Proceedings 13th
International Parallel Processing Symposium and 10th Symposium on Parallel and
Distributed Processing. ; 1999:99-104. doi:10.1109/ipps.1999.760442'
apa: Bonorden, O., Juurlink, B., Von Otte, I., & Rieping, I. (1999). The Paderborn
university BSP (PUB) library-design, implementation and performance. Proceedings
13th International Parallel Processing Symposium and 10th Symposium on Parallel
and Distributed Processing, 99–104. https://doi.org/10.1109/ipps.1999.760442
bibtex: '@inproceedings{Bonorden_Juurlink_Von Otte_Rieping_1999, title={The Paderborn
university BSP (PUB) library-design, implementation and performance}, DOI={10.1109/ipps.1999.760442},
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}
}'
chicago: Bonorden, Olaf, Bernhardus Juurlink, I. Von Otte, and Ingo Rieping. “The
Paderborn University BSP (PUB) Library-Design, Implementation and Performance.”
In Proceedings 13th International Parallel Processing Symposium and 10th Symposium
on Parallel and Distributed Processing, 99–104, 1999. https://doi.org/10.1109/ipps.1999.760442.
ieee: 'O. Bonorden, B. Juurlink, I. Von Otte, and I. Rieping, “The Paderborn university
BSP (PUB) library-design, implementation and performance,” in Proceedings 13th
International Parallel Processing Symposium and 10th Symposium on Parallel and
Distributed Processing, 1999, pp. 99–104, doi: 10.1109/ipps.1999.760442.'
mla: Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library-Design,
Implementation and Performance.” Proceedings 13th International Parallel Processing
Symposium and 10th Symposium on Parallel and Distributed Processing, 1999,
pp. 99–104, doi:10.1109/ipps.1999.760442.
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.'
date_created: 2020-09-28T12:11:30Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1109/ipps.1999.760442
language:
- iso: eng
page: 99-104
publication: Proceedings 13th International Parallel Processing Symposium and 10th
Symposium on Parallel and Distributed Processing
publication_identifier:
isbn:
- '0769501435'
publication_status: published
status: public
title: The Paderborn university BSP (PUB) library-design, implementation and performance
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '19815'
author:
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
citation:
ama: Kleine Büning H, Lettmann T. Resolution remains hard under equivalence. Discrete
Applied Mathematics. 1999:139-148. doi:10.1016/s0166-218x(99)00055-4
apa: Kleine Büning, H., & Lettmann, T. (1999). Resolution remains hard under
equivalence. Discrete Applied Mathematics, 139–148. https://doi.org/10.1016/s0166-218x(99)00055-4
bibtex: '@article{Kleine Büning_Lettmann_1999, title={Resolution remains hard under
equivalence}, DOI={10.1016/s0166-218x(99)00055-4},
journal={Discrete Applied Mathematics}, author={Kleine Büning, Hans and Lettmann,
Theodor}, year={1999}, pages={139–148} }'
chicago: Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under
Equivalence.” Discrete Applied Mathematics, 1999, 139–48. https://doi.org/10.1016/s0166-218x(99)00055-4.
ieee: H. Kleine Büning and T. Lettmann, “Resolution remains hard under equivalence,”
Discrete Applied Mathematics, pp. 139–148, 1999.
mla: Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under Equivalence.”
Discrete Applied Mathematics, 1999, pp. 139–48, doi:10.1016/s0166-218x(99)00055-4.
short: H. Kleine Büning, T. Lettmann, Discrete Applied Mathematics (1999) 139–148.
date_created: 2020-10-01T08:13:12Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1016/s0166-218x(99)00055-4
language:
- iso: eng
page: 139-148
publication: Discrete Applied Mathematics
publication_identifier:
issn:
- 0166-218X
publication_status: published
status: public
title: Resolution remains hard under equivalence
type: journal_article
user_id: '315'
year: '1999'
...
---
_id: '3252'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Wehrheim H. Partial order reductions for failures refinement. Electr Notes
Theor Comput Sci. 1999:71--84. doi:10.1016/S1571-0661(05)80296-8
apa: Wehrheim, H. (1999). Partial order reductions for failures refinement. Electr.
Notes Theor. Comput. Sci., 71--84. https://doi.org/10.1016/S1571-0661(05)80296-8
bibtex: '@article{Wehrheim_1999, title={Partial order reductions for failures refinement},
DOI={10.1016/S1571-0661(05)80296-8},
journal={Electr. Notes Theor. Comput. Sci.}, author={Wehrheim, Heike}, year={1999},
pages={71--84} }'
chicago: Wehrheim, Heike. “Partial Order Reductions for Failures Refinement.” Electr.
Notes Theor. Comput. Sci., 1999, 71--84. https://doi.org/10.1016/S1571-0661(05)80296-8.
ieee: H. Wehrheim, “Partial order reductions for failures refinement,” Electr.
Notes Theor. Comput. Sci., pp. 71--84, 1999.
mla: Wehrheim, Heike. “Partial Order Reductions for Failures Refinement.” Electr.
Notes Theor. Comput. Sci., 1999, pp. 71--84, doi:10.1016/S1571-0661(05)80296-8.
short: H. Wehrheim, Electr. Notes Theor. Comput. Sci. (1999) 71--84.
date_created: 2018-06-14T07:26:58Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1016/S1571-0661(05)80296-8
page: 71--84
publication: Electr. Notes Theor. Comput. Sci.
status: public
title: Partial order reductions for failures refinement
type: journal_article
user_id: '29719'
year: '1999'
...
---
_id: '3253'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wehrheim H. Data Abstraction for {CSP-OZ}. In: M. Wing J, Woodcock J, Davies
J, 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}. Lecture Notes in Computer Science. ; 1999:1028--1047. doi:10.1007/3-540-48118-4_5'
apa: Wehrheim, H. (1999). Data Abstraction for {CSP-OZ}. 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} (pp. 1028--1047). https://doi.org/10.1007/3-540-48118-4_5
bibtex: '@inproceedings{Wehrheim_1999, series={Lecture Notes in Computer Science},
title={Data Abstraction for {CSP-OZ}}, DOI={10.1007/3-540-48118-4_5},
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} }'
chicago: Wehrheim, Heike. “Data Abstraction for {CSP-OZ}.” In FM’99 - Formal
Methods, World Congress on Formal Methods in the Development of Computing Systems,
Toulouse, France, September 20-24, 1999, Proceedings, Volume {II}, edited
by Jeannette M. Wing, Jim Woodcock, and Jim Davies, 1028--1047. Lecture Notes
in Computer Science, 1999. https://doi.org/10.1007/3-540-48118-4_5.
ieee: H. Wehrheim, “Data Abstraction for {CSP-OZ},” in 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.
mla: Wehrheim, Heike. “Data Abstraction for {CSP-OZ}.” FM’99 - Formal Methods,
World Congress on Formal Methods in the Development of Computing Systems, Toulouse,
France, September 20-24, 1999, Proceedings, Volume {II}, edited by Jeannette
M. Wing et al., 1999, pp. 1028--1047, doi:10.1007/3-540-48118-4_5.
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.'
date_created: 2018-06-14T07:32:05Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1007/3-540-48118-4_5
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
full_name: Davies, Jim
last_name: Davies
page: 1028--1047
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}
series_title: Lecture Notes in Computer Science
status: public
title: Data Abstraction for {CSP-OZ}
type: conference
user_id: '29719'
year: '1999'
...
---
_id: '3254'
author:
- first_name: Clemens
full_name: Fischer, Clemens
last_name: Fischer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Fischer C, Wehrheim H. Model-Checking {CSP-OZ} Specifications with {FDR}.
In: Araki K, Galloway A, Taguchi K, eds. Integrated Formal Methods, Proceedings
of the 1st International Conference on Integrated Formal Methods, {IFM} 99, York,
UK, 28-29 June 1999. ; 1999:315--334.'
apa: Fischer, C., & Wehrheim, H. (1999). Model-Checking {CSP-OZ} Specifications
with {FDR}. 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 (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} }'
chicago: Fischer, Clemens, and Heike Wehrheim. “Model-Checking {CSP-OZ} Specifications
with {FDR}.” In Integrated Formal Methods, Proceedings of the 1st International
Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999,
edited by Keijiro Araki, Andy Galloway, and Kenji Taguchi, 315--334, 1999.
ieee: C. Fischer and H. Wehrheim, “Model-Checking {CSP-OZ} Specifications with {FDR},”
in 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.
mla: Fischer, Clemens, and Heike Wehrheim. “Model-Checking {CSP-OZ} Specifications
with {FDR}.” Integrated Formal Methods, Proceedings of the 1st International
Conference on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999,
edited by Keijiro Araki et al., 1999, pp. 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.'
date_created: 2018-06-14T07:33:10Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
editor:
- first_name: Keijiro
full_name: Araki, Keijiro
last_name: Araki
- first_name: Andy
full_name: Galloway, Andy
last_name: Galloway
- first_name: Kenji
full_name: Taguchi, Kenji
last_name: Taguchi
page: 315--334
publication: Integrated Formal Methods, Proceedings of the 1st International Conference
on Integrated Formal Methods, {IFM} 99, York, UK, 28-29 June 1999
status: public
title: Model-Checking {CSP-OZ} Specifications with {FDR}
type: conference
user_id: '29719'
year: '1999'
...
---
_id: '2151'
author:
- first_name: Michele
full_name: Flammini, Michele
last_name: Flammini
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical
Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123
apa: Flammini, M., & Scheideler, C. (1999). Simple, Efficient Routing Schemes
for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420.
https://doi.org/10.1007/s002240000123
bibtex: '@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes
for All-Optical Networks}, volume={32}, DOI={10.1007/s002240000123},
number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler,
Christian}, year={1999}, pages={387--420} }'
chicago: 'Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing
Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999):
387--420. https://doi.org/10.1007/s002240000123.'
ieee: M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical
Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.
mla: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes
for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999,
pp. 387--420, doi:10.1007/s002240000123.
short: M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
date_created: 2018-04-03T06:22:14Z
date_updated: 2022-01-06T06:55:02Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240000123
intvolume: ' 32'
issue: '3'
language:
- iso: eng
page: 387--420
publication: Theory Comput. Syst.
status: public
title: Simple, Efficient Routing Schemes for All-Optical Networks
type: journal_article
user_id: '14955'
volume: 32
year: '1999'
...
---
_id: '2164'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing
Packets Along Fixed Paths. In: SODA. ; 1999:112--121.'
apa: Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies
for Routing Packets Along Fixed Paths. In SODA (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} }'
chicago: Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line
Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
ieee: P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for
Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.
mla: Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies
for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.
short: 'P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.'
date_created: 2018-04-03T08:56:06Z
date_updated: 2022-01-06T06:55:09Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:34:50Z
date_updated: 2018-04-12T07:34:50Z
file_id: '2288'
file_name: SODA-99.pdf
file_size: 179058
relation: main_file
file_date_updated: 2018-04-12T07:34:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 112--121
publication: SODA
status: public
title: Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
type: conference
urn: '21649'
user_id: '14955'
year: '1999'
...
---
_id: '2165'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Marco
full_name: Riedel, Marco
last_name: Riedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling
Strategies. In: SPAA. ; 1999:33--42.'
apa: Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive
Request Scheduling Strategies. In SPAA (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} }'
chicago: Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive
Request Scheduling Strategies.” In SPAA, 33--42, 1999.
ieee: P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling
Strategies,” in SPAA, 1999, pp. 33--42.
mla: Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.”
SPAA, 1999, pp. 33--42.
short: 'P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.'
date_created: 2018-04-03T08:56:45Z
date_updated: 2022-01-06T06:55:09Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:36:27Z
date_updated: 2018-04-12T07:36:27Z
file_id: '2290'
file_name: SPAA-99.pdf
file_size: 144422
relation: main_file
file_date_updated: 2018-04-12T07:36:27Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 33--42
publication: SPAA
status: public
title: Simple Competitive Request Scheduling Strategies
type: conference
urn: '21658'
user_id: '14955'
year: '1999'
...
---
_id: '17864'
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 \x93quality\x94
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"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Tamas
full_name: Lukovszki, Tamas
last_name: Lukovszki
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Fischer M, Lukovszki T, Ziegler M. Partitioned neighborhood spanners of minimal
outdegree. In: Proceedings of the 11th Canadian Conference on Computational
Geometry. Vancouver; 1999.'
apa: Fischer, M., Lukovszki, T., & Ziegler, M. (1999). Partitioned neighborhood
spanners of minimal outdegree. In Proceedings of the 11th Canadian Conference
on Computational Geometry. Vancouver.
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} }'
chicago: Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood
Spanners of Minimal Outdegree.” In Proceedings of the 11th Canadian Conference
on Computational Geometry. Vancouver, 1999.
ieee: M. Fischer, T. Lukovszki, and M. Ziegler, “Partitioned neighborhood spanners
of minimal outdegree,” in Proceedings of the 11th Canadian Conference on Computational
Geometry, 1999.
mla: Fischer, Matthias, et al. “Partitioned Neighborhood Spanners of Minimal Outdegree.”
Proceedings of the 11th Canadian Conference on Computational Geometry,
1999.
short: 'M. Fischer, T. Lukovszki, M. Ziegler, in: Proceedings of the 11th Canadian
Conference on Computational Geometry, Vancouver, 1999.'
date_created: 2020-08-12T13:12:00Z
date_updated: 2022-01-06T06:53:21Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-27T11:14:43Z
date_updated: 2020-08-27T11:14:43Z
file_id: '18438'
file_name: hni-id-729.pdf
file_size: 209419
relation: main_file
success: 1
file_date_updated: 2020-08-27T11:14:43Z
has_accepted_license: '1'
language:
- iso: eng
place: Vancouver
publication: Proceedings of the 11th Canadian Conference on Computational Geometry
related_material:
link:
- relation: confirmation
url: http://www.cccg.ca/proceedings/1999/fp36.pdf
status: public
title: Partitioned neighborhood spanners of minimal outdegree
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '18747'
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.
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Sohler C. Fast Reconstruction of Delaunay Triangulations. In: Proceedings
of the 11th Canadian Conference on Computational Geometry ( CCCG’99). ; 1999:136-141.'
apa: Sohler, C. (1999). Fast Reconstruction of Delaunay Triangulations. In Proceedings
of the 11th Canadian Conference on Computational Geometry ( CCCG’99) (pp.
136–141).
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} }'
chicago: Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” In
Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99),
136–41, 1999.
ieee: C. Sohler, “Fast Reconstruction of Delaunay Triangulations,” in Proceedings
of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999,
pp. 136–141.
mla: Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” Proceedings
of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999,
pp. 136–41.
short: 'C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational
Geometry ( CCCG’99), 1999, pp. 136–141.'
date_created: 2020-09-01T10:43:10Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
language:
- iso: eng
page: 136-141
publication: Proceedings of the 11th Canadian Conference on Computational Geometry
( CCCG'99)
status: public
title: Fast Reconstruction of Delaunay Triangulations
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '18942'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: Lukovszki T. New Results on Geometric Spanners and Their Applications.
Vol 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1999.
apa: Lukovszki, T. (1999). New Results on Geometric Spanners and Their Applications
(Vol. 63). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
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} }'
chicago: Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications.
Vol. 63. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1999.
ieee: T. Lukovszki, New Results on Geometric Spanners and Their Applications,
vol. 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.
mla: Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications.
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.
date_created: 2020-09-03T11:41:51Z
date_updated: 2022-01-06T06:53:55Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-22T13:12:09Z
date_updated: 2020-09-22T13:12:09Z
file_id: '19641'
file_name: pub-hni-495.pdf
file_size: 1077329
relation: main_file
success: 1
file_date_updated: 2020-09-22T13:12:09Z
has_accepted_license: '1'
intvolume: ' 63'
language:
- iso: eng
publication_identifier:
isbn:
- '3-931466-62-0 '
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: New Results on Geometric Spanners and Their Applications
type: dissertation
user_id: '5786'
volume: 63
year: '1999'
...
---
_id: '18959'
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.
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.
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.
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: 'Lukovszki T. New Results on Fault Tolerant Geometric Spanners. In: Proceedings
of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS. ; 1999:193-204.
doi:10.1007/3-540-48447-7_20'
apa: Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In
Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99),
LNCS (pp. 193–204). https://doi.org/10.1007/3-540-48447-7_20
bibtex: '@inproceedings{Lukovszki_1999, title={New Results on Fault Tolerant Geometric
Spanners}, DOI={10.1007/3-540-48447-7_20},
booktitle={Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99),
LNCS}, author={Lukovszki, Tamás}, year={1999}, pages={193–204} }'
chicago: Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” In
Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99),
LNCS, 193–204, 1999. https://doi.org/10.1007/3-540-48447-7_20.
ieee: T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” 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.” Proceedings
of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999,
pp. 193–204, doi:10.1007/3-540-48447-7_20.
short: 'T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data
Structures (WADS’99), LNCS, 1999, pp. 193–204.'
date_created: 2020-09-03T13:03:45Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1007/3-540-48447-7_20
language:
- iso: eng
page: 193-204
publication: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99),
LNCS
publication_identifier:
isbn:
- '9783540662792'
- '9783540484479'
issn:
- 0302-9743
publication_status: published
status: public
title: New Results on Fault Tolerant Geometric Spanners
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '18965'
author:
- first_name: Christof
full_name: Krick, Christof
last_name: Krick
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- 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
full_name: Westermann, Matthias
last_name: Westermann
citation:
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: Proceedings
of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’99. ; 1999:165-174. doi:10.1145/305619.305637'
apa: 'Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann,
M. (1999). Data management in networks: experimental evaluation of a provably
good strategy. In Proceedings of the eleventh annual ACM symposium on Parallel
algorithms and architectures - SPAA ’99 (pp. 165–174). https://doi.org/10.1145/305619.305637'
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={10.1145/305619.305637},
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} }'
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 Proceedings of the Eleventh Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’99, 165–74, 1999. https://doi.org/10.1145/305619.305637.'
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 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.” Proceedings of the Eleventh Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’99, 1999, pp. 165–74, doi:10.1145/305619.305637.'
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.'
date_created: 2020-09-03T14:27:14Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
doi: 10.1145/305619.305637
language:
- iso: eng
page: 165-174
publication: Proceedings of the eleventh annual ACM symposium on Parallel algorithms
and architectures - SPAA '99
publication_identifier:
isbn:
- '1581131240'
publication_status: published
status: public
title: 'Data management in networks: experimental evaluation of a provably good strategy'
type: conference
user_id: '15415'
year: '1999'
...