@article{64713, author = {{Glöckner, Helge and Willis, George A.}}, issn = {{0146-4124}}, journal = {{Topology Proceedings}}, keywords = {{22D05, 22D10, 46L05}}, number = {{2}}, pages = {{565–591}}, title = {{{Topologization of Hecke pairs and Hecke C^*-algebras.}}}, volume = {{26}}, year = {{2002}}, } @inproceedings{2552, author = {{Karl, Holger}}, booktitle = {{Proc. Wireless World Research Forum Kickoff Meeting (WWRF)}}, title = {{{Relaying in Wireless Access Networks – A Capacity and Energy-Efficiency Perspective }}}, year = {{2001}}, } @inproceedings{2554, author = {{Karl, Holger}}, publisher = {{Eork-in-progress session of mobicom 2001}}, title = {{{Relaying ñ bad for energy, good for capacity?}}}, year = {{2001}}, } @inproceedings{2556, author = {{Karl, Holger and Hentschel, T.}}, booktitle = {{Zukunftsperspektiven der Mobilkommunikation, Symposium Bundesministerium für Bildung und Forschung}}, title = {{{IBMS 2 - Integriertes Bandbreiteneffizientes Mobiles Software-Radio System}}}, year = {{2001}}, } @phdthesis{19622, author = {{Schröder, Klaus}}, isbn = {{3-931466-88-4}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing}}}, volume = {{89}}, year = {{2001}}, } @inproceedings{19797, author = {{Salzwedel, Kay and Hartmann, Georg and Wolff, Carsten and Preis, Robert}}, booktitle = {{Proceedings of the PDPTA 2001}}, pages = {{463--470}}, title = {{{Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)}}}, volume = {{1}}, year = {{2001}}, } @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}}, }