@inproceedings{3210, author = {{Wehrheim, Heike}}, booktitle = {{Theoretical Aspects of Computing - {ICTAC} 2008, 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings}}, editor = {{S. Fitzgerald, John and Elisabeth Haxthausen, Anne and Yenig{\"{u}}n, H{\"{u}}sn{\"{u}}}}, pages = {{380----394}}, title = {{{Bounded Model Checking for Partial Kripke Structures}}}, doi = {{10.1007/978-3-540-85762-4_26}}, year = {{2008}}, } @inproceedings{3143, author = {{Gajek, Sebastian and Jager, Tibor and Manulis, Mark and Schwenk, Jörg}}, booktitle = {{Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings}}, pages = {{115----129}}, title = {{{A Browser-Based Kerberos Authentication Scheme}}}, doi = {{10.1007/978-3-540-88313-5_8}}, year = {{2008}}, } @inproceedings{3144, author = {{Altmann, Kristina and Jager, Tibor and Rupp, Andy}}, booktitle = {{Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations}}, pages = {{437----448}}, title = {{{On Black-Box Ring Extraction and Integer Factorization}}}, doi = {{10.1007/978-3-540-70583-3_36}}, year = {{2008}}, } @inproceedings{3145, author = {{Jager, Tibor and Schwenk, Jörg}}, booktitle = {{Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings}}, pages = {{200----209}}, title = {{{On the Equivalence of Generic Group Models}}}, doi = {{10.1007/978-3-540-88733-1_14}}, year = {{2008}}, } @techreport{2737, author = {{Gries, Thomas and Redlin, Margarete}}, isbn = {{978-92-9230-116-3}}, pages = {{37}}, publisher = {{WIDER Research Papers, United Nations University (UNU)}}, title = {{{International integration and regional development in China }}}, volume = {{2008.66}}, year = {{2008}}, } @book{17465, editor = {{Peckhaus, Volker and Bernhard, Peter}}, isbn = {{978-3-89785-594-6}}, pages = {{471}}, publisher = {{mentis Verlag}}, title = {{{Methodisches Denken im Kontext. Festschrift für Christian Thiel, mit einem unveröffentlichten Brief Gottlob Freges}}}, year = {{2008}}, } @inproceedings{17868, abstract = {{The paper describes an approach for an aggregated animation of a simulation experiment in an interactive 3D environment, visualizing multiple, distributed simulation runs. Although the general approach of a 3-dimensional visualization of material flow simulation helps to understand the dynamic behavior of a system better as well as faster, it remains unclear, how typical the animated simulation represents the model, if there is a stochastic influence for even some parameters. By the integrated visualization of multiple distributed simulation runs, this uncertainty can be solved, which will be shown in this paper for a typical simulation study of a queuing system. }}, author = {{Dangelmaier, Wilhelm and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Suess, Tim}}, booktitle = {{2008 Winter Simulation Conference}}, isbn = {{9781424427079}}, pages = {{2012--2020}}, title = {{{Aggregated 3D-visualization of a distributed simulation experiment of a queuing system}}}, doi = {{10.1109/wsc.2008.4736296}}, year = {{2008}}, } @inproceedings{19003, author = {{Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}}, booktitle = {{Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)}}, isbn = {{9783540699002}}, issn = {{0302-9743}}, pages = {{378--389}}, title = {{{The Kinetic Facility Location Problem}}}, doi = {{10.1007/978-3-540-69903-3_34}}, year = {{2008}}, } @inproceedings{19004, abstract = {{We present a deterministic kinetic data structure for the facility location problem that maintains a subset of the moving points as facilities such that, at any point of time, the sum of the maintenance cost for the facilities and the connection cost for the clients is at most a constant factor larger than the current optimal cost. In our scenario, each point can open a facility and moves continuously along a known trajectory in a d-dimensional Euclidean space where d is a constant. Our kinetic data structure has a storage requirement of O(n (log^d(n)+log(nR))), where n is the number of points and R is the ratio of the product of the maximum maintenance cost and demand to the product of their corresponding minimum values. In the case that each trajectory can be described by a bounded degree polynomial, the data structure processes O(n^2 log^2(nR)) events, each requiring only O(log(nR)) facility changes and O(log^(d+1)(n) log(nR)) time. This results in a total processing time of O(n^2 log^(d+1)(n) log^3(nR)). To the best of our knowledge, this is the first kinetic data structure for the facility location problem.}}, author = {{Gehweiler, Joachim and Lammersen, Christiane and Degener, Bastian}}, booktitle = {{Proceedings of the 24th European Workshop on Computational Geometry}}, pages = {{251--254}}, title = {{{The Kinetic Facility Location Problem}}}, year = {{2008}}, } @inproceedings{1941, author = {{Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}}, booktitle = {{Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}}, isbn = {{978-3-540-89334-9}}, pages = {{124----140}}, publisher = {{Springer}}, title = {{{Tiara: A Self-stabilizing Deterministic Skip List}}}, doi = {{10.1007/978-3-540-89335-6_12}}, volume = {{5340}}, year = {{2008}}, } @inbook{1942, author = {{Scheideler, Christian}}, booktitle = {{Taschenbuch der Algorithmen}}, isbn = {{978-3-540-76393-2}}, pages = {{229----236}}, publisher = {{Springer}}, title = {{{Broadcasting: Wie verbreite ich schnell Informationen?}}}, doi = {{10.1007/978-3-540-76394-9_22}}, year = {{2008}}, } @proceedings{1943, editor = {{Hegering, Heinz-Gerd and Lehmann, Axel and Jürgen Ohlbach, Hans and Scheideler, Christian}}, isbn = {{978-3-88579-227-7}}, title = {{{INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland}}}, volume = {{133}}, year = {{2008}}, } @book{1945, author = {{Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea}}, isbn = {{978-3-540-76393-2}}, title = {{{Taschenbuch der Algorithmen}}}, year = {{2008}}, } @inproceedings{2355, author = {{Brinkmann, André and Effert, Sascha}}, booktitle = {{Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)}}, pages = {{551--554}}, publisher = {{Springer}}, title = {{{Redundant Data Placement Strategies for Cluster Storage Environments}}}, doi = {{10.1007/978-3-540-92221-6_38}}, year = {{2008}}, } @inproceedings{2383, author = {{Lietsch, Stefan and Hermann Lensing, Paul}}, booktitle = {{Proc. Int. Symp. on Visual Computing (ISVC)}}, pages = {{658--668}}, publisher = {{Springer}}, title = {{{GPU-Supported Image Compression for Remote Visualization - Realization and Benchmarking}}}, doi = {{10.1007/978-3-540-89639-5_63}}, volume = {{5358}}, year = {{2008}}, } @inbook{2384, author = {{Laroque, Christoph and Lietsch, Stefan and Zabel, Henning}}, booktitle = {{Augmented & Virtual Reality in der Produktentstehung}}, isbn = {{978-3-939350-51-4}}, pages = {{221--239}}, publisher = {{Heinz Nixdorf Institut}}, title = {{{Computational Steering verteilter, interaktiver Materialflusssimulationen}}}, volume = {{232}}, year = {{2008}}, } @inproceedings{2386, author = {{Bienkowski, Marcin and Brinkmann, André and Korzeniowski, Miroslaw}}, booktitle = {{Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)}}, pages = {{184--196}}, publisher = {{Springer}}, title = {{{Degree 3 Suffices: A Large-Scale Overlay for P2P Networks}}}, doi = {{10.1007/978-3-540-92221-6_13}}, year = {{2008}}, } @inproceedings{20367, author = {{Hamann, Heiko and Wörn, Heinz}}, booktitle = {{The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)}}, isbn = {{9783540691334}}, issn = {{0302-9743}}, pages = {{447----456}}, title = {{{Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem}}}, doi = {{10.1007/978-3-540-69134-1_44}}, volume = {{5040}}, year = {{2008}}, } @article{20369, abstract = {{Designing and analyzing self-organizing systems such as robotic swarms is a challenging task even though we have complete knowledge about the robot’s interior. It is difficult to determine the individual robot’s behavior based on the swarm behavior and vice versa due to the high number of agent–agent interactions. A step towards a solution of this problem is the development of appropriate models which accurately predict the swarm behavior based on a specified control algorithm. Such models would reduce the necessary number of time-consuming simulations and experiments during the design process of an algorithm. In this paper we propose a model with focus on an explicit representation of space because the effectiveness of many swarm robotic scenarios depends on spatial inhomogeneity. We use methods of statistical physics to address spatiality. Starting from a description of a single robot we derive an abstract model of swarm motion. The model is then extended to a generic model framework of communicating robots. In two examples we validate models against simulation results. Our experience shows that qualitative correctness is easily achieved, while quantitative correctness is disproportionately more difficult but still possible.}}, author = {{Hamann, Heiko and Wörn, Heinz}}, issn = {{1935-3812}}, journal = {{Swarm Intelligence}}, number = {{2-4}}, pages = {{209--239}}, title = {{{A framework of space–time continuous models for algorithm design in swarm robotics}}}, doi = {{10.1007/s11721-008-0015-3}}, volume = {{2}}, year = {{2008}}, } @inbook{20711, author = {{Monien, Burkhard and Lorenz, Ulf and Warner, Daniel}}, booktitle = {{Taschenbuch der Algorithmen}}, isbn = {{9783540763932}}, title = {{{Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?}}}, doi = {{10.1007/978-3-540-76394-9_28}}, year = {{2008}}, }