---
_id: '19616'
author:
- first_name: Kay
  full_name: Salzwedel, Kay
  last_name: Salzwedel
citation:
  ama: Salzwedel K. <i>Data Distribution Algorithms for Storage Networks</i>. Vol
    153. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2004.
  apa: Salzwedel, K. (2004). <i>Data Distribution Algorithms for Storage Networks</i>
    (Vol. 153). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
  bibtex: '@book{Salzwedel_2004, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, title={Data Distribution Algorithms for Storage Networks}, volume={153},
    publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Salzwedel,
    Kay}, year={2004}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn} }'
  chicago: Salzwedel, Kay. <i>Data Distribution Algorithms for Storage Networks</i>.
    Vol. 153. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2004.
  ieee: K. Salzwedel, <i>Data Distribution Algorithms for Storage Networks</i>, vol.
    153. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.
  mla: Salzwedel, Kay. <i>Data Distribution Algorithms for Storage Networks</i>. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2004.
  short: K. Salzwedel, Data Distribution Algorithms for Storage Networks, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2004.
date_created: 2020-09-22T08:37:39Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '26'
- _id: '63'
intvolume: '       153'
language:
- iso: eng
publication_identifier:
  isbn:
  - 3-935433-62-X
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
  link:
  - relation: confirmation
    url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20040101385
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: Data Distribution Algorithms for Storage Networks
type: dissertation
user_id: '5786'
volume: 153
year: '2004'
...
---
_id: '19692'
author:
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
- first_name: Dimo
  full_name: Brockhoff, Dimo
  last_name: Brockhoff
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Matthias
  full_name: Englert, Matthias
  last_name: Englert
- first_name: Christian
  full_name: Gunia, Christian
  last_name: Gunia
- first_name: Oliver
  full_name: Heering, Oliver
  last_name: Heering
- first_name: Thomas
  full_name: Jansen, Thomas
  last_name: Jansen
- first_name: Michael
  full_name: Leifhelm, Michael
  last_name: Leifhelm
- first_name: Kai
  full_name: Plociennik, Kai
  last_name: Plociennik
- first_name: Heiko
  full_name: Röglin, Heiko
  last_name: Röglin
- first_name: Andrea
  full_name: Schweer, Andrea
  last_name: Schweer
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
- first_name: Stefan
  full_name: Tannenbaum, Stefan
  last_name: Tannenbaum
- first_name: Ingo
  full_name: Wegener, Ingo
  last_name: Wegener
citation:
  ama: 'Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary
    Algorithms as Adaptation Schemes. In: <i>Parallel Problem Solving from Nature
    - PPSN VIII</i>. Berlin, Heidelberg; 2004. doi:<a href="https://doi.org/10.1007/978-3-540-30217-9_4">10.1007/978-3-540-30217-9_4</a>'
  apa: 'Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O.,
    … Wegener, I. (2004). The Ising Model: Simple Evolutionary Algorithms as Adaptation
    Schemes. In <i>Parallel Problem Solving from Nature - PPSN VIII</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/978-3-540-30217-9_4">https://doi.org/10.1007/978-3-540-30217-9_4</a>'
  bibtex: '@inproceedings{Briest_Brockhoff_Degener_Englert_Gunia_Heering_Jansen_Leifhelm_Plociennik_Röglin_et
    al._2004, place={Berlin, Heidelberg}, title={The Ising Model: Simple Evolutionary
    Algorithms as Adaptation Schemes}, DOI={<a href="https://doi.org/10.1007/978-3-540-30217-9_4">10.1007/978-3-540-30217-9_4</a>},
    booktitle={Parallel Problem Solving from Nature - PPSN VIII}, author={Briest,
    Patrick and Brockhoff, Dimo and Degener, Bastian and Englert, Matthias and Gunia,
    Christian and Heering, Oliver and Jansen, Thomas and Leifhelm, Michael and Plociennik,
    Kai and Röglin, Heiko and et al.}, year={2004} }'
  chicago: 'Briest, Patrick, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian
    Gunia, Oliver Heering, Thomas Jansen, et al. “The Ising Model: Simple Evolutionary
    Algorithms as Adaptation Schemes.” In <i>Parallel Problem Solving from Nature
    - PPSN VIII</i>. Berlin, Heidelberg, 2004. <a href="https://doi.org/10.1007/978-3-540-30217-9_4">https://doi.org/10.1007/978-3-540-30217-9_4</a>.'
  ieee: 'P. Briest <i>et al.</i>, “The Ising Model: Simple Evolutionary Algorithms
    as Adaptation Schemes,” in <i>Parallel Problem Solving from Nature - PPSN VIII</i>,
    2004.'
  mla: 'Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as
    Adaptation Schemes.” <i>Parallel Problem Solving from Nature - PPSN VIII</i>,
    2004, doi:<a href="https://doi.org/10.1007/978-3-540-30217-9_4">10.1007/978-3-540-30217-9_4</a>.'
  short: 'P. Briest, D. Brockhoff, B. Degener, M. Englert, C. Gunia, O. Heering, T.
    Jansen, M. Leifhelm, K. Plociennik, H. Röglin, A. Schweer, D. Sudholt, S. Tannenbaum,
    I. Wegener, in: Parallel Problem Solving from Nature - PPSN VIII, Berlin, Heidelberg,
    2004.'
date_created: 2020-09-25T10:41:37Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-540-30217-9_4
language:
- iso: eng
place: Berlin, Heidelberg
publication: Parallel Problem Solving from Nature - PPSN VIII
publication_identifier:
  isbn:
  - '9783540230922'
  - '9783540302179'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: 'The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes'
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19693'
author:
- first_name: Andrea
  full_name: Schweer, Andrea
  last_name: Schweer
- first_name: Michael
  full_name: Leifhelm, Michael
  last_name: Leifhelm
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Oliver
  full_name: Heering, Oliver
  last_name: Heering
- first_name: Stefan
  full_name: Tannenbaum, Stefan
  last_name: Tannenbaum
- first_name: Heiko
  full_name: Röglin, Heiko
  last_name: Röglin
- first_name: Christian
  full_name: Gunia, Christian
  last_name: Gunia
- first_name: Matthias
  full_name: Englert, Matthias
  last_name: Englert
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
- first_name: Dimo
  full_name: Brockhoff, Dimo
  last_name: Brockhoff
- first_name: Ingo
  full_name: Wegener, Ingo
  last_name: Wegener
- first_name: Thomas
  full_name: Jansen, Thomas
  last_name: Jansen
- first_name: Kai
  full_name: Plociennik, Kai
  last_name: Plociennik
citation:
  ama: 'Schweer A, Leifhelm M, Degener B, et al. Experimental Supplements to the Theoretical
    Analysis of EAs on Problems from Combinatorial Optimization. In: <i>Parallel Problem
    Solving from Nature - PPSN VIII</i>. ; 2004.'
  apa: Schweer, A., Leifhelm, M., Degener, B., Heering, O., Tannenbaum, S., Röglin,
    H., … Plociennik, K. (2004). Experimental Supplements to the Theoretical Analysis
    of EAs on Problems from Combinatorial Optimization. In <i>Parallel Problem Solving
    from Nature - PPSN VIII</i>.
  bibtex: '@inproceedings{Schweer_Leifhelm_Degener_Heering_Tannenbaum_Röglin_Gunia_Englert_Briest_Sudholt_et
    al._2004, title={Experimental Supplements to the Theoretical Analysis of EAs on
    Problems from Combinatorial Optimization}, booktitle={Parallel Problem Solving
    from Nature - PPSN VIII}, author={Schweer, Andrea and Leifhelm, Michael and Degener,
    Bastian and Heering, Oliver and Tannenbaum, Stefan and Röglin, Heiko and Gunia,
    Christian and Englert, Matthias and Briest, Patrick and Sudholt, Dirk and et al.},
    year={2004} }'
  chicago: Schweer, Andrea, Michael Leifhelm, Bastian Degener, Oliver Heering, Stefan
    Tannenbaum, Heiko Röglin, Christian Gunia, et al. “Experimental Supplements to
    the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.”
    In <i>Parallel Problem Solving from Nature - PPSN VIII</i>, 2004.
  ieee: A. Schweer <i>et al.</i>, “Experimental Supplements to the Theoretical Analysis
    of EAs on Problems from Combinatorial Optimization,” in <i>Parallel Problem Solving
    from Nature - PPSN VIII</i>, 2004.
  mla: Schweer, Andrea, et al. “Experimental Supplements to the Theoretical Analysis
    of EAs on Problems from Combinatorial Optimization.” <i>Parallel Problem Solving
    from Nature - PPSN VIII</i>, 2004.
  short: 'A. Schweer, M. Leifhelm, B. Degener, O. Heering, S. Tannenbaum, H. Röglin,
    C. Gunia, M. Englert, P. Briest, D. Sudholt, D. Brockhoff, I. Wegener, T. Jansen,
    K. Plociennik, in: Parallel Problem Solving from Nature - PPSN VIII, 2004.'
date_created: 2020-09-25T10:45:22Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
publication: Parallel Problem Solving from Nature - PPSN VIII
publication_status: published
status: public
title: Experimental Supplements to the Theoretical Analysis of EAs on Problems from
  Combinatorial Optimization
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19800'
abstract:
- lang: eng
  text: Redundant arrays of independent disks, also called RAID arrays, have gained
    a wide popularity in the last twenty years. Most of the disks used in the server
    market are currently based on RAID technology. The primary reason for introducing
    RAID technology in 1988 has been the fact that large disk systems have become
    much slower and more expensive than the connection of a large number of inexpensive
    disks and the use of them as an array. The times seem to repeat themselves. Today,
    large scale RAID arrays have become incredible big and expensive. It seems that
    it makes sense to replace them by a collection of smaller and inexpensive arrays
    of JBODs or mid-ranged RAID arrays. In this paper we will show that combining
    these systems with state-of-the-art virtualization technology can lead to a system
    that is faster and less expensive than an enterprise storage system, while being
    as easy to manage and as reliable. Therefore we will outline the most important
    features of storage management and compare there realization in enterprise class
    storage systems and in current and future virtualization environments.
author:
- first_name: André
  full_name: Brinkmann, André
  last_name: Brinkmann
- first_name: Kay
  full_name: Salzwedel, Kay
  last_name: Salzwedel
- first_name: Mario
  full_name: Vodisek, Mario
  last_name: Vodisek
citation:
  ama: 'Brinkmann A, Salzwedel K, Vodisek M. A case for virtualized arrays of RAID.
    In: <i>Proceedings of the International Workshop on Storage Network Architecture
    and Parallel I/Os - SNAPI ’04</i>. ; 2004:9-16. doi:<a href="https://doi.org/10.1145/1162628.1162630">10.1145/1162628.1162630</a>'
  apa: Brinkmann, A., Salzwedel, K., &#38; Vodisek, M. (2004). A case for virtualized
    arrays of RAID. In <i>Proceedings of the international workshop on Storage network
    architecture and parallel I/Os - SNAPI ’04</i> (pp. 9–16). <a href="https://doi.org/10.1145/1162628.1162630">https://doi.org/10.1145/1162628.1162630</a>
  bibtex: '@inproceedings{Brinkmann_Salzwedel_Vodisek_2004, title={A case for virtualized
    arrays of RAID}, DOI={<a href="https://doi.org/10.1145/1162628.1162630">10.1145/1162628.1162630</a>},
    booktitle={Proceedings of the international workshop on Storage network architecture
    and parallel I/Os - SNAPI ’04}, author={Brinkmann, André and Salzwedel, Kay and
    Vodisek, Mario}, year={2004}, pages={9–16} }'
  chicago: Brinkmann, André, Kay Salzwedel, and Mario Vodisek. “A Case for Virtualized
    Arrays of RAID.” In <i>Proceedings of the International Workshop on Storage Network
    Architecture and Parallel I/Os - SNAPI ’04</i>, 9–16, 2004. <a href="https://doi.org/10.1145/1162628.1162630">https://doi.org/10.1145/1162628.1162630</a>.
  ieee: A. Brinkmann, K. Salzwedel, and M. Vodisek, “A case for virtualized arrays
    of RAID,” in <i>Proceedings of the international workshop on Storage network architecture
    and parallel I/Os - SNAPI ’04</i>, 2004, pp. 9–16.
  mla: Brinkmann, André, et al. “A Case for Virtualized Arrays of RAID.” <i>Proceedings
    of the International Workshop on Storage Network Architecture and Parallel I/Os
    - SNAPI ’04</i>, 2004, pp. 9–16, doi:<a href="https://doi.org/10.1145/1162628.1162630">10.1145/1162628.1162630</a>.
  short: 'A. Brinkmann, K. Salzwedel, M. Vodisek, in: Proceedings of the International
    Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04, 2004,
    pp. 9–16.'
date_created: 2020-09-30T12:39:30Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1145/1162628.1162630
language:
- iso: eng
page: 9-16
publication: Proceedings of the international workshop on Storage network architecture
  and parallel I/Os - SNAPI '04
publication_status: published
status: public
title: A case for virtualized arrays of RAID
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19807'
abstract:
- lang: eng
  text: 'Wireless connectivity is state of the art for local area networks. Currently,
    most W-LAN networks rely on a centralized design with access points routing all
    inner and outbound traffic. These access points are intrinsic communication bottlenecks.
    Mobile Ad Hoc Networks (MANET) overcome this problem, because every participant
    works as well as a simple node and as a router. Current MANETs are restricted
    in scalability, because they rely on flooding mechanisms or complete routing tables.
    Other approaches, providing better scalability use clustering, yet network performance
    deteriorates in case of high node mobility. We describe the design of a PAMANET,
    the Paderborn Mobile Ad Hoc Network, a MANET overcoming these problems providing
    scalability and reliability in a mobile scenario. When implemented, PAMANET works
    with standard W-LAN IEEE 802.11 radio devices, provides IPv6 communication interfaces
    and works on personal computers under a standard Linux distribution. First, we
    present current routing protocols and classify them with respect to scalability
    and stability in dynamically evolving MANETs. Then, we discuss related research
    in the area of distributed hash tables and consistent hashing, used for relieving
    hot spots in the Web, storage area networks and peerto-peer networks, which inspires
    the design of PAMANET. PAMANET consists of three main components: First, the embedding
    of the routing layer into IEEE 802.11 and IPv6 by using techniques used at the
    ad hoc support library (aslib) by Gupta et al. Second, the routing layer which
    combines a landmark routing, hierarchical clustering, consistent hashing for providing
    location dependent addresses and lookup-service for the location of nodes. Third,
    a peerto-peer data storage system based on egoistic distributed caches enabling
    hop and traffic efficient data access on replicated data partitions. <br>The routing
    layer incorporates a variety of new approaches. Link distances reflect the failure
    probability of links, which is estimated by the reciprocal age of the link. Then,
    we combine a landmarking system on this metric with the hierarchical layer graph
    yielding small landmark addresses and small routing tables. To balance the load
    of the distributed lookup-service for landmark addresses, a hierarchical weighted
    consistent hashing scheme is used. This ensures that each node receives an equal
    part of all landmark addresses. Using these mechanisms (regularly and on demand)
    PAMANET adjusts IPv6 routing tables such that short stable routes are preferred.
    For the distribution of control data like landmark information PAMANET uses a
    message box system interface to provide fast one-hop communication. On top of
    this system, PAMANET provides a peer-to-peer data storage and lookup system that
    realizes time, traffic, and load efficient access using egoistic caches and data
    segmentation strategies.'
author:
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
- first_name: Stefan
  full_name: Böttcher, Stefan
  last_name: Böttcher
- first_name: Franz
  full_name: Rammig, Franz
  last_name: Rammig
citation:
  ama: 'Schindelhauer C, Böttcher S, Rammig F. The design of PaMaNet the Paderborn
    mobile ad-hoc network. In: <i>Proceedings of the Second International Workshop
    on Mobility Management &#38; Wireless Access Protocols</i>. ; 2004. doi:<a href="https://doi.org/10.1145/1023783.1023807">10.1145/1023783.1023807</a>'
  apa: Schindelhauer, C., Böttcher, S., &#38; Rammig, F. (2004). The design of PaMaNet
    the Paderborn mobile ad-hoc network. In <i>Proceedings of the second international
    workshop on Mobility management &#38; wireless access protocols</i>. <a href="https://doi.org/10.1145/1023783.1023807">https://doi.org/10.1145/1023783.1023807</a>
  bibtex: '@inproceedings{Schindelhauer_Böttcher_Rammig_2004, title={The design of
    PaMaNet the Paderborn mobile ad-hoc network}, DOI={<a href="https://doi.org/10.1145/1023783.1023807">10.1145/1023783.1023807</a>},
    booktitle={Proceedings of the second international workshop on Mobility management
    &#38; wireless access protocols}, author={Schindelhauer, Christian and Böttcher,
    Stefan and Rammig, Franz}, year={2004} }'
  chicago: Schindelhauer, Christian, Stefan Böttcher, and Franz Rammig. “The Design
    of PaMaNet the Paderborn Mobile Ad-Hoc Network.” In <i>Proceedings of the Second
    International Workshop on Mobility Management &#38; Wireless Access Protocols</i>,
    2004. <a href="https://doi.org/10.1145/1023783.1023807">https://doi.org/10.1145/1023783.1023807</a>.
  ieee: C. Schindelhauer, S. Böttcher, and F. Rammig, “The design of PaMaNet the Paderborn
    mobile ad-hoc network,” in <i>Proceedings of the second international workshop
    on Mobility management &#38; wireless access protocols</i>, 2004.
  mla: Schindelhauer, Christian, et al. “The Design of PaMaNet the Paderborn Mobile
    Ad-Hoc Network.” <i>Proceedings of the Second International Workshop on Mobility
    Management &#38; Wireless Access Protocols</i>, 2004, doi:<a href="https://doi.org/10.1145/1023783.1023807">10.1145/1023783.1023807</a>.
  short: 'C. Schindelhauer, S. Böttcher, F. Rammig, in: Proceedings of the Second
    International Workshop on Mobility Management &#38; Wireless Access Protocols,
    2004.'
date_created: 2020-09-30T12:58:55Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1145/1023783.1023807
language:
- iso: eng
publication: Proceedings of the second international workshop on Mobility management
  & wireless access protocols
publication_identifier:
  isbn:
  - '1581139209'
publication_status: published
status: public
title: The design of PaMaNet the Paderborn mobile ad-hoc network
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19851'
abstract:
- lang: eng
  text: The Internet-SCSI protocol [iSCSI] allows a client to interact with a remote
    SCSI-capable target by means of block-oriented commands encapsulated within TCP/IP
    packets. Thereby, iSCSI greatly simplifies storage virtualization, since clients
    can access storage in a unified manner, no matter whether the I/O-path is short
    or long distance. Intermediate devices located on the path between a client and
    a target can easily intercept iSCSI sessions and rewrite packets for the sake
    of load balancing, prefetching, or redundancy, to mention just a few beneficial
    applications. Within this paper we describe the design and implementation of such
    an iSCSI capable intermediate device that deploys prefetching strategies in combination
    with redundant disks to reduce average I/O-latency. Depending on its location
    within the network, this virtualization and prefetching device can hide wide area
    access latency and reduce network contention targeting remote SCSI-devices to
    a large extent.
author:
- first_name: Peter
  full_name: Bleckmann, Peter
  last_name: Bleckmann
- first_name: Gunnar
  full_name: Schomaker, Gunnar
  last_name: Schomaker
- first_name: Adrian
  full_name: Slowik, Adrian
  last_name: Slowik
citation:
  ama: 'Bleckmann P, Schomaker G, Slowik A. Virtualization with prefetching abilities
    based on iSCSI. In: <i>Proceeding of International Workshop on Storage Network
    Architecture and Parallel I/O</i>. ; 2004:40-47. doi:<a href="https://doi.org/10.1145/1162628.1162634">10.1145/1162628.1162634</a>'
  apa: Bleckmann, P., Schomaker, G., &#38; Slowik, A. (2004). Virtualization with
    prefetching abilities based on iSCSI. <i>Proceeding of International Workshop
    on Storage Network Architecture and Parallel I/O</i>, <i>2</i>, 40–47. <a href="https://doi.org/10.1145/1162628.1162634">https://doi.org/10.1145/1162628.1162634</a>
  bibtex: '@inproceedings{Bleckmann_Schomaker_Slowik_2004, title={Virtualization with
    prefetching abilities based on iSCSI}, DOI={<a href="https://doi.org/10.1145/1162628.1162634">10.1145/1162628.1162634</a>},
    number={2}, booktitle={Proceeding of International Workshop on Storage Network
    Architecture and Parallel I/O}, author={Bleckmann, Peter and Schomaker, Gunnar
    and Slowik, Adrian}, year={2004}, pages={40–47} }'
  chicago: Bleckmann, Peter, Gunnar Schomaker, and Adrian Slowik. “Virtualization
    with Prefetching Abilities Based on ISCSI.” In <i>Proceeding of International
    Workshop on Storage Network Architecture and Parallel I/O</i>, 40–47, 2004. <a
    href="https://doi.org/10.1145/1162628.1162634">https://doi.org/10.1145/1162628.1162634</a>.
  ieee: 'P. Bleckmann, G. Schomaker, and A. Slowik, “Virtualization with prefetching
    abilities based on iSCSI,” in <i>Proceeding of International Workshop on Storage
    Network Architecture and Parallel I/O</i>, 2004, no. 2, pp. 40–47, doi: <a href="https://doi.org/10.1145/1162628.1162634">10.1145/1162628.1162634</a>.'
  mla: Bleckmann, Peter, et al. “Virtualization with Prefetching Abilities Based on
    ISCSI.” <i>Proceeding of International Workshop on Storage Network Architecture
    and Parallel I/O</i>, no. 2, 2004, pp. 40–47, doi:<a href="https://doi.org/10.1145/1162628.1162634">10.1145/1162628.1162634</a>.
  short: 'P. Bleckmann, G. Schomaker, A. Slowik, in: Proceeding of International Workshop
    on Storage Network Architecture and Parallel I/O, 2004, pp. 40–47.'
date_created: 2020-10-02T11:40:12Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1145/1162628.1162634
issue: '2'
language:
- iso: eng
page: 40-47
publication: Proceeding of International Workshop on Storage Network Architecture
  and Parallel I/O
publication_status: published
status: public
title: Virtualization with prefetching abilities based on iSCSI
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19879'
author:
- first_name: Jan
  full_name: Klein, Jan
  last_name: Klein
- first_name: Gabriel
  full_name: Zachmann, Gabriel
  last_name: Zachmann
citation:
  ama: Klein J, Zachmann G. Point Cloud Surfaces using Geometric Proximity Graphs.
    <i>Computers and Graphics</i>. 2004;28(6):839-850. doi:<a href="https://doi.org/10.1016/j.cag.2004.08.012">10.1016/j.cag.2004.08.012</a>
  apa: Klein, J., &#38; Zachmann, G. (2004). Point Cloud Surfaces using Geometric
    Proximity Graphs. <i>Computers and Graphics</i>, <i>28</i>(6), 839–850. <a href="https://doi.org/10.1016/j.cag.2004.08.012">https://doi.org/10.1016/j.cag.2004.08.012</a>
  bibtex: '@article{Klein_Zachmann_2004, title={Point Cloud Surfaces using Geometric
    Proximity Graphs}, volume={28}, DOI={<a href="https://doi.org/10.1016/j.cag.2004.08.012">10.1016/j.cag.2004.08.012</a>},
    number={6}, journal={Computers and Graphics}, author={Klein, Jan and Zachmann,
    Gabriel}, year={2004}, pages={839–850} }'
  chicago: 'Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric
    Proximity Graphs.” <i>Computers and Graphics</i> 28, no. 6 (2004): 839–50. <a
    href="https://doi.org/10.1016/j.cag.2004.08.012">https://doi.org/10.1016/j.cag.2004.08.012</a>.'
  ieee: J. Klein and G. Zachmann, “Point Cloud Surfaces using Geometric Proximity
    Graphs,” <i>Computers and Graphics</i>, vol. 28, no. 6, pp. 839–850, 2004.
  mla: Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric Proximity
    Graphs.” <i>Computers and Graphics</i>, vol. 28, no. 6, 2004, pp. 839–50, doi:<a
    href="https://doi.org/10.1016/j.cag.2004.08.012">10.1016/j.cag.2004.08.012</a>.
  short: J. Klein, G. Zachmann, Computers and Graphics 28 (2004) 839–850.
date_created: 2020-10-05T12:57:39Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1016/j.cag.2004.08.012
intvolume: '        28'
issue: '6'
language:
- iso: eng
page: 839-850
publication: Computers and Graphics
status: public
title: Point Cloud Surfaces using Geometric Proximity Graphs
type: journal_article
user_id: '15415'
volume: 28
year: '2004'
...
---
_id: '19883'
author:
- first_name: Jan
  full_name: Klein, Jan
  last_name: Klein
- first_name: Gabriel
  full_name: Zachmann, Gabriel
  last_name: Zachmann
citation:
  ama: 'Klein J, Zachmann G. Proximity Graphs for Defining Surfaces over Point Clouds.
    In: <i>Eurographics Symposium on Point-Based Grahics (SPBG’04)</i>. ; 2004:131-138.'
  apa: Klein, J., &#38; Zachmann, G. (2004). Proximity Graphs for Defining Surfaces
    over Point Clouds. In <i>Eurographics Symposium on Point-Based Grahics (SPBG’04)</i>
    (pp. 131–138).
  bibtex: '@inproceedings{Klein_Zachmann_2004, title={Proximity Graphs for Defining
    Surfaces over Point Clouds}, booktitle={Eurographics Symposium on Point-Based
    Grahics (SPBG’04)}, author={Klein, Jan and Zachmann, Gabriel}, year={2004}, pages={131–138}
    }'
  chicago: Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces
    over Point Clouds.” In <i>Eurographics Symposium on Point-Based Grahics (SPBG’04)</i>,
    131–38, 2004.
  ieee: J. Klein and G. Zachmann, “Proximity Graphs for Defining Surfaces over Point
    Clouds,” in <i>Eurographics Symposium on Point-Based Grahics (SPBG’04)</i>, 2004,
    pp. 131–138.
  mla: Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces over
    Point Clouds.” <i>Eurographics Symposium on Point-Based Grahics (SPBG’04)</i>,
    2004, pp. 131–38.
  short: 'J. Klein, G. Zachmann, in: Eurographics Symposium on Point-Based Grahics
    (SPBG’04), 2004, pp. 131–138.'
date_created: 2020-10-05T13:03:44Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 131-138
publication: Eurographics Symposium on Point-Based Grahics (SPBG'04)
status: public
title: Proximity Graphs for Defining Surfaces over Point Clouds
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19889'
author:
- first_name: Jan
  full_name: Klein, Jan
  last_name: Klein
- first_name: Gabriel
  full_name: Zachmann, Gabriel
  last_name: Zachmann
citation:
  ama: 'Klein J, Zachmann G. Nice and Fast Implicit Surfaces over Noisy Point Clouds.
    In: <i>SIGGRAPH 2004, Sketches</i>. ; 2004.'
  apa: Klein, J., &#38; Zachmann, G. (2004). Nice and Fast Implicit Surfaces over
    Noisy Point Clouds. In <i>SIGGRAPH 2004, Sketches</i>.
  bibtex: '@inproceedings{Klein_Zachmann_2004, title={Nice and Fast Implicit Surfaces
    over Noisy Point Clouds}, booktitle={SIGGRAPH 2004, Sketches}, author={Klein,
    Jan and Zachmann, Gabriel}, year={2004} }'
  chicago: Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over
    Noisy Point Clouds.” In <i>SIGGRAPH 2004, Sketches</i>, 2004.
  ieee: J. Klein and G. Zachmann, “Nice and Fast Implicit Surfaces over Noisy Point
    Clouds,” in <i>SIGGRAPH 2004, Sketches</i>, 2004.
  mla: Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over Noisy
    Point Clouds.” <i>SIGGRAPH 2004, Sketches</i>, 2004.
  short: 'J. Klein, G. Zachmann, in: SIGGRAPH 2004, Sketches, 2004.'
date_created: 2020-10-05T13:31:16Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
publication: SIGGRAPH 2004, Sketches
status: public
title: Nice and Fast Implicit Surfaces over Noisy Point Clouds
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '19891'
author:
- first_name: Jan
  full_name: Klein, Jan
  last_name: Klein
- first_name: Gabriel
  full_name: Zachmann, Gabriel
  last_name: Zachmann
citation:
  ama: 'Klein J, Zachmann G. Point Cloud Collision Detection. In: <i>Computer Graphics
    Forum (Proceedings of EUROGRAPHICS 2004)</i>. ; 2004:567-576.'
  apa: Klein, J., &#38; Zachmann, G. (2004). Point Cloud Collision Detection. In <i>Computer
    Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i> (pp. 567–576).
  bibtex: '@inproceedings{Klein_Zachmann_2004, title={Point Cloud Collision Detection},
    booktitle={Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)}, author={Klein,
    Jan and Zachmann, Gabriel}, year={2004}, pages={567–576} }'
  chicago: Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” In
    <i>Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>, 567–76, 2004.
  ieee: J. Klein and G. Zachmann, “Point Cloud Collision Detection,” in <i>Computer
    Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>, 2004, pp. 567–576.
  mla: Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” <i>Computer
    Graphics Forum (Proceedings of EUROGRAPHICS 2004)</i>, 2004, pp. 567–76.
  short: 'J. Klein, G. Zachmann, in: Computer Graphics Forum (Proceedings of EUROGRAPHICS
    2004), 2004, pp. 567–576.'
date_created: 2020-10-05T13:49:10Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 567-576
publication: Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)
status: public
title: Point Cloud Collision Detection
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '26411'
author:
- first_name: Klaus
  full_name: Volbert, Klaus
  last_name: Volbert
citation:
  ama: 'Volbert K. Experimental analysis of adjustable sectorized topologies for static
    ad hoc networks. In: <i>Proceedings of the 2004 Joint Workshop on Foundations
    of Mobile Computing  - DIALM-POMC ’04</i>. ; 2004. doi:<a href="https://doi.org/10.1145/1022630.1022646">10.1145/1022630.1022646</a>'
  apa: Volbert, K. (2004). Experimental analysis of adjustable sectorized topologies
    for static ad hoc networks. <i>Proceedings of the 2004 Joint Workshop on Foundations
    of Mobile Computing  - DIALM-POMC ’04</i>. <a href="https://doi.org/10.1145/1022630.1022646">https://doi.org/10.1145/1022630.1022646</a>
  bibtex: '@inproceedings{Volbert_2004, title={Experimental analysis of adjustable
    sectorized topologies for static ad hoc networks}, DOI={<a href="https://doi.org/10.1145/1022630.1022646">10.1145/1022630.1022646</a>},
    booktitle={Proceedings of the 2004 joint workshop on Foundations of mobile computing 
    - DIALM-POMC ’04}, author={Volbert, Klaus}, year={2004} }'
  chicago: Volbert, Klaus. “Experimental Analysis of Adjustable Sectorized Topologies
    for Static Ad Hoc Networks.” In <i>Proceedings of the 2004 Joint Workshop on Foundations
    of Mobile Computing  - DIALM-POMC ’04</i>, 2004. <a href="https://doi.org/10.1145/1022630.1022646">https://doi.org/10.1145/1022630.1022646</a>.
  ieee: 'K. Volbert, “Experimental analysis of adjustable sectorized topologies for
    static ad hoc networks,” 2004, doi: <a href="https://doi.org/10.1145/1022630.1022646">10.1145/1022630.1022646</a>.'
  mla: Volbert, Klaus. “Experimental Analysis of Adjustable Sectorized Topologies
    for Static Ad Hoc Networks.” <i>Proceedings of the 2004 Joint Workshop on Foundations
    of Mobile Computing  - DIALM-POMC ’04</i>, 2004, doi:<a href="https://doi.org/10.1145/1022630.1022646">10.1145/1022630.1022646</a>.
  short: 'K. Volbert, in: Proceedings of the 2004 Joint Workshop on Foundations of
    Mobile Computing  - DIALM-POMC ’04, 2004.'
date_created: 2021-10-18T15:34:55Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '63'
- _id: '26'
doi: 10.1145/1022630.1022646
language:
- iso: eng
publication: Proceedings of the 2004 joint workshop on Foundations of mobile computing  -
  DIALM-POMC '04
publication_status: published
status: public
title: Experimental analysis of adjustable sectorized topologies for static ad hoc
  networks
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '26992'
author:
- first_name: Stefan
  full_name: Rührup, Stefan
  last_name: Rührup
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
citation:
  ama: Rührup S, Schindelhauer C. <i>Traffic and Hop Efficient Position-Based Routing
    Using a Cell Structure</i>.; 2004.
  apa: Rührup, S., &#38; Schindelhauer, C. (2004). <i>Traffic and Hop Efficient Position-based
    Routing using a Cell Structure</i>.
  bibtex: '@book{Rührup_Schindelhauer_2004, place={Heinz Nixdorf Institut, Universität
    Paderborn}, title={Traffic and Hop Efficient Position-based Routing using a Cell
    Structure}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2004}
    }'
  chicago: Rührup, Stefan, and Christian Schindelhauer. <i>Traffic and Hop Efficient
    Position-Based Routing Using a Cell Structure</i>. Heinz Nixdorf Institut, Universität
    Paderborn, 2004.
  ieee: S. Rührup and C. Schindelhauer, <i>Traffic and Hop Efficient Position-based
    Routing using a Cell Structure</i>. Heinz Nixdorf Institut, Universität Paderborn,
    2004.
  mla: Rührup, Stefan, and Christian Schindelhauer. <i>Traffic and Hop Efficient Position-Based
    Routing Using a Cell Structure</i>. 2004.
  short: S. Rührup, C. Schindelhauer, Traffic and Hop Efficient Position-Based Routing
    Using a Cell Structure, Heinz Nixdorf Institut, Universität Paderborn, 2004.
date_created: 2021-10-28T11:59:31Z
date_updated: 2022-01-06T06:57:32Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2021-10-28T11:58:56Z
  date_updated: 2021-10-28T11:58:56Z
  file_id: '26993'
  file_name: techreport-hniid-2024.pdf
  file_size: 234517
  relation: main_file
  success: 1
file_date_updated: 2021-10-28T11:58:56Z
has_accepted_license: '1'
language:
- iso: eng
place: Heinz Nixdorf Institut, Universität Paderborn
status: public
title: Traffic and Hop Efficient Position-based Routing using a Cell Structure
type: report
user_id: '15415'
year: '2004'
...
---
_id: '17346'
author:
- first_name: André
  full_name: Brinkmann, André
  last_name: Brinkmann
- first_name: Michael
  full_name: Heidebuer, Michael
  last_name: Heidebuer
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: 'Ulrich '
  full_name: 'Rückert, Ulrich '
  last_name: Rückert
- first_name: Kay
  full_name: Salzwedel, Kay
  last_name: Salzwedel
- first_name: Mario
  full_name: Vodisek, Mario
  last_name: Vodisek
citation:
  ama: 'Brinkmann A, Heidebuer M, Meyer auf der Heide F, Rückert U, Salzwedel K, Vodisek
    M. V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.
    In: Kobler B, Hariharan PC, eds. <i>21st {IEEE} Conference on Mass Storage Systems
    and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and
    Technologies, Greenbelt, Maryland, USA</i>. IEEE; 2004:153--157.'
  apa: Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel,
    K., &#38; Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage
    Virtualization System. In B. Kobler &#38; P. C. Hariharan (Eds.), <i>21st {IEEE}
    Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference
    on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA</i> (pp. 153--157).
    IEEE.
  bibtex: '@inproceedings{Brinkmann_Heidebuer_Meyer auf der Heide_Rückert_Salzwedel_Vodisek_2004,
    title={V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System},
    booktitle={21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th
    {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt,
    Maryland, USA}, publisher={IEEE}, author={Brinkmann, André and Heidebuer, Michael
    and Meyer auf der Heide, Friedhelm and Rückert, Ulrich  and Salzwedel, Kay and
    Vodisek, Mario}, editor={Kobler, Ben and Hariharan, P. C.Editors}, year={2004},
    pages={153--157} }'
  chicago: Brinkmann, André, Michael Heidebuer, Friedhelm Meyer auf der Heide, Ulrich  Rückert,
    Kay Salzwedel, and Mario Vodisek. “V:Drive - Costs and Benefits of an Out-of-Band
    Storage Virtualization System.” In <i>21st {IEEE} Conference on Mass Storage Systems
    and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and
    Technologies, Greenbelt, Maryland, USA</i>, edited by Ben Kobler and P. C. Hariharan,
    153--157. IEEE, 2004.
  ieee: A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel,
    and M. Vodisek, “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization
    System,” in <i>21st {IEEE} Conference on Mass Storage Systems and Technologies
    / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt,
    Maryland, USA</i>, 2004, pp. 153--157.
  mla: Brinkmann, André, et al. “V:Drive - Costs and Benefits of an Out-of-Band Storage
    Virtualization System.” <i>21st {IEEE} Conference on Mass Storage Systems and
    Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies,
    Greenbelt, Maryland, USA</i>, edited by Ben Kobler and P. C. Hariharan, IEEE,
    2004, pp. 153--157.
  short: 'A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel,
    M. Vodisek, in: B. Kobler, P.C. Hariharan (Eds.), 21st {IEEE} Conference on Mass
    Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage
    Systems and Technologies, Greenbelt, Maryland, USA, IEEE, 2004, pp. 153--157.'
date_created: 2020-06-26T13:30:51Z
date_updated: 2022-01-06T06:53:08Z
department:
- _id: '63'
editor:
- first_name: Ben
  full_name: Kobler, Ben
  last_name: Kobler
- first_name: P. C.
  full_name: Hariharan, P. C.
  last_name: Hariharan
language:
- iso: eng
page: 153--157
publication: 21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th
  {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland,
  USA
publisher: IEEE
status: public
title: V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '18777'
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Valentina
  full_name: Damerow, Valentina
  last_name: Damerow
citation:
  ama: 'Sohler C, Damerow V. Smoothed Number of Extreme Points under Uniform Noise.
    In: <i>Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04)</i>.
    ; 2004:93-96.'
  apa: Sohler, C., &#38; Damerow, V. (2004). Smoothed Number of Extreme Points under
    Uniform Noise. In <i>Proceedings of the 20th European Workshop on Computational
    Geometry (EWCG’04)</i> (pp. 93–96).
  bibtex: '@inproceedings{Sohler_Damerow_2004, title={Smoothed Number of Extreme Points
    under Uniform Noise}, booktitle={Proceedings of the 20th European Workshop on
    Computational Geometry (EWCG’04)}, author={Sohler, Christian and Damerow, Valentina},
    year={2004}, pages={93–96} }'
  chicago: Sohler, Christian, and Valentina Damerow. “Smoothed Number of Extreme Points
    under Uniform Noise.” In <i>Proceedings of the 20th European Workshop on Computational
    Geometry (EWCG’04)</i>, 93–96, 2004.
  ieee: C. Sohler and V. Damerow, “Smoothed Number of Extreme Points under Uniform
    Noise,” in <i>Proceedings of the 20th European Workshop on Computational Geometry
    (EWCG’04)</i>, 2004, pp. 93–96.
  mla: Sohler, Christian, and Valentina Damerow. “Smoothed Number of Extreme Points
    under Uniform Noise.” <i>Proceedings of the 20th European Workshop on Computational
    Geometry (EWCG’04)</i>, 2004, pp. 93–96.
  short: 'C. Sohler, V. Damerow, in: Proceedings of the 20th European Workshop on
    Computational Geometry (EWCG’04), 2004, pp. 93–96.'
date_created: 2020-09-01T12:23:21Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '63'
language:
- iso: eng
page: 93 - 96
publication: Proceedings of the 20th European Workshop on Computational Geometry (EWCG'04)
status: public
title: Smoothed Number of Extreme Points under Uniform Noise
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '18778'
abstract:
- lang: eng
  text: Given a point set P in the d-dimensional unit hypercube, we give upper bounds
    on the maximal expected number of extreme points when each point is perturbed
    by small random noise chosen independently for each point from the same noise
    distribution &#916;. Our results are parametrized by the variance of the noise
    distribution. For large variance we essentially consider the average case for
    distribution &#916; while for variance 0 we consider the worst case. Hence our
    results give upper bounds on the number of extreme points where our input distributions
    range from average case to worst case.<br>Our main contribution is a rather general
    lemma that can be used to obtain upper bounds on the expected number of extreme
    points for a large class of noise distributions. We then apply this lemma to obtain
    explicit bounds for random noise coming from the Gaussian normal distribution
    of variance &#963;² and the uniform distribution in a hypercube of side length
    &epsilon. For these noise distributions we show upper bounds of O( (1/ &#963;
    )^d * log^3/2 * d - 1 n ) and O( ( (n log n) / &#949; )^d/(d+1) ), respectively.
    Besides its theoretical motivation our model is also motivated by the observation
    that in many applications of convex hull algorithms the input data is inherently
    noisy, e.g. when the data comes from physical measurement or imprecise arithmetic
    is used.
author:
- first_name: Valentina
  full_name: Damerow, Valentina
  last_name: Damerow
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: 'Damerow V, Sohler C. Extreme Points Under Random Noise. In: <i>Proceedings
    of the 12th European Symposium on Algorithms (ESA’04)</i>. Berlin, Heidelberg;
    2004. doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_25">10.1007/978-3-540-30140-0_25</a>'
  apa: Damerow, V., &#38; Sohler, C. (2004). Extreme Points Under Random Noise. In
    <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>. Berlin,
    Heidelberg. <a href="https://doi.org/10.1007/978-3-540-30140-0_25">https://doi.org/10.1007/978-3-540-30140-0_25</a>
  bibtex: '@inproceedings{Damerow_Sohler_2004, place={Berlin, Heidelberg}, title={Extreme
    Points Under Random Noise}, DOI={<a href="https://doi.org/10.1007/978-3-540-30140-0_25">10.1007/978-3-540-30140-0_25</a>},
    booktitle={Proceedings of the 12th European Symposium on Algorithms (ESA’04)},
    author={Damerow, Valentina and Sohler, Christian}, year={2004} }'
  chicago: Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random
    Noise.” In <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>.
    Berlin, Heidelberg, 2004. <a href="https://doi.org/10.1007/978-3-540-30140-0_25">https://doi.org/10.1007/978-3-540-30140-0_25</a>.
  ieee: V. Damerow and C. Sohler, “Extreme Points Under Random Noise,” in <i>Proceedings
    of the 12th European Symposium on Algorithms (ESA’04)</i>, 2004.
  mla: Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.”
    <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>, 2004,
    doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_25">10.1007/978-3-540-30140-0_25</a>.
  short: 'V. Damerow, C. Sohler, in: Proceedings of the 12th European Symposium on
    Algorithms (ESA’04), Berlin, Heidelberg, 2004.'
date_created: 2020-09-01T12:26:47Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '63'
doi: 10.1007/978-3-540-30140-0_25
language:
- iso: eng
place: Berlin, Heidelberg
publication: Proceedings of the 12th European Symposium on Algorithms (ESA'04)
publication_identifier:
  isbn:
  - '9783540230250'
  - '9783540301400'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Extreme Points Under Random Noise
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '18785'
abstract:
- lang: eng
  text: A limiting factor in the performance of a render- ing system is the number
    of state changes, i.e., changes of the attributes material, texture, shader program,
    etc., in the stream of rendered primitives. We propose to include a small buffer
    between appli- cation and graphics hardware in the rendering sys- tem. This pipeline
    buffer is used to rearrange the incoming sequence of primitives on-line and locally
    in such a way that the number of state changes is minimized. This method is generic;
    it can be easily integrated into existing rendering systems. In our experiments
    a pipeline buffer reduces the number of state changes by an order of magnitude
    and achieves almost the same rendering time as an optimal, i.e., presorted, sequence
    without pipeline buffer. Due to its simple structure and its low mem- ory requirements
    this method can easily be imple- mented in software or even hardware.
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Jens
  full_name: Krokowski, Jens
  last_name: Krokowski
- first_name: Harald
  full_name: Räcke, Harald
  last_name: Räcke
- first_name: Matthias
  full_name: Westermann, Matthias
  last_name: Westermann
citation:
  ama: 'Sohler C, Krokowski J, Räcke H, Westermann M. Reducing State Changes with
    a Pipeline Buffer. In: <i>Proceedings of the Vision, Modeling, and Visualization
    Conference (VMV 2004)</i>. ; 2004.'
  apa: Sohler, C., Krokowski, J., Räcke, H., &#38; Westermann, M. (2004). Reducing
    State Changes with a Pipeline Buffer. In <i>Proceedings of the Vision, Modeling,
    and Visualization Conference (VMV 2004)</i>.
  bibtex: '@inproceedings{Sohler_Krokowski_Räcke_Westermann_2004, title={Reducing
    State Changes with a Pipeline Buffer}, booktitle={Proceedings of the Vision, Modeling,
    and Visualization Conference (VMV 2004)}, author={Sohler, Christian and Krokowski,
    Jens and Räcke, Harald and Westermann, Matthias}, year={2004} }'
  chicago: Sohler, Christian, Jens Krokowski, Harald Räcke, and Matthias Westermann.
    “Reducing State Changes with a Pipeline Buffer.” In <i>Proceedings of the Vision,
    Modeling, and Visualization Conference (VMV 2004)</i>, 2004.
  ieee: C. Sohler, J. Krokowski, H. Räcke, and M. Westermann, “Reducing State Changes
    with a Pipeline Buffer,” in <i>Proceedings of the Vision, Modeling, and Visualization
    Conference (VMV 2004)</i>, 2004.
  mla: Sohler, Christian, et al. “Reducing State Changes with a Pipeline Buffer.”
    <i>Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004)</i>,
    2004.
  short: 'C. Sohler, J. Krokowski, H. Räcke, M. Westermann, in: Proceedings of the
    Vision, Modeling, and Visualization Conference (VMV 2004), 2004.'
date_created: 2020-09-01T13:34:52Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the Vision, Modeling, and Visualization Conference (VMV
  2004)
status: public
title: Reducing State Changes with a Pipeline Buffer
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '18786'
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
citation:
  ama: 'Sohler C, Czumaj A. Sublinear-Time Approximation for Clustering via Random
    Sampling. In: <i>Automata, Languages and Programming (ICALP)</i>. ; 2004:396-407.'
  apa: Sohler, C., &#38; Czumaj, A. (2004). Sublinear-Time Approximation for Clustering
    via Random Sampling. In <i>Automata, Languages and Programming (ICALP)</i> (pp.
    396–407).
  bibtex: '@inproceedings{Sohler_Czumaj_2004, title={Sublinear-Time Approximation
    for Clustering via Random Sampling}, number={1}, booktitle={Automata, Languages
    and Programming (ICALP)}, author={Sohler, Christian and Czumaj, Artur}, year={2004},
    pages={396–407} }'
  chicago: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation for
    Clustering via Random Sampling.” In <i>Automata, Languages and Programming (ICALP)</i>,
    396–407, 2004.
  ieee: C. Sohler and A. Czumaj, “Sublinear-Time Approximation for Clustering via
    Random Sampling,” in <i>Automata, Languages and Programming (ICALP)</i>, 2004,
    no. 1, pp. 396–407.
  mla: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation for Clustering
    via Random Sampling.” <i>Automata, Languages and Programming (ICALP)</i>, no.
    1, 2004, pp. 396–407.
  short: 'C. Sohler, A. Czumaj, in: Automata, Languages and Programming (ICALP), 2004,
    pp. 396–407.'
date_created: 2020-09-01T13:41:48Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '63'
issue: '1'
language:
- iso: eng
page: 396-407
publication: Automata, Languages and Programming (ICALP)
status: public
title: Sublinear-Time Approximation for Clustering via Random Sampling
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '17986'
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
- first_name: Vasco
  full_name: Brattka, Vasco
  last_name: Brattka
citation:
  ama: Ziegler M, Brattka V. Computability in linear algebra. <i>Theoretical Computer
    Science</i>. 2004;326(1-3):187-211. doi:<a href="https://doi.org/10.1016/j.tcs.2004.06.022">https://doi.org/10.1016/j.tcs.2004.06.022</a>
  apa: Ziegler, M., &#38; Brattka, V. (2004). Computability in linear algebra. <i>Theoretical
    Computer Science</i>, <i>326</i>(1–3), 187–211. <a href="https://doi.org/10.1016/j.tcs.2004.06.022">https://doi.org/10.1016/j.tcs.2004.06.022</a>
  bibtex: '@article{Ziegler_Brattka_2004, title={Computability in linear algebra},
    volume={326}, DOI={<a href="https://doi.org/10.1016/j.tcs.2004.06.022">https://doi.org/10.1016/j.tcs.2004.06.022</a>},
    number={1–3}, journal={Theoretical Computer Science}, author={Ziegler, Martin
    and Brattka, Vasco}, year={2004}, pages={187–211} }'
  chicago: 'Ziegler, Martin, and Vasco Brattka. “Computability in Linear Algebra.”
    <i>Theoretical Computer Science</i> 326, no. 1–3 (2004): 187–211. <a href="https://doi.org/10.1016/j.tcs.2004.06.022">https://doi.org/10.1016/j.tcs.2004.06.022</a>.'
  ieee: M. Ziegler and V. Brattka, “Computability in linear algebra,” <i>Theoretical
    Computer Science</i>, vol. 326, no. 1–3, pp. 187–211, 2004.
  mla: Ziegler, Martin, and Vasco Brattka. “Computability in Linear Algebra.” <i>Theoretical
    Computer Science</i>, vol. 326, no. 1–3, 2004, pp. 187–211, doi:<a href="https://doi.org/10.1016/j.tcs.2004.06.022">https://doi.org/10.1016/j.tcs.2004.06.022</a>.
  short: M. Ziegler, V. Brattka, Theoretical Computer Science 326 (2004) 187–211.
date_created: 2020-08-14T13:41:32Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: https://doi.org/10.1016/j.tcs.2004.06.022
intvolume: '       326'
issue: 1-3
language:
- iso: eng
page: 187-211
publication: Theoretical Computer Science
publication_status: published
status: public
title: Computability in linear algebra
type: journal_article
user_id: '15415'
volume: 326
year: '2004'
...
---
_id: '18260'
abstract:
- lang: eng
  text: "For uniform computability of regular sets in Euclidean space, previous work
    has identified twelve 'basic' notions, to (pairs of) which many previous notions
    considered in literature were shown to be equivalent.\r\n\r\nWith respect to those
    basic notions, we now investigate on the computability of natural OPERATIONS on
    regular sets: union, intersection, complement, convex hull, image, and pre-image
    under suitable classes of functions."
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Ziegler M. Computable operators on regular sets. In: <i>Computability and
    Complexity in Analysis</i>. Vol 50. ; 2004:392-404. doi:<a href="https://doi.org/10.1002/malq.200310107">10.1002/malq.200310107</a>'
  apa: Ziegler, M. (2004). Computable operators on regular sets. <i>Computability
    and Complexity in Analysis</i>, <i>50</i>(4–5), 392–404. <a href="https://doi.org/10.1002/malq.200310107">https://doi.org/10.1002/malq.200310107</a>
  bibtex: '@inproceedings{Ziegler_2004, title={Computable operators on regular sets},
    volume={50}, DOI={<a href="https://doi.org/10.1002/malq.200310107">10.1002/malq.200310107</a>},
    number={4–5}, booktitle={Computability and Complexity in Analysis}, author={Ziegler,
    Martin}, year={2004}, pages={392–404} }'
  chicago: Ziegler, Martin. “Computable Operators on Regular Sets.” In <i>Computability
    and Complexity in Analysis</i>, 50:392–404, 2004. <a href="https://doi.org/10.1002/malq.200310107">https://doi.org/10.1002/malq.200310107</a>.
  ieee: 'M. Ziegler, “Computable operators on regular sets,” in <i>Computability and
    Complexity in Analysis</i>, 2004, vol. 50, no. 4–5, pp. 392–404, doi: <a href="https://doi.org/10.1002/malq.200310107">10.1002/malq.200310107</a>.'
  mla: Ziegler, Martin. “Computable Operators on Regular Sets.” <i>Computability and
    Complexity in Analysis</i>, vol. 50, no. 4–5, 2004, pp. 392–404, doi:<a href="https://doi.org/10.1002/malq.200310107">10.1002/malq.200310107</a>.
  short: 'M. Ziegler, in: Computability and Complexity in Analysis, 2004, pp. 392–404.'
date_created: 2020-08-25T10:31:45Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
doi: 10.1002/malq.200310107
intvolume: '        50'
issue: 4-5
language:
- iso: eng
page: 392-404
publication: Computability and Complexity in Analysis
publication_identifier:
  issn:
  - 0942-5616
  - 1521-3870
publication_status: published
status: public
title: Computable operators on regular sets
type: conference
user_id: '15415'
volume: 50
year: '2004'
...
---
_id: '18263'
abstract:
- lang: eng
  text: We generalize univariate multipoint evaluation of polynomials of degree n
    at sublinear amortized cost per point. More precisely, it is shown how to evaluate
    a bivariate polynomial p of maximum degree less than n, specified by its n^2 coefficients,
    simultaneously at n^2 given points using a total of O(n^2.667) arithmetic operations.
    In terms of the input size N being quadratic in n, this amounts to an amortized
    cost of O(N^0.334) per point.
author:
- first_name: Michael
  full_name: Nüsken, Michael
  last_name: Nüsken
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Nüsken M, Ziegler M. Fast Multipoint Evaluation of Bivariate Polynomials.
    In: <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>. Vol 3221. Berlin,
    Heidelberg: Springer; 2004:544-555. doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_49">10.1007/978-3-540-30140-0_49</a>'
  apa: 'Nüsken, M., &#38; Ziegler, M. (2004). Fast Multipoint Evaluation of Bivariate
    Polynomials. In <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i> (Vol.
    3221, pp. 544–555). Berlin, Heidelberg: Springer. <a href="https://doi.org/10.1007/978-3-540-30140-0_49">https://doi.org/10.1007/978-3-540-30140-0_49</a>'
  bibtex: '@inproceedings{Nüsken_Ziegler_2004, place={Berlin, Heidelberg}, title={Fast
    Multipoint Evaluation of Bivariate Polynomials}, volume={3221}, DOI={<a href="https://doi.org/10.1007/978-3-540-30140-0_49">10.1007/978-3-540-30140-0_49</a>},
    booktitle={Proc. 12th Annual Symposium on Algorithms (ESA’04)}, publisher={Springer},
    author={Nüsken, Michael and Ziegler, Martin}, year={2004}, pages={544–555} }'
  chicago: 'Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate
    Polynomials.” In <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>, 3221:544–55.
    Berlin, Heidelberg: Springer, 2004. <a href="https://doi.org/10.1007/978-3-540-30140-0_49">https://doi.org/10.1007/978-3-540-30140-0_49</a>.'
  ieee: M. Nüsken and M. Ziegler, “Fast Multipoint Evaluation of Bivariate Polynomials,”
    in <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>, 2004, vol. 3221,
    pp. 544–555.
  mla: Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate
    Polynomials.” <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>, vol.
    3221, Springer, 2004, pp. 544–55, doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_49">10.1007/978-3-540-30140-0_49</a>.
  short: 'M. Nüsken, M. Ziegler, in: Proc. 12th Annual Symposium on Algorithms (ESA’04),
    Springer, Berlin, Heidelberg, 2004, pp. 544–555.'
date_created: 2020-08-25T11:25:11Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
doi: 10.1007/978-3-540-30140-0_49
intvolume: '      3221'
language:
- iso: eng
page: 544-555
place: Berlin, Heidelberg
publication: Proc. 12th Annual Symposium on Algorithms (ESA'04)
publication_identifier:
  isbn:
  - '9783540230250'
  - '9783540301400'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Fast Multipoint Evaluation of Bivariate Polynomials
type: conference
user_id: '15415'
volume: 3221
year: '2004'
...