TY - JOUR AU - Meschut, Gerson ID - 21006 IS - 11 JF - Adhäsion TI - Eigenschaftsoptimierte Verbindungen durch wärmearmes Hybridfügen VL - 44 ER - TY - CONF AU - Koyro, M. AU - Meschut, Gerson ID - 21007 T2 - Tagungsband zur 4. Jahres- und 1. Europäischen Fachkonferenz “Kleben im Automobilbau” TI - Status und Weiterentwicklungsmöglichkeiten beim strukturellen Kleben bei Spaceframe-Konstruktionen ER - TY - JOUR AU - Adler, Micah AU - Scheideler, Christian ID - 2143 IS - 5/6 JF - Theory Comput. Syst. TI - Efficient Communication Strategies for Ad Hoc Wireless Networks VL - 33 ER - TY - JOUR AU - Scheideler, Christian AU - Vöcking, Berthold ID - 2145 IS - 4 JF - SIAM J. Comput. TI - From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols VL - 30 ER - TY - CONF AU - Berenbrink, Petra AU - Brinkmann, André AU - Scheideler, Christian ID - 2146 T2 - PDPTA TI - Distributed Path Selection for Storage Networks ER - TY - CONF AU - Czumaj, Artur AU - Scheideler, Christian ID - 2147 T2 - SODA TI - Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma ER - TY - JOUR AU - Czumaj, Artur AU - Scheideler, Christian ID - 2148 IS - 3-4 JF - Random Struct. Algorithms TI - Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma VL - 17 ER - TY - CONF AU - Brinkmann, André AU - Salzwedel, Kay AU - Scheideler, Christian ID - 2149 T2 - SPAA TI - Efficient, distributed data placement strategies for storage area networks (extended abstract) ER - TY - CONF AU - Czumaj, Artur AU - Scheideler, Christian ID - 2150 T2 - STOC TI - A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) ER - TY - BOOK ED - Peckhaus, Volker ID - 17458 SN - 0-8218-0844-3 TI - “Contributing Editor” für die Sektion “Philosophy of Mathematics” in: The History of Mathematics from Antiquity to the Present: A Selective Annotated Bibliography, edited by Joseph W. Dauben, revised edition on CD-ROM by Albert C. Lewis, in cooperation with the International Commission on the History Mathematics, American Mathematical Society ER - TY - JOUR AU - Peckhaus, Volker ID - 17528 IS - 2 (November) JF - Adef Revista de Filosofia (Buenos Aires) TI - Análisis regresivo VL - 15 ER - TY - CHAP AU - Mindt, Ilka ED - Mair, Christian ED - Hundt, Marianne ID - 17852 T2 - Corpus Linguistics and Linguistic Theory. Papers from the Twentieth International Conference on English Language Research on Computerized Corpora (ICAME 20) TI - Prosodic Cues at Speaker Turns ER - TY - GEN AB - 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. AU - Wand, Michael AU - Fischer, Matthias AU - Meyer auf der Heide, Friedhelm ID - 17865 TI - Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes ER - TY - CONF AU - Govindarajan, Sathish AU - Lukovszki, Tamas AU - Maheshwari, Anil AU - Zeh, Norbert ID - 18962 SN - 0178-4617 T2 - Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS TI - I/O-Efficient Well-Separated Pair Decomposition and Applications ER - TY - BOOK AB - 2., kartonierte Auflage: Berlin 2002 ED - Allkemper, Alo ED - Eke, Norbert Otto ID - 19084 TI - Deutsche Dramatiker des 20. Jahrhunderts ER - TY - BOOK ED - Allkemper, Alo ED - Eke, Norbert Otto ID - 19086 TI - Literatur und Demokratie ER - TY - CHAP AU - Seng, Eva- Maria ED - Lupfer, Gilbert ED - Rudert, Konstanze ED - Sigel, Paul ID - 19196 T2 - Bau + Kunst, Festschrift zum 65. Geburtstag von Jürgen Paul TI - Architektur und Ausstattung von Schloß Augustusburg als politisches Vermächtnis eines “Guten Regiments” und “Guter Ordnung” ER - TY - CONF AU - Karl, Holger AU - Polze, Andreas AU - Werner, Matthias ID - 1920 T2 - Proc. the Workshop on Run-Time Systems for Parallel Programming TI - Predictable Network Computing using Message-driven Scheduling ER - TY - CHAP AU - Eke, Norbert Otto ED - O' Dochartaigh, Pól ID - 19397 T2 - Jews in German Literature since 1945: German-Jewish Literature? TI - Das Schreckliche und das Komische. George Tabori und die Shoah ER - TY - CHAP AU - Eke, Norbert Otto ED - Wallace, Ian ED - Tate, Dennis ED - Labroisse, Gerd ID - 19398 T2 - Heiner Müller: Probleme und Perspektiven. Bath-Symposion 1998 TI - Körper-Schrift. Heiner Müllers Anthropologie des Körpers VL - 48 ER - 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(