@inproceedings{2428, abstract = {{ In this paper we present instance-specific accelerators for minimum-cost covering problems. We first define the covering problem and discuss a branch&bound algorithm to solve it. Then we describe an instance-specific hardware architecture that implements branch&bound in 3-valued logic and uses reduction techniques usually found in software solvers. Results for small unate covering problems reveal significant raw speedups. }}, author = {{Plessl, Christian and Platzner, Marco}}, booktitle = {{Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}}, keywords = {{minimum covering, accelerator, funding-sundance}}, pages = {{85--91}}, publisher = {{CSREA Press}}, title = {{{Instance-Specific Accelerators for Minimum Covering}}}, year = {{2001}}, } @article{2429, author = {{Plessl, Christian and Wilde, Erik}}, journal = {{iX}}, pages = {{88--93}}, publisher = {{Heise Verlag}}, title = {{{Server-Side-Techniken im Web – ein Überblick}}}, year = {{2001}}, } @misc{2430, abstract = {{In this report the design and implementation of an instance-specific accelerator for solving minimum covering problems will be presented. After an introduction to configurable computing in general, the minimum covering problem is defined and a branch and bound algorithm to solve it in software is presented. The remainder of the report shows how this branch and bound algorithm can be adopted to hardware. Specifically it is stressed how the various sophisticated strategies for deducing conditions for variables used by software solvers can be adopted to hardware and how a system which uses 3-valued logic to solve this problem can be designed. In addition to these considerations focusing on the architecture of the system, some important details of the actual implementation are given. A prototype has been implemented for showing the feasibility of the concept and for gaining information about speed and size of the hardware implementation. Cycle-accurate simulations for a set of benchmark problems have been done for determining the performance of the accelerator. The speed of the resulting accelerators has been compared to the time a reference software solver (espresso) needs and the resulting speedups have been calculated. I have shown that a raw speedup of several orders of maginitude can be achieved for many problems; for some problems no speedup is achieved yet. After a discussion of the results, ideas for future work are presented.}}, author = {{Plessl, Christian}}, publisher = {{Computer Engineering and Networks Lab, ETH Zurich, Switzerland}}, title = {{{Reconfigurable Accelerators for Minimum Covering}}}, year = {{2001}}, } @inproceedings{2432, abstract = {{In this paper, we present the analysis of applications from the domain of handheld and wearable computing. This analysis is the first step to derive and evaluate design parameters for dynamically reconfigurable processors. We discuss the selection of representative benchmarks for handhelds and wearables and group the applications into multimedia, communications, and cryptography programs. We simulate the applications on a cycle-accurate processor simulator and gather statistical data such as instruction mix, cache hit rates and memory requirements for an embedded processor model. A breakdown of the executed cycles into different functions identifies the most compute-intensive code sections - the kernels. Then, we analyze the applications and discuss parameters that strongly influence the design of dynamically reconfigurable processors. Finally, we outline the construction of a parameterizable simulation model for a reconfigurable unit that is attached to a processor core.}}, author = {{Enzler, Rolf and Platzner, Marco and Plessl, Christian and Thiele, Lothar and Tröster, Gerhard}}, booktitle = {{Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing and Communications III}}, keywords = {{benchmark}}, pages = {{135--146}}, title = {{{Reconfigurable Processors for Handhelds and Wearables: Application Analysis}}}, doi = {{10.1117/12.434376}}, volume = {{4525}}, year = {{2001}}, } @article{3244, author = {{Rensink, Arend and Wehrheim, Heike}}, journal = {{Acta Inf.}}, number = {{3}}, pages = {{155----234}}, title = {{{Process algebra with action dependencies}}}, doi = {{10.1007/s002360100070}}, year = {{2001}}, } @article{3245, author = {{Bartetzko, Detlef and Fischer, Clemens and Möller, Michael and Wehrheim, Heike}}, journal = {{Electr. Notes Theor. Comput. Sci.}}, number = {{2}}, pages = {{103----117}}, title = {{{Jass - Java with Assertions}}}, doi = {{10.1016/S1571-0661(04)00247-6}}, year = {{2001}}, } @inproceedings{3246, author = {{Fischer, Clemens and Olderog, Ernst-Rüdiger and Wehrheim, Heike}}, booktitle = {{Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings}}, editor = {{Hu{\ss}mann, Heinrich}}, pages = {{91----108}}, title = {{{A {CSP} View on {UML-RT} Structure Diagrams}}}, doi = {{10.1007/3-540-45314-8_8}}, year = {{2001}}, } @article{2139, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, journal = {{Combinatorica}}, number = {{1}}, pages = {{95----138}}, title = {{{Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}}}, doi = {{10.1007/s004930170007}}, volume = {{21}}, year = {{2001}}, } @inproceedings{2140, author = {{Awerbuch, Baruch and Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}}, booktitle = {{FOCS}}, pages = {{158----167}}, publisher = {{IEEE Computer Society}}, title = {{{Simple Routing Strategies for Adversarial Systems}}}, year = {{2001}}, } @inproceedings{2141, author = {{Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}}, booktitle = {{PDP}}, pages = {{227----234}}, publisher = {{IEEE Computer Society}}, title = {{{SIMLAB-A Simulation Environment for Storage Area Networks}}}, year = {{2001}}, } @inproceedings{2142, author = {{Kolman, Petr and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{38----47}}, title = {{{Simple on-line algorithms for the maximum disjoint paths problem}}}, year = {{2001}}, } @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}}, } @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}}, }