@phdthesis{19616,
  author       = {{Salzwedel, Kay}},
  isbn         = {{3-935433-62-X}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Data Distribution Algorithms for Storage Networks}}},
  volume       = {{153}},
  year         = {{2004}},
}

@inproceedings{19692,
  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 Schweer, Andrea and Sudholt, Dirk and Tannenbaum, Stefan and Wegener, Ingo}},
  booktitle    = {{Parallel Problem Solving from Nature - PPSN VIII}},
  isbn         = {{9783540230922}},
  issn         = {{0302-9743}},
  title        = {{{The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes}}},
  doi          = {{10.1007/978-3-540-30217-9_4}},
  year         = {{2004}},
}

@inproceedings{19693,
  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 Brockhoff, Dimo and Wegener, Ingo and Jansen, Thomas and Plociennik, Kai}},
  booktitle    = {{Parallel Problem Solving from Nature - PPSN VIII}},
  title        = {{{Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization}}},
  year         = {{2004}},
}

@inproceedings{19800,
  abstract     = {{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       = {{Brinkmann, André and Salzwedel, Kay and Vodisek, Mario}},
  booktitle    = {{Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI '04}},
  pages        = {{9--16}},
  title        = {{{A case for virtualized arrays of RAID}}},
  doi          = {{10.1145/1162628.1162630}},
  year         = {{2004}},
}

@inproceedings{19807,
  abstract     = {{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       = {{Schindelhauer, Christian and Böttcher, Stefan and Rammig, Franz}},
  booktitle    = {{Proceedings of the second international workshop on Mobility management & wireless access protocols}},
  isbn         = {{1581139209}},
  title        = {{{The design of PaMaNet the Paderborn mobile ad-hoc network}}},
  doi          = {{10.1145/1023783.1023807}},
  year         = {{2004}},
}

@inproceedings{19851,
  abstract     = {{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       = {{Bleckmann, Peter and Schomaker, Gunnar and Slowik, Adrian}},
  booktitle    = {{Proceeding of International Workshop on Storage Network Architecture and Parallel I/O}},
  number       = {{2}},
  pages        = {{40--47}},
  title        = {{{Virtualization with prefetching abilities based on iSCSI}}},
  doi          = {{10.1145/1162628.1162634}},
  year         = {{2004}},
}

@article{19879,
  author       = {{Klein, Jan and Zachmann, Gabriel}},
  journal      = {{Computers and Graphics}},
  number       = {{6}},
  pages        = {{839--850}},
  title        = {{{Point Cloud Surfaces using Geometric Proximity Graphs}}},
  doi          = {{10.1016/j.cag.2004.08.012}},
  volume       = {{28}},
  year         = {{2004}},
}

@inproceedings{19883,
  author       = {{Klein, Jan and Zachmann, Gabriel}},
  booktitle    = {{Eurographics Symposium on Point-Based Grahics (SPBG'04)}},
  pages        = {{131--138}},
  title        = {{{Proximity Graphs for Defining Surfaces over Point Clouds}}},
  year         = {{2004}},
}

@inproceedings{19889,
  author       = {{Klein, Jan and Zachmann, Gabriel}},
  booktitle    = {{SIGGRAPH 2004, Sketches}},
  title        = {{{Nice and Fast Implicit Surfaces over Noisy Point Clouds}}},
  year         = {{2004}},
}

@inproceedings{19891,
  author       = {{Klein, Jan and Zachmann, Gabriel}},
  booktitle    = {{Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004)}},
  pages        = {{567--576}},
  title        = {{{Point Cloud Collision Detection}}},
  year         = {{2004}},
}

@inproceedings{26411,
  author       = {{Volbert, Klaus}},
  booktitle    = {{Proceedings of the 2004 joint workshop on Foundations of mobile computing  - DIALM-POMC '04}},
  title        = {{{Experimental analysis of adjustable sectorized topologies for static ad hoc networks}}},
  doi          = {{10.1145/1022630.1022646}},
  year         = {{2004}},
}

@techreport{26992,
  author       = {{Rührup, Stefan and Schindelhauer, Christian}},
  title        = {{{Traffic and Hop Efficient Position-based Routing using a Cell Structure}}},
  year         = {{2004}},
}

@inproceedings{17346,
  author       = {{Brinkmann, André and Heidebuer, Michael and Meyer auf der Heide, Friedhelm and Rückert, Ulrich  and Salzwedel, Kay and Vodisek, Mario}},
  booktitle    = {{21st {IEEE} Conference on Mass Storage Systems and Technologies / 12th {NASA} Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA}},
  editor       = {{Kobler, Ben and Hariharan, P. C.}},
  pages        = {{153----157}},
  publisher    = {{IEEE}},
  title        = {{{V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System}}},
  year         = {{2004}},
}

@inproceedings{18777,
  author       = {{Sohler, Christian and Damerow, Valentina}},
  booktitle    = {{Proceedings of the 20th European Workshop on Computational Geometry (EWCG'04)}},
  pages        = {{93 -- 96}},
  title        = {{{Smoothed Number of Extreme Points under Uniform Noise}}},
  year         = {{2004}},
}

@inproceedings{18778,
  abstract     = {{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       = {{Damerow, Valentina and Sohler, Christian}},
  booktitle    = {{Proceedings of the 12th European Symposium on Algorithms (ESA'04)}},
  isbn         = {{9783540230250}},
  issn         = {{0302-9743}},
  title        = {{{Extreme Points Under Random Noise}}},
  doi          = {{10.1007/978-3-540-30140-0_25}},
  year         = {{2004}},
}

@inproceedings{18785,
  abstract     = {{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       = {{Sohler, Christian and Krokowski, Jens and Räcke, Harald and Westermann, Matthias}},
  booktitle    = {{Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004)}},
  title        = {{{Reducing State Changes with a Pipeline Buffer}}},
  year         = {{2004}},
}

@inproceedings{18786,
  author       = {{Sohler, Christian and Czumaj, Artur}},
  booktitle    = {{Automata, Languages and Programming (ICALP)}},
  number       = {{1}},
  pages        = {{396--407}},
  title        = {{{Sublinear-Time Approximation for Clustering via Random Sampling}}},
  year         = {{2004}},
}

@article{17986,
  author       = {{Ziegler, Martin and Brattka, Vasco}},
  journal      = {{Theoretical Computer Science}},
  number       = {{1-3}},
  pages        = {{187--211}},
  title        = {{{Computability in linear algebra}}},
  doi          = {{https://doi.org/10.1016/j.tcs.2004.06.022}},
  volume       = {{326}},
  year         = {{2004}},
}

@inproceedings{18260,
  abstract     = {{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.

With 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       = {{Ziegler, Martin}},
  booktitle    = {{Computability and Complexity in Analysis}},
  issn         = {{0942-5616}},
  number       = {{4-5}},
  pages        = {{392--404}},
  title        = {{{Computable operators on regular sets}}},
  doi          = {{10.1002/malq.200310107}},
  volume       = {{50}},
  year         = {{2004}},
}

@inproceedings{18263,
  abstract     = {{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       = {{Nüsken, Michael and Ziegler, Martin}},
  booktitle    = {{Proc. 12th Annual Symposium on Algorithms (ESA'04)}},
  isbn         = {{9783540230250}},
  issn         = {{0302-9743}},
  pages        = {{544--555}},
  publisher    = {{Springer}},
  title        = {{{Fast Multipoint Evaluation of Bivariate Polynomials}}},
  doi          = {{10.1007/978-3-540-30140-0_49}},
  volume       = {{3221}},
  year         = {{2004}},
}