TY - CHAP AU - Eke, Norbert Otto ED - Allkemper, Alo ED - Eke, Norbert Otto ID - 19399 T2 - Deutsche Dramatiker des 20. Jahrhunderts TI - Thomas Brasch ER - TY - CHAP AU - Eke, Norbert Otto ED - Allkemper, Alo ED - Eke, Norbert Otto ID - 19400 T2 - Deutsche Dramatiker des 20. Jahrhunderts TI - George Tabori ER - TY - CHAP AU - Eke, Norbert Otto ED - Beutin, Wolfgang ED - Stein, Peter ID - 19401 T2 - Willibald Alexis (1798-1871). Ein Autor des Vor- und Nachmärz TI - Der Kritiker in der Kritik. Willibald Alexis, das Junge Deutschland und Alexis' autobiographische Fragmente Erinnerungen aus meinem Leben ER - TY - CHAP AU - Eke, Norbert Otto ED - Allkemper, Alo ED - Eke, Norbert Otto ID - 19403 T2 - Literatur und Demokratie TI - Wahrnehmung im Augen-Schein. Thomas Braschs (und Jurek Beckers) filmische Reflexion über die Kunst nach Auschwitz: „Der Passagier – Welcome to Germany“ ER - TY - GEN AU - Zimmer, Detmar ID - 23424 TI - Aus einem Getriebemodul und einem Antriebsmodul bestehende Antriebseinheit ER - TY - GEN AU - Zimmer, Detmar ID - 23425 TI - Getriebebaukasten mit Kronengetriebe ER - TY - CONF AB - 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. AU - Czumaj, Artur AU - Sohler, Christian AU - Ziegler, Martin ID - 17990 SN - 0302-9743 T2 - Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00) TI - Property Testing in Computational Geometry VL - 4698 ER - TY - BOOK ED - Fromme, J. ED - Ganguin, S. ED - Iske, S. ED - Meister, Dorothee M. ED - Sander, U. ID - 18121 TI - Medienbildung und Gesellschaft ER - TY - CONF AB - 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. AU - Ziegler, Martin AU - Brattka, Vasco ID - 18146 SN - 0302-9743 T2 - SOFSEM 2000: Theory and Practice of Informatics TI - Computing the Dimension of Linear Subspaces VL - 1963 ER - TY - CONF AB - What is the minimum number of hyperplanes that slice all edges of the d-dimensional hypercube? The answers have been known for d<=4.
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).
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. AU - Ziegler, Martin AU - Sohler, Christian ID - 18150 T2 - Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00) TI - Computing Cut Numbers ER - TY - JOUR AB - 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(