---
_id: '19639'
author:
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: Vöcking B. Static and Dynamic Data Management in Networks. Vol 46. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 1998.
apa: Vöcking, B. (1998). Static and Dynamic Data Management in Networks (Vol.
46). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Vöcking_1998, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Static and Dynamic Data Management in Networks}, volume={46},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Vöcking,
Berthold}, year={1998}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Vöcking, Berthold. Static and Dynamic Data Management in Networks.
Vol. 46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1998.
ieee: B. Vöcking, Static and Dynamic Data Management in Networks, vol. 46.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
mla: Vöcking, Berthold. Static and Dynamic Data Management in Networks. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1998.
short: B. Vöcking, Static and Dynamic Data Management in Networks, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1998.
date_created: 2020-09-22T13:05:43Z
date_updated: 2022-01-06T06:54:09Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-22T13:05:04Z
date_updated: 2020-09-22T13:05:04Z
file_id: '19640'
file_name: pub-hni-478.pdf
file_size: 592479
relation: main_file
success: 1
file_date_updated: 2020-09-22T13:05:04Z
has_accepted_license: '1'
intvolume: ' 46'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-45-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: Static and Dynamic Data Management in Networks
type: dissertation
user_id: '5786'
volume: 46
year: '1998'
...
---
_id: '19735'
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 addition, it provides routines for collective
communication on arbitrary subsets of processors, partition operations, and a
zero-cost synchronization mechanism. Furthermore, some techniques used in the
implementation of the PUB library deviate significantly from the techniques used
in other BSP libraries.
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
- first_name: Ingo
full_name: von Otte, Ingo
last_name: von Otte
- first_name: Bernhardus
full_name: Juurlink, Bernhardus
last_name: Juurlink
citation:
ama: Bonorden O, Rieping I, von Otte I, Juurlink B. The Paderborn University
BSP (PUB) Library - Design, Implementation and Performance.; 1998.
apa: Bonorden, O., Rieping, I., von Otte, I., & Juurlink, B. (1998). The
Paderborn University BSP (PUB) Library - Design, Implementation and Performance.
bibtex: '@book{Bonorden_Rieping_von Otte_Juurlink_1998, title={The Paderborn University
BSP (PUB) Library - Design, Implementation and Performance}, author={Bonorden,
Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}, year={1998}
}'
chicago: Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. The
Paderborn University BSP (PUB) Library - Design, Implementation and Performance,
1998.
ieee: O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, The Paderborn University
BSP (PUB) Library - Design, Implementation and Performance. 1998.
mla: Bonorden, Olaf, et al. The Paderborn University BSP (PUB) Library - Design,
Implementation and Performance. 1998.
short: O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, The Paderborn University
BSP (PUB) Library - Design, Implementation and Performance, 1998.
date_created: 2020-09-28T12:41:20Z
date_updated: 2022-01-06T06:54:11Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-28T12:41:08Z
date_updated: 2020-09-28T12:41:08Z
file_id: '19736'
file_name: pub-hni-1350.pdf
file_size: 255806
relation: main_file
success: 1
file_date_updated: 2020-09-28T12:41:08Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
type: report
user_id: '15415'
year: '1998'
...
---
_id: '3255'
author:
- first_name: Thomas
full_name: Gehrke, Thomas
last_name: Gehrke
- first_name: Michaela
full_name: Huhn, Michaela
last_name: Huhn
- first_name: Peter
full_name: Niebert, Peter
last_name: Niebert
- first_name: Arend
full_name: Rensink, Arend
last_name: Rensink
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Gehrke T, Huhn M, Niebert P, Rensink A, Wehrheim H. A Process Algebra Semantics
for {MSC} Including Conditions. In: K{\"{o}}nig H, Langend{\"{o}}rfer P, eds.
Formale Beschreibungstechniken F{\"{u}}r Verteilte Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch,
Cottbus, 4. Und 5. Juni 1998. ; 1998:185--196.'
apa: Gehrke, T., Huhn, M., Niebert, P., Rensink, A., & Wehrheim, H. (1998).
A Process Algebra Semantics for {MSC} Including Conditions. In H. K{\"{o}}nig
& P. Langend{\"{o}}rfer (Eds.), Formale Beschreibungstechniken f{\"{u}}r
verteilte Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch, Cottbus, 4. und 5. Juni 1998
(pp. 185--196).
bibtex: '@inproceedings{Gehrke_Huhn_Niebert_Rensink_Wehrheim_1998, title={A Process
Algebra Semantics for {MSC} Including Conditions}, booktitle={Formale Beschreibungstechniken
f{\"{u}}r verteilte Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch, Cottbus, 4. und 5.
Juni 1998}, author={Gehrke, Thomas and Huhn, Michaela and Niebert, Peter and Rensink,
Arend and Wehrheim, Heike}, editor={K{\"{o}}nig, Hartmut and Langend{\"{o}}rfer,
PeterEditors}, year={1998}, pages={185--196} }'
chicago: Gehrke, Thomas, Michaela Huhn, Peter Niebert, Arend Rensink, and Heike
Wehrheim. “A Process Algebra Semantics for {MSC} Including Conditions.” In Formale
Beschreibungstechniken F{\"{u}}r Verteilte Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch,
Cottbus, 4. Und 5. Juni 1998, edited by Hartmut K{\"{o}}nig and Peter Langend{\"{o}}rfer,
185--196, 1998.
ieee: T. Gehrke, M. Huhn, P. Niebert, A. Rensink, and H. Wehrheim, “A Process Algebra
Semantics for {MSC} Including Conditions,” in Formale Beschreibungstechniken
f{\"{u}}r verteilte Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch, Cottbus, 4. und 5.
Juni 1998, 1998, pp. 185--196.
mla: Gehrke, Thomas, et al. “A Process Algebra Semantics for {MSC} Including Conditions.”
Formale Beschreibungstechniken F{\"{u}}r Verteilte Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch,
Cottbus, 4. Und 5. Juni 1998, edited by Hartmut K{\"{o}}nig and Peter Langend{\"{o}}rfer,
1998, pp. 185--196.
short: 'T. Gehrke, M. Huhn, P. Niebert, A. Rensink, H. Wehrheim, in: H. K{\"{o}}nig,
P. Langend{\"{o}}rfer (Eds.), Formale Beschreibungstechniken F{\"{u}}r Verteilte
Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch, Cottbus, 4. Und 5. Juni 1998, 1998, pp.
185--196.'
date_created: 2018-06-14T07:34:22Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
editor:
- first_name: Hartmut
full_name: K{\"{o}}nig, Hartmut
last_name: K{\"{o}}nig
- first_name: Peter
full_name: Langend{\"{o}}rfer, Peter
last_name: Langend{\"{o}}rfer
page: 185--196
publication: Formale Beschreibungstechniken f{\"{u}}r verteilte Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch,
Cottbus, 4. und 5. Juni 1998
status: public
title: A Process Algebra Semantics for {MSC} Including Conditions
type: conference
user_id: '29719'
year: '1998'
...
---
_id: '3256'
author:
- first_name: Thomas
full_name: Gehrke, Thomas
last_name: Gehrke
- first_name: Michaela
full_name: Huhn, Michaela
last_name: Huhn
- first_name: Arend
full_name: Rensink, Arend
last_name: Rensink
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Gehrke T, Huhn M, Rensink A, Wehrheim H. An Algebraic Semantics for Message
Sequence Chart Documents. In: Budkowski S, R. Cavalli A, Najm E, eds. Formal
Description Techniques and Protocol Specification, Testing and Verification, {FORTE}
{XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International Conference on
Formal Description Techniques for Distributed Systems and Communication Protocols
{(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII),
3-6 November, 1998, Paris, France. {IFIP} Conference Proceedings. ; 1998:3--18.'
apa: Gehrke, T., Huhn, M., Rensink, A., & Wehrheim, H. (1998). An Algebraic
Semantics for Message Sequence Chart Documents. In S. Budkowski, A. R. Cavalli,
& E. Najm (Eds.), Formal Description Techniques and Protocol Specification,
Testing and Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1}
Joint International Conference on Formal Description Techniques for Distributed
Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification,
Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France
(pp. 3--18).
bibtex: '@inproceedings{Gehrke_Huhn_Rensink_Wehrheim_1998, series={{IFIP} Conference
Proceedings}, title={An Algebraic Semantics for Message Sequence Chart Documents},
booktitle={Formal Description Techniques and Protocol Specification, Testing and
Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International
Conference on Formal Description Techniques for Distributed Systems and Communication
Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification
{(PSTV} XVIII), 3-6 November, 1998, Paris, France}, author={Gehrke, Thomas and
Huhn, Michaela and Rensink, Arend and Wehrheim, Heike}, editor={Budkowski, Stanislaw
and R. Cavalli, Ana and Najm, ElieEditors}, year={1998}, pages={3--18}, collection={{IFIP}
Conference Proceedings} }'
chicago: Gehrke, Thomas, Michaela Huhn, Arend Rensink, and Heike Wehrheim. “An Algebraic
Semantics for Message Sequence Chart Documents.” In Formal Description Techniques
and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII’98,
{IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques
for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol
Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris,
France, edited by Stanislaw Budkowski, Ana R. Cavalli, and Elie Najm, 3--18.
{IFIP} Conference Proceedings, 1998.
ieee: T. Gehrke, M. Huhn, A. Rensink, and H. Wehrheim, “An Algebraic Semantics for
Message Sequence Chart Documents,” in Formal Description Techniques and Protocol
Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP}
{TC6} {WG6.1} Joint International Conference on Formal Description Techniques
for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol
Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris,
France, 1998, pp. 3--18.
mla: Gehrke, Thomas, et al. “An Algebraic Semantics for Message Sequence Chart Documents.”
Formal Description Techniques and Protocol Specification, Testing and Verification,
{FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International Conference
on Formal Description Techniques for Distributed Systems and Communication Protocols
{(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII),
3-6 November, 1998, Paris, France, edited by Stanislaw Budkowski et al., 1998,
pp. 3--18.
short: 'T. Gehrke, M. Huhn, A. Rensink, H. Wehrheim, in: S. Budkowski, A. R. Cavalli,
E. Najm (Eds.), Formal Description Techniques and Protocol Specification, Testing
and Verification, {FORTE} {XI} / {PSTV} XVIII’98, {IFIP} {TC6} {WG6.1} Joint International
Conference on Formal Description Techniques for Distributed Systems and Communication
Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification
{(PSTV} XVIII), 3-6 November, 1998, Paris, France, 1998, pp. 3--18.'
date_created: 2018-06-14T07:35:45Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
editor:
- first_name: Stanislaw
full_name: Budkowski, Stanislaw
last_name: Budkowski
- first_name: Ana
full_name: R. Cavalli, Ana
last_name: R. Cavalli
- first_name: Elie
full_name: Najm, Elie
last_name: Najm
page: 3--18
publication: Formal Description Techniques and Protocol Specification, Testing and
Verification, {FORTE} {XI} / {PSTV} XVIII'98, {IFIP} {TC6} {WG6.1} Joint International
Conference on Formal Description Techniques for Distributed Systems and Communication
Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV}
XVIII), 3-6 November, 1998, Paris, France
series_title: '{IFIP} Conference Proceedings'
status: public
title: An Algebraic Semantics for Message Sequence Chart Documents
type: conference
user_id: '29719'
year: '1998'
...
---
_id: '3257'
author:
- first_name: Michaela
full_name: Huhn, Michaela
last_name: Huhn
- first_name: Peter
full_name: Niebert, Peter
last_name: Niebert
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Huhn M, Niebert P, Wehrheim H. Partial Order Reductions for Bisimulation Checking.
In: Arvind V, Ramanujam R, eds. Foundations of Software Technology and Theoretical
Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings.
Lecture Notes in Computer Science. ; 1998:271--282. doi:10.1007/978-3-540-49382-2_26'
apa: Huhn, M., Niebert, P., & Wehrheim, H. (1998). Partial Order Reductions
for Bisimulation Checking. In V. Arvind & R. Ramanujam (Eds.), Foundations
of Software Technology and Theoretical Computer Science, 18th Conference, Chennai,
India, December 17-19, 1998, Proceedings (pp. 271--282). https://doi.org/10.1007/978-3-540-49382-2_26
bibtex: '@inproceedings{Huhn_Niebert_Wehrheim_1998, series={Lecture Notes in Computer
Science}, title={Partial Order Reductions for Bisimulation Checking}, DOI={10.1007/978-3-540-49382-2_26},
booktitle={Foundations of Software Technology and Theoretical Computer Science,
18th Conference, Chennai, India, December 17-19, 1998, Proceedings}, author={Huhn,
Michaela and Niebert, Peter and Wehrheim, Heike}, editor={Arvind, Vikraman and
Ramanujam, RamaswamyEditors}, year={1998}, pages={271--282}, collection={Lecture
Notes in Computer Science} }'
chicago: Huhn, Michaela, Peter Niebert, and Heike Wehrheim. “Partial Order Reductions
for Bisimulation Checking.” In Foundations of Software Technology and Theoretical
Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings,
edited by Vikraman Arvind and Ramaswamy Ramanujam, 271--282. Lecture Notes in
Computer Science, 1998. https://doi.org/10.1007/978-3-540-49382-2_26.
ieee: M. Huhn, P. Niebert, and H. Wehrheim, “Partial Order Reductions for Bisimulation
Checking,” in Foundations of Software Technology and Theoretical Computer Science,
18th Conference, Chennai, India, December 17-19, 1998, Proceedings, 1998,
pp. 271--282.
mla: Huhn, Michaela, et al. “Partial Order Reductions for Bisimulation Checking.”
Foundations of Software Technology and Theoretical Computer Science, 18th Conference,
Chennai, India, December 17-19, 1998, Proceedings, edited by Vikraman Arvind
and Ramaswamy Ramanujam, 1998, pp. 271--282, doi:10.1007/978-3-540-49382-2_26.
short: 'M. Huhn, P. Niebert, H. Wehrheim, in: V. Arvind, R. Ramanujam (Eds.), Foundations
of Software Technology and Theoretical Computer Science, 18th Conference, Chennai,
India, December 17-19, 1998, Proceedings, 1998, pp. 271--282.'
date_created: 2018-06-14T07:37:32Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1007/978-3-540-49382-2_26
editor:
- first_name: Vikraman
full_name: Arvind, Vikraman
last_name: Arvind
- first_name: Ramaswamy
full_name: Ramanujam, Ramaswamy
last_name: Ramanujam
page: 271--282
publication: Foundations of Software Technology and Theoretical Computer Science,
18th Conference, Chennai, India, December 17-19, 1998, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Partial Order Reductions for Bisimulation Checking
type: conference
user_id: '29719'
year: '1998'
...
---
_id: '3028'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Beat
full_name: Trachsler, Beat
last_name: Trachsler
citation:
ama: Blömer J, Trachsler B. A lower bound for a class of graph based loss resilient
codes. Technical report/Departement of Computer Science, ETH Zürich. 1998.
apa: Blömer, J., & Trachsler, B. (1998). A lower bound for a class of graph
based loss resilient codes. Technical Report/Departement of Computer Science,
ETH Zürich.
bibtex: '@article{Blömer_Trachsler_1998, title={A lower bound for a class of graph
based loss resilient codes}, journal={Technical report/Departement of Computer
Science, ETH Zürich}, author={Blömer, Johannes and Trachsler, Beat}, year={1998}
}'
chicago: Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph
Based Loss Resilient Codes.” Technical Report/Departement of Computer Science,
ETH Zürich, 1998.
ieee: J. Blömer and B. Trachsler, “A lower bound for a class of graph based loss
resilient codes,” Technical report/Departement of Computer Science, ETH Zürich,
1998.
mla: Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based
Loss Resilient Codes.” Technical Report/Departement of Computer Science, ETH
Zürich, 1998.
short: J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science,
ETH Zürich (1998).
date_created: 2018-06-05T08:29:47Z
date_updated: 2022-01-06T06:58:52Z
ddc:
- '000'
department:
- _id: '64'
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-06-05T08:32:27Z
date_updated: 2018-06-05T08:32:27Z
file_id: '3031'
file_name: code_lower.pdf
file_size: 173369
relation: main_file
success: 1
file_date_updated: 2018-06-05T08:32:27Z
has_accepted_license: '1'
publication: Technical report/Departement of Computer Science, ETH Zürich
publication_status: published
status: public
title: A lower bound for a class of graph based loss resilient codes
type: journal_article
user_id: '25078'
year: '1998'
...
---
_id: '17412'
abstract:
- lang: eng
text: "We study algorithmic aspects in the management of geometric scenes in interactive
walkthrough animations. We consider arbitrarily large scenes consisting of unit
size balls. For a smooth navigation in the scene we have to fulfill hard real
time requirements. Therefore, we need algorithms whose running time is independent
of the total number of objects in the scene and that use as small space as possible.
In this work we focus on one of the basic operations in our walkthrough system:
reporting the objects around the visitor within a certain distance. Previously
a randomized data structure was presented that supports reporting the balls around
the visitor in an output sensitive time and allows insertion and deletion of objects
nearly as fast as searching. These results were achieved by exploiting the fact
that the visitor moves ''slowly'' through the scene. A serious disadvantage of
the aforementioned data structure is a big space overhead and the use of randomization.
Our first result is a construction of weak spanners that leads to an improvement
of the space requirement of the previously known data structures. Then we develop
a deterministic data structure for the searching problem in which insertion of
objects are allowed. Our incremental data structure supports O(1+k) reporting
time, where k is a certain quantity close to the number of reported objects. The
insertion time is similar to the reporting time and the space is linear to the
total number of objects.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations
with Weak Spanners in Real Time. In: Algorithms — ESA’ 98. Berlin, Heidelberg;
1998. doi:10.1007/3-540-68530-8_14'
apa: Fischer, M., Lukovszki, T., & Ziegler, M. (1998). Geometric Searching in
Walkthrough Animations with Weak Spanners in Real Time. In Algorithms — ESA’
98. Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_14
bibtex: '@inbook{Fischer_Lukovszki_Ziegler_1998, place={Berlin, Heidelberg}, title={Geometric
Searching in Walkthrough Animations with Weak Spanners in Real Time}, DOI={10.1007/3-540-68530-8_14},
booktitle={Algorithms — ESA’ 98}, author={Fischer, Matthias and Lukovszki, Tamás
and Ziegler, Martin}, year={1998} }'
chicago: Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching
in Walkthrough Animations with Weak Spanners in Real Time.” In Algorithms —
ESA’ 98. Berlin, Heidelberg, 1998. https://doi.org/10.1007/3-540-68530-8_14.
ieee: M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough
Animations with Weak Spanners in Real Time,” in Algorithms — ESA’ 98, Berlin,
Heidelberg, 1998.
mla: Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with
Weak Spanners in Real Time.” Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.
short: 'M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin,
Heidelberg, 1998.'
date_created: 2020-07-27T11:42:54Z
date_updated: 2022-01-06T06:53:11Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/3-540-68530-8_14
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-27T11:20:38Z
date_updated: 2020-08-27T11:20:38Z
file_id: '18442'
file_name: hni-id-854.pdf
file_size: 266070
relation: main_file
success: 1
file_date_updated: 2020-08-27T11:20:38Z
has_accepted_license: '1'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Algorithms — ESA’ 98
publication_identifier:
isbn:
- '9783540648482'
- '9783540685302'
issn:
- 0302-9743
publication_status: published
status: public
title: Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
type: book_chapter
user_id: '15415'
year: '1998'
...
---
_id: '17863'
abstract:
- lang: eng
text: "New dynamic search data structures developed recently guarantee constant
execution time per search and update, i.e., they fulfil the real-time requirements
necessary for interactive walkthrough in large geometric scenes. Yet, superiority
or even applicability of these new methods in practice was still an open question.\r\n\r\nTheir
prototypical implementation presented in this work uses common libraries on standard
stations and thus represents a first strut to bridge this gap. Indeed our experimental
results give an indication on the actual performance of these theoretical ideas
on real machines and possible bottlenecks in future developments. By special algorithmic
enhancements, we can even avoid the otherwise essential preprocessing step.\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. A Network Based Approach for Realtime Walkthrough
of Massive Models. In: Algorithm Engineering, 2nd International Workshop, {WAE
’98}. Saarbrücken: Max-Planck-Institut für Informatik; 1998:133--142.'
apa: 'Fischer, M., Lukovszki, T., & Ziegler, M. (1998). A Network Based Approach
for Realtime Walkthrough of Massive Models. In Algorithm Engineering, 2nd International
Workshop, {WAE ’98} (pp. 133--142). Saarbrücken: Max-Planck-Institut für Informatik.'
bibtex: '@inproceedings{Fischer_Lukovszki_Ziegler_1998, place={Saarbrücken}, title={A
Network Based Approach for Realtime Walkthrough of Massive Models}, booktitle={Algorithm
Engineering, 2nd International Workshop, {WAE ’98}}, publisher={Max-Planck-Institut
für Informatik}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin
}, year={1998}, pages={133--142} }'
chicago: 'Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “A Network Based
Approach for Realtime Walkthrough of Massive Models.” In Algorithm Engineering,
2nd International Workshop, {WAE ’98}, 133--142. Saarbrücken: Max-Planck-Institut
für Informatik, 1998.'
ieee: M. Fischer, T. Lukovszki, and M. Ziegler, “A Network Based Approach for Realtime
Walkthrough of Massive Models,” in Algorithm Engineering, 2nd International
Workshop, {WAE ’98}, 1998, pp. 133--142.
mla: Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough
of Massive Models.” Algorithm Engineering, 2nd International Workshop, {WAE
’98}, Max-Planck-Institut für Informatik, 1998, pp. 133--142.
short: 'M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International
Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp.
133--142.'
date_created: 2020-08-12T12:50:56Z
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:18:26Z
date_updated: 2020-08-27T11:18:26Z
file_id: '18440'
file_name: hni-id-853.pdf
file_size: 272549
relation: main_file
success: 1
file_date_updated: 2020-08-27T11:18:26Z
has_accepted_license: '1'
language:
- iso: eng
page: 133--142
place: Saarbrücken
publication: Algorithm Engineering, 2nd International Workshop, {WAE '98}
publisher: Max-Planck-Institut für Informatik
status: public
title: A Network Based Approach for Realtime Walkthrough of Massive Models
type: conference
user_id: '15415'
year: '1998'
...
---
_id: '18145'
abstract:
- lang: ger
text: Preis für den Beitrag "Multimediale Entdeckungsreisen unserer Welt mit dem
Internet"
- lang: eng
text: Award for the Article "Multimedia-based Expedition of our World with the Internet"
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: Ziegler M, Fischer M, Lukovszki T. Multimediale Entdeckungsreisen Unserer
Welt Mit Dem Internet.; 1998.
apa: Ziegler, M., Fischer, M., & Lukovszki, T. (1998). Multimediale Entdeckungsreisen
unserer Welt mit dem Internet.
bibtex: '@book{Ziegler_Fischer_Lukovszki_1998, title={Multimediale Entdeckungsreisen
unserer Welt mit dem Internet}, author={Ziegler, Martin and Fischer, Matthias
and Lukovszki, Tamás}, year={1998} }'
chicago: Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. Multimediale
Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.
ieee: M. Ziegler, M. Fischer, and T. Lukovszki, Multimediale Entdeckungsreisen
unserer Welt mit dem Internet. 1998.
mla: Ziegler, Martin, et al. Multimediale Entdeckungsreisen Unserer Welt Mit
Dem Internet. 1998.
short: M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer
Welt Mit Dem Internet, 1998.
date_created: 2020-08-24T09:55:41Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
status: public
title: Multimediale Entdeckungsreisen unserer Welt mit dem Internet
type: report
user_id: '15415'
year: '1998'
...
---
_id: '18445'
author:
- first_name: Brigitte
full_name: Oesterdiekhoff, Brigitte
last_name: Oesterdiekhoff
citation:
ama: Oesterdiekhoff B. On Periodic Comparator Networks. Universität Paderborn;
1998.
apa: Oesterdiekhoff, B. (1998). On Periodic Comparator Networks. Universität
Paderborn.
bibtex: '@book{Oesterdiekhoff_1998, place={Universität Paderborn}, title={On Periodic
Comparator Networks}, author={Oesterdiekhoff, Brigitte}, year={1998} }'
chicago: Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. Universität
Paderborn, 1998.
ieee: B. Oesterdiekhoff, On Periodic Comparator Networks. Universität Paderborn,
1998.
mla: Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. 1998.
short: B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn,
1998.
date_created: 2020-08-27T11:42:12Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '63'
language:
- iso: eng
place: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: On Periodic Comparator Networks
type: dissertation
user_id: '15415'
year: '1998'
...
---
_id: '2168'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory
Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096
apa: Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies.
Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096
bibtex: '@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies},
volume={31}, DOI={10.1007/s002240000096},
number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and
Vöcking, Berthold}, year={1998}, pages={425--449} }'
chicago: 'Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.'
ieee: C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory
Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.
mla: Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
Strategies.” Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449,
doi:10.1007/s002240000096.
short: C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
date_created: 2018-04-03T08:59:06Z
date_updated: 2022-01-06T06:55:10Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240000096
intvolume: ' 31'
issue: '4'
language:
- iso: eng
page: 425--449
publication: Theory Comput. Syst.
status: public
title: Universal Continuous Routing Strategies
type: journal_article
user_id: '14955'
volume: 31
year: '1998'
...
---
_id: '2169'
author:
- first_name: Micah
full_name: Adler, Micah
last_name: Adler
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless
Networks (Extended Abstract). In: SPAA. ; 1998:259--268.'
apa: Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).
bibtex: '@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler,
Micah and Scheideler, Christian}, year={1998}, pages={259--268} }'
chicago: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.
ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc
Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.
mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.
short: 'M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.'
date_created: 2018-04-03T08:59:55Z
date_updated: 2022-01-06T06:55:10Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:08:12Z
date_updated: 2018-04-12T07:08:12Z
file_id: '2285'
file_name: SPAA98.pdf
file_size: 492778
relation: main_file
file_date_updated: 2018-04-12T07:08:12Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 259--268
publication: SPAA
status: public
title: Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
type: conference
urn: '21699'
user_id: '14955'
year: '1998'
...
---
_id: '2170'
author:
- first_name: Uriel
full_name: Feige, Uriel
last_name: Feige
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended
Abstract). In: STOC. ; 1998:624--633.'
apa: Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop
Scheduling (Extended Abstract). In STOC (pp. 624--633).
bibtex: '@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic
Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel
and Scheideler, Christian}, year={1998}, pages={624--633} }'
chicago: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job
Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.
ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling
(Extended Abstract),” in STOC, 1998, pp. 624--633.
mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop
Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.
short: 'U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.'
date_created: 2018-04-03T09:00:31Z
date_updated: 2022-01-06T06:55:11Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:15:50Z
date_updated: 2018-04-12T07:15:50Z
file_id: '2286'
file_name: STOC98.pdf
file_size: 228487
relation: main_file
file_date_updated: 2018-04-12T07:15:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 624--633
publication: STOC
status: public
title: Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
type: conference
urn: '21705'
user_id: '14955'
year: '1998'
...
---
_id: '21784'
author:
- first_name: Gitta
full_name: Domik, Gitta
id: '90'
last_name: Domik
- first_name: S.
full_name: Vollbracht, S.
last_name: Vollbracht
citation:
ama: Domik G, Vollbracht S. Dreidimensionale Welten auf flachen Bildschirmen. Zeitschrift
Forschungsforum Paderborn. 1998.
apa: Domik, G., & Vollbracht, S. (1998). Dreidimensionale Welten auf flachen
Bildschirmen. Zeitschrift Forschungsforum Paderborn.
bibtex: '@article{Domik_Vollbracht_1998, title={Dreidimensionale Welten auf flachen
Bildschirmen}, journal={Zeitschrift Forschungsforum Paderborn}, author={Domik,
Gitta and Vollbracht, S.}, year={1998} }'
chicago: Domik, Gitta, and S. Vollbracht. “Dreidimensionale Welten Auf Flachen Bildschirmen.”
Zeitschrift Forschungsforum Paderborn, 1998.
ieee: G. Domik and S. Vollbracht, “Dreidimensionale Welten auf flachen Bildschirmen,”
Zeitschrift Forschungsforum Paderborn, 1998.
mla: Domik, Gitta, and S. Vollbracht. “Dreidimensionale Welten Auf Flachen Bildschirmen.”
Zeitschrift Forschungsforum Paderborn, 1998.
short: G. Domik, S. Vollbracht, Zeitschrift Forschungsforum Paderborn (1998).
date_created: 2021-04-25T17:35:26Z
date_updated: 2022-01-06T06:55:13Z
department:
- _id: '65'
language:
- iso: eng
publication: Zeitschrift Forschungsforum Paderborn
status: public
title: Dreidimensionale Welten auf flachen Bildschirmen
type: journal_article
user_id: '14955'
year: '1998'
...
---
_id: '21785'
author:
- first_name: J.
full_name: D. Stuwe, J.
last_name: D. Stuwe
- first_name: C.
full_name: Lenz, C.
last_name: Lenz
- first_name: Gitta
full_name: Domik, Gitta
id: '90'
last_name: Domik
citation:
ama: 'D. Stuwe J, Lenz C, Domik G. Visualization of geographic data using VRML-an
Internet client, for a geographic information system (GIS). In: Proceedings.
Computer Graphics International (Cat. No.98EX149). Vol 1. ; 1998:111-112.
doi:10.1109/CGI.1998.694258'
apa: D. Stuwe, J., Lenz, C., & Domik, G. (1998). Visualization of geographic
data using VRML-an Internet client, for a geographic information system (GIS).
In Proceedings. Computer Graphics International (Cat. No.98EX149) (Vol.
1, pp. 111–112). https://doi.org/10.1109/CGI.1998.694258
bibtex: '@inproceedings{D. Stuwe_Lenz_Domik_1998, title={Visualization of geographic
data using VRML-an Internet client, for a geographic information system (GIS)},
volume={1}, DOI={10.1109/CGI.1998.694258},
booktitle={Proceedings. Computer Graphics International (Cat. No.98EX149)}, author={D.
Stuwe, J. and Lenz, C. and Domik, Gitta}, year={1998}, pages={111–112} }'
chicago: D. Stuwe, J., C. Lenz, and Gitta Domik. “Visualization of Geographic Data
Using VRML-an Internet Client, for a Geographic Information System (GIS).” In
Proceedings. Computer Graphics International (Cat. No.98EX149), 1:111–12,
1998. https://doi.org/10.1109/CGI.1998.694258.
ieee: J. D. Stuwe, C. Lenz, and G. Domik, “Visualization of geographic data using
VRML-an Internet client, for a geographic information system (GIS),” in Proceedings.
Computer Graphics International (Cat. No.98EX149), 1998, vol. 1, pp. 111–112.
mla: D. Stuwe, J., et al. “Visualization of Geographic Data Using VRML-an Internet
Client, for a Geographic Information System (GIS).” Proceedings. Computer Graphics
International (Cat. No.98EX149), vol. 1, 1998, pp. 111–12, doi:10.1109/CGI.1998.694258.
short: 'J. D. Stuwe, C. Lenz, G. Domik, in: Proceedings. Computer Graphics International
(Cat. No.98EX149), 1998, pp. 111–112.'
date_created: 2021-04-25T17:35:27Z
date_updated: 2022-01-06T06:55:13Z
department:
- _id: '65'
doi: 10.1109/CGI.1998.694258
intvolume: ' 1'
language:
- iso: eng
page: 111-112
publication: Proceedings. Computer Graphics International (Cat. No.98EX149)
status: public
title: Visualization of geographic data using VRML-an Internet client, for a geographic
information system (GIS)
type: conference
user_id: '14955'
volume: 1
year: '1998'
...
---
_id: '2185'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Scheideler C. Universal Routing Strategies for Interconnection Networks.
Vol 1390.; 1998. doi:10.1007/BFb0052928
apa: Scheideler, C. (1998). Universal Routing Strategies for Interconnection
Networks (Vol. 1390). https://doi.org/10.1007/BFb0052928
bibtex: '@book{Scheideler_1998, series={Lecture Notes in Computer Science}, title={Universal
Routing Strategies for Interconnection Networks}, volume={1390}, DOI={10.1007/BFb0052928},
author={Scheideler, Christian}, year={1998}, collection={Lecture Notes in Computer
Science} }'
chicago: Scheideler, Christian. Universal Routing Strategies for Interconnection
Networks. Vol. 1390. Lecture Notes in Computer Science, 1998. https://doi.org/10.1007/BFb0052928.
ieee: C. Scheideler, Universal Routing Strategies for Interconnection Networks,
vol. 1390. 1998.
mla: Scheideler, Christian. Universal Routing Strategies for Interconnection
Networks. Vol. 1390, 1998, doi:10.1007/BFb0052928.
short: C. Scheideler, Universal Routing Strategies for Interconnection Networks,
1998.
date_created: 2018-04-03T09:38:18Z
date_updated: 2022-01-06T06:55:17Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/BFb0052928
intvolume: ' 1390'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-540-69792-3
series_title: Lecture Notes in Computer Science
status: public
title: Universal Routing Strategies for Interconnection Networks
type: book
user_id: '14955'
volume: 1390
year: '1998'
...
---
_id: '7793'
abstract:
- lang: eng
text: 'During the last 20 years several different formal and semi-formal specification
techniques have been successfully developed and used. Applications comprise the
specification of simple programs, data types and processes as well as complex
hardware and software systems. The variety of specification techniques ranges
from formal set theoretical, algebraic, and logic approaches for specifying sequential
systems and from Petri-nets, process algebras, automata, and graph grammars for
specifying concurrent and distributed behaviors to semi-formal software engineering
methods for developing complex systems. Formal and semi-formal approaches have
their advantages and disadvantages: the informal diagrammatic methods are easier
to understand and to apply but they can be ambiguous. Due to the different nature
of the employed diagrams and descriptions it is often difficult to get a comprehensive
view of all functional and dynamic properties. On the other hand, the formal approaches
are more difficult to learn and require mathematical training. But they provide
mathematical rigor for analysis and prototyping of designs. Verification is possible
only with formal techniques. Since a few years many researchers and research groups
are putting more and more effort in closing this gap by integrating semi-formal
and formal specification techniques. Their studies and experiences show the added
value of combining semi-formal and formal techniques and at the same time open
a whole range of new problems and questions which cannot be asked when studying
formalisms in isolation. In this seminar more than 40 scientists came together
in 28 talks and two panel discussions to study possibilities and solutions for
integrating and validating different formal and semi-formal specification techniques.
Similarities and differences of formal and semi-formal specification formalisms
as well as possibilities for combining such techniques were discussed. Most talks
of this seminar analysed, compared, or integrated at least two such methods. On
behalf of all participants the organizers would like to thank the staff of Schloss
Dagstuhl for providing an excellent environment to the conference. The support
of the TMR programme of the European Community is gratefully acknowledged. Due
to this programme it was possible to fund the participation of several young researchers
and of three key note speakers.'
citation:
ama: Engels G, Ehrig H, Orejas F, Wirsing M, eds. Semi-Formal and Formal Specification
Techniques. Vol 218. Schloss Dagstuhl, Leibniz Center for Informatics; 1998.
apa: Engels, G., Ehrig, H., Orejas, F., & Wirsing, M. (Eds.). (1998). Semi-Formal
and Formal Specification Techniques (Vol. 218). Schloss Dagstuhl, Leibniz
Center for Informatics.
bibtex: '@book{Engels_Ehrig_Orejas_Wirsing_1998, series={Dagstuhl-Seminar-Report},
title={Semi-Formal and Formal Specification Techniques}, volume={218}, publisher={Schloss
Dagstuhl, Leibniz Center for Informatics}, year={1998}, collection={Dagstuhl-Seminar-Report}
}'
chicago: Engels, Gregor, Hartmut Ehrig, Fernando Orejas, and M. Wirsing, eds. Semi-Formal
and Formal Specification Techniques. Vol. 218. Dagstuhl-Seminar-Report. Schloss
Dagstuhl, Leibniz Center for Informatics, 1998.
ieee: G. Engels, H. Ehrig, F. Orejas, and M. Wirsing, Eds., Semi-Formal and Formal
Specification Techniques, vol. 218. Schloss Dagstuhl, Leibniz Center for Informatics,
1998.
mla: Engels, Gregor, et al., editors. Semi-Formal and Formal Specification Techniques.
Vol. 218, Schloss Dagstuhl, Leibniz Center for Informatics, 1998.
short: G. Engels, H. Ehrig, F. Orejas, M. Wirsing, eds., Semi-Formal and Formal
Specification Techniques, Schloss Dagstuhl, Leibniz Center for Informatics, 1998.
date_created: 2019-02-19T19:14:00Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
editor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Hartmut
full_name: Ehrig, Hartmut
last_name: Ehrig
- first_name: Fernando
full_name: Orejas, Fernando
last_name: Orejas
- first_name: M.
full_name: Wirsing, M.
last_name: Wirsing
intvolume: ' 218'
language:
- iso: eng
publisher: Schloss Dagstuhl, Leibniz Center for Informatics
series_title: Dagstuhl-Seminar-Report
status: public
title: Semi-Formal and Formal Specification Techniques
type: conference_editor
user_id: '52534'
volume: 218
year: '1998'
...
---
_id: '7794'
citation:
ama: 'Engels G, Ehrig H, Kreowski H-J, Rozenberg G, eds. 6th International Workshop
on Theory and Applications of Graph Transformations (TAGT ’98), Paderborn, Selected
Papers. Vol 1764. Berlin/Heidelberg: Springer; 1998.'
apa: 'Engels, G., Ehrig, H., Kreowski, H.-J., & Rozenberg, G. (Eds.). (1998).
6th International Workshop on Theory and Applications of Graph Transformations
(TAGT ’98), Paderborn, Selected Papers (Vol. 1764). Berlin/Heidelberg: Springer.'
bibtex: '@book{Engels_Ehrig_Kreowski_Rozenberg_1998, place={Berlin/Heidelberg},
series={LNCS}, title={6th International Workshop on Theory and Applications of
Graph Transformations (TAGT ’98), Paderborn, Selected Papers}, volume={1764},
publisher={Springer}, year={1998}, collection={LNCS} }'
chicago: 'Engels, Gregor, Hartmut Ehrig, Hans-Jörg Kreowski, and Grzegorz Rozenberg,
eds. 6th International Workshop on Theory and Applications of Graph Transformations
(TAGT ’98), Paderborn, Selected Papers. Vol. 1764. LNCS. Berlin/Heidelberg:
Springer, 1998.'
ieee: 'G. Engels, H. Ehrig, H.-J. Kreowski, and G. Rozenberg, Eds., 6th International
Workshop on Theory and Applications of Graph Transformations (TAGT ’98), Paderborn,
Selected Papers, vol. 1764. Berlin/Heidelberg: Springer, 1998.'
mla: Engels, Gregor, et al., editors. 6th International Workshop on Theory and
Applications of Graph Transformations (TAGT ’98), Paderborn, Selected Papers.
Vol. 1764, Springer, 1998.
short: G. Engels, H. Ehrig, H.-J. Kreowski, G. Rozenberg, eds., 6th International
Workshop on Theory and Applications of Graph Transformations (TAGT ’98), Paderborn,
Selected Papers, Springer, Berlin/Heidelberg, 1998.
date_created: 2019-02-19T19:14:51Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
editor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Hartmut
full_name: Ehrig, Hartmut
last_name: Ehrig
- first_name: Hans-Jörg
full_name: Kreowski, Hans-Jörg
last_name: Kreowski
- first_name: Grzegorz
full_name: Rozenberg, Grzegorz
last_name: Rozenberg
intvolume: ' 1764'
language:
- iso: eng
place: Berlin/Heidelberg
publisher: Springer
series_title: LNCS
status: public
title: 6th International Workshop on Theory and Applications of Graph Transformations
(TAGT '98), Paderborn, Selected Papers
type: conference_editor
user_id: '52534'
volume: 1764
year: '1998'
...
---
_id: '7843'
author:
- first_name: Ralph
full_name: Depke, Ralph
last_name: Depke
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Katharina
full_name: Mehner, Katharina
last_name: Mehner
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
- first_name: Annika
full_name: Wagner, Annika
last_name: Wagner
citation:
ama: 'Depke R, Engels G, Mehner K, Sauer S, Wagner A. Ein Ansatz zur Verbesserung
des Entwicklungsprozesses von Multimedia-Anwendungen. In: Proceedings of the
GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany). Vol 18. GI;
1998:12-19.'
apa: Depke, R., Engels, G., Mehner, K., Sauer, S., & Wagner, A. (1998). Ein
Ansatz zur Verbesserung des Entwicklungsprozesses von Multimedia-Anwendungen.
In Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany)
(Vol. 18, pp. 12–19). GI.
bibtex: '@inproceedings{Depke_Engels_Mehner_Sauer_Wagner_1998, title={Ein Ansatz
zur Verbesserung des Entwicklungsprozesses von Multimedia-Anwendungen}, volume={18},
number={3}, booktitle={Proceedings of the GI-Fachtagung on Softwaretechnik (1998),
Paderborn (Germany)}, publisher={GI}, author={Depke, Ralph and Engels, Gregor
and Mehner, Katharina and Sauer, Stefan and Wagner, Annika}, year={1998}, pages={12–19}
}'
chicago: Depke, Ralph, Gregor Engels, Katharina Mehner, Stefan Sauer, and Annika
Wagner. “Ein Ansatz Zur Verbesserung Des Entwicklungsprozesses von Multimedia-Anwendungen.”
In Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany),
18:12–19. GI, 1998.
ieee: R. Depke, G. Engels, K. Mehner, S. Sauer, and A. Wagner, “Ein Ansatz zur Verbesserung
des Entwicklungsprozesses von Multimedia-Anwendungen,” in Proceedings of the
GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany), 1998, vol. 18,
no. 3, pp. 12–19.
mla: Depke, Ralph, et al. “Ein Ansatz Zur Verbesserung Des Entwicklungsprozesses
von Multimedia-Anwendungen.” Proceedings of the GI-Fachtagung on Softwaretechnik
(1998), Paderborn (Germany), vol. 18, no. 3, GI, 1998, pp. 12–19.
short: 'R. Depke, G. Engels, K. Mehner, S. Sauer, A. Wagner, in: Proceedings of
the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany), GI, 1998, pp.
12–19.'
date_created: 2019-02-20T14:09:54Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
intvolume: ' 18'
issue: '3'
language:
- iso: eng
page: 12-19
publication: Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn
(Germany)
publisher: GI
status: public
title: Ein Ansatz zur Verbesserung des Entwicklungsprozesses von Multimedia-Anwendungen
type: conference
user_id: '52534'
volume: 18
year: '1998'
...
---
_id: '7844'
author:
- first_name: Klaus
full_name: Didrich, Klaus
last_name: Didrich
- first_name: Annika
full_name: Wagner, Annika
last_name: Wagner
citation:
ama: 'Didrich K, Wagner A. Integration of Single Pushout Transformation and Functional
Programming. In: Proceedings of the World Conference on Integrated Design and
Process Technology (IDPT 1998), Berlin (Germany). Vol 4. Society for Design
and Process Science; 1998:65-73.'
apa: Didrich, K., & Wagner, A. (1998). Integration of Single Pushout Transformation
and Functional Programming. In Proceedings of the World Conference on Integrated
Design and Process Technology (IDPT 1998), Berlin (Germany) (Vol. 4, pp. 65–73).
Society for Design and Process Science.
bibtex: '@inproceedings{Didrich_Wagner_1998, title={Integration of Single Pushout
Transformation and Functional Programming}, volume={4}, booktitle={Proceedings
of the World Conference on Integrated Design and Process Technology (IDPT 1998),
Berlin (Germany)}, publisher={Society for Design and Process Science}, author={Didrich,
Klaus and Wagner, Annika}, year={1998}, pages={65–73} }'
chicago: Didrich, Klaus, and Annika Wagner. “Integration of Single Pushout Transformation
and Functional Programming.” In Proceedings of the World Conference on Integrated
Design and Process Technology (IDPT 1998), Berlin (Germany), 4:65–73. Society
for Design and Process Science, 1998.
ieee: K. Didrich and A. Wagner, “Integration of Single Pushout Transformation and
Functional Programming,” in Proceedings of the World Conference on Integrated
Design and Process Technology (IDPT 1998), Berlin (Germany), 1998, vol. 4,
pp. 65–73.
mla: Didrich, Klaus, and Annika Wagner. “Integration of Single Pushout Transformation
and Functional Programming.” Proceedings of the World Conference on Integrated
Design and Process Technology (IDPT 1998), Berlin (Germany), vol. 4, Society
for Design and Process Science, 1998, pp. 65–73.
short: 'K. Didrich, A. Wagner, in: Proceedings of the World Conference on Integrated
Design and Process Technology (IDPT 1998), Berlin (Germany), Society for Design
and Process Science, 1998, pp. 65–73.'
date_created: 2019-02-20T14:10:57Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
intvolume: ' 4'
language:
- iso: eng
page: 65-73
publication: Proceedings of the World Conference on Integrated Design and Process
Technology (IDPT 1998), Berlin (Germany)
publisher: Society for Design and Process Science
status: public
title: Integration of Single Pushout Transformation and Functional Programming
type: conference
user_id: '52534'
volume: 4
year: '1998'
...