---
_id: '39499'
abstract:
- lang: eng
  text: "3D-graphics popularity has steadily increased in a\r\nnumber of areas such
    as entertainment, scienti c vi-\r\nsualization, simulation, and virtual reality.
    Despite\r\nthis rapid growth the authoring of animated 3D objects\r\nin virtual
    environments is stil l by no means trivial.\r\nThis article presents new concepts
    of the animated 3D\r\nprogramming language SAM (Solid Agents in Motion)\r\nand
    its programming environment. In SAM, the main\r\nsyntactic objects like agents,
    rules, and messages are\r\nrepresented as 3D objects. The design of a SAM pro-\r\ngram
    is supported by a dedicated 3D structure editor.\r\nThe editor al lows the de
    nition and spatial arrange-\r\nment of SAM agents in a 3D scene by direct manipu-\r\nlation.
    The paper gives a number of SAM examples,\r\ndemonstrating the authoring of simple
    animated vir-\r\ntual 3D scenarios."
author:
- first_name: Christian
  full_name: Geiger, Christian
  last_name: Geiger
- first_name: Georg
  full_name: Lehrenfeld, Georg
  last_name: Lehrenfeld
- first_name: Wolfgang
  full_name: Müller, Wolfgang
  id: '16243'
  last_name: Müller
citation:
  ama: 'Geiger C, Lehrenfeld G, Müller W. Authoring Communicating Agents in Virtual
    Environments. In: <i>Proceedings of the Annual Conference for the Computer Human
    Interaction</i>. ; 1998.'
  apa: Geiger, C., Lehrenfeld, G., &#38; Müller, W. (1998). Authoring Communicating
    Agents in Virtual Environments. <i>Proceedings of the Annual Conference for the
    Computer Human Interaction</i>.
  bibtex: '@inproceedings{Geiger_Lehrenfeld_Müller_1998, place={Adelaide, Australia},
    title={Authoring Communicating Agents in Virtual Environments}, booktitle={Proceedings
    of the Annual Conference for the Computer Human Interaction}, author={Geiger,
    Christian and Lehrenfeld, Georg and Müller, Wolfgang}, year={1998} }'
  chicago: Geiger, Christian, Georg Lehrenfeld, and Wolfgang Müller. “Authoring Communicating
    Agents in Virtual Environments.” In <i>Proceedings of the Annual Conference for
    the Computer Human Interaction</i>. Adelaide, Australia, 1998.
  ieee: C. Geiger, G. Lehrenfeld, and W. Müller, “Authoring Communicating Agents in
    Virtual Environments,” 1998.
  mla: Geiger, Christian, et al. “Authoring Communicating Agents in Virtual Environments.”
    <i>Proceedings of the Annual Conference for the Computer Human Interaction</i>,
    1998.
  short: 'C. Geiger, G. Lehrenfeld, W. Müller, in: Proceedings of the Annual Conference
    for the Computer Human Interaction, Adelaide, Australia, 1998.'
date_created: 2023-01-24T11:44:06Z
date_updated: 2023-01-24T11:44:10Z
department:
- _id: '672'
language:
- iso: eng
place: Adelaide, Australia
publication: Proceedings of the Annual Conference for the Computer Human Interaction
status: public
title: Authoring Communicating Agents in Virtual Environments
type: conference
user_id: '5786'
year: '1998'
...
---
_id: '39493'
abstract:
- lang: eng
  text: This article presents the animated visual 3D programming language SAM (Solid
    Agents in Motion) for parallel systems specification and animation. A SAM program
    is a set of interacting agents synchronously exchanging messages. The agent's
    behaviour is specified by means of production rules with a condition and a sequence
    of actions each. Actions are linearly ordered and execute when matching a rule.
    In SAM, main syntactic objects like agents, rules, and messages are 3D. These
    objects can have an abstract and a concrete, solid 3D presentation. While the
    abstract representation is for programming and debugging, the concrete representation
    is for animated 3D end-user presentations. After outlining the concepts of SAM
    this article gives two programming examples of 3D micro worlds and an overview
    of the programming environment.
author:
- first_name: Christian
  full_name: Geiger, Christian
  last_name: Geiger
- first_name: Wolfgang
  full_name: Müller, Wolfgang
  id: '16243'
  last_name: Müller
- first_name: W.
  full_name: Rosenbach, W.
  last_name: Rosenbach
citation:
  ama: 'Geiger C, Müller W, Rosenbach W. SAM - An Animated 3D Programming Language.
    In: <i>Proceedings of the IEEE Symposium on Visual Languages</i>. ; 1998. doi:<a
    href="https://doi.org/10.1109/VL.1998.706167">10.1109/VL.1998.706167</a>'
  apa: Geiger, C., Müller, W., &#38; Rosenbach, W. (1998). SAM - An Animated 3D Programming
    Language. <i>Proceedings of the IEEE Symposium on Visual Languages</i>. 1998 IEEE
    Symposium on Visual Languages, Halifax, Canada. <a href="https://doi.org/10.1109/VL.1998.706167">https://doi.org/10.1109/VL.1998.706167</a>
  bibtex: '@inproceedings{Geiger_Müller_Rosenbach_1998, place={Halifax, Canada}, title={SAM
    - An Animated 3D Programming Language}, DOI={<a href="https://doi.org/10.1109/VL.1998.706167">10.1109/VL.1998.706167</a>},
    booktitle={Proceedings of the IEEE Symposium on Visual Languages}, author={Geiger,
    Christian and Müller, Wolfgang and Rosenbach, W.}, year={1998} }'
  chicago: Geiger, Christian, Wolfgang Müller, and W. Rosenbach. “SAM - An Animated
    3D Programming Language.” In <i>Proceedings of the IEEE Symposium on Visual Languages</i>.
    Halifax, Canada, 1998. <a href="https://doi.org/10.1109/VL.1998.706167">https://doi.org/10.1109/VL.1998.706167</a>.
  ieee: 'C. Geiger, W. Müller, and W. Rosenbach, “SAM - An Animated 3D Programming
    Language,” presented at the 1998 IEEE Symposium on Visual Languages, Halifax,
    Canada, 1998, doi: <a href="https://doi.org/10.1109/VL.1998.706167">10.1109/VL.1998.706167</a>.'
  mla: Geiger, Christian, et al. “SAM - An Animated 3D Programming Language.” <i>Proceedings
    of the IEEE Symposium on Visual Languages</i>, 1998, doi:<a href="https://doi.org/10.1109/VL.1998.706167">10.1109/VL.1998.706167</a>.
  short: 'C. Geiger, W. Müller, W. Rosenbach, in: Proceedings of the IEEE Symposium
    on Visual Languages, Halifax, Canada, 1998.'
conference:
  location: Halifax, Canada
  name: 1998 IEEE Symposium on Visual Languages
date_created: 2023-01-24T11:39:30Z
date_updated: 2023-01-24T11:39:35Z
department:
- _id: '672'
doi: 10.1109/VL.1998.706167
keyword:
- Animation
- Computer languages
- Solids
- Concrete
- Application software
- Virtual reality
- Programming profession
- Switches
- Visualization
- Debugging
language:
- iso: eng
place: Halifax, Canada
publication: Proceedings of the IEEE Symposium on Visual Languages
publication_identifier:
  isbn:
  - 0-8186-8712-6
status: public
title: SAM - An Animated 3D Programming Language
type: conference
user_id: '5786'
year: '1998'
...
---
_id: '39489'
author:
- first_name: Christian
  full_name: Geiger, Christian
  last_name: Geiger
- first_name: Wolfgang
  full_name: Müller, Wolfgang
  id: '16243'
  last_name: Müller
citation:
  ama: Geiger C, Müller W. Visuelle Spezifikation, Modellierung und Animation im Systementwurf.
    Published online 1998.
  apa: Geiger, C., &#38; Müller, W. (1998). <i>Visuelle Spezifikation, Modellierung
    und Animation im Systementwurf</i>.
  bibtex: '@article{Geiger_Müller_1998, place={Magdeburg, Germany}, series={Simulation
    und Visualisierung 98}, title={Visuelle Spezifikation, Modellierung und Animation
    im Systementwurf}, author={Geiger, Christian and Müller, Wolfgang}, year={1998},
    collection={Simulation und Visualisierung 98} }'
  chicago: Geiger, Christian, and Wolfgang Müller. “Visuelle Spezifikation, Modellierung
    Und Animation Im Systementwurf.” Simulation Und Visualisierung 98. Magdeburg,
    Germany, 1998.
  ieee: C. Geiger and W. Müller, “Visuelle Spezifikation, Modellierung und Animation
    im Systementwurf.” Magdeburg, Germany, 1998.
  mla: Geiger, Christian, and Wolfgang Müller. <i>Visuelle Spezifikation, Modellierung
    Und Animation Im Systementwurf</i>. 1998.
  short: C. Geiger, W. Müller, (1998).
date_created: 2023-01-24T11:37:14Z
date_updated: 2023-01-24T11:37:19Z
department:
- _id: '672'
language:
- iso: eng
place: Magdeburg, Germany
series_title: Simulation und Visualisierung 98
status: public
title: Visuelle Spezifikation, Modellierung und Animation im Systementwurf
type: conference
user_id: '5786'
year: '1998'
...
---
_id: '19631'
author:
- first_name: Armin
  full_name: Bäumker, Armin
  last_name: Bäumker
citation:
  ama: Bäumker A. <i>Communication Efficient Parallel Searching</i>. Vol 28. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn; 1997.
  apa: Bäumker, A. (1997). <i>Communication Efficient Parallel Searching</i> (Vol.
    28). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
  bibtex: '@book{Bäumker_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, title={Communication Efficient Parallel Searching}, volume={28}, publisher={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn}, author={Bäumker, Armin}, year={1997},
    collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
  chicago: Bäumker, Armin. <i>Communication Efficient Parallel Searching</i>. Vol.
    28. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1997.
  ieee: A. Bäumker, <i>Communication Efficient Parallel Searching</i>, vol. 28. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1997.
  mla: Bäumker, Armin. <i>Communication Efficient Parallel Searching</i>. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1997.
  short: A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1997.
date_created: 2020-09-22T12:46:17Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '63'
- _id: '26'
intvolume: '        28'
language:
- iso: eng
publication_identifier:
  isbn:
  - 3-931466-27-2
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: Communication Efficient Parallel Searching
type: dissertation
user_id: '5786'
volume: 28
year: '1997'
...
---
_id: '19636'
author:
- first_name: Wolfgang
  full_name: Dittrich, Wolfgang
  last_name: Dittrich
citation:
  ama: Dittrich W. <i>Communication and I/O Efficient Parallel Data Structures</i>.
    Vol 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.
  apa: Dittrich, W. (1997). <i>Communication and I/O Efficient Parallel Data Structures</i>
    (Vol. 27). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
  bibtex: '@book{Dittrich_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, title={Communication and I/O Efficient Parallel Data Structures},
    volume={27}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
    author={Dittrich, Wolfgang}, year={1997}, collection={Verlagsschriftenreihe des
    Heinz Nixdorf Instituts, Paderborn} }'
  chicago: Dittrich, Wolfgang. <i>Communication and I/O Efficient Parallel Data Structures</i>.
    Vol. 27. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1997.
  ieee: W. Dittrich, <i>Communication and I/O Efficient Parallel Data Structures</i>,
    vol. 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
  mla: Dittrich, Wolfgang. <i>Communication and I/O Efficient Parallel Data Structures</i>.
    Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
  short: W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1997.
date_created: 2020-09-22T12:53:00Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '63'
- _id: '26'
intvolume: '        27'
language:
- iso: eng
publication_identifier:
  isbn:
  - 3-931466-26-4
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: Communication and I/O Efficient Parallel Data Structures
type: dissertation
user_id: '5786'
volume: 27
year: '1997'
...
---
_id: '19637'
author:
- first_name: Willy-Bernhard
  full_name: Strothmann, Willy-Bernhard
  last_name: Strothmann
citation:
  ama: Strothmann W-B. <i>Bounded Degree Spanning Trees</i>. Vol 35. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn; 1997.
  apa: Strothmann, W.-B. (1997). <i>Bounded Degree Spanning Trees</i> (Vol. 35). Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn.
  bibtex: '@book{Strothmann_1997, series={Verlagsschriftenreihe des Heinz Nixdorf
    Instituts, Paderborn}, title={Bounded Degree Spanning Trees}, volume={35}, publisher={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn}, author={Strothmann, Willy-Bernhard},
    year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}
    }'
  chicago: Strothmann, Willy-Bernhard. <i>Bounded Degree Spanning Trees</i>. Vol.
    35. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1997.
  ieee: W.-B. Strothmann, <i>Bounded Degree Spanning Trees</i>, vol. 35. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1997.
  mla: Strothmann, Willy-Bernhard. <i>Bounded Degree Spanning Trees</i>. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1997.
  short: W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des
    Heinz Nixdorf Instituts, Paderborn, 1997.
date_created: 2020-09-22T12:57:53Z
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-22T12:57:43Z
  date_updated: 2020-09-22T12:57:43Z
  file_id: '19638'
  file_name: pub-hni-468.pdf
  file_size: 1172216
  relation: main_file
  success: 1
file_date_updated: 2020-09-22T12:57:43Z
has_accepted_license: '1'
intvolume: '        35'
language:
- iso: eng
publication_identifier:
  isbn:
  - 3-931466-34-5
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: Bounded Degree Spanning Trees
type: dissertation
user_id: '5786'
volume: 35
year: '1997'
...
---
_id: '19869'
abstract:
- lang: eng
  text: Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning
    tree of $G$ of maximum degree bounded by $dT$. It is well known that for each
    $dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning
    tree is NP-complete. In this paper we investigate this problem when additionally
    connectivity and maximum degree of the graph are given. A complete characterization
    of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$
    is provided. Our first result is that given a biconnected graph of maximum degree
    $2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of
    higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning
    tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand,
    we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$
    has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge
    3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$
    has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian
    path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$.
    This extends the well known result for $k=3$ and fully characterizes the case
    $dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected
    planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG
    > dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$.
    On the other hand, we show how to find in polynomial (linear or almost linear)
    time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$.
author:
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Willy-Bernhard
  full_name: Strothmann, Willy-Bernhard
  last_name: Strothmann
citation:
  ama: 'Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: <i>Proceedings
    of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>. ; 1997. doi:<a
    href="https://doi.org/10.1007/3-540-63397-9_9">10.1007/3-540-63397-9_9</a>'
  apa: Czumaj, A., &#38; Strothmann, W.-B. (1997). Bounded degree spanning trees.
    <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>.
    <a href="https://doi.org/10.1007/3-540-63397-9_9">https://doi.org/10.1007/3-540-63397-9_9</a>
  bibtex: '@inproceedings{Czumaj_Strothmann_1997, title={Bounded degree spanning trees},
    DOI={<a href="https://doi.org/10.1007/3-540-63397-9_9">10.1007/3-540-63397-9_9</a>},
    booktitle={Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)},
    author={Czumaj, Artur and Strothmann, Willy-Bernhard}, year={1997} }'
  chicago: Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning
    Trees.” In <i>Proceedings of the Fifth Annual European Symposium on Algorithms
    (ESA’97)</i>, 1997. <a href="https://doi.org/10.1007/3-540-63397-9_9">https://doi.org/10.1007/3-540-63397-9_9</a>.
  ieee: 'A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi:
    <a href="https://doi.org/10.1007/3-540-63397-9_9">10.1007/3-540-63397-9_9</a>.'
  mla: Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.”
    <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>,
    1997, doi:<a href="https://doi.org/10.1007/3-540-63397-9_9">10.1007/3-540-63397-9_9</a>.
  short: 'A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European
    Symposium on Algorithms (ESA’97), 1997.'
date_created: 2020-10-05T07:13:42Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1007/3-540-63397-9_9
language:
- iso: eng
publication: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)
publication_identifier:
  isbn:
  - '9783540633976'
  - '9783540695363'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Bounded degree spanning trees
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '3258'
author:
- first_name: Arend
  full_name: Rensink, Arend
  last_name: Rensink
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Rensink A, Wehrheim H. Dependency-Based Action Refinement. In: Pr{\’{\i}}vara
    I, Ruzicka P, eds. <i>Mathematical Foundations of Computer Science 1997, 22nd
    International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>.
    Lecture Notes in Computer Science. ; 1997:468--477. doi:<a href="https://doi.org/10.1007/BFb0029990">10.1007/BFb0029990</a>'
  apa: Rensink, A., &#38; Wehrheim, H. (1997). Dependency-Based Action Refinement.
    In I. Pr{\’{\i}}vara &#38; P. Ruzicka (Eds.), <i>Mathematical Foundations of Computer
    Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August
    25-29, 1997, Proceedings</i> (pp. 468--477). <a href="https://doi.org/10.1007/BFb0029990">https://doi.org/10.1007/BFb0029990</a>
  bibtex: '@inproceedings{Rensink_Wehrheim_1997, series={Lecture Notes in Computer
    Science}, title={Dependency-Based Action Refinement}, DOI={<a href="https://doi.org/10.1007/BFb0029990">10.1007/BFb0029990</a>},
    booktitle={Mathematical Foundations of Computer Science 1997, 22nd International
    Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings}, author={Rensink,
    Arend and Wehrheim, Heike}, editor={Pr{\’{\i}}vara, Igor and Ruzicka, PeterEditors},
    year={1997}, pages={468--477}, collection={Lecture Notes in Computer Science}
    }'
  chicago: Rensink, Arend, and Heike Wehrheim. “Dependency-Based Action Refinement.”
    In <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium,
    MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>, edited by
    Igor Pr{\’{\i}}vara and Peter Ruzicka, 468--477. Lecture Notes in Computer Science,
    1997. <a href="https://doi.org/10.1007/BFb0029990">https://doi.org/10.1007/BFb0029990</a>.
  ieee: A. Rensink and H. Wehrheim, “Dependency-Based Action Refinement,” in <i>Mathematical
    Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava,
    Slovakia, August 25-29, 1997, Proceedings</i>, 1997, pp. 468--477.
  mla: Rensink, Arend, and Heike Wehrheim. “Dependency-Based Action Refinement.” <i>Mathematical
    Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava,
    Slovakia, August 25-29, 1997, Proceedings</i>, edited by Igor Pr{\’{\i}}vara and
    Peter Ruzicka, 1997, pp. 468--477, doi:<a href="https://doi.org/10.1007/BFb0029990">10.1007/BFb0029990</a>.
  short: 'A. Rensink, H. Wehrheim, in: I. Pr{\’{\i}}vara, P. Ruzicka (Eds.), Mathematical
    Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava,
    Slovakia, August 25-29, 1997, Proceedings, 1997, pp. 468--477.'
date_created: 2018-06-14T07:40:10Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1007/BFb0029990
editor:
- first_name: Igor
  full_name: Pr{\'{\i}}vara, Igor
  last_name: Pr{\'{\i}}vara
- first_name: Peter
  full_name: Ruzicka, Peter
  last_name: Ruzicka
page: 468--477
publication: Mathematical Foundations of Computer Science 1997, 22nd International
  Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Dependency-Based Action Refinement
type: conference
user_id: '29719'
year: '1997'
...
---
_id: '3259'
author:
- first_name: Arend
  full_name: Rensink, Arend
  last_name: Rensink
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Rensink A, Wehrheim H. Dependency-Based Action Refinement. In: Pr{\’{\i}}vara
    I, Ruzicka P, eds. <i>Mathematical Foundations of Computer Science 1997, 22nd
    International Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>.
    Lecture Notes in Computer Science. ; 1997:468--477. doi:<a href="https://doi.org/10.1007/BFb0029990">10.1007/BFb0029990</a>'
  apa: Rensink, A., &#38; Wehrheim, H. (1997). Dependency-Based Action Refinement.
    In I. Pr{\’{\i}}vara &#38; P. Ruzicka (Eds.), <i>Mathematical Foundations of Computer
    Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August
    25-29, 1997, Proceedings</i> (pp. 468--477). <a href="https://doi.org/10.1007/BFb0029990">https://doi.org/10.1007/BFb0029990</a>
  bibtex: '@inproceedings{Rensink_Wehrheim_1997, series={Lecture Notes in Computer
    Science}, title={Dependency-Based Action Refinement}, DOI={<a href="https://doi.org/10.1007/BFb0029990">10.1007/BFb0029990</a>},
    booktitle={Mathematical Foundations of Computer Science 1997, 22nd International
    Symposium, MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings}, author={Rensink,
    Arend and Wehrheim, Heike}, editor={Pr{\’{\i}}vara, Igor and Ruzicka, PeterEditors},
    year={1997}, pages={468--477}, collection={Lecture Notes in Computer Science}
    }'
  chicago: Rensink, Arend, and Heike Wehrheim. “Dependency-Based Action Refinement.”
    In <i>Mathematical Foundations of Computer Science 1997, 22nd International Symposium,
    MFCS’97, Bratislava, Slovakia, August 25-29, 1997, Proceedings</i>, edited by
    Igor Pr{\’{\i}}vara and Peter Ruzicka, 468--477. Lecture Notes in Computer Science,
    1997. <a href="https://doi.org/10.1007/BFb0029990">https://doi.org/10.1007/BFb0029990</a>.
  ieee: A. Rensink and H. Wehrheim, “Dependency-Based Action Refinement,” in <i>Mathematical
    Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava,
    Slovakia, August 25-29, 1997, Proceedings</i>, 1997, pp. 468--477.
  mla: Rensink, Arend, and Heike Wehrheim. “Dependency-Based Action Refinement.” <i>Mathematical
    Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava,
    Slovakia, August 25-29, 1997, Proceedings</i>, edited by Igor Pr{\’{\i}}vara and
    Peter Ruzicka, 1997, pp. 468--477, doi:<a href="https://doi.org/10.1007/BFb0029990">10.1007/BFb0029990</a>.
  short: 'A. Rensink, H. Wehrheim, in: I. Pr{\’{\i}}vara, P. Ruzicka (Eds.), Mathematical
    Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava,
    Slovakia, August 25-29, 1997, Proceedings, 1997, pp. 468--477.'
date_created: 2018-06-14T07:43:09Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1007/BFb0029990
editor:
- first_name: Igor
  full_name: Pr{\'{\i}}vara, Igor
  last_name: Pr{\'{\i}}vara
- first_name: Peter
  full_name: Ruzicka, Peter
  last_name: Ruzicka
page: 468--477
publication: Mathematical Foundations of Computer Science 1997, 22nd International
  Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Dependency-Based Action Refinement
type: conference
user_id: '29719'
year: '1997'
...
---
_id: '3029'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: 'Blömer J. Denesting by bounded degree radicals. In: <i>Algorithms — ESA ’97</i>.
    Berlin, Heidelberg: Springer Berlin Heidelberg; 1997:53-63. doi:<a href="https://doi.org/10.1007/3-540-63397-9_5">10.1007/3-540-63397-9_5</a>'
  apa: 'Blömer, J. (1997). Denesting by bounded degree radicals. In <i>Algorithms
    — ESA ’97</i> (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. <a
    href="https://doi.org/10.1007/3-540-63397-9_5">https://doi.org/10.1007/3-540-63397-9_5</a>'
  bibtex: '@inbook{Blömer_1997, place={Berlin, Heidelberg}, title={Denesting by bounded
    degree radicals}, DOI={<a href="https://doi.org/10.1007/3-540-63397-9_5">10.1007/3-540-63397-9_5</a>},
    booktitle={Algorithms — ESA ’97}, publisher={Springer Berlin Heidelberg}, author={Blömer,
    Johannes}, year={1997}, pages={53–63} }'
  chicago: 'Blömer, Johannes. “Denesting by Bounded Degree Radicals.” In <i>Algorithms
    — ESA ’97</i>, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. <a
    href="https://doi.org/10.1007/3-540-63397-9_5">https://doi.org/10.1007/3-540-63397-9_5</a>.'
  ieee: 'J. Blömer, “Denesting by bounded degree radicals,” in <i>Algorithms — ESA
    ’97</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.'
  mla: Blömer, Johannes. “Denesting by Bounded Degree Radicals.” <i>Algorithms — ESA
    ’97</i>, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:<a href="https://doi.org/10.1007/3-540-63397-9_5">10.1007/3-540-63397-9_5</a>.
  short: 'J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin,
    Heidelberg, 1997, pp. 53–63.'
date_created: 2018-06-05T08:30:40Z
date_updated: 2022-01-06T06:58:52Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/3-540-63397-9_5
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-06-05T08:31:35Z
  date_updated: 2018-06-05T08:31:35Z
  file_id: '3030'
  file_name: DenestingByBoundedDegreeRevised.pdf
  file_size: 1656133
  relation: main_file
  success: 1
file_date_updated: 2018-06-05T08:31:35Z
has_accepted_license: '1'
page: 53-63
place: Berlin, Heidelberg
publication: Algorithms — ESA '97
publication_identifier:
  isbn:
  - '9783540633976'
  - '9783540695363'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Denesting by bounded degree radicals
type: book_chapter
user_id: '25078'
year: '1997'
...
---
_id: '3033'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Richard
  full_name: Karp, Richard
  last_name: Karp
- first_name: Emo
  full_name: Welzl, Emo
  last_name: Welzl
citation:
  ama: Blömer J, Karp R, Welzl E. The rank of sparse random matrices over finite fields.
    <i>Random Structures \&#38; Algorithms</i>. 1997;(4):407-419. doi:<a href="https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y">10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>
  apa: Blömer, J., Karp, R., &#38; Welzl, E. (1997). The rank of sparse random matrices
    over finite fields. <i>Random Structures \&#38; Algorithms</i>, (4), 407–419.
    <a href="https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y">https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>
  bibtex: '@article{Blömer_Karp_Welzl_1997, title={The rank of sparse random matrices
    over finite fields}, DOI={<a href="https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y">10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>},
    number={4}, journal={Random Structures \&#38; Algorithms}, author={Blömer, Johannes
    and Karp, Richard and Welzl, Emo}, year={1997}, pages={407–419} }'
  chicago: 'Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random
    Matrices over Finite Fields.” <i>Random Structures \&#38; Algorithms</i>, no.
    4 (1997): 407–19. <a href="https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y">https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>.'
  ieee: J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over
    finite fields,” <i>Random Structures \&#38; Algorithms</i>, no. 4, pp. 407–419,
    1997.
  mla: Blömer, Johannes, et al. “The Rank of Sparse Random Matrices over Finite Fields.”
    <i>Random Structures \&#38; Algorithms</i>, no. 4, 1997, pp. 407–19, doi:<a href="https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y">10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>.
  short: J. Blömer, R. Karp, E. Welzl, Random Structures \&#38; Algorithms (1997)
    407–419.
date_created: 2018-06-05T08:34:49Z
date_updated: 2022-01-06T06:58:52Z
department:
- _id: '64'
doi: 10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
extern: '1'
issue: '4'
keyword:
- random matrices
- rank
- finite fields
page: 407-419
publication: Random Structures \& Algorithms
publication_status: published
status: public
title: The rank of sparse random matrices over finite fields
type: journal_article
user_id: '25078'
year: '1997'
...
---
_id: '18955'
abstract:
- lang: eng
  text: In this paper we present a (randomized) algorithm for maintaining the biconnected
    components of a dynamic planar graph of $n$ vertices under deletions of edges.
    The biconnected components can be maintained under any sequence of edge deletions
    in a total of $O(n log n)$ time, with high probability. This gives $O(log n)$
    amortized time per edge deletion, which improves previous (deterministic) results
    due to Giammarresi and Italiano, where $O(n log^2 n)$ amortized time is needed.
    Our work describes a simplification of the data structures from [GiIt96] and uses
    dynamic perfect hashing to reduce the running time. As in the paper by Giammarresi
    and Italiano, we only need $O(n)$ space. Finally we describe some simply additional
    operations on the decremental data structure. By aid of them this the data structure
    is applicable for finding efficiently a $Delta$-spanning tree in a biconnected
    planar graph with a maximum degree $2Delta-2$ do to Czumaj and Strothmann.
author:
- first_name: Willy-Bernhard
  full_name: Strothmann, Willy-Bernhard
  last_name: Strothmann
- first_name: Tamás
  full_name: Lukovszki, Tamás
  last_name: Lukovszki
citation:
  ama: Strothmann W-B, Lukovszki T. <i>Decremental Biconnectivity on Planar Graphs</i>.
    Paderborn; 1997.
  apa: Strothmann, W.-B., &#38; Lukovszki, T. (1997). <i>Decremental Biconnectivity
    on Planar Graphs</i>. Paderborn.
  bibtex: '@book{Strothmann_Lukovszki_1997, place={Paderborn}, title={Decremental
    Biconnectivity on Planar Graphs}, author={Strothmann, Willy-Bernhard and Lukovszki,
    Tamás}, year={1997} }'
  chicago: Strothmann, Willy-Bernhard, and Tamás Lukovszki. <i>Decremental Biconnectivity
    on Planar Graphs</i>. Paderborn, 1997.
  ieee: W.-B. Strothmann and T. Lukovszki, <i>Decremental Biconnectivity on Planar
    Graphs</i>. Paderborn, 1997.
  mla: Strothmann, Willy-Bernhard, and Tamás Lukovszki. <i>Decremental Biconnectivity
    on Planar Graphs</i>. 1997.
  short: W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs,
    Paderborn, 1997.
date_created: 2020-09-03T12:59:56Z
date_updated: 2022-01-06T06:53:55Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-09-03T12:59:44Z
  date_updated: 2020-09-03T12:59:44Z
  file_id: '18957'
  file_name: pub-hni-901.pdf
  file_size: 222106
  relation: main_file
  success: 1
file_date_updated: 2020-09-03T12:59:44Z
has_accepted_license: '1'
language:
- iso: eng
place: Paderborn
status: public
title: Decremental Biconnectivity on Planar Graphs
type: report
user_id: '15415'
year: '1997'
...
---
_id: '18575'
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Markus
  full_name: Denny, Markus
  last_name: Denny
citation:
  ama: 'Sohler C, Denny M. Encoding a Triangulation as a Permutation of its Point
    Set. In: <i>Proceedings of the 9th Canadian Conference on Computational Geometry</i>.
    ; 1997:39-43.'
  apa: Sohler, C., &#38; Denny, M. (1997). Encoding a Triangulation as a Permutation
    of its Point Set. In <i>Proceedings of the 9th Canadian Conference on Computational
    Geometry</i> (pp. 39–43).
  bibtex: '@inproceedings{Sohler_Denny_1997, title={Encoding a Triangulation as a
    Permutation of its Point Set}, booktitle={Proceedings of the 9th Canadian Conference
    on Computational Geometry}, author={Sohler, Christian and Denny, Markus}, year={1997},
    pages={39–43} }'
  chicago: Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation
    of Its Point Set.” In <i>Proceedings of the 9th Canadian Conference on Computational
    Geometry</i>, 39–43, 1997.
  ieee: C. Sohler and M. Denny, “Encoding a Triangulation as a Permutation of its
    Point Set,” in <i>Proceedings of the 9th Canadian Conference on Computational
    Geometry</i>, 1997, pp. 39–43.
  mla: Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation
    of Its Point Set.” <i>Proceedings of the 9th Canadian Conference on Computational
    Geometry</i>, 1997, pp. 39–43.
  short: 'C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational
    Geometry, 1997, pp. 39–43.'
date_created: 2020-08-28T14:14:57Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
language:
- iso: eng
page: 39-43
publication: Proceedings of the 9th Canadian Conference on Computational Geometry
status: public
title: Encoding a Triangulation as a Permutation of its Point Set
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '2175'
author:
- first_name: Stefan
  full_name: Bock, Stefan
  last_name: Bock
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the
    (n, d)-Torus. In: <i>IPPS</i>. IEEE Computer Society; 1997:326--332.'
  apa: Bock, S., Meyer auf der Heide, F., &#38; Scheideler, C. (1997). Optimal Wormhole
    Routing in the (n, d)-Torus. In <i>IPPS</i> (pp. 326--332). IEEE Computer Society.
  bibtex: '@inproceedings{Bock_Meyer auf der Heide_Scheideler_1997, title={Optimal
    Wormhole Routing in the (n, d)-Torus}, booktitle={IPPS}, publisher={IEEE Computer
    Society}, author={Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler,
    Christian}, year={1997}, pages={326--332} }'
  chicago: Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler.
    “Optimal Wormhole Routing in the (n, d)-Torus.” In <i>IPPS</i>, 326--332. IEEE
    Computer Society, 1997.
  ieee: S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing
    in the (n, d)-Torus,” in <i>IPPS</i>, 1997, pp. 326--332.
  mla: Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” <i>IPPS</i>,
    IEEE Computer Society, 1997, pp. 326--332.
  short: 'S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer
    Society, 1997, pp. 326--332.'
date_created: 2018-04-03T09:11:47Z
date_updated: 2022-01-06T06:55:13Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T07:07:20Z
  date_updated: 2018-04-12T07:11:50Z
  file_id: '2284'
  file_name: IPPS97.pdf
  file_size: 88749
  relation: main_file
file_date_updated: 2018-04-12T07:11:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 326--332
publication: IPPS
publisher: IEEE Computer Society
status: public
title: Optimal Wormhole Routing in the (n, d)-Torus
type: conference
urn: '21759'
user_id: '14955'
year: '1997'
...
---
_id: '2179'
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. In: <i>SPAA</i>. ; 1997:170--179.'
  apa: Flammini, M., &#38; Scheideler, C. (1997). Simple, Efficient Routing Schemes
    for All-Optical Networks. In <i>SPAA</i> (pp. 170--179).
  bibtex: '@inproceedings{Flammini_Scheideler_1997, title={Simple, Efficient Routing
    Schemes for All-Optical Networks}, booktitle={SPAA}, author={Flammini, Michele
    and Scheideler, Christian}, year={1997}, pages={170--179} }'
  chicago: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing
    Schemes for All-Optical Networks.” In <i>SPAA</i>, 170--179, 1997.
  ieee: M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical
    Networks,” in <i>SPAA</i>, 1997, pp. 170--179.
  mla: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes
    for All-Optical Networks.” <i>SPAA</i>, 1997, pp. 170--179.
  short: 'M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.'
date_created: 2018-04-03T09:17:10Z
date_updated: 2022-01-06T06:55:13Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T07:06:34Z
  date_updated: 2018-04-12T07:11:32Z
  file_id: '2283'
  file_name: SPAA97.pdf
  file_size: 365709
  relation: main_file
file_date_updated: 2018-04-12T07:11:32Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 170--179
publication: SPAA
status: public
title: Simple, Efficient Routing Schemes for All-Optical Networks
type: conference
urn: '21792'
user_id: '14955'
year: '1997'
...
---
_id: '7795'
citation:
  ama: 'Engels G, ed. <i>Themenheft: Softwaretechnik</i>. Vol 12. Berlin/Heidelberg:
    Springer; 1997. doi:<a href="http://dx.doi.org/10.1007/s004500050085">http://dx.doi.org/10.1007/s004500050085</a>'
  apa: 'Engels, G. (Ed.). (1997). <i>Themenheft: Softwaretechnik</i> (Vol. 12). Berlin/Heidelberg:
    Springer. <a href="http://dx.doi.org/10.1007/s004500050085">http://dx.doi.org/10.1007/s004500050085</a>'
  bibtex: '@book{Engels_1997, place={Berlin/Heidelberg}, series={Informatik: Forschung
    und Entwicklung}, title={Themenheft: Softwaretechnik}, volume={12}, DOI={<a href="http://dx.doi.org/10.1007/s004500050085">http://dx.doi.org/10.1007/s004500050085</a>},
    number={4}, publisher={Springer}, year={1997}, collection={Informatik: Forschung
    und Entwicklung} }'
  chicago: 'Engels, Gregor, ed. <i>Themenheft: Softwaretechnik</i>. Vol. 12. Informatik:
    Forschung Und Entwicklung. Berlin/Heidelberg: Springer, 1997. <a href="http://dx.doi.org/10.1007/s004500050085">http://dx.doi.org/10.1007/s004500050085</a>.'
  ieee: 'G. Engels, Ed., <i>Themenheft: Softwaretechnik</i>, vol. 12, no. 4. Berlin/Heidelberg:
    Springer, 1997.'
  mla: 'Engels, Gregor, editor. <i>Themenheft: Softwaretechnik</i>. Vol. 12, no. 4,
    Springer, 1997, doi:<a href="http://dx.doi.org/10.1007/s004500050085">http://dx.doi.org/10.1007/s004500050085</a>.'
  short: 'G. Engels, ed., Themenheft: Softwaretechnik, Springer, Berlin/Heidelberg,
    1997.'
date_created: 2019-02-19T19:15:50Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1007/s004500050085
editor:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
intvolume: '        12'
issue: '4'
language:
- iso: eng
place: Berlin/Heidelberg
publisher: Springer
series_title: 'Informatik: Forschung und Entwicklung'
status: public
title: 'Themenheft: Softwaretechnik'
type: conference_editor
user_id: '52534'
volume: 12
year: '1997'
...
---
_id: '7839'
abstract:
- lang: eng
  text: The idea of a combined reference model- and view-based specification approach
    has been proposed recently in the software engineering community. In this paper
    we present a specification technique based on graph transformations which supports
    such a development approach. The use of graphs and graph transformations supports
    an intuitive understanding and an integration of static and dynamic aspects on
    a well-defined semantical base. On this background, formal notions of view and
    view relation are developed and the behaviour of views is described by a loose
    semantics. We define a construction for automatic view integration which assumes
    that the dependencies between different views are described by a reference model.
    The views and the reference model are kept consistent manually, which is the task
    of a model manager. All concepts and results are illustrated at the well-known
    example of a banking system.
author:
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Reiko
  full_name: Heckel, Reiko
  last_name: Heckel
- first_name: Gabriele
  full_name: Taentzer, Gabriele
  last_name: Taentzer
- first_name: Hartmut
  full_name: Ehrig, Hartmut
  last_name: Ehrig
citation:
  ama: 'Engels G, Heckel R, Taentzer G, Ehrig H. A View-Oriented Approach to System
    Modelling Using Graph Transformations. In: Jazayeri M, Schauer H, eds. <i>Proceedings
    European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)</i>.
    Vol 1301. Berlin/Heidelberg: Springer; 1997:327-343. doi:<a href="http://dx.doi.org/10.1007/3-540-63531-9">http://dx.doi.org/10.1007/3-540-63531-9</a>'
  apa: 'Engels, G., Heckel, R., Taentzer, G., &#38; Ehrig, H. (1997). A View-Oriented
    Approach to System Modelling Using Graph Transformations. In M. Jazayeri &#38;
    H. Schauer (Eds.), <i>Proceedings European Software Engineering Conference (ESEC
    1997), Zürich (Switzerland)</i> (Vol. 1301, pp. 327–343). Berlin/Heidelberg: Springer.
    <a href="http://dx.doi.org/10.1007/3-540-63531-9">http://dx.doi.org/10.1007/3-540-63531-9</a>'
  bibtex: '@inproceedings{Engels_Heckel_Taentzer_Ehrig_1997, place={Berlin/Heidelberg},
    title={A View-Oriented Approach to System Modelling Using Graph Transformations},
    volume={1301}, DOI={<a href="http://dx.doi.org/10.1007/3-540-63531-9">http://dx.doi.org/10.1007/3-540-63531-9</a>},
    booktitle={Proceedings European Software Engineering Conference (ESEC 1997), Zürich
    (Switzerland)}, publisher={Springer}, author={Engels, Gregor and Heckel, Reiko
    and Taentzer, Gabriele and Ehrig, Hartmut}, editor={Jazayeri, M. and Schauer,
    H.Editors}, year={1997}, pages={327–343} }'
  chicago: 'Engels, Gregor, Reiko Heckel, Gabriele Taentzer, and Hartmut Ehrig. “A
    View-Oriented Approach to System Modelling Using Graph Transformations.” In <i>Proceedings
    European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)</i>,
    edited by M. Jazayeri and H. Schauer, 1301:327–43. Berlin/Heidelberg: Springer,
    1997. <a href="http://dx.doi.org/10.1007/3-540-63531-9">http://dx.doi.org/10.1007/3-540-63531-9</a>.'
  ieee: G. Engels, R. Heckel, G. Taentzer, and H. Ehrig, “A View-Oriented Approach
    to System Modelling Using Graph Transformations,” in <i>Proceedings European Software
    Engineering Conference (ESEC 1997), Zürich (Switzerland)</i>, 1997, vol. 1301,
    pp. 327–343.
  mla: Engels, Gregor, et al. “A View-Oriented Approach to System Modelling Using
    Graph Transformations.” <i>Proceedings European Software Engineering Conference
    (ESEC 1997), Zürich (Switzerland)</i>, edited by M. Jazayeri and H. Schauer, vol.
    1301, Springer, 1997, pp. 327–43, doi:<a href="http://dx.doi.org/10.1007/3-540-63531-9">http://dx.doi.org/10.1007/3-540-63531-9</a>.
  short: 'G. Engels, R. Heckel, G. Taentzer, H. Ehrig, in: M. Jazayeri, H. Schauer
    (Eds.), Proceedings European Software Engineering Conference (ESEC 1997), Zürich
    (Switzerland), Springer, Berlin/Heidelberg, 1997, pp. 327–343.'
date_created: 2019-02-20T14:06:52Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1007/3-540-63531-9
editor:
- first_name: M.
  full_name: Jazayeri, M.
  last_name: Jazayeri
- first_name: H.
  full_name: Schauer, H.
  last_name: Schauer
intvolume: '      1301'
language:
- iso: eng
page: 327-343
place: Berlin/Heidelberg
publication: Proceedings European Software Engineering Conference (ESEC 1997), Zürich
  (Switzerland)
publisher: Springer
status: public
title: A View-Oriented Approach to System Modelling Using Graph Transformations
type: conference
user_id: '52534'
volume: 1301
year: '1997'
...
---
_id: '7840'
abstract:
- lang: ger
  text: 'Vorteile von Laserkristallen in Slab-Geometrie gegenüber Stäben liegen in
    einer Reduktion der thermisch induzierten Linsenwirkung und der spannungsinduzierten
    Depolarisation durch einen zick-zack-förmigen Strahlverlauf innerhalb des Kristalls.
    Durch die Analyse der durch die Anordnung der Pumpquellen und die Dotierungskonzentration
    bestimmten Temperatur- und Spannungsverteilungen mit Hilfe eines Finite-Element-Modells
    und die Berechnung der resultierenden optischen Eigenschaften lassen sich die
    genannten Zielgrößen optimieren. Die Verfahren wurden auf am Laser Zentrum Hannover
    e.V. entwickelte Nd:YAG-Stab- und Slablaser angewandt und ermöglichten die Entwicklung
    diodengepumpter Festkörperlaser-Systeme mit Ausgangsleistungen von mehr als 750W
    bei guter Strahlqualität. Modellerweiterungen unter Berücksichtigung der Wechselwirkung
    zwischen Lasermoden und aktivem Material werden diskutiert. Diese Arbeit wird
    gefördert durch das BMBF, FKZ: 13 N 6361'
author:
- first_name: Ralph
  full_name: Depke, Ralph
  last_name: Depke
- first_name: Stefan
  full_name: Knoke, Stefan
  last_name: Knoke
- first_name: Wolfram
  full_name: Schöne, Wolfram
  last_name: Schöne
- first_name: Andreas
  full_name: Tünnermann, Andreas
  last_name: Tünnermann
- first_name: H.
  full_name: Welling, H.
  last_name: Welling
citation:
  ama: 'Depke R, Knoke S, Schöne W, Tünnermann A, Welling H. Thermooptische Effekte
    in Nd:YAG-Slablasern. In: <i>Verhandlungen Der Deutschen Physikalischen Gesellschaft</i>.
    Vol 32. Weinheim, Germany: Physik-Verlag; 1997.'
  apa: 'Depke, R., Knoke, S., Schöne, W., Tünnermann, A., &#38; Welling, H. (1997).
    Thermooptische Effekte in Nd:YAG-Slablasern. In <i>Verhandlungen der Deutschen
    Physikalischen Gesellschaft</i> (Vol. 32). Weinheim, Germany: Physik-Verlag.'
  bibtex: '@inproceedings{Depke_Knoke_Schöne_Tünnermann_Welling_1997, place={Weinheim,
    Germany}, title={Thermooptische Effekte in Nd:YAG-Slablasern}, volume={32}, number={3},
    booktitle={Verhandlungen der Deutschen Physikalischen Gesellschaft}, publisher={Physik-Verlag},
    author={Depke, Ralph and Knoke, Stefan and Schöne, Wolfram and Tünnermann, Andreas
    and Welling, H.}, year={1997} }'
  chicago: 'Depke, Ralph, Stefan Knoke, Wolfram Schöne, Andreas Tünnermann, and H.
    Welling. “Thermooptische Effekte in Nd:YAG-Slablasern.” In <i>Verhandlungen Der
    Deutschen Physikalischen Gesellschaft</i>, Vol. 32. Weinheim, Germany: Physik-Verlag,
    1997.'
  ieee: R. Depke, S. Knoke, W. Schöne, A. Tünnermann, and H. Welling, “Thermooptische
    Effekte in Nd:YAG-Slablasern,” in <i>Verhandlungen der Deutschen Physikalischen
    Gesellschaft</i>, 1997, vol. 32, no. 3.
  mla: Depke, Ralph, et al. “Thermooptische Effekte in Nd:YAG-Slablasern.” <i>Verhandlungen
    Der Deutschen Physikalischen Gesellschaft</i>, vol. 32, no. 3, Physik-Verlag,
    1997.
  short: 'R. Depke, S. Knoke, W. Schöne, A. Tünnermann, H. Welling, in: Verhandlungen
    Der Deutschen Physikalischen Gesellschaft, Physik-Verlag, Weinheim, Germany, 1997.'
date_created: 2019-02-20T14:07:44Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
intvolume: '        32'
issue: '3'
language:
- iso: eng
place: Weinheim, Germany
publication: Verhandlungen der Deutschen Physikalischen Gesellschaft
publisher: Physik-Verlag
status: public
title: Thermooptische Effekte in Nd:YAG-Slablasern
type: conference
user_id: '52534'
volume: 32
year: '1997'
...
---
_id: '7841'
author:
- first_name: Reiko
  full_name: Heckel, Reiko
  last_name: Heckel
- first_name: Hartmut
  full_name: Ehrig, Hartmut
  last_name: Ehrig
- first_name: Uwe
  full_name: Wolter, Uwe
  last_name: Wolter
- first_name: Andrea
  full_name: Corradini, Andrea
  last_name: Corradini
citation:
  ama: 'Heckel R, Ehrig H, Wolter U, Corradini A. Integrating the Specification Techniques
    of Graph Transformation and Temporal Logic. In: <i>Proceedings of the 22nd International
    Symposium on Mathematical Foundations of Computer Science (MFCS 1997), Bratislava
    (Slovakia)</i>. LNCS. London, UK: Springer; 1997:219-228. doi:<a href="http://dx.doi.org/10.1007/BFb0029965">http://dx.doi.org/10.1007/BFb0029965</a>'
  apa: 'Heckel, R., Ehrig, H., Wolter, U., &#38; Corradini, A. (1997). Integrating
    the Specification Techniques of Graph Transformation and Temporal Logic. In <i>Proceedings
    of the 22nd International Symposium on Mathematical Foundations of Computer Science
    (MFCS 1997), Bratislava (Slovakia)</i> (pp. 219–228). London, UK: Springer. <a
    href="http://dx.doi.org/10.1007/BFb0029965">http://dx.doi.org/10.1007/BFb0029965</a>'
  bibtex: '@inproceedings{Heckel_Ehrig_Wolter_Corradini_1997, place={London, UK},
    series={LNCS}, title={Integrating the Specification Techniques of Graph Transformation
    and Temporal Logic}, DOI={<a href="http://dx.doi.org/10.1007/BFb0029965">http://dx.doi.org/10.1007/BFb0029965</a>},
    booktitle={Proceedings of the 22nd International Symposium on Mathematical Foundations
    of Computer Science (MFCS 1997), Bratislava (Slovakia)}, publisher={Springer},
    author={Heckel, Reiko and Ehrig, Hartmut and Wolter, Uwe and Corradini, Andrea},
    year={1997}, pages={219–228}, collection={LNCS} }'
  chicago: 'Heckel, Reiko, Hartmut Ehrig, Uwe Wolter, and Andrea Corradini. “Integrating
    the Specification Techniques of Graph Transformation and Temporal Logic.” In <i>Proceedings
    of the 22nd International Symposium on Mathematical Foundations of Computer Science
    (MFCS 1997), Bratislava (Slovakia)</i>, 219–28. LNCS. London, UK: Springer, 1997.
    <a href="http://dx.doi.org/10.1007/BFb0029965">http://dx.doi.org/10.1007/BFb0029965</a>.'
  ieee: R. Heckel, H. Ehrig, U. Wolter, and A. Corradini, “Integrating the Specification
    Techniques of Graph Transformation and Temporal Logic,” in <i>Proceedings of the
    22nd International Symposium on Mathematical Foundations of Computer Science (MFCS
    1997), Bratislava (Slovakia)</i>, 1997, pp. 219–228.
  mla: Heckel, Reiko, et al. “Integrating the Specification Techniques of Graph Transformation
    and Temporal Logic.” <i>Proceedings of the 22nd International Symposium on Mathematical
    Foundations of Computer Science (MFCS 1997), Bratislava (Slovakia)</i>, Springer,
    1997, pp. 219–28, doi:<a href="http://dx.doi.org/10.1007/BFb0029965">http://dx.doi.org/10.1007/BFb0029965</a>.
  short: 'R. Heckel, H. Ehrig, U. Wolter, A. Corradini, in: Proceedings of the 22nd
    International Symposium on Mathematical Foundations of Computer Science (MFCS
    1997), Bratislava (Slovakia), Springer, London, UK, 1997, pp. 219–228.'
date_created: 2019-02-20T14:08:31Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1007/BFb0029965
language:
- iso: eng
page: 219-228
place: London, UK
publication: Proceedings of the 22nd International Symposium on Mathematical Foundations
  of Computer Science (MFCS 1997), Bratislava (Slovakia)
publisher: Springer
series_title: LNCS
status: public
title: Integrating the Specification Techniques of Graph Transformation and Temporal
  Logic
type: conference
user_id: '52534'
year: '1997'
...
---
_id: '7842'
author:
- first_name: Stefan
  full_name: Knoke, Stefan
  last_name: Knoke
- first_name: Ralph
  full_name: Depke, Ralph
  last_name: Depke
- first_name: Wolfram
  full_name: Schöne, Wolfram
  last_name: Schöne
- first_name: O.S.
  full_name: Brozek, O.S.
  last_name: Brozek
- first_name: Andreas
  full_name: Tünnermann, Andreas
  last_name: Tünnermann
- first_name: H.
  full_name: Welling, H.
  last_name: Welling
citation:
  ama: 'Knoke S, Depke R, Schöne W, Brozek OS, Tünnermann A, Welling H. Einfrequenzbetrieb
    von Nd:YAG-Stablasersystemen hoher Ausgangsleistung. In: <i>Verhandlungen Der
    Deutschen Physikalischen Gesellschaft, Weinheim (Germany)</i>. Vol 32. Physik-Verlag;
    1997.'
  apa: Knoke, S., Depke, R., Schöne, W., Brozek, O. S., Tünnermann, A., &#38; Welling,
    H. (1997). Einfrequenzbetrieb von Nd:YAG-Stablasersystemen hoher Ausgangsleistung.
    In <i>Verhandlungen der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)</i>
    (Vol. 32). Physik-Verlag.
  bibtex: '@inproceedings{Knoke_Depke_Schöne_Brozek_Tünnermann_Welling_1997, title={Einfrequenzbetrieb
    von Nd:YAG-Stablasersystemen hoher Ausgangsleistung}, volume={32}, number={3},
    booktitle={Verhandlungen der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)},
    publisher={Physik-Verlag}, author={Knoke, Stefan and Depke, Ralph and Schöne,
    Wolfram and Brozek, O.S. and Tünnermann, Andreas and Welling, H.}, year={1997}
    }'
  chicago: Knoke, Stefan, Ralph Depke, Wolfram Schöne, O.S. Brozek, Andreas Tünnermann,
    and H. Welling. “Einfrequenzbetrieb von Nd:YAG-Stablasersystemen Hoher Ausgangsleistung.”
    In <i>Verhandlungen Der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)</i>,
    Vol. 32. Physik-Verlag, 1997.
  ieee: S. Knoke, R. Depke, W. Schöne, O. S. Brozek, A. Tünnermann, and H. Welling,
    “Einfrequenzbetrieb von Nd:YAG-Stablasersystemen hoher Ausgangsleistung,” in <i>Verhandlungen
    der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)</i>, 1997, vol.
    32, no. 3.
  mla: Knoke, Stefan, et al. “Einfrequenzbetrieb von Nd:YAG-Stablasersystemen Hoher
    Ausgangsleistung.” <i>Verhandlungen Der Deutschen Physikalischen Gesellschaft,
    Weinheim (Germany)</i>, vol. 32, no. 3, Physik-Verlag, 1997.
  short: 'S. Knoke, R. Depke, W. Schöne, O.S. Brozek, A. Tünnermann, H. Welling, in:
    Verhandlungen Der Deutschen Physikalischen Gesellschaft, Weinheim (Germany), Physik-Verlag,
    1997.'
date_created: 2019-02-20T14:09:17Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
intvolume: '        32'
issue: '3'
language:
- iso: eng
publication: Verhandlungen der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)
publisher: Physik-Verlag
status: public
title: Einfrequenzbetrieb von Nd:YAG-Stablasersystemen hoher Ausgangsleistung
type: conference
user_id: '52534'
volume: 32
year: '1997'
...