@phdthesis{19621,
  author       = {{Westermann, Matthias}},
  isbn         = {{3-931466-89-2}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints}}},
  volume       = {{90}},
  year         = {{2000}},
}

@techreport{19733,
  author       = {{Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}},
  title        = {{{PUB-Library, Release 7.0, User Guide and Function Reference}}},
  year         = {{2000}},
}

@inproceedings{19849,
  author       = {{Bednara, M. and Beyer, O. and Teich, J. and Wanka, Rolf}},
  booktitle    = {{Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)}},
  isbn         = {{0769507166}},
  pages        = {{299--308}},
  title        = {{{Tradeoff analysis and architecture design of a hybrid hardware/software sorter}}},
  doi          = {{10.1109/asap.2000.862400}},
  year         = {{2000}},
}

@article{2143,
  author       = {{Adler, Micah and Scheideler, Christian}},
  journal      = {{Theory Comput. Syst.}},
  number       = {{5/6}},
  pages        = {{337----391}},
  title        = {{{Efficient Communication Strategies for Ad Hoc Wireless Networks}}},
  doi          = {{10.1007/s002240010006}},
  volume       = {{33}},
  year         = {{2000}},
}

@article{2145,
  author       = {{Scheideler, Christian and Vöcking, Berthold}},
  journal      = {{SIAM J. Comput.}},
  number       = {{4}},
  pages        = {{1126----1155}},
  title        = {{{From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}}},
  doi          = {{10.1137/S0097539799353431}},
  volume       = {{30}},
  year         = {{2000}},
}

@inproceedings{2146,
  author       = {{Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}},
  booktitle    = {{PDPTA}},
  title        = {{{Distributed Path Selection for Storage Networks}}},
  year         = {{2000}},
}

@inproceedings{2147,
  author       = {{Czumaj, Artur and Scheideler, Christian}},
  booktitle    = {{SODA}},
  pages        = {{30----39}},
  title        = {{{Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}}},
  year         = {{2000}},
}

@article{2148,
  author       = {{Czumaj, Artur and Scheideler, Christian}},
  journal      = {{Random Struct. Algorithms}},
  number       = {{3-4}},
  pages        = {{213----237}},
  title        = {{{Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}}},
  volume       = {{17}},
  year         = {{2000}},
}

@inproceedings{2149,
  author       = {{Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}},
  booktitle    = {{SPAA}},
  pages        = {{119----128}},
  title        = {{{Efficient, distributed data placement strategies for storage area networks (extended abstract)}}},
  year         = {{2000}},
}

@inproceedings{2150,
  author       = {{Czumaj, Artur and Scheideler, Christian}},
  booktitle    = {{STOC}},
  pages        = {{38----47}},
  publisher    = {{ACM}},
  title        = {{{A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}}},
  year         = {{2000}},
}

@techreport{17865,
  abstract     = {{We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of a three dimensional scene of triangular primitives by reconstruction from a random sample of surface points which are chosen with a probability proportional to the projected area of the objects. The approach is independent of mesh connectivity and topology. It leads to a rendering time that grows only logarithmically with the numbers of triangles in the scene and to linear memory consumption, thus allowing walkthroughs of scenes of extreme complexity. We consider different methods for image reconstruction which aim at correctness, rendering speed and image quality and we develop an efficient data structure for sample extraction in output-sensitive time which allows for efficient dynamic updates of the scene. Experiments confirm that scenes consisting of some hundred billion triangles can be rendered within seconds with an image quality comparable to a conventional z-buffer rendering; in special cases, realtime performance can be achieved.}},
  author       = {{Wand, Michael and Fischer, Matthias and Meyer auf der Heide, Friedhelm}},
  title        = {{{Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes}}},
  year         = {{2000}},
}

@inproceedings{18962,
  author       = {{Govindarajan, Sathish and Lukovszki, Tamas and Maheshwari, Anil and Zeh, Norbert}},
  booktitle    = {{Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS}},
  issn         = {{0178-4617}},
  pages        = {{585--614}},
  title        = {{{I/O-Efficient Well-Separated Pair Decomposition and Applications}}},
  doi          = {{10.1007/s00453-005-1197-3}},
  year         = {{2000}},
}

@inproceedings{17990,
  abstract     = {{We consider the notion of Property Testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is 'far' from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size.}},
  author       = {{Czumaj, Artur and Sohler, Christian and Ziegler, Martin}},
  booktitle    = {{Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00)}},
  isbn         = {{9783540410041}},
  issn         = {{0302-9743}},
  pages        = {{155--166}},
  publisher    = {{Springer}},
  title        = {{{Property Testing in Computational Geometry}}},
  doi          = {{10.1007/3-540-45253-2_15}},
  volume       = {{4698}},
  year         = {{2000}},
}

@inproceedings{18146,
  abstract     = {{Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gauss Algorithm which was invented before the theory of algorithms has been developed. The purpose of this paper is to link linear algebra explicitly to computable analysis, that is the theory of computable real number functions. Especially, we will investigate in which sense the dimension of a given linear subspace can be computed. The answer highly depends on how the linear subspace is given: if it is given by a finite number of vectors whose linear span represents the space, then the dimension does not depend continuously on these vectors and consequently it cannot be computed. If the linear subspace is represented via its distance function, which is a standard way to represent closed subspaces in computable analysis, then the dimension does computably depend on the distance function.}},
  author       = {{Ziegler, Martin and Brattka, Vasco}},
  booktitle    = {{SOFSEM 2000: Theory and Practice of Informatics}},
  isbn         = {{9783540413486}},
  issn         = {{0302-9743}},
  pages        = {{450--458}},
  publisher    = {{Springer}},
  title        = {{{Computing the Dimension of Linear Subspaces}}},
  doi          = {{10.1007/3-540-44411-4_34}},
  volume       = {{1963}},
  year         = {{2000}},
}

@inproceedings{18150,
  abstract     = {{What is the minimum number of hyperplanes that slice all edges of the d-dimensional hypercube? The answers have been known for d<=4.<br>This work settles the problem for d=5 and d=6. More precisely, a computer search implies that 4 hyperplanes do not suffice for this purpose (but 5 do).<br>We also develop computational approaches for attacking this extremal problem from combinatorial geometry in higher dimensions. They allow us to determine for example all maximal sliceable subsets of hypercube edges up to dimension 7.}},
  author       = {{Ziegler, Martin and Sohler, Christian}},
  booktitle    = {{Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00)}},
  pages        = {{73--79}},
  title        = {{{Computing Cut Numbers}}},
  year         = {{2000}},
}

@article{18446,
  abstract     = {{We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called periodic. The number of parallel steps performed during a single run of M is called its period, the sorting time of M is the total number of parallel steps that are necessary to sort in the worst case. Periodic sorting networks have the advantage that they need little hardware (control logic, wiring, area) and that they are adaptive. We are interested in comparator networks of a constant period, due to their potential applications in hardware design.

Previously, very little was known on such networks. The fastest solutions required time O(nε) where the depth was roughly 1/ε. We introduce a general method called periodification scheme that converts automatically an arbitrary sorting network that sorts n items in time T(n) and that has layout area A(n) into a sorting network that has period 5, sorts ***(n • T(n) items in time O(T(<n)• log n), and has layout area O(A(n)) • T(n)). In particular, applying this scheme to Batcher's algorithms, we get practical period 5 comparator networks that sort in time O(log3n). For theoretical interest, one may use the AKS netork resulting in a period 5 comparator network with runtime O(log2n).}},
  author       = {{Lorys, Krzysztof and Wanka, Rolf and Oesterdiekhoff, Brigitte and Kutylowski, Miroslaw}},
  journal      = {{Journal of the ACM}},
  pages        = {{944--967}},
  title        = {{{Periodification Scheme: Constructing Sorting Networks with Constant Period}}},
  doi          = {{10.1145/355483.355490}},
  volume       = {{45}},
  year         = {{2000}},
}

@inproceedings{2211,
  author       = {{Czumaj, Artur and Scheideler, Christian}},
  booktitle    = {{32nd ACM Symposium on Theory of Computing}},
  pages        = {{38--47}},
  title        = {{{A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }}},
  year         = {{2000}},
}

@inproceedings{16495,
  author       = {{Meyer auf der Heide, Friedhelm and Räcke, Harald and Westermann, Matthias}},
  booktitle    = {{Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA '00}},
  isbn         = {{1581131852}},
  title        = {{{Data management in hierarchical bus networks}}},
  doi          = {{10.1145/341800.341814}},
  year         = {{2000}},
}

@inproceedings{16496,
  abstract     = {{We present a general framework for the development of on-line algorithms for data management in networks with limited memory capacities. These algorithms dynamically create and delete copies of shared data objects that can be read and written by the nodes in the network. Our algorithms aim to minimize the congestion, i.e., the maximum communication load over all network resources, so that that none of these resources become a communication bottleneck. We give several examples of networks for which our framework yields efficient algorithms, including meshes, fat-trees, hypercubic networks, and complete networks. For example, our framework yields an $O(d cdot log n)$-competitive caching algorithm for $d$-dimensional meshes of size $n$ with respect to the congestion on the communication links, and an $O(1)$-competitive algorithms for complete networks with respect to the congestion at the memory modules due to remote accesses. Previous work on data management in networks either neglects memory capacity constraints or minimizes only the total communication load, i.e., the sum of the communication load over all resources, which may produce congestion as some of the links become bottlenecks.}},
  author       = {{Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}},
  booktitle    = {{SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms}},
  isbn         = {{0898714532}},
  pages        = {{430–439}},
  title        = {{{Caching in networks}}},
  year         = {{2000}},
}

@inbook{16497,
  author       = {{Meyer auf der Heide, Friedhelm and Kutyłowski, Mirosław and Ragde, Prabhakar}},
  booktitle    = {{Euro-Par 2000 Parallel Processing}},
  isbn         = {{9783540679561}},
  issn         = {{0302-9743}},
  title        = {{{Complexity Theory and Algorithms}}},
  doi          = {{10.1007/3-540-44520-x_59}},
  year         = {{2000}},
}