@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{18750, author = {{Sohler, Christian and Czumaj, Artur}}, booktitle = {{Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms}}, pages = {{865--872}}, title = {{{Soft Kinetic Data Structures}}}, year = {{2001}}, } @article{18857, abstract = {{This paper investigates geometric problems in the context of property testing algorithms. Property testing is an emerging area in computer science in which one is aiming at verifying whether a given object has a predetermined property or is “far” from any object having the property. Although there has been some research previously done in testing geometric properties, prior works have been mostly dealing with the study of combinatorial notion of the distance defining whether an object is “far” or it is “close”; very little research has been done for geometric notion of distance measures, that is, distance measures that are based on the geometry underlying input objects. The main objective of this work is to develop sound models to study geometric problems in the context of property testing. Comparing to the previous work in property testing, there are two novel aspects developed in this paper: geometric measures of being close to an object having the predetermined property, and the use of geometric data structures as basic primitives to design the testers. We believe that the second aspect is of special importance in the context of property testing and that the use of specialized data structures as basic primitives in the testers can be applied to other important problems in this area. We shall discuss a number of models that in our opinion fit best geometric problems and apply them to study geometric properties for three very fundamental and representative problems in the area: testing convex position, testing map labeling, and testing clusterability.}}, author = {{Sohler, Christian and Czumaj, Artur}}, journal = {{Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)}}, pages = {{266--277}}, title = {{{Property Testing with Geometric Queries}}}, doi = {{10.1007/3-540-44676-1_22}}, 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}}, } @book{19110, author = {{Eke, Norbert Otto}}, pages = {{403}}, publisher = {{Igel}}, title = {{{Thomas Valentin: Der Hausfreund. Dramen (Edition)}}}, volume = {{8}}, year = {{2001}}, } @inbook{19145, author = {{Seng, Eva- Maria}}, booktitle = {{Modell und Wirklichkeit, Festschrift zum 60. Geburtstag von Richard Saage}}, editor = {{Reese-Schäfer, Walter and Kühnel, Martin and Rüdiger, Axel}}, pages = {{236--263}}, title = {{{Architektonischer Wunschtraum, literarische Utopie, bauliche Realität. Samjatins “Wir” und die Architektur des 20. Jahrhunderts}}}, year = {{2001}}, } @inbook{19184, author = {{Seng, Eva- Maria}}, booktitle = {{Das Echo Halles}}, editor = {{Lächele, Rainer}}, pages = {{59--92}}, title = {{{Christianopolis. Der utopische Architekturentwurf des Johann Valentin Andreae}}}, year = {{2001}}, } @article{19195, author = {{Seng, Eva- Maria}}, journal = {{MUT. Forum für Kultur, Politik und Geschichte, Nr.407, Juli 2001}}, number = {{Nr. 407}}, pages = {{18--27}}, title = {{{Vom Kristallpalast zum gläsernen Menschen}}}, year = {{2001}}, } @inbook{19367, author = {{Eke, Norbert Otto}}, booktitle = {{Grabbes Welttheater. Christian Dietrich Grabbe zum 200. Geburtstag}}, editor = {{Kopp, Detlev and Vogt, Michael}}, pages = {{71--101}}, publisher = {{Aisthesis}}, title = {{{„Alle Ehre deiner Narbe.“ Die Spur des Körpers im Werk Grabbes}}}, year = {{2001}}, } @inbook{19369, author = {{Eke, Norbert Otto}}, booktitle = {{Literaturkonzepte im Vormärz. Forum Vormärz Forschung. Jahrbuch 2000}}, editor = {{Vogt, Michael and Kopp, Detlev}}, pages = {{243--260}}, publisher = {{Aisthesis}}, title = {{{Faustisches im Schatten Goethes. Nikolaus Lenaus vormärzlicher Faust – eine Erinnerung}}}, year = {{2001}}, } @inbook{19371, author = {{Eke, Norbert Otto}}, booktitle = {{Thomas Valentin: Der Hausfreund. Dramen}}, editor = {{Eke, Norbert Otto}}, pages = {{387--403}}, publisher = {{Igel}}, title = {{{Der Dramatiker Thomas Valentin}}}, year = {{2001}}, } @misc{23421, author = {{Zimmer, Detmar}}, title = {{{Dichtsysteme zwischen einer Welle und einem feststehenden Gehäuseteil}}}, year = {{2001}}, } @misc{23423, author = {{Zimmer, Detmar}}, title = {{{Modular Gear System with Contrate Gear}}}, year = {{2001}}, } @article{23731, abstract = {{ On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field Z 2 was completed on a 4-processor Linux PC, using roughly 100 CPU-hours. The basic approach is a combination of the factorization software BIPOLAR and a parallel version of Cantor's multiplication algorithm. The PUB-library (Paderborn University BSP library) is used for the implementation of the parallel communication. }}, author = {{Bonorden, Olaf and von zur Gathen, Joachim and Gerhard, Jürgen and Müller, Olaf}}, issn = {{0163-5824}}, journal = {{ACM SIGSAM Bulletin}}, pages = {{16--18}}, title = {{{Factoring a binary polynomial of degree over one million}}}, doi = {{10.1145/504331.504333}}, 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}}, } @inproceedings{18166, abstract = {{What is the maximum number of edges of the d-dimensional hypercube, denoted by S(d,k), that can be sliced by k many hyperplanes? This question on combinatorial properties of Euclidean geometry arising from linear separability considerations in the theory of Perceptrons has become an issue on its own. We use computational and combinatorial methods to obtain new bounds on S(d,k), s<=8. These strengthen earlier results on hypercube cut numbers.}}, author = {{Ziegler, Martin and Emamy-Khansari, M. Reza}}, booktitle = {{Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG'2001)}}, pages = {{155--164}}, title = {{{New Bounds for Hypercube Slicing Numbers}}}, volume = {{AA}}, year = {{2001}}, } @inproceedings{18168, abstract = {{We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing rather than the RealRAM model. Asking for mere computability of a function's maximum over some closed domain, we show that the common presumptions 'full-dimensional' and `bounded' in fact cannot be omitted: The sound framework of Recursive Analysis enables us to rigorously prove this folkloristic observation! On the other hand, convexity of this domain may be weakened to connectedness, and even NON-linear functions turn out to be effectively optimizable.}}, author = {{Brattka, Vasco and Ziegler, Martin}}, booktitle = {{Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG'01)}}, pages = {{181--184}}, title = {{{Turing Computability of (Non-)Linear Optimization}}}, year = {{2001}}, } @inproceedings{18370, abstract = {{We present a new approximate occlusion-culling algorithm that in contrast to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For generating a frame, as far as possible only the visible objects are rendered that can be found quickly by an edge of the graph. The algorithm allows a real-time navigation with over 20 frames per second in complex scenes consisting of over 10 millions of polygons. Moreover, approximation errors are very low.}}, author = {{Klein, Jan and Fischer, Matthias}}, booktitle = {{Proc. of 3. GI-Informatiktage 2001}}, pages = {{275 -- 278}}, title = {{{Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph}}}, year = {{2001}}, } @inproceedings{22321, author = {{Zimmer, Detmar}}, booktitle = {{Variantenvielfalt in Produkten und Prozessen. Erfahrungen, Methoden und Instrumente}}, isbn = {{3-18-091645-1}}, pages = {{77--87}}, publisher = {{VDI-Gesellschaft Entwicklung Konstruktion Vertrieb (VDI-EKV)}}, title = {{{Entwicklung eines Getriebemotoren-Baukastens}}}, year = {{2001}}, } @article{22322, author = {{Zimmer, Detmar}}, journal = {{SMM - Schweizer Maschinenmarkt }}, number = {{17}}, title = {{{Kraft- oder Formschluss?}}}, volume = {{102}}, year = {{2001}}, }