@inproceedings{24338,
  author       = {{Grünewald, Matthias and Lukovszki, Tamás and Schindelhauer, Christian and Volbert, Klaus}},
  booktitle    = {{Proceedings of the 8th International Euro-Par Conference}},
  issn         = {{0302-9743}},
  title        = {{{Distributed Maintenance of Resource Efficient Wireless Network Topologies}}},
  doi          = {{10.1007/3-540-45706-2_134}},
  year         = {{2002}},
}

@inproceedings{18566,
  abstract     = {{We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node or move to another node. The hunter is assumed to be restricted to the graph G: in every round, the hunter can move using at most one edge. For the rabbit we investigate two models: in one model the rabbit is restricted to the same graph as the hunter, and in the other model the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round.

We say that the rabbit is caught as soon as hunter and rabbit are located at the same node in a round. The goal of the hunter is to catch the rabbit in as few rounds as possible, whereas the rabbit aims to maximize the number of rounds until it is caught. Given a randomized hunter strategy for G, the escape length for that strategy is the worst case expected number of rounds it takes the hunter to catch the rabbit, where the worst case is with regards to all (possibly randomized) rabbit strategies. Our main result is a hunter strategy for general graphs with an escape length of only O
(n log (diam(G))) against restricted as well as unrestricted rabbits. This bound is close to optimal since Ω(n) is a trivial lower bound on the escape length in both models. Furthermore, we prove that our upper bound is optimal up to constant factors against unrestricted rabbits.}},
  author       = {{Adler, Micah and Räcke, Harald and Sivadasan, Naveen and Sohler, Christian and Vöcking, Berthold}},
  booktitle    = {{Proceedings of the 29th International Colloquium on Automata, Languages and Programming}},
  isbn         = {{9783540438649}},
  issn         = {{0302-9743}},
  title        = {{{Randomized Pursuit-Evasion in Graphs}}},
  doi          = {{10.1007/3-540-45465-9_77}},
  year         = {{2002}},
}

@inbook{16723,
  author       = {{Meyer auf der Heide, Friedhelm and Kumar, Mohan and Nikoletseas, Sotiris and Spirakis, Paul}},
  booktitle    = {{Euro-Par 2002 Parallel Processing}},
  isbn         = {{9783540440499}},
  issn         = {{0302-9743}},
  title        = {{{Mobile Computing, Mobile Networks}}},
  doi          = {{10.1007/3-540-45706-2_133}},
  year         = {{2002}},
}

@article{18749,
  author       = {{Czumaj, Artur and Sohler, Christian}},
  isbn         = {{9783540422877}},
  issn         = {{0302-9743}},
  journal      = {{Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)}},
  pages        = {{493--505}},
  title        = {{{Testing Hypergraph Coloring}}},
  doi          = {{10.1007/3-540-48224-5_41}},
  year         = {{2001}},
}

@inproceedings{18964,
  author       = {{Lukovszki, Tamás and Maheshwari, Anil and Zeh, Norbert}},
  booktitle    = {{Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS}},
  isbn         = {{9783540430025}},
  issn         = {{0302-9743}},
  title        = {{{I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems}}},
  doi          = {{10.1007/3-540-45294-x_21}},
  year         = {{2001}},
}

@inproceedings{18152,
  abstract     = {{Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them suffer from instabilities when applied to degenerate matrices, i.e., those having multiple eigenvalues. We investigate the spectral representation's effectivity properties on the sound formal basis of computable analysis. It turns out that in general the eigenvectors cannot be computed from a given matrix. If however the size of the matrix' spectrum (=number of different eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in principle the spectral decomposition can be computed under remarkably weak non-degeneracy conditions.}},
  author       = {{Ziegler, Martin and Brattka, Vasco}},
  booktitle    = {{Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000)}},
  isbn         = {{9783540421979}},
  issn         = {{0302-9743}},
  pages        = {{378--388}},
  title        = {{{A Computable Spectral Theorem}}},
  doi          = {{10.1007/3-540-45335-0_23}},
  volume       = {{2064}},
  year         = {{2001}},
}

@inbook{16493,
  author       = {{Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Graph-Theoretic Concepts in Computer Science}},
  isbn         = {{9783540427070}},
  issn         = {{0302-9743}},
  title        = {{{Data Management in Networks}}},
  doi          = {{10.1007/3-540-45477-2_2}},
  volume       = {{2204}},
  year         = {{2001}},
}

@inbook{16494,
  author       = {{Meyer auf der Heide, Friedhelm and Wanka, Rolf}},
  booktitle    = {{Computational Science - ICCS 2001}},
  isbn         = {{9783540422334}},
  issn         = {{0302-9743}},
  title        = {{{Parallel Bridging Models and Their Impact on Algorithm Design}}},
  doi          = {{10.1007/3-540-45718-6_68}},
  year         = {{2001}},
}

@book{16722,
  editor       = {{Meyer auf der Heide, Friedhelm}},
  isbn         = {{9783540424932}},
  issn         = {{0302-9743}},
  publisher    = {{Springer }},
  title        = {{{Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark}}},
  doi          = {{10.1007/3-540-44676-1}},
  year         = {{2001}},
}

@inbook{3023,
  author       = {{Blömer, Johannes}},
  booktitle    = {{Automata, Languages and Programming}},
  isbn         = {{9783540677154}},
  issn         = {{0302-9743}},
  pages        = {{248--259}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices}}},
  doi          = {{10.1007/3-540-45022-x_22}},
  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}},
}

@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}},
}

@inbook{2435,
  author       = {{Simon, Jens and Reinefeld, Alexander and Heinz, Oliver}},
  booktitle    = {{SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters}},
  editor       = {{Hellwagner, Hermann and Reinefeld, Alexander}},
  isbn         = {{978-3-540-47048-9}},
  issn         = {{0302-9743}},
  pages        = {{367--381}},
  publisher    = {{Springer}},
  title        = {{{Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI}}},
  doi          = {{10.1007/10704208}},
  volume       = {{1734}},
  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}},
}

@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}},
}

@inproceedings{13608,
  author       = {{Eisenring, Michael and Platzner, Marco and Thiele, Lothar}},
  booktitle    = {{Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL)}},
  isbn         = {{9783540664574}},
  issn         = {{0302-9743}},
  pages        = {{205--214}},
  publisher    = {{Springer}},
  title        = {{{Communication Synthesis for Reconfigurable Embedded Systems}}},
  doi          = {{10.1007/978-3-540-48302-1_21}},
  volume       = {{1673}},
  year         = {{1999}},
}

@inbook{17412,
  abstract     = {{We study algorithmic aspects in the management of geometric scenes in interactive walkthrough animations. We consider arbitrarily large scenes consisting of unit size balls. For a smooth navigation in the scene we have to fulfill hard real time requirements. Therefore, we need algorithms whose running time is independent of the total number of objects in the scene and that use as small space as possible. In this work we focus on one of the basic operations in our walkthrough system: reporting the objects around the visitor within a certain distance. Previously a randomized data structure was presented that supports reporting the balls around the visitor in an output sensitive time and allows insertion and deletion of objects nearly as fast as searching. These results were achieved by exploiting the fact that the visitor moves ''slowly'' through the scene. A serious disadvantage of the aforementioned data structure is a big space overhead and the use of randomization. Our first result is a construction of weak spanners that leads to an improvement of the space requirement of the previously known data structures. Then we develop a deterministic data structure for the searching problem in which insertion of objects are allowed. Our incremental data structure supports O(1+k) reporting time, where k is a certain quantity close to the number of reported objects. The insertion time is similar to the reporting time and the space is linear to the total number of objects.
}},
  author       = {{Fischer, Matthias and Lukovszki, Tamás and Ziegler, Martin}},
  booktitle    = {{Algorithms — ESA’ 98}},
  isbn         = {{9783540648482}},
  issn         = {{0302-9743}},
  title        = {{{Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time}}},
  doi          = {{10.1007/3-540-68530-8_14}},
  year         = {{1998}},
}

@inbook{16562,
  author       = {{Meyer auf der Heide, Friedhelm and Martinez, Gabriel Terán}},
  booktitle    = {{LATIN'98: Theoretical Informatics}},
  isbn         = {{9783540642756}},
  issn         = {{0302-9743}},
  title        = {{{Communication-efficient parallel multiway and approximate minimum cut computation}}},
  doi          = {{10.1007/bfb0054332}},
  year         = {{1998}},
}

@inproceedings{13606,
  author       = {{Platzner, Marco and De Micheli, Giovanni}},
  booktitle    = {{Proceedings of the 8th International Workshop on Field Programmable Logic and Applications (FPL) }},
  isbn         = {{9783540649489}},
  issn         = {{0302-9743}},
  pages        = {{69--78}},
  publisher    = {{Springer }},
  title        = {{{Acceleration of satisfiability algorithms by reconfigurable hardware}}},
  doi          = {{10.1007/bfb0055234}},
  year         = {{1998}},
}