@article{17010,
  author       = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}},
  issn         = {{0097-5397}},
  journal      = {{SIAM Journal on Computing}},
  pages        = {{1703--1739}},
  title        = {{{Contention Resolution in Hashing Based Shared Memory Simulations}}},
  doi          = {{10.1137/s009753979529564x}},
  year         = {{2000}},
}

@article{16345,
  author       = {{Meyer auf der Heide, Friedhelm and Wanka, Rolf}},
  journal      = {{ForschungsForum Paderborn}},
  pages        = {{112--116}},
  title        = {{{Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik}}},
  year         = {{2000}},
}

@misc{19784,
  author       = {{Scheideler, Christian}},
  isbn         = {{3-931466-77-9}},
  title        = {{{Probabilistic Methods for Coordination Problems}}},
  year         = {{2000}},
}

@inproceedings{19732,
  abstract     = {{The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In ad-dition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in its implementation deviate significantly from the techniques used in other BSP libraries.}},
  author       = {{Bonorden, Olaf and Juurlink, Bernhardus and Von Otte, I. and Rieping, Ingo}},
  booktitle    = {{Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing}},
  isbn         = {{0769501435}},
  pages        = {{99--104}},
  title        = {{{The Paderborn university BSP (PUB) library-design, implementation and performance}}},
  doi          = {{10.1109/ipps.1999.760442}},
  year         = {{1999}},
}

@article{2151,
  author       = {{Flammini, Michele and Scheideler, Christian}},
  journal      = {{Theory Comput. Syst.}},
  number       = {{3}},
  pages        = {{387----420}},
  title        = {{{Simple, Efficient Routing Schemes for All-Optical Networks}}},
  doi          = {{10.1007/s002240000123}},
  volume       = {{32}},
  year         = {{1999}},
}

@inproceedings{2164,
  author       = {{Berenbrink, Petra and Scheideler, Christian}},
  booktitle    = {{SODA}},
  pages        = {{112----121}},
  title        = {{{Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths}}},
  year         = {{1999}},
}

@inproceedings{2165,
  author       = {{Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}},
  booktitle    = {{SPAA}},
  pages        = {{33----42}},
  title        = {{{Simple Competitive Request Scheduling Strategies}}},
  year         = {{1999}},
}

@inproceedings{17864,
  abstract     = {{A geometric spanner with vertex set P in Rd is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k in N and the stretch factor f>1 describing the “quality” of approximation. PNGs have been throughly investigated with respect to small values of f. We present in this work results about small values of k. The aim of minimizing k rather than f arises from two observations:

* k determines the amount of space required for storing PNGs.

* Many algorithms employing a (previously constructed) spanner have running times depending on its outdegree.

Our results include, for fixed dimensions d as well as asymptotically, upper and lower bounds on this optimal value of k. The upper bounds are shown constructively and yield efficient algorithms for actually computing the corresponding PNGs even in degenerate cases.
}},
  author       = {{Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin}},
  booktitle    = {{Proceedings of the 11th Canadian Conference on Computational Geometry}},
  title        = {{{Partitioned neighborhood spanners of minimal outdegree}}},
  year         = {{1999}},
}

@inproceedings{18747,
  abstract     = {{We present a new ( O(n) ) algorithm to compute good orders for the point set of a Delaunay triangulation of ( n ) points in the plane. Such a good order makes reconstruction in ( O(n) ) time with a simple algorithm possible. In contrast to the algorithm of Snoeyink and van Kreveld cite1, which is based on independent sets, our algorithm uses a breadth first search (BFS) to obtain these orders. Both approaches construct such orders by repeatedly removing a constant fraction of vertices from the current triangulation. The advantage of the BFS approach is that we can give significantly better bounds on the fraction of removed points in a phase of the algorithm. We can prove that a single phase of our algorithm removes at least ( frac13 ) of the points, even if we restrict the degree of the points (at the time they are removed) to 6. We implemented and compared both algorithms. Our algorithms is slightly faster and achieves about 15% better vertex data compression when using a simple variable length code to encode the differences between two consecutive vertices of the given order.}},
  author       = {{Sohler, Christian}},
  booktitle    = {{Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG'99)}},
  pages        = {{136--141}},
  title        = {{{Fast Reconstruction of Delaunay Triangulations}}},
  year         = {{1999}},
}

@phdthesis{18942,
  author       = {{Lukovszki, Tamás}},
  isbn         = {{3-931466-62-0 }},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{New Results on Geometric Spanners and Their Applications}}},
  volume       = {{63}},
  year         = {{1999}},
}

@inproceedings{18959,
  abstract     = {{We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S be a set of $n$ points in the d-dimensional space and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path.<br><br>Recently it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner with O(k^2 n) edges which can be constructed in O(n log n + k^2 n) time. Furthermore, it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner whose degree is bouned by O(c^k+1) for some constant c.<br><br>Our first contribution is a construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound. The computation takes O(n log^d-1 n + k n log log n) time. Then we show that the same k-vertex fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct a k-vertex fault tolerant spanner with O(k^2 n) edges whose degree is bounded by O(k^2). Finally, we give a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S. We investigate the question whether Steiner points help. We answer this question affirmatively and prove Theta(kn) bounds on the number of Steiner points and on the number of edges in such spanners.}},
  author       = {{Lukovszki, Tamás}},
  booktitle    = {{Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS}},
  isbn         = {{9783540662792}},
  issn         = {{0302-9743}},
  pages        = {{193--204}},
  title        = {{{New Results on Fault Tolerant Geometric Spanners}}},
  doi          = {{10.1007/3-540-48447-7_20}},
  year         = {{1999}},
}

@inproceedings{18965,
  author       = {{Krick, Christof and Meyer auf der Heide, Friedhelm and Räcke, Harald and Vöcking, Berthold and Westermann, Matthias}},
  booktitle    = {{Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '99}},
  isbn         = {{1581131240}},
  pages        = {{165--174}},
  title        = {{{Data management in networks: experimental evaluation of a provably good strategy}}},
  doi          = {{10.1145/305619.305637}},
  year         = {{1999}},
}

@inproceedings{18576,
  abstract     = {{In this paper we deal with two problems on star-shaped polygons. First, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set ( S ) of ( n ) points in the plane that does not admit degenerate star-shaped polygons. The expected running time of the algorithm is ( O(n^2log n) ) and it uses ( O(n) ) memory. We call a star-shaped polygon degenerate if its kernel has 0 area.<br><br>Secondly, we show how to count all star-shaped polygons whose vertices are a subset of ( S ) in ( O(n^5log n) ) time and ( O(n) ) space. The algorithm can also be used for random uniform generation. We also present lower and upper bounds on the number of star-shaped polygons.}},
  author       = {{Sohler, Christian}},
  booktitle    = {{Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG'99)}},
  pages        = {{174--177}},
  title        = {{{Generating Random Star-Shaped Polygons}}},
  year         = {{1999}},
}

@inproceedings{2210,
  author       = {{Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}},
  booktitle    = {{International Workshop on Communication and Data Management in Large Networks (CDMLarge)}},
  pages        = {{2--12}},
  title        = {{{Design of the PRESTO Multimedia Storage Network (Extended Abstract)}}},
  year         = {{1999}},
}

@inproceedings{2166,
  author       = {{Scheideler, Christian and Vöcking, Berthold}},
  booktitle    = {{STOC}},
  pages        = {{215----224}},
  title        = {{{From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}}},
  year         = {{1999}},
}

@article{16501,
  author       = {{Meyer auf der Heide, Friedhelm and Vöcking, Berthold}},
  issn         = {{0196-6774}},
  journal      = {{Journal of Algorithms}},
  pages        = {{105--131}},
  title        = {{{Shortest-Path Routing in Arbitrary Networks}}},
  doi          = {{10.1006/jagm.1998.0980}},
  year         = {{1999}},
}

@article{16502,
  author       = {{Berenbrink, P. and Meyer auf der Heide, Friedhelm and Schröder, K.}},
  issn         = {{1432-4350}},
  journal      = {{Theory of Computing Systems}},
  pages        = {{281--300}},
  title        = {{{Allocating Weighted Jobs in Parallel}}},
  doi          = {{10.1007/s002240000119}},
  year         = {{1999}},
}

@inbook{17052,
  author       = {{Mayr, E. W. and Meyer auf der Heide, Friedhelm and Wanka, Rolf}},
  booktitle    = {{Informatik aktuell}},
  isbn         = {{9783540664505}},
  issn         = {{1431-472X}},
  title        = {{{International Workshop on Communication and Data Management in Large Networks}}},
  doi          = {{10.1007/978-3-662-01069-3_47}},
  year         = {{1999}},
}

@inbook{17053,
  author       = {{Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}},
  booktitle    = {{Algorithms - ESA’ 99}},
  isbn         = {{9783540662518}},
  issn         = {{0302-9743}},
  title        = {{{Provably Good and Practical Strategies for Non-uniform Data Management in Networks}}},
  doi          = {{10.1007/3-540-48481-7_9}},
  year         = {{1999}},
}

@phdthesis{19639,
  author       = {{Vöcking, Berthold}},
  isbn         = {{3-931466-45-0}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Static and Dynamic Data Management in Networks}}},
  volume       = {{46}},
  year         = {{1998}},
}