@inproceedings{24277, abstract = {{We propose a dynamic, ad-hoc communication network consisting of mobile units that can warn about traffic jams on motorways. Our goal is to provide a practical, low cost solution. Therefore we consider very simple wireless communication hardware, without collision detection, with very small bandwidth and a probabilistic model of link failure. We provide a complete system architecture. For this purpose we design and analyze solutions for size approximation, leader election and broadcasting. Our algorithms are fine-tuned for fast operation in a practical setting. We provide both a theoretical and experimental evaluation of our solutions. Our contribution is much different from the previous work, where either pure theoretical models with a pure theoretical analysis are provided or algorithms working in practical models are evaluated only through simulations.}}, author = {{Kutyłowski, Jarosław and Zagórski, Filip}}, booktitle = {{SOFSEM 2006: Theory and Practice of Computer Science}}, issn = {{0302-9743}}, title = {{{Reliable Broadcasting Without Collision Detection}}}, doi = {{10.1007/11611257_37}}, year = {{2006}}, } @article{3223, author = {{Brückner, Ingo and Metzler, Björn and Wehrheim, Heike}}, journal = {{Nord. J. Comput.}}, number = {{1-2}}, pages = {{22----45}}, title = {{{Optimizing Slicing of Formal Specifications by Deductive Verification}}}, year = {{2006}}, } @inproceedings{3224, author = {{Derrick, John and Wehrheim, Heike}}, booktitle = {{Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings}}, editor = {{Johnson, Michael and Vene, Varmo}}, pages = {{111----126}}, title = {{{Model Transformations Incorporating Multiple Views}}}, doi = {{10.1007/11784180_11}}, year = {{2006}}, } @inproceedings{3225, author = {{Wehrheim, Heike}}, booktitle = {{Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, {ICFEM} 2006, Macao, China, November 1-3, 2006, Proceedings}}, editor = {{Liu, Zhiming and He, Jifeng}}, pages = {{514----528}}, title = {{{Incremental Slicing}}}, doi = {{10.1007/11901433_28}}, year = {{2006}}, } @proceedings{3226, editor = {{Gorrieri, Roberto and Wehrheim, Heike}}, isbn = {{3-540-34893-X}}, title = {{{Formal Methods for Open Object-Based Distributed Systems, 8th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2006, Bologna, Italy, June 14-16, 2006, Proceedings}}}, doi = {{10.1007/11768869}}, year = {{2006}}, } @article{3003, abstract = {{We give a brief introduction to probabilistic encryptions. This serves as an example how randomness plays a pivotal role in cryptographic systems that satisfy advanced security concepts.}}, author = {{Blömer, Johannes}}, journal = {{Journal of Universal Computer Science (J.UCS)}}, number = {{6}}, pages = {{654----671}}, title = {{{Randomness and Secrecy - A Brief Introduction}}}, doi = {{10.3217/jucs-012-06-0654}}, year = {{2006}}, } @inbook{3004, author = {{Blömer, Johannes and Krummel, Volker}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540462507}}, issn = {{0302-9743}}, pages = {{106--120}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Fault Based Collision Attacks on AES}}}, doi = {{10.1007/11889700_11}}, year = {{2006}}, } @inbook{3005, author = {{Blömer, Johannes and Otto, Martin}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540462507}}, issn = {{0302-9743}}, pages = {{13--23}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered}}}, doi = {{10.1007/11889700_2}}, year = {{2006}}, } @inbook{3007, author = {{Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540462507}}, issn = {{0302-9743}}, pages = {{36--52}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Sign Change Fault Attacks on Elliptic Curve Cryptosystems}}}, doi = {{10.1007/11889700_4}}, year = {{2006}}, } @inproceedings{26988, abstract = {{For most of today's IT environments, the tremendous need for storage capacity in combination with a required minimum I/O performance has become highly critical. In dynamically growing environments, a storage management solution's underlying data distribution scheme has great impact to the overall system I/O performance. The evaluation of a number of open system storage visualization solutions and volume managers has shown that all of them lack the ability to automatically adapt to changing access patterns and storage infrastructures; many of them require an error prone manual re-layout of the data blocks, or rely on a very time consuming re-striping of all available data. This paper evaluates the performance of conventional data distribution approaches compared to the adaptive virtualization solution V:DRIVE in dynamically changing storage environments. Changes of the storage infrastructure are normally not considered in benchmark results, but can have a significant impact on storage performance. Using synthetic benchmarks, V:DRIVE is compared in such changing environments with the non-adaptive Linux logical volume manager (LVM). The performance results of our tests clearly outline the necessity of adaptive data distribution schemes.}}, author = {{Brinkmann, Andre and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}}, booktitle = {{14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)}}, title = {{{Influence of adaptive data layouts on performance in dynamically changing storage environments}}}, doi = {{10.1109/pdp.2006.44}}, year = {{2006}}, } @inproceedings{20950, author = {{Meyer, Matthias}}, booktitle = {{Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento, Italy}}, pages = {{305--306}}, publisher = {{IEEE Computer Society}}, title = {{{Pattern-based Reengineering of Software Systems}}}, year = {{2006}}, } @inproceedings{20951, author = {{Giese, Holger and Meyer, Matthias and Wagner, Robert}}, booktitle = {{Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany}}, pages = {{56--60}}, publisher = {{University of Paderborn}}, title = {{{A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink}}}, volume = {{tr-ri-06-275}}, year = {{2006}}, } @inproceedings{20952, author = {{Tichy, Matthias and Meyer, Matthias and Giese, Holger}}, booktitle = {{Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany}}, pages = {{10--14}}, publisher = {{University of Paderborn}}, title = {{{On Semantic Issues in Story Diagrams}}}, volume = {{tr-ri-06-275}}, year = {{2006}}, } @misc{20967, author = {{Holtmann, Jörg}}, publisher = {{University of Paderborn}}, title = {{{Entwicklung von Geschäftsprozessmustern zur Qualitätssicherung}}}, year = {{2006}}, } @article{2110, author = {{Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}}, journal = {{IEEE Trans. Mob. Comput.}}, number = {{9}}, pages = {{1242----1254}}, title = {{{Survivable Monitoring in Dynamic Networks}}}, doi = {{10.1109/TMC.2006.138}}, year = {{2006}}, } @inproceedings{2111, author = {{Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian}}, booktitle = {{IPDPS}}, title = {{{Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}}}, year = {{2006}}, } @inproceedings{2112, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{OPODIS}}, pages = {{275----289}}, title = {{{Robust Random Number Generation for Peer-to-Peer Systems}}}, year = {{2006}}, } @inproceedings{2113, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{318----327}}, title = {{{Towards a scalable and robust DHT}}}, year = {{2006}}, } @proceedings{17417, abstract = {{We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.}}, editor = {{Rammig, Franz-Josef and Dangelmaier, Wilhelm and Karl, Holger and Mertsching, Bärbel and Meyer auf der Heide, Friedhelm and Trächtler, Ansgar}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems}}}, year = {{2006}}, } @book{17475, author = {{Monien, Burkhard and Meyer auf der Heide, Friedhelm}}, isbn = {{978-3-939350-00-2}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{New trends in parallel and distributed computing}}}, volume = {{181}}, year = {{2006}}, }