@phdthesis{19639, author = {{Vöcking, Berthold}}, isbn = {{3-931466-45-0}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Static and Dynamic Data Management in Networks}}}, volume = {{46}}, year = {{1998}}, } @techreport{19735, abstract = {{The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In addition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in the implementation of the PUB library deviate significantly from the techniques used in other BSP libraries.}}, author = {{Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}}, title = {{{The Paderborn University BSP (PUB) Library - Design, Implementation and Performance}}}, year = {{1998}}, } @inproceedings{3255, author = {{Gehrke, Thomas and Huhn, Michaela and Niebert, Peter and Rensink, Arend and Wehrheim, Heike}}, booktitle = {{Formale Beschreibungstechniken f{\"{u}}r verteilte Systeme, 8. GI/ITG-Fachgespr{\"{a}}ch, Cottbus, 4. und 5. Juni 1998}}, editor = {{K{\"{o}}nig, Hartmut and Langend{\"{o}}rfer, Peter}}, pages = {{185----196}}, title = {{{A Process Algebra Semantics for {MSC} Including Conditions}}}, year = {{1998}}, } @inproceedings{3256, author = {{Gehrke, Thomas and Huhn, Michaela and Rensink, Arend and Wehrheim, Heike}}, booktitle = {{Formal Description Techniques and Protocol Specification, Testing and Verification, {FORTE} {XI} / {PSTV} XVIII'98, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols {(FORTE} {XI)} and Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6 November, 1998, Paris, France}}, editor = {{Budkowski, Stanislaw and R. Cavalli, Ana and Najm, Elie}}, pages = {{3----18}}, title = {{{An Algebraic Semantics for Message Sequence Chart Documents}}}, year = {{1998}}, } @inproceedings{3257, author = {{Huhn, Michaela and Niebert, Peter and Wehrheim, Heike}}, booktitle = {{Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings}}, editor = {{Arvind, Vikraman and Ramanujam, Ramaswamy}}, pages = {{271----282}}, title = {{{Partial Order Reductions for Bisimulation Checking}}}, doi = {{10.1007/978-3-540-49382-2_26}}, year = {{1998}}, } @article{3028, author = {{Blömer, Johannes and Trachsler, Beat}}, journal = {{Technical report/Departement of Computer Science, ETH Zürich}}, title = {{{A lower bound for a class of graph based loss resilient codes}}}, year = {{1998}}, } @inbook{17412, abstract = {{We study algorithmic aspects in the management of geometric scenes in interactive walkthrough animations. We consider arbitrarily large scenes consisting of unit size balls. For a smooth navigation in the scene we have to fulfill hard real time requirements. Therefore, we need algorithms whose running time is independent of the total number of objects in the scene and that use as small space as possible. In this work we focus on one of the basic operations in our walkthrough system: reporting the objects around the visitor within a certain distance. Previously a randomized data structure was presented that supports reporting the balls around the visitor in an output sensitive time and allows insertion and deletion of objects nearly as fast as searching. These results were achieved by exploiting the fact that the visitor moves ''slowly'' through the scene. A serious disadvantage of the aforementioned data structure is a big space overhead and the use of randomization. Our first result is a construction of weak spanners that leads to an improvement of the space requirement of the previously known data structures. Then we develop a deterministic data structure for the searching problem in which insertion of objects are allowed. Our incremental data structure supports O(1+k) reporting time, where k is a certain quantity close to the number of reported objects. The insertion time is similar to the reporting time and the space is linear to the total number of objects. }}, author = {{Fischer, Matthias and Lukovszki, Tamás and Ziegler, Martin}}, booktitle = {{Algorithms — ESA’ 98}}, isbn = {{9783540648482}}, issn = {{0302-9743}}, title = {{{Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time}}}, doi = {{10.1007/3-540-68530-8_14}}, year = {{1998}}, } @inproceedings{17863, abstract = {{New dynamic search data structures developed recently guarantee constant execution time per search and update, i.e., they fulfil the real-time requirements necessary for interactive walkthrough in large geometric scenes. Yet, superiority or even applicability of these new methods in practice was still an open question. Their prototypical implementation presented in this work uses common libraries on standard stations and thus represents a first strut to bridge this gap. Indeed our experimental results give an indication on the actual performance of these theoretical ideas on real machines and possible bottlenecks in future developments. By special algorithmic enhancements, we can even avoid the otherwise essential preprocessing step. }}, author = {{Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin }}, booktitle = {{Algorithm Engineering, 2nd International Workshop, {WAE '98}}}, pages = {{133----142}}, publisher = {{Max-Planck-Institut für Informatik}}, title = {{{A Network Based Approach for Realtime Walkthrough of Massive Models}}}, year = {{1998}}, } @techreport{18145, abstract = {{Preis für den Beitrag "Multimediale Entdeckungsreisen unserer Welt mit dem Internet"}}, author = {{Ziegler, Martin and Fischer, Matthias and Lukovszki, Tamás}}, title = {{{Multimediale Entdeckungsreisen unserer Welt mit dem Internet}}}, year = {{1998}}, } @phdthesis{18445, author = {{Oesterdiekhoff, Brigitte}}, title = {{{On Periodic Comparator Networks}}}, year = {{1998}}, } @article{2168, author = {{Scheideler, Christian and Vöcking, Berthold}}, journal = {{Theory Comput. Syst.}}, number = {{4}}, pages = {{425----449}}, title = {{{Universal Continuous Routing Strategies}}}, doi = {{10.1007/s002240000096}}, volume = {{31}}, year = {{1998}}, } @inproceedings{2169, author = {{Adler, Micah and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{259----268}}, title = {{{Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)}}}, year = {{1998}}, } @inproceedings{2170, author = {{Feige, Uriel and Scheideler, Christian}}, booktitle = {{STOC}}, pages = {{624----633}}, title = {{{Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)}}}, year = {{1998}}, } @article{21784, author = {{Domik, Gitta and Vollbracht, S.}}, journal = {{Zeitschrift Forschungsforum Paderborn}}, title = {{{Dreidimensionale Welten auf flachen Bildschirmen}}}, year = {{1998}}, } @inproceedings{21785, author = {{D. Stuwe, J. and Lenz, C. and Domik, Gitta}}, booktitle = {{Proceedings. Computer Graphics International (Cat. No.98EX149)}}, pages = {{111--112}}, title = {{{Visualization of geographic data using VRML-an Internet client, for a geographic information system (GIS)}}}, doi = {{10.1109/CGI.1998.694258}}, volume = {{1}}, year = {{1998}}, } @book{2185, author = {{Scheideler, Christian}}, isbn = {{978-3-540-69792-3}}, title = {{{Universal Routing Strategies for Interconnection Networks}}}, doi = {{10.1007/BFb0052928}}, volume = {{1390}}, year = {{1998}}, } @proceedings{7793, abstract = {{During the last 20 years several different formal and semi-formal specification techniques have been successfully developed and used. Applications comprise the specification of simple programs, data types and processes as well as complex hardware and software systems. The variety of specification techniques ranges from formal set theoretical, algebraic, and logic approaches for specifying sequential systems and from Petri-nets, process algebras, automata, and graph grammars for specifying concurrent and distributed behaviors to semi-formal software engineering methods for developing complex systems. Formal and semi-formal approaches have their advantages and disadvantages: the informal diagrammatic methods are easier to understand and to apply but they can be ambiguous. Due to the different nature of the employed diagrams and descriptions it is often difficult to get a comprehensive view of all functional and dynamic properties. On the other hand, the formal approaches are more difficult to learn and require mathematical training. But they provide mathematical rigor for analysis and prototyping of designs. Verification is possible only with formal techniques. Since a few years many researchers and research groups are putting more and more effort in closing this gap by integrating semi-formal and formal specification techniques. Their studies and experiences show the added value of combining semi-formal and formal techniques and at the same time open a whole range of new problems and questions which cannot be asked when studying formalisms in isolation. In this seminar more than 40 scientists came together in 28 talks and two panel discussions to study possibilities and solutions for integrating and validating different formal and semi-formal specification techniques. Similarities and differences of formal and semi-formal specification formalisms as well as possibilities for combining such techniques were discussed. Most talks of this seminar analysed, compared, or integrated at least two such methods. On behalf of all participants the organizers would like to thank the staff of Schloss Dagstuhl for providing an excellent environment to the conference. The support of the TMR programme of the European Community is gratefully acknowledged. Due to this programme it was possible to fund the participation of several young researchers and of three key note speakers.}}, editor = {{Engels, Gregor and Ehrig, Hartmut and Orejas, Fernando and Wirsing, M.}}, publisher = {{Schloss Dagstuhl, Leibniz Center for Informatics}}, title = {{{Semi-Formal and Formal Specification Techniques}}}, volume = {{218}}, year = {{1998}}, } @proceedings{7794, editor = {{Engels, Gregor and Ehrig, Hartmut and Kreowski, Hans-Jörg and Rozenberg, Grzegorz}}, publisher = {{Springer}}, title = {{{6th International Workshop on Theory and Applications of Graph Transformations (TAGT '98), Paderborn, Selected Papers}}}, volume = {{1764}}, year = {{1998}}, } @inproceedings{7843, author = {{Depke, Ralph and Engels, Gregor and Mehner, Katharina and Sauer, Stefan and Wagner, Annika}}, booktitle = {{Proceedings of the GI-Fachtagung on Softwaretechnik (1998), Paderborn (Germany)}}, number = {{3}}, pages = {{12--19}}, publisher = {{GI}}, title = {{{Ein Ansatz zur Verbesserung des Entwicklungsprozesses von Multimedia-Anwendungen}}}, volume = {{18}}, year = {{1998}}, } @inproceedings{7844, author = {{Didrich, Klaus and Wagner, Annika}}, booktitle = {{Proceedings of the World Conference on Integrated Design and Process Technology (IDPT 1998), Berlin (Germany)}}, pages = {{65--73}}, publisher = {{Society for Design and Process Science}}, title = {{{Integration of Single Pushout Transformation and Functional Programming}}}, volume = {{4}}, year = {{1998}}, }