Suche
Aktuell:
16. Mai 2013
Hohe Auszeichnung für Paderborner Informatikprofessor Dr. Friedhelm Meyer auf der Heide
Prof. Dr. Friedhelm Meyer auf der Heide vom Heinz Nixdorf Institut der Universität Paderborn wurde als neues Mitglied in ...
Publikationen
DruckenUnsere Publikationen aus dem Jahr 2013:
Kling, Peter; Pietrzyk, Peter: Profitable Scheduling on Multiple Speed-Scalable Processors. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Jul. 2013, ACM
(Details)
Happe, Markus; Kling, Peter; Meyer auf der Heide, Friedhelm; Platzner, Marco; Plessl, Christian: On-The-Fly Computing: A Novel Paradigm for Individualized IT Services. In: Proceedings of the 9th Workshop on Software Technology for Future embedded and Ubiquitous Systems (SEUS), Jun. 2013, IEEE
(Details)
Meyer auf der Heide, Friedhelm: Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen. In: Gausemeier, Jürgen; Grafe, Michael; Meyer auf der Heide, Friedhelm (Hrsg.) 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, HNI-Verlagsschriftenreihe, Paderborn, S. 7--16, 18. - 19. Apr. 2013, Heinz Nixdorf Institut
(Details)
Petring, Ralf; Eikel, Benjamin; Jähn, Claudius; Fischer, Matthias; Meyer auf der Heide, Friedhelm: Darstellung heterogener 3-D-Szenen in Echtzeit. In: Gausemeier, Jürgen; Grafe, Michael; Meyer auf der Heide, Friedhelm (Hrsg.) 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, HNI-Verlagsschriftenreihe, Paderborn, Band 311 , S. 49--60, 18. - 19. Apr. 2013, Heinz Nixdorf Institut
(Details)
Gausemeier, Jürgen; Grafe, Michael; Meyer auf der Heide, Friedhelm (Hrsg.) 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung. HNI-Verlagsschriftenreihe, Paderborn, Band 311 , 18. - 19. Apr. 2013, Heinz Nixdorf Institut
(Details)
Brandes, Philipp; Kempkes, Barbara; Meyer auf der Heide, Friedhelm: Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. Theoretical Computer Science, to appear 2013
(Details)
Unsere Publikationen aus dem Jahr 2012:
Hoefer, Martin; Skopalik, Alexander: Social Context in Potential Games. In: Internet and Network Economics - 8th International Workshop, WINE 2012, Liverpool, UK, December 10-12, 2012. Proceedings, Band 7695 , S. 364-377, Dez. 2012, Springer
(Details)
Brandes, Philipp; Meyer auf der Heide, Friedhelm: Distributed Computing in Fault-Prone Dynamic Networks. In: 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), S. 9 - 14, Dez. 2012, ACM
(Details)
Cord-Landwehr, Andreas; Kling, Peter; Mallmann-Trenn, Frederik: Slow Down & Sleep for Profit in Online Deadline Scheduling. In: Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), Dez. 2012, Springer
(Details)
Cord-Landwehr, Andreas; Hüllmann, Martina; Kling, Peter; Setzer, Alexander: Basic Network Creation Games with Communication Interests. In: Algorithmic Game Theory, SAGT 2012, LNCS, Nr.7615 , S. 72-83, 22. - 23. Okt. 2012, Springer Berlin/Heidelberg
(Details)
Fanelli, Angelo; Moscardelli, Luca ; Skopalik, Alexander: On the Impact of Fair Best Response Dynamics. In: Mathematical Foundations of Computer Science 2012, Sep. 2012, Springer-Verlag
(Details)
Suess, Tim; Koch, Clemens; Jähn, Claudius; Fischer, Matthias; Meyer auf der Heide, Friedhelm: Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. In: Bebis, George; Boyle, Richard; Parvin, Bahram; Koracin, Darko; Fowlkes, Charless; Wang, Sen; Choi, Min-Hyung; Mantler, Stephan; Schulze, Jürgen P.; Acevedo, Daniel; Mueller, Klaus; Papka, Michael E. (Hrsg.) ISVC (1), Lecture Notes in Computer Science, Band 7431 , S. 502-512, 16. - 18. Jul. 2012, Springer
(Details)
Damerow, Valentina; Manthey, Bodo; Meyer auf der Heide, Friedhelm; Räcke, Harald; Scheideler, Christian; Sohler, Christian; Tantau, Till: Smoothed Analysis of Left-To-Right Maxima with Applications. ACM Transactions on Algorithms, 8(3)(30), Jul. 2012
(Details)
Kling, Peter; Meyer auf der Heide, Friedhelm; Pietrzyk, Peter: An Algorithm for Online Facility Leasing. In: Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, Band 7355 , S. 61--72, 30. Jun. - 2. Jul. 2012, Springer
(Details)
Kempkes, Barbara; Kling, Peter; Meyer auf der Heide, Friedhelm: Optimal and Competitive Runtime Bounds for Continuous, Local Gathering of Mobile Robots. In: Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM International Conference Proceeding Series, S. 18--26, 25. - 27. Jun. 2012
(Details)
Kempkes, Barbara; Meyer auf der Heide, Friedhelm: Continuous Local Strategies for Robotic Formation Problems. In: Proceedings of the 11th International Symposium on Experimental Algorithms - SEA, Lecture Notes in Computer Science, Band 7276 , S. 9-17, Jun. 2012, Springer-Verlag
(Details)
Caragiannis, Ioannis; Fanelli, Angelo; Gravin, Nick; Skopalik, Alexander: Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. In: ACM Conference on Electronic Commerce, 1. Jan. 2012 ACM, ACM
(Details)
Drees, Maximilian; Hüllmann, Martina; Koutsopoulos, Andreas ; Scheideler, Christian: Self-Organizing Particle Systems. In: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012
(Details)
Caragiannis, Ioannis; Fanelli, Angelo; Gravin, Nick; Skopalik, Alexander: Computing approximate pure Nash equilibria in congestion games. SIGecom Exchanges, 11(1): S. 26-29 2012
(Details)
Unsere Publikationen aus dem Jahr 2011:
Gehweiler, Joachim; Kling, Peter; Meyer auf der Heide, Friedhelm: An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In: Wyrzykowski, Roman; Wyrzykowski, Roman (Hrsg.) Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics, Lecture Notes in Computer Science, Nr.7204 , S. 31--40, 11. - 14. Sep. 2011, Springer Berlin/Heidelberg
(Details)
Abshoff, Sebastian; Cord-Landwehr, Andreas; Degener, Bastian; Kempkes, Barbara; Pietrzyk, Peter: Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In: Algorithms for Sensor Systems, 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2011), LNCS, Nr.7111 , S. 13--27, 8. - 9. Sep. 2011, Springer-Verlag
(Details)
Cord-Landwehr, Andreas; Degener, Bastian; Fischer, Matthias; Hüllmann, Martina; Kempkes, Barbara; Klaas, Alexander; Kling, Peter; Kurras, Sven; Märtens, Marcus; Meyer auf der Heide, Friedhelm; Raupach, Christoph; Swierkot, Kamil; Warner, Daniel; Weddemann, Christoph; Wonisch, Daniel: A new Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Lecture Notes in Computer Science, Band 6756 , S. 650--661, Jul. 2011, Springer-Verlag, Heidelberg, Germany
(Details)
Kling, Peter; Meyer auf der Heide, Friedhelm: Convergence of Local Communication Chain Strategies via Linear Transformations. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), S. 159--166, 4. - 6. Jun. 2011, ACM
(Details)
Eikel, Benjamin; Jähn, Claudius; Petring, Ralf: PADrend: Platform for Algorithm Development and Rendering. In: Gausemeier, Jürgen; Grafe, Michael; Meyer auf der Heide, Friedhelm (Hrsg.) Augmented & Virtual Reality in der Produktentstehung, HNI-Verlagsschriftenreihe, Paderborn, Band 295 , S. 159--170, Mai 2011, Heinz Nixdorf Institut, Universität Paderborn
(Details)
Gehweiler, Joachim: Peer-to-Peer Based Parallel Web Computing . Dissertation, University of Paderborn, HNI-Verlagsschriftenreihe, Paderborn, Mai 2011
(Details)
Suess, Tim; Jähn, Claudius; Fischer, Matthias; Meyer auf der Heide, Friedhelm; Koch, Clemens: Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. In: Gausemeier, Jürgen; Grafe, Michael; Meyer auf der Heide, Friedhelm (Hrsg.) Augmented & Virtual Reality in der Produktentstehung, HNI-Verlagsschriftenreihe, Paderborn, Band 295 , S. 185--197, Mai 2011, Heinz Nixdorf Institut, Universität Paderborn
(Details)
Suess, Tim; Koch, Clemens; Jähn, Claudius; Fischer, Matthias: Approximative occlusion culling using the hull tree. In: Proceedings of Graphics Interface 2011, S. 79--86, Mai 2011, Canadian Human-Computer Communications Society
(Details)
Suess, Tim; Koch, Clemens; Jähn, Claudius; Fischer, Matthias; Meyer auf der Heide, Friedhelm: Parallel Out-of-Core Occlusion Culling. Mrz. 2011
(Details)
Degener, Bastian; Fekete, Sándor; Kempkes, Barbara; Meyer auf der Heide, Friedhelm: A survey on relay placement with runtime and approximation guarantees. Computer Science Review, 5(1): S. 57-68, Feb. 2011
(Details)
Cord-Landwehr, Andreas; Degener, Bastian; Fischer, Matthias; Hüllmann, Martina; Kempkes, Barbara; Klaas, Alexander; Kling, Peter; Kurras, Sven; Märtens, Marcus; Meyer auf der Heide, Friedhelm; Raupach, Christoph; Swierkot, Kamil; Warner, Daniel; Weddemann, Christoph; Wonisch, Daniel: Collisionless Gathering of Robots with an Extent. In: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), Lecture Notes in Computer Science, Nr.6543 , S. 178-189, 22. - 28. Jan. 2011, Springer
(Details)
Briest, Patrick; Krysta, Piotr; Vöcking, Berthold: Approximation Techniques for Utilitarian Mechanism Design. SIAM Journal on Computing 2011
(Details)
Klaas, Alexander; Laroque, Christoph; Fischer, Matthias; Dangelmaier, Wilhelm: Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse. In: Proceedings of the 2011 Winter Simulation Conference, 2011
(Details)
Degener, Bastian; Kempkes, Barbara; Langner, Tobias; Meyer auf der Heide, Friedhelm; Wattenhofer, Roger: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: SPAA '11: Proc. of the 23rd annual ACM symposium on parallel algorithms and architectures, S. 139-147, 2011, ACM
(Details)
Brandes, Philipp; Degener, Bastian; Kempkes, Barbara; Meyer auf der Heide, Friedhelm: Energy-efficient strategies for building short chains of mobile robots locally. In: SIROCCO '11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, S. 138-149, 2011
(Details)
Degener, Bastian; Kempkes, Barbara; Meyer auf der Heide, Friedhelm: Organic Computing A Paradigm Shift for Complex Systems. , Autonomic Systems, Band 1 , Kapitel: Energy-Awareness in Self-organising Robotic Exploration Teams , S. 531-543, Springer Verlag, 2011. Auflage, 2011
(Details)
Briest, Patrick; Raupach, Christoph: The Car Sharing Problem. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011
(Details)
Briest, Patrick; Krysta, Piotr: Buying Cheap is Expensive: Approximability of Combinatorial Pricing Problems. SIAM Journal on Computing 2011
(Details)
Briest, Patrick; Hoefer, Martin; Krysta, Piotr: Stackelberg Network Pricing Games. Algorithmica 2011
(Details)
Renken, Hendrik; Laroque, Christoph; Fischer, Matthias: An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In: Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011
(Details)
Klaas, Alexander; Laroque, Christoph; Renken, Hendrik; Dangelmaier, Wilhelm: Goal-Based Agents in Material Flow Simulations - Integration of an Agent Programming Framework in the Discrete Event Simulator D3FACT. In: Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011
(Details)
Kempkes, Barbara; Meyer auf der Heide, Friedhelm: Local, Self-organizing Strategies for Robotic Formation Problems. In: ALGOSENSORS, Lecture Notes in Computer Science, Band 7111 , S. 4-12, 2011, Springer
(Details)
Degener, Bastian; Kempkes, Barbara; Meyer auf der Heide, Friedhelm: Building Simple Formations in Large Societies of Tiny Mobile Robots. Procedia CS, 7: S. 153-155 2011
(Details)
Schumacher, Tobias; Suess, Tim; Plessl, Christian; Platzner, Marco: FPGA Acceleration of Communication-Bound Streaming Applications: Architecture Modeling and a 3D Image Compositing Case Study. International Journal of Reconfigurable Computing, 2011: S. 1--11 2011
(Details)
Unsere Publikationen aus dem Jahr 2010:
Janson, Thomas; Mahlmann, Peter; Schindelhauer, Christian: A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. In: Proceedings of the 16th International Conference on Parallel and Distributed Systems (ICPADS10), Shanghai, China, 9. - 10. Dez. 2010, IEEE
(Details)
Fischer, Matthias; Renken, Hendrik; Laroque, Christoph; Schaumann, Guido; Dangelmaier, Wilhelm: Automated 3D-Motion Planning for Ramps and Stairs in Intra-Logistics Material Flow Simulations. In: Proceedings of the 2010 Winter Simulation Conference (WSC 2010), S. 1648 - 1660, 5. - 8. Dez. 2010 IEEE, Omnipress
(Details)
Suess, Tim; Wiesemann, Timo; Fischer, Matthias: Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments. In: 5th IEEE International Conference on Networking, Architecture, and Storage, S. 448 - 456, 15. - 17. Jul. 2010 IEEE Computer Society, IEEE Press
(Details)
Degener, Bastian; Gehweiler, Joachim; Lammersen, Christiane: Kinetic Facility Location. Algorithmica, 57(3): S. 562-584, Jul. 2010
(Details)
Abramsky, Samson ; Gavoille, Cyril ; Kirchner, Claude ; Meyer auf der Heide, Friedhelm; Spirakis, Paul G. (Hrsg.) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) Part II. LNCS, Band 6199 , Bordeaux, France, Jul. 2010, Springer
(Details)
Abramsky, Samson ; Gavoille, Cyril ; Kirchner, Claude ; Meyer auf der Heide, Friedhelm; Spirakis, Paul G. (Hrsg.) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) Part I. LNCS, Band 6198 , Bordeaux, France, Jul. 2010, Springer
(Details)
Dumrauf, Dominic; Suess, Tim: On the Complexity of Local Search for Weighted Standard Set Problems. In: Proc. 6th Conference on Computability in Europe, S. 132-140, 30. Jun. - 4. Jul. 2010
(Details)
Degener, Bastian; Kempkes, Barbara; Kling, Peter; Meyer auf der Heide, Friedhelm: A continuous, local strategy for constructing a short chain of mobile robots. In: SIROCCO '10: Proceedings of the 17th International Colloquium on Structural Information and Communication Complexity, LNCS, Band 6058 , S. 168-182, 7. - 11. Jun. 2010, Springer
(Details)
Gehweiler, Joachim; Thies, Michael: Thread Migration and Checkpointing in Java. tr-ri-10-315, Jun. 2010
(Details)
Gehweiler, Joachim; Meyer auf der Heide, Friedhelm; , : A Large-Scale Distributed Environment for Peer-to-Peer Services. tr-ri-10-317, Jun. 2010
(Details)
Meyer auf der Heide, Friedhelm; Phillips, Cynthia (Hrsg.) SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures. , Thira, Santorini, Greece, Jun. 2010, ACM Press
(Details)
Degener, Bastian; Kempkes, Barbara; Meyer auf der Heide, Friedhelm: A local O(n^2) gathering algorithm. In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, S. 217-223, Jun. 2010, ACM
(Details)
Suess, Tim; Jähn, Claudius; Fischer, Matthias: Asynchronous Parallel Reliefboard Computation for Scene Object Approximation. In: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), S. 43-51, Norrköping, Sweden, Mai 2010 Eurographics Association, Eurographics Association
(Details)
Meyerhenke, Henning; Gehweiler, Joachim: On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In: Dagstuhl Seminar Proceedings 10261: Algorithm Engineering, 2010
(Details)
Briest, Patrick; Chalermsook, Parinya; Khanna, Sanjeev; Laekhanukit, Bundit; Nanongkai, Danupon: Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In: Workshop on Internet and Network Economics (WINE), 2010
(Details)
Mahlmann, Peter: Peer-to-Peer Networks based on Random Graphs. Dissertation, University of Paderborn, 2010
(Details)
Gehweiler, Joachim; Meyer auf der Heide, Friedhelm: Bin Packing or 'How Do I Get My Stuff into the Boxes?'. In: Algorithms Unplugged, S. 367-374. Springer-Verlag, 2010
(Details)
Mense, Mario; Schindelhauer, Christian: Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Lecture Notes in Computer Science, Band 5873 , S. 624--639, 2010, Springer
(Details)
Eikel, Benjamin; Jähn, Claudius; Fischer, Matthias: Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In: Advances in Visual Computing, Lecture Notes in Computer Science, Band 6453 , S. 622--633. Springer, Berlin / Heidelberg, 2010
(Details)
Suess, Tim; Wiesemann, Timo; Fischer, Matthias: Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In: Augmented & Virtual Reality in der Produktentstehung, HNI-Verlagsschriftenreihe, Paderborn, S. 39-52, 2010 Universität Paderborn, HNI Verlagsschriftenreihe, Paderborn
(Details)
Degener, Bastian; Kempkes, Barbara; Pietrzyk, Peter: A local, distributed constant-factor approximation algorithm for the dynamic facility location problem . In: International Parallel & Distributed Processing Symposium (IPDPS), 2010
(Details)
Briest, Patrick; Chawla, Shuchi; Kleinberg, Robert D.; Weinberg, S. Matthew: Pricing Randomized Allocations. In: Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010
(Details)
Gehweiler, Joachim; Meyerhenke, Henning: A Distributed Diffusive Heuristic for Clustering a Virtual P2P Supercomputer. In: Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC), 2010
(Details)
Meyer auf der Heide, Friedhelm; Scheideler, Christian: Algorithmische Grundlagen verteilter Speichersysteme. Informatik-Spektrum, 33(5): S. 468-474 2010
(Details)
Brandes, Philipp; Degener, Bastian; Kempkes, Barbara; Meyer auf der Heide, Friedhelm: Building short chains of mobile robots locally with a bounded stepwidth. 2010
(Details)
Briest, Patrick; Röglin, Heiko: The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. In: Workshop on Approximation and Online Algorithms (WAOA), 2010
(Details)
Degener, Bastian: Local, distributed approximation algorithms for geometric assignment problems. International Graduate School of Dynamic Intelligent Systems, 2010
(Details)
Blesa, Maria J.; Blum, Christian; de Caro, Angelo; Degener, Bastian; Kempkes, Barbara; Leone, Pierre; Persiano, Giuseppe; Meyer auf der Heide, Friedhelm; Mylonas, Georgios: Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study. 2010
(Details)
Unsere Publikationen aus dem Jahr 2009:
Schumacher, Tobias; Suess, Tim; Plessl, Christian; Platzner, Marco: Communication Performance Characterization for Reconfigurable Accelerator Design on the XD1000. In: Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig), 9. - 11. Dez. 2009
(Details)
Mahlmann, Peter; Janson, Thomas; Schindelhauer, Christian: 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. tr-ri-09-309, Paderborn, Germany, Dez. 2009
(Details)
Dangelmaier, Wilhelm; Delius, Robin; Laroque, Christoph; Fischer, Matthias: Concepts for Model Verification and Validation during Simulation Runtime. In: European Simulation and Modelling Conference (ESM 2009), S. 49-53, 26. - 28. Okt. 2009 EUROSIS, EUROSIS-ETI
(Details)
Klaas, Alexander; Cord-Landwehr, Andreas; Raupach, Christoph; Weddemann, Christoph; Warner, Daniel; Wonisch, Daniel; Swierkot, Kamil; Märtens, Marcus; Hüllmann, Martina; Kling, Peter; Kurras, Sven: About Swarms. FRONTS-TR200955, Sep. 2009
(Details)
Nikoletseas, Sotiris E.; Raptopoulos, Christoforos; Spirakis, Paul G.: Colouring Non-Sparse Random Intersection Graphs. In: 34st International Symposium on Mathematical Foundations of Computer Science, S. 600--611, 24. - 28. Aug. 2009
(Details)
Mehler, Jan; Meyer auf der Heide, Friedhelm: Power-Aware Online File Allocation in Mobile Ad Hoc Networks. In: Proceedings of the 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'09), S. 347-356, 11. - 13. Aug. 2009 ACM SIGACT, ACM SIGARCH, ACM Press
(Details)
Meyer auf der Heide, Friedhelm; Bender, Michael (Hrsg.) SPAA 2009: 21st Symposium on Parallelism in Algorithms and Architectures . , Calgary, Alberta, Canada, Aug. 2009, ACM Press
(Details)
Bonorden, Olaf; Degener, Bastian; Kempkes, Barbara; Pietrzyk, Peter: Complexity and approximation of a geometric local robot assignment problem . In: Algorithmic Aspects of Wireless Sensor Networks, S. 252 - 262, Jul. 2009, Springer Verlag
(Details)
Suess, Tim; Fischer, Matthias; Huber, Daniel; Laroque, Christoph; Dangelmaier, Wilhelm: Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen. In: Gausemeier, Jürgen; Grafe, Michael (Hrsg.) Augmented & Virtual Reality in der Produktentstehung, Band 252 , S. 111--126, Mai 2009, Heinz Nixdorf Institut, Universität Paderborn
(Details)
Ooi, Chia Ching; Schindelhauer, Christian: Minimal energy path planning for wireless robots. ACM/Springer Journal of Mobile Networks and Applications (MONET), Mai 2009
(Details)
Magenheim, Johannes; Dohmen, Michael; Lehner, Leopold; Reinhardt, Wolfgang; Stahl, Katharina; Suess, Tim: Informatik macchiato. Pearson-Studium, Apr. 2009
(Details)
Kutylowski, Jaroslaw; Meyer auf der Heide, Friedhelm: Optimal strategies for maintaining a chain of relays between an explorer and a base camp . Theoretical Computer Science, 410(36): S. 3391-3405 2009
(Details)
Bienkowski, Marcin; Byrka, Jaroslaw ; Korzeniowski, Miroslaw; Meyer auf der Heide, Friedhelm: Optimal Algorithms for Page Migration in Dynamic Networks. Journal of Discrete Algorithms, 7(4): S. 545-569 2009
(Details)
Dangelmaier, Wilhelm; Degener, Bastian: Online optimization with discrete lotsizing production and rolling horizons. In: 2nd International Conference on Dynamics in Logistics , S. 37-48, 2009
(Details)
Briest, Patrick: Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). it - Information Technology (vormals it+ti), 51(1): S. 62-65 2009
(Details)
Fischer, Matthias; Hilbig, Matthias; Jähn, Claudius; Meyer auf der Heide, Friedhelm; Ziegler, Martin: Planar Visibility Counting. In: Proc. 25th European Workshop on Computational Geometry, S. 203-206, 2009
(Details)
Nikoletseas, Sotiris E.; Raptopoulos, Christoforos; Spirakis, Paul G.: Combinatorial Properties for Efficient Communication in Distributed Networks with Local Interactions. In: Proceedings of IPDPS - IEEE International Parallel & Distributed Processing Symposium, S. 1--11, 2009
(Details)
Briest, Patrick; Guala, Luciano; Hoefer, Martin; Ventre, Carmine: On Stackelberg Pricing with Computationally Bounded Consumers. In: Proceedings of the 5th International Workshop on Internet and Network Economics (WINE), 2009
(Details)
Meyer auf der Heide, Friedhelm; Rammig, Franz-Josef: Self-Organisation and Self-Optimization. Public Service Review: Science and Technology, 04 2009
(Details)
Bonorden, Olaf; Degener, Bastian; Kempkes, Barbara; Pietrzyk, Peter: Complexity and approximation of a geometric local robot assignment problem. tr-ri-09-299, 2009
(Details)
Unsere Publikationen aus dem Jahr 2008:
Suess, Tim; Fischer, Matthias; Huber, Daniel; Laroque, Christoph; Dangelmaier, Wilhelm: A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations. In: International Symposium on Advances in Parallel and Distributed Computing Techniques (APDCT-08), S. 587-593, Dez. 2008 IEEE, IEEE Computer Society Press
(Details)
Ooi, Chia Ching; Schindelhauer, Christian: Energy-Efficient Distributed Target Tracking using Wireless Relay Robots. In: ARS'08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008), Nov. 2008, Springer
(Details)
Knieper, Tobias; Gnokam Defo, Gilles Bertrand; Kaufmann, Paul; Platzner, Marco: On Robust Evolution of Digital Hardware. In: 2nd IFIP Conference on Biologically Inspired Collaborative Computing (BICC 2008), S. 213-222, Milano, Italy, Sep. 2008, Springer
(Details)
Meyer auf der Heide, Friedhelm; Schneider, Barbara: Local Strategies for connecting stations by small robotic networks. In: IFIP International Federation for Information Processing, Volume 268; Biologically- Inspired Collaborative Computing, S. 95104, Sep. 2008, Springer Boston
(Details)
Ziegler, Martin; Koolen, Wouter M.: Kolmogorov Complexity Theory over the Reals. In: Brattka, Vasco; Weihrauch, Klaus (Hrsg.) Proc. 5th Int. Conf. on Computability and Complexity in Analysis (CCA'08), Electronic Notes in Theoretical Computer Science, 1. Aug. 2008, Elsevier, Amsterdam, The Netherlands
(Details)
Lürwer-Brüggemeier, Katharina; Ziegler, Martin: On Faster Integer Calculations Using Non-arithmetic Primitives. In: Proc. 7th International Conference on Unconventional Computation (UC'08), Lecture Notes in Computer Science, Band 5204 , S. 111-128, 1. Aug. 2008, Springer Verlag
(Details)
Köhler, Sven; Ziegler, Martin: On the Stability of Fast Polynomial Arithmetic. In: Proc. 8th Conference on Real Numbers and Computers, S. 147-156, 1. Jul. 2008
(Details)
Meyer auf der Heide, Friedhelm; Shavit, Nir (Hrsg.) SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures. , Munich, Germany, Jun. 2008, ACM Press
(Details)
Eikel, Benjamin; Fischer, Matthias; Laroque, Christoph: Regelung von Animationen in Simulationen von hochdynamischen Fabrikszenen . In: Gausemeier, Jürgen; Grafe, Michael (Hrsg.) Augmented & Virtual Reality in der Produktentstehung, Band 232 , S. 193--206, Jun. 2008, Heinz Nixdorf Institut, Universität Paderborn
(Details)
Mahlmann, Peter; Schindelhauer, Christian: Random Graphs for Peer-to-Peer Overlays. In: Meyer auf der Heide, Friedhelm (Hrsg.) The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, Nr.222 , S. 1-22, 27. - 28. Feb. 2008, HNI Verlagsschriftenreihe, Paderborn
(Details)
Ziegler, Martin: A Meta-Theory of Physics and Computation. In: Verhandlungen der Deutschen Physikalischen Gesellschaft, S. 145. Deutsche Physikalische Gesellschaft (DPG), 2008
(Details)
Dangelmaier, Wilhelm; Eikel, Benjamin; Fischer, Matthias; Laroque, Christoph: Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations. In: Industrial Simulation Conference (ISC 2008), S. 306-310, 2008 EUROSIS, EUROSIS-ETI
(Details)
Degener, Bastian; Gehweiler, Joachim; Lammersen, Christiane: The Kinetic Facility Location Problem. In: Proceedings of the 24th European Workshop on Computational Geometry, S. 251-254, 2008
(Details)
Mense, Mario; Scheideler, Christian: SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems. In: 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, California, USA, 20.-22. Febr.,, Jan. 2008
(Details)
Dangelmaier, Wilhelm; Fischer, Matthias; Huber, Daniel; Laroque, Christoph; Suess, Tim: Aggregated 3D-Visualization of a Distributed Simulation Experiment of a Queuing System. In: Mason, S. J. ; Hill, R. ; Moench, L.; Rose, O. (Hrsg.) Winter Simulation Conference (WSCŽ 08), S. 2012 - 2020, 2008 IEEE, Omnipress
(Details)
Degener, Bastian; Gehweiler, Joachim; Lammersen, Christiane: The Kinetic Facility Location Problem. In: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), S. 378-389, 2008
(Details)
Babaioff, Moshe; Briest, Patrick; Krysta, Piotr: On the Approximability of Combinatorial Exchange Problems. In: Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), 2008
(Details)
Ooi, Chia Ching; Schindelhauer, Christian: Detours Save Energy in Mobile Wireless Networks. In: MWCN'08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), Jan. 2008, Springer
(Details)
Briest, Patrick: Uniform Budgets and the Envy-Free Pricing Problem. In: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008
(Details)
Ackermann, Heiner; Briest, Patrick; Fanghänel, Alexander; Vöcking, Berthold: Who Should Pay for Forwarding Packets?. Internet Mathematics, 5(4): S. 459-475 2008
(Details)
Meyer auf der Heide, Friedhelm: The European Integrated Project "Dynamically Evolving, Large Scale Information Systems (DELIS)", Proceedings of the Final Workshop, Barcelona, February 27-28, 2008. HNI-Verlagsschriftenreihe, Paderborn, Band 222 , Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, Jan. 2008
(Details)
Meer, Klaus; Ziegler, Martin: An explicit solution to Post's Problem over the Reals. Journal of Complexity, 23, Jan. 2008
(Details)
Ziegler, Martin: Physically-Relativized Church-Turing Hypotheses: Physical Foundations of Computing and Complexity Theory of Computational Physics. Applied Mathematics and Computation 2008
(Details)
Fischer, Matthias; Hilbig, Matthias; Jähn, Claudius; Meyer auf der Heide, Friedhelm; Ziegler, Martin: Planar Visibility Counting (Extended Version). , The Computing Research Repository (CoRR) , 2008
(Details)
Briest, Patrick; Goldberg, Paul W.; Röglin, Heiko: Approximate Equilibria in Games with Few Players. , 2008
(Details)
Le Roux, Stephane; Ziegler, Martin: Singular Coverings and Nonuniform Notions of Closed Set Computability. Mathematical Logic Quarterly (MLQ), 54(5): S. 545-560 2008
(Details)
Gehweiler, Joachim; Meyer auf der Heide, Friedhelm: Bin Packing oder 'Wie bekomme ich die Klamotten in die Kisten?'. In: Taschenbuch der Algorithmen, S. 395-403. Springer-Verlag, 2008
(Details)
Degener, Bastian; Gehweiler, Joachim; Lammersen, Christiane: The Kinetic Facility Location Problem. tr-ri-08-288, Technical Report, 2008
(Details)
Brinkmann, André; Effert, Sascha: Data Replication in P2P Environments. In: 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), München, Germany, 2008
(Details)
Unsere Publikationen aus dem Jahr 2007:
Dynia, Miroslaw: Collective Graph Exploration. Dissertation, Graduate School "Automatic Configuration in open systems", Dez. 2007
(Details)
Kutylowski, Jaroslaw: Using Mobile Relays for Ensuring Connectivity in Sparse Networks. Dissertation, International Graduate School of Dynamic Intelligent Systems, Dez. 2007
(Details)
Ooi, Chia Ching; Schindelhauer, Christian: Minimal energy path planning for wireless robots. In: ROBOCOMM'07: Proc. of the 1st International Conference on Robot Communication and Coordination, ACM International Conference Proceeding Series, Okt. 2007, IEEE
(Details)
Fischer, Matthias; Laroque, Christoph; Huber, Daniel; Krokowski, Jens; Mueck, Bengt; Kortenjan, Michael; Aufenanger, Mark; Dangelmaier, Wilhelm: Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment. In: European Simulation and Modelling Conference (ESM 2007) , S. 499--505, Okt. 2007 EUROSIS
(Details)
Brinkmann, André; Effert, Sascha: Snapshots and Continuous Data Replication in Cluster Storage Environments. In: Proceedings of the 4th International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI'07), S. 1-8, San Diego,California, 24. - 25. Sep. 2007
(Details)
Brinkmann, André; Effert, Sascha: Inter-node Communication in Peer-to-Peer Storage Clusters. In: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (MSST), S. 257-262, San Diego, California, 24. - 26. Sep. 2007
(Details)
Brinkmann, André; Effert, Sascha; Meyer auf der Heide, Friedhelm; Scheideler, Christian: Dynamic and Redundant Data Placement. In: 27th IEEE International Conference on Distributed Computing Systems (ICDCS 2007), Toronto, Canada, 25. - 29. Jun. 2007
(Details)
Mahlmann, Peter; Schindelhauer, Christian: Peer-to-Peer-Netzwerke: Algorithmen und Methoden. Springer-Verlag Berlin, 1. Auflage, 1. Jun. 2007
(Details)
Schomaker, Gunnar: DHHT-RAID: A Distributed Heterogeneous Scalable Architecture for Dynamic Storage Environments. In: Advanced Information Networking and Applications (AINA-07), Band 21 , S. 331-339, 20. - 23. Mai 2007, IEEE Computer Society Press
(Details)
Dynia, Miroslaw; Lopuszanski, Jakub; Schindelhauer, Christian: Why Robots Need Maps. In: Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, S. 37-- 46, 1. Mai 2007, Springer-Verlag Berlin
(Details)
Brinkmann, André; Effert, Sascha: Cost effectiveness of Storage Grids and Storage Clusters. In: 15th Euromicro Conference on Parallel, Distributed and Network based Processing, S. 517-525, Naples, Italy, 7. - 9. Feb. 2007
(Details)
Briest, Patrick; Krysta, Piotr: Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007
(Details)
Dangelmaier, Wilhelm; Laroque, Christoph; Fischer, Matthias: EIn ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. In: Gausemeier, Jürgen; Grafe, Michael (Hrsg.) Augmented & Virtual Reality in der Produktentstehung, HNI-Verlagsschriftenreihe, Paderborn, Band 209 , S. 95-110, Jan. 2007, Heinz Nixdorf Institut
(Details)
Lammersen, Christiane; Sohler, Christian: StrSort Algorithms for Geometric Problems. In: Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), S. 69-72, Jan. 2007
(Details)
Dynia, Miroslaw; Korzeniowski, Miroslaw; Kutylowski, Jaroslaw: Competitive Maintenance of Minimum Spanning Tree in Dynamic Graphs. In: Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07), Lecture Notes in Computer Science, Band 4362 , S. 260--271, 1. Jan. 2007, Springer-Verlag Berlin
(Details)
Czumaj, Artur; Frahling, Gereon; Sohler, Christian: Efficient kinetic data structures for MaxCut. In: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), S. 157-160, Jan. 2007
(Details)
Feldman, Dan; Monemizahdeh, Morteza; Sohler, Christian: A PTAS for k-means clustering based on weak coresets. In: Proceedings of the 23rd annual symposium on computational geometry (SoCG'07), S. 11-18, Jan. 2007
(Details)
Czumaj, Artur; Sohler, Christian: Small Space Representations for Metric Min-Sum k-Clustering and their Applications. In: Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07), S. 536-548, Jan. 2007
(Details)
Ziegler, Martin: Real Computability and Hypercomputation. Informatik Berichte tr-ri-07-285, Jan. 2007
(Details)
Meer, Klaus; Ziegler, Martin: Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In: Proc. 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007), LNCS, Band 4708 , S. 726-737, Jan. 2007, Springer Verlag LNCS
(Details)
Ziegler, Martin: (Short) Survey of Real Hypercomputation. In: Proc. 3rd Conference on Computability in Europe (CiE'07), LNCS, Band 4497 , S. 809-824 , Jan. 2007
(Details)
Le Roux, Stephane; Ziegler, Martin: Singular Coverings and Non-Uniform Notions of Closed Set Computability. In: Proc. 4th International Conference on Computability and Complexity in Analysis (CCA'07), Electronic Notes in Theoretical Computer Science, S. 169-185 , Jan. 2007
(Details)
Ziegler, Martin: Revising Type-2 Computation and Degrees of Discontinuity. In: Proc. 3rd International Conference on Computability and Complexity in Analysis (CCA'06), Electronic Notes in Theoretical Computer Science, Band 167 , S. 255-274 , Jan. 2007
(Details)
Ziegler, Martin: Real Hypercomputation and Continuity. Theory of Computing Systems, 41: S. 177-206 , Jan. 2007
(Details)
Czumaj, Artur; Sohler, Christian: Testing Expansion in Bounded-Degree Graphs. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), S. 570 - 578, Jan. 2007
(Details)
Buriol, Luciana; Frahling, Gereon; Leonardi, Stefano; Sohler, Christian: Estimating Clustering Indexes in Data Streams. In: Proceedings of the 15th European Symposium on Algorithms (ESA), S. 816-632, Jan. 2007
(Details)
Bienkowski, Marcin; Kutylowski, Jaroslaw: The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. In: Proc. of the 10th International Workshop on Algorithms and Data Structures (WADS), LNCS, S. 337-348, 1. Jan. 2007, Springer-Verlag Berlin
(Details)
Dynia, Miroslaw; Kutylowski, Jaroslaw; Meyer auf der Heide, Friedhelm; Schrieb, Jonas: Local strategies for maintaining a chain of relay stations between an explorer and a base station. In: SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, S. 260-269, New York, NY, USA, 1. Jan. 2007, ACM Press, New York, NY, USA
(Details)
Leonardi, Stefano; Mahlmann, Peter; Meyer auf der Heide, Friedhelm; Spirakis, Paul G.; Weikum, Gerhard: Guarding our digital society's well-being . e-Strategies, www.britishpublishers.com, 3-10-2007 2007
(Details)
Arens, Stephan; Buss, Alexander; Deck, Helena; Dynia, Miroslaw; Fischer, Matthias; Hagedorn, Holger; Isaak, Peter; Krieger, Alexander; Kutylowski, Jaroslaw; Meyer auf der Heide, Friedhelm; Nesterow, Viktor; Ogierman, Adrian; Schrieb, Jonas; Stobbe, Boris; Storm, Thomas; Wachsmuth, Henning: Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In: 4th International Symposium on Autonomous Minirobots for Research and Edutainment (AMiRE 2007), S. 215-222, 2007
(Details)
Czumaj, Artur; Sohler, Christian: On Testable Properties in Bounded Degree Graphs. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'07), S. 494-501, Jan. 2007
(Details)
Kutylowski, Jaroslaw: Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries. , Jan. 2007
(Details)
Bonorden, Olaf: Load Balancing in the Bulk-Synchronous-Parallel Setting using Process Migrations. In: Proceedings of the International Parallel & Distributed Processing Symposium (IPDPS07, HCW07), Long Beach, CA, 2007, IEEE Computer Society Press
(Details)
Czumaj, Artur; Sohler, Christian: Sublinear-time approximation algorithms for clustering via random sampling. Random Structures & Algorithms, 30(1-2): S. 226 -- 256, Jan. 2007
(Details)
Unsere Publikationen aus dem Jahr 2006:
Ziegler, Martin: Stability versus speed in a computable algebraic model. Theoretical Computer Science, 351: S. 14-26 2006
(Details)
Mahlmann, Peter; Schindelhauer, Christian: Distributed Random Digraph Transformations for Peer-to-Peer Networks. In: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2006), S. 308--317, Cambridge, Massachusetts, USA, 30. Jul. - 2. Aug. 2006, ACM Press, New York, NY, USA
(Details)
Frahling, Gereon; Faigle, Ulrich: A Combinatorial Algorithm for Weighted Stable Sets in Bipartite Graphs. Journal on Discrete Applied Mathematics 2006
(Details)
Czumaj, Artur; Sohler, Christian: Sublinear-time Algorithms. EATCS Bulletin, (89): S. 23--47, Jun. 2006
(Details)
Loeser, Christoph; Schomaker, Gunnar; Schubert, Matthias: Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In: 5th International Conference on Networking (ICN)., Mauritius, 23. - 26. Apr. 2006 ICN, Springer Verlag LNCS
(Details)
Schindelhauer, Christian; Schomaker, Gunnar: SAN Optimal Multi Parameter Access Scheme. In: 5th International Conference on Networking (ICN), Mauritius, 23. - 26. Apr. 2006 ICN, Springer Verlag LNCS
(Details)
Brinkmann, André; Effert, Sascha; Heidebuer, Michael; Vodisek, Mario: Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. In: 5th International Conference on Networking (ICN), Nr.5 , Mauritius, 23. - 26. Apr. 2006, Springer Verlag LNCS
(Details)
Demaine, Erik; Meyer auf der Heide, Friedhelm; Pagh, Rasmus; Patrascu, Mihai: De Dictionariis Dynamicis Pauco Spatio Utentibus. In: Latin American Theoretical Informatics (LATIN 2006), S. 349-361, Valdivia, Chile, 20. - 24. Mrz. 2006
(Details)
Kortenjan, Michael; Schomaker, Gunnar: Size Equivalent Cluster Trees - Realtime Rendering of Large Industrial Scenes. In: 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 25. - 27. Jan. 2006 African Graphics Association (AFRIGRAPH)
(Details)
Schindelhauer, Christian: Mobility in Wireless Networks. In: 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2006), Merin, Czech Republic, 21. - 27. Jan. 2006
(Details)
Kutylowski, Jaroslaw; Zagorski, Filip: Reliable Broadcasting without Collision Detection in an Automotive Scenario. In: Proc. of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2006), Lecture Notes in Computer Science, S. 389-398, 21. - 27. Jan. 2006, Springer-Verlag Berlin
(Details)
Grünewald, Matthias; Meyer auf der Heide, Friedhelm; Rührup, U.; Schindelhauer, Christian; Volbert, Klaus: Directional Communication in Mobile Ad Hoc Networks. In: New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium , S. pp.: 225-234, Paderborn, Germany, 17. - 18. Jan. 2006
(Details)
Dynia, Miroslaw; Kutylowski, Jaroslaw; Lorek, Pawel; Meyer auf der Heide, Friedhelm: Maintaining Communication Between an Explorer and a Base Station. In: IFIP 19th World Computer Congress, TC10: 1st IFIP International Conference on Biologically Inspired Computing, S. 137--146, 1. Jan. 2006
(Details)
Damerow, Valentina: Average and Smoothed Complexity of Geometric Structures. HNI-Verlagsschriftenreihe, Paderborn, Band 190 , Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, Jan. 2006
(Details)
Rührup, Stefan: Position-based Routing Strategies. HNI-Verlagsschriftenreihe, Paderborn, Band 203 , Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, Jan. 2006
(Details)
Rammig, Franz-Josef; Dangelmaier, Wilhelm; Karl, Holger; Mertsching, Bärbel; Meyer auf der Heide, Friedhelm; Trächtler, Ansgar: Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems. In: Proceedings of the 6th International Heinz Nixdorf Symposium., 2006, HNI Verlagsschriftenreihe, Paderborn
(Details)
Brinkmann, André; Effert, Sascha; Heidebuer, Michael; Vodisek, Mario: Influence of Adaptive Data Layouts on Performance in dynamically changing Storage Environments. In: 14th Euromicro Conference on Parallel, Distributed and Network based Processing, Jan. - Feb. 2006
(Details)
Dangelmaier, Wilhelm; Huber, Daniel; Laroque, Christoph; Aufenanger, Mark; Fischer, Matthias; Krokowski, Jens; Kortenjan, Michael: d³FACT insight goes parallel - Aggregation of multiple simulations. In: Simulation and Visualization 2006 (SimViS), S. 79-88, 2006, SCS European Publishing House
(Details)
Briest, Patrick; Krysta, Piotr: Single-Minded Unlimited Supply Pricing on Sparse Instances. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006
(Details)
Briest, Patrick; Gunia, Christian: Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006
(Details)
Gehweiler, Joachim; Schomaker, Gunnar: Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries. In: Proceeedings of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT), S. 51-58, 2006
(Details)
Gehweiler, Joachim; Lammersen, Christiane; Sohler, Christian: A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. In: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), S. 237-243, 2006
(Details)
Bonorden, Olaf; Gehweiler, Joachim; Meyer auf der Heide, Friedhelm: A Web Computing Environment for Parallel Algorithms in Java. In: Journal on Scalable Computing: Practice and Experience, S. 1-14, 2006
(Details)
Degener, Bastian: Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen.
(Details)
Dynia, Miroslaw; Kutylowski, Jaroslaw; Schindelhauer, Christian; Meyer auf der Heide, Friedhelm: Smart Robot Teams Exploring Sparse Trees. In: Proc. of the 31st International Symposium of Mathematical Foundations of Computer Science, Springer Lecture Notes in Computer Science LNCS, S. 327-338, Jan. 2006, Springer Verlag
(Details)
Dynia, Miroslaw; Korzeniowski, Miroslaw; Schindelhauer, Christian: Power-Aware Collective Tree Exploration. In: Proc. of the Architecture of Computing Systems, LNCS, Nr.3894 , S. 341--351, Jan. 2006, Springer Verlag
(Details)
Buriol, Luciana; Frahling, Gereon; Leonardi, Stefano; Marchetti-Spaccamela, Alberto; Sohler, Christian: Computing Clustering Coefficients in Data Streams. In: Proceedings of the European Conference on Complex Systems (ECCS'06), Jan. 2006
(Details)
Meer, Klaus; Ziegler, Martin: Uncomputability below the Real Halting Problem. Springer Lecture Notes in Computer Science, 3988: S. 368-377, Jan. 2006
(Details)
Bonorden, Olaf; Gehweiler, Joachim; Meyer auf der Heide, Friedhelm; Rehberg, Bettina: Efficient Parallel Algorithms. In: Proceeedings of 6th International Heinz Nixdorf Symposium: New Trends in Parallel & Distributed Computing, S. 137-153, 2006
(Details)
Dynia, Miroslaw; Kumlehn, Andreas; Kutylowski, Jaroslaw; Meyer auf der Heide, Friedhelm; Schindelhauer, Christian: SmartS Simulator Design. , Jan. 2006
(Details)
Frahling, Gereon; Sohler, Christian: A Fast k-Means Implementation Using Coresets. In: ACM Symposium on Computational Geometry, S. 135-143, 2006
(Details)
Ziegler, Martin: Effectively Open Real Functions. Journal of Complexity, 22: S. 827-849 2006
(Details)
Rührup, Stefan; Schindelhauer, Christian: Online Multi-Path Routing in a Maze. In: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006
(Details)
Buriol, Luciana; Frahling, Gereon; Leonardi, Stefano; Marchetti-Spaccamela, Alberto; Sohler, Christian: Counting Triangles in Data Streams. In: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), Jan. 2006
(Details)
Klein, Jan: Efficient Collision Detection for Point and Polygon Based Models. Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 186, 2006
(Details)
Monien, Burkhard; Meyer auf der Heide, Friedhelm: New Trends in Parallel& Distributed Computing. HNI-Verlagsschriftenreihe, Paderborn, Band 181 , HNI Verlagsschriftenreihe, Paderborn, 2006
(Details)
Rührup, Stefan; Schindelhauer, Christian: Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. tr-rsfb-06-078, 2006
(Details)
Unsere Publikationen aus dem Jahr 2005:
Fischer, Matthias; Mueck, Bengt; Mahajan, Kiran; Kortenjan, Michael; Laroque, Christoph; Dangelmaier, Wilhelm: Multi-User Support And Motion Planning of Humans And Humans Driven Vehicles In Interactive 3D Material Flow Simulations. In: Kuhl, M.E; Steiger, N.M; Armstrong, F.B; Joines, J.A (Hrsg.) Winter Simulation Conference (WSCŽ 05), S. 1921-1930, Orlando, USA, 4. - 7. Dez. 2005 IEEE
(Details)
Eßmann, Bernd; Bleckmann, Peter; Hampel, Thorsten; Elsässer, Robert: Distributed Persistence in CSCW Applications. tr-ri-05-268, Dez. 2005
(Details)
Weikum, Gerhard; Hales, David; Schindelhauer, Christian; Triantafillou, Peter: Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search. In: European Conference on Complex Systems (ECCS 2005), Paris, 14. - 18. Nov. 2005
(Details)
Bleckmann, Peter; Sprotte, René; Eßmann, Bernd; Hampel, Thorsten: Interactive Learning Objects in Mobile E-Learning. In: Proccedings of the World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education 2005 (E-Learn 2005), S. 2809-2816, Vancouver, Canada, 24. - 27. Okt. 2005, AACE Press
(Details)
Rührup, Stefan; Schindelhauer, Christian; Volbert, Klaus: Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), LNCS, Band 3738 , S. 244257, Cancun, Mexico, 6. - 8. Okt. 2005, Springer-Verlag
(Details)
Schindelhauer, Christian; Voss, Kerstin: Probability Distributions for Channel Utilisation. In: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), LNCS, Band 3738 , S. 271-284, Cancun, Mexico, 6. - 8. Okt. 2005, Springer Verlag
(Details)
Drüke, Isabell; Loeser, Christoph; Oesterdiekhoff, Brigitte: Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario. In: IEEE International Conference on Industrial Informatics (INDIN), 5. Okt. 2005
(Details)
Rührup, Stefan; Schindelhauer, Christian: Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio. In: Proc. of 13th Annual European Symposium on Algorithms (ESA 2005), LNCS, Band 3669 , S. 23-34, 3. - 6. Okt. 2005, Springer-Verlag
(Details)
Bienkowski, Marcin; Jaroslaw, Byrka: Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), LNCS, Band 3669 , S. 815-826, 3. - 6. Okt. 2005, Springer Verlag
(Details)
Frahling, Gereon; Krokowski, Jens: Online Occlusion Culling. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), LNCS, Band 3669 , S. 758-769, 3. - 6. Okt. 2005, Springer Verlag
(Details)
Oesterdiekhoff, Brigitte: Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices. In: IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2005
(Details)
Brinkmann, André; Effert, Sascha; Heidebuer, Michael; Vodisek, Mario: Distributed MD. In: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, S. 81 - 88, Saint Louis, Missouri, USA, 18. Sep. 2005
(Details)
Baars, Henning; Brinkmann, André; Effert, Sascha; Heidebuer, Michael; Vodisek, Mario: An integrated Architecture for Business Intelligence support from Application down to Storage. In: In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os, S. 1-8, Saint Louis, Missouri, USA, 18. Sep. 2005
(Details)
Schattkowsky, Tim; Hausmann, Jan Hendrik; Rettberg, Achim: Using UML Activities for Synthesis on Reconfigurable Hardware. In: Proceedings of the UML for SoC Design Workshop, Anaheim, USA, 2005
(Details)
Bienkowski, Marcin; Korzeniowski, Miroslaw: Dynamic Page Migration under Brownian Motion. In: Proc. of the European Conference in Parallel Processing (Euro-Par), S. 962-971, 2005
(Details)
Bienkowski, Marcin; Korzeniowski, Miroslaw; Meyer auf der Heide, Friedhelm: Dynamic Load Balancing in Distributed Hash Tables. In: Proc. of the 4th Annual International Workshop on Peer-To-Peer Systems (IPTPS), S. 217-225, 2005
(Details)
Bienkowski, Marcin; Korzeniowski, Miroslaw; Dynia, Miroslaw: Improved Algorithms for Dynamic Page Migration. In: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), S. 365-376, 2005
(Details)
Bienkowski, Marcin; Meyer auf der Heide, Friedhelm: Page Migration in Dynamic Networks. In: Proc. of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), S. 1-14, Sep. 2005
(Details)
Köhler, Sven; Schindelhauer, Christian; Ziegler, Martin: On Approximating Real-Word Halting Problems. In: Reischuk, Rüdiger; Liskiewicz, Maciej (Hrsg.) Proc. 15th International Symposium on Fundamentals of Computation Theory (FCT'05), Springer Lecture Notes in Computer Science LNCS, Band 3623 , S. 443-455, 17. - 20. Aug. 2005, Springer Verlag
(Details)
Meer, Klaus; Ziegler, Martin: An Explicit Solution to Posts Problem over the Reals. In: Reischuk, Rüdiger; Liskiewicz, Maciej (Hrsg.) Proc. 15th International Symposium on Fundamentals of Computation Theory (FCT'05), Springer Lecture Notes in Computer Science LNCS, Band 3623 , S. 456-467, 17. - 20. Aug. 2005, Springer-Verlag
(Details)
Klein, Jan; Zachmann, Gabriel: The Expected Running Time of Hierarchical Collision Detection. In: 32nd International Conference on Computer Graphics and Interactive Techniques (SIGGRAPH 2005), Poster Session, Los Angeles, USA, 31. Jul. - 4. Aug. 2005
(Details)
Schindelhauer, Christian; Volbert, Klaus; Ziegler, Martin: Geometric Spanners with Applications in Wireless Networks. 2005
(Details)
Schindelhauer, Christian; Schomaker, Gunnar: Weighted Distributed Hash Tables. In: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), S. 218-227, Las Vegas, Nevada, USA, 17. - 20. Jul. 2005, ACM Press, New York, NY, USA
(Details)
Bienkowski, Marcin: Dynamic Page Migration with Stochastic Requests. In: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), S. 270-278, Las Vegas, Nevada, USA, 17. - 20. Jul. 2005, ACM Press, New York, NY, USA
(Details)
Mahlmann, Peter; Schindelhauer, Christian: Peer-to-Peer Networks based on Random Transformations of Connected Regular Undirected Graphs. In: Proc. of the 17th annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), S. 155-164, Las Vegas, Nevada, USA, 17. - 20. Jul. 2005, ACM Press, New York, NY, USA
(Details)
Fuchssteiner, Benno; Ziegler, Martin: Nonlinear Reformulation of Heisenbergs Dynamics. International Journal of Theoretical Physics, 44(7): S. 693-717, Jul. 2005
(Details)
Du, Jia Lei; Rührup, Stefan; Witkowski, Ulf; Rückert, Ulrich: Resource and Service Discovery for Large-Scale Robot Networks in Disaster Scenarios. In: Proceedings of the IEEE International Workshop on Safety, Security and Rescue Robotics (SSRR2005), Kobe, Japan, 6. - 9. Jun. 2005
(Details)
Dangelmaier, Wilhelm; Mueck, Bengt; Fischer, Matthias; Mahajan, Kiran; Laroque, Christoph: Methods to lead the user to significant processes in a 3D material flow simulation. In: Merkuryev, Yuri; Zobel, Richard; Kerckhoffs, Eugene (Hrsg.) Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, S. 267-270, 1. - 4. Jun. 2005
(Details)
Ziegler, Martin: Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: Cooper, S. Barry; Löwe, Benedikt; Torenvliet, Leen (Hrsg.) Proc. CiE 2005: New Computational Paradigms, Springer Lecture Notes in Computer Science LNCS, Band 3526 , S. 562-571, 2005, Springer-Verlag
(Details)
Dangelmaier, Wilhelm; Fischer, Matthias; Grafe, Michael; Gausemeier, Jürgen; Matysczok, Carsten; Mueck, Bengt: Virtual and augmented reality support for discrete manufacturing system simulation. Computers in Industry, 56(4): S. 371-383, Mai 2005
(Details)
Czumaj, Artur; Sohler, Christian: Abstract Combinatorial Programs and Efficient Property Testers. SIAM Journal on Computing, 34(3): S. 580-615 2005
(Details)
Czumaj, Artur; Sohler, Christian: Testing Hypergraph Coloring.. Theoretical Computer Science, 331(1): S. 37-52 2005
(Details)
Badoiu, M.; Czumaj, Artur; Indyk, Piotr; Sohler, Christian: Facility Location in Sublinear Time.. In: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), S. 866-877, 2005
(Details)
Loeser, Christoph; Schomaker, Gunnar; Brinkmann, André; Vodisek, Mario; Heidebuer, Michael: Content distribution in Video-on-Demand P2P networks with ARIMA. In: Proceedings of the 4th International Conference on Networking, Band 3421 , S. 800-810, 17. - 21. Apr. 2005, Springer Verlag
(Details)
Rührup, Stefan; Schindelhauer, Christian: Competitive Time and Traffic Analysis of Position-based Routing using a Cell Structure. In: Proc. of the 5th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (IPDPS/WMAN'05), S. 248, Apr. 2005
(Details)
Bienkowski, Marcin; Brinkmann, André; Korzeniowski, Miroslaw; Orhan, Orhan: Cube Connected Cycles Based Bluetooth Scatternet Formation. In: Proceedings of the 4th International Conference on Networking, S. 413-420, 1. Apr. 2005
(Details)
Mahajan, Kiran; Laroque, Christoph; Dangelmaier, Wilhelm; Soltenborn, Christian; Kortenjan, Michael; Kuntze, Daniel: d³FACT insight: A motion planning algorithm for material flow simulations in virtual environments. In: Schulze, Thomas; Horton, Graham; Preim, Bernhard; Schlechtweg, Stefan (Hrsg.) Simulation and Visualization 2005 (SimViS), Band 1 , S. 115-126, 3. - 4. Mrz. 2005, SCS European Publishing House
(Details)
Frahling, Gereon; Indyk, Piotr; Sohler, Christian: Sampling in Dynamic Data Streams and Applications. In: Proceedings of the 21st Annual ACM Symposium on Computational Geometry (SoCG), S. 142-149, 2005
(Details)
Räcke, Harald: Data Management and Routing in General Networks. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 154, 2. Feb. 2005
(Details)
Klein, Jan; Zachmann, Gabriel: Interpolation Search for Point Cloud Intersection. In: Proceedings of the 13-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision'2005 (WSCG'2005), S. 163-170, Plzen, Czech Republic, 31. Jan. - 4. Feb. 2005
(Details)
Frahling, Gereon; Sohler, Christian: Coresets in Dynamic Geometric Data Streams. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), S. 209-217, 2005
(Details)
Grzaslewicz, Ryszard; Kutylowski, Jaroslaw; Kutylowski, Miroslaw; Pietkiewicz, Wojciech: Robust Undetectable Interference Watermarks. In: Information & Security Hiding (ISH '05), LNCS, Band 3841 , S. 517-526, 2005, Springer-Verlag Berlin
(Details)
Gehweiler, Joachim: Implementierung und Analyse von Lastbalancierungsverfahren in einer Web-Computing-Umgebung.
(Details)
Ziegler, Martin: Computational Power of Infinite Quantum Parallelism. International Journal of Theoretical Physics, 44(11): S. 2059-2071, Nov. 2005
(Details)
Lammersen, Christiane: Algorithmen für geometrische Probleme im Datenstrom-Modell erweitert um ein Sortierungsprimitiv.
(Details)
Czumaj, Artur; Ergun, Funda; Fortnow, Lance; Magen, Avner; Newman, Ilan; Rubinfeld, Ronitt; Sohler, Christian: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM J. Comput., 35(1): S. 91-109, Jan. 2005
(Details)
Bienkowski, Marcin; Damerow, Valentina; Meyer auf der Heide, Friedhelm; Sohler, Christian: Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube. In: Proceedings of the 21st European Workshop on Computational Geometry (EWCG'05), S. 167 - 170, , Jan. 2005
(Details)
Fischer, Matthias: Design, Analysis, and Evaluation of Data Structure for Distributed Virtual Environments. HNI-Verlagsschriftenreihe, Paderborn, Band 164 , Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, Jan. 2005
(Details)
Volbert, Klaus: Geometric Spanners for Topology Control in Wireless Networks. HNI-Verlagsschriftenreihe, Paderborn, Band 168 , Fakultät für Elektrotechnik, Informatik und Mathematik, Universität Paderborn, Jan. 2005
(Details)
Bonorden, Olaf; Gehweiler, Joachim; Meyer auf der Heide, Friedhelm: A Web Computing Environment for Parallel Algorithms in Java. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), S. 801-808, 2005
(Details)
Bonorden, Olaf; Gehweiler, Joachim; Meyer auf der Heide, Friedhelm: Load Balancing Strategies in a Web Computing Environment. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), S. 839-846, 2005
(Details)
Unsere Publikationen aus dem Jahr 2004:
Loeser, Christoph; Schaefer, Robbie; Müller, Wolfgang; Bororwski, M.: RTMC - An Adaptive Fraemwork for Remote Tool Monitoring and Control. In: SCI, 2004
(Details)
Klein, Jan; Krokowski, Jens; Fischer, Matthias; Wand, Michael; Wanka, Rolf; Meyer auf der Heide, Friedhelm: The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. PRESENCE, 13(6): S. 617-637, Dez. 2004
(Details)
Klein, Jan; Zachmann, Gabriel: Point Cloud Surfaces using Geometric Proximity Graphs. Computers and Graphics, 28(6): S. 839-850, Dez. 2004
(Details)
Czumaj, Artur; Sohler, Christian: Sublinear-Time Approximation for Clustering via Random Sampling. In: Automata, Languages and Programming (ICALP), LNCS 3142, Nr.1 , S. 396-407, 2004
(Details)
Krokowski, Jens; Räcke, Harald; Sohler, Christian; Westermann, Matthias: Reducing State Changes with a Pipeline Buffer. In: Proceedings of the 9th International Fall Workshop Vision, Modeling, and Visualization, 2004
(Details)
Bleckmann, Peter; Schomaker, Gunnar; Slowik, Adrian: Virtualization with Prefetching Abilities based on iSCSI. In: Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, Nr.2 , S. 40-47, 2004, ACM Press, New York, NY, USA
(Details)
Schattkowsky, Tim; Loeser, Christoph; Müller, Wolfgang: Peer-To-Peer Technology for Interconnecting Web Services in Heterogeneous Networks. In: Tagungsband der AINA'04, Yokohama, Japan, 4. Nov. 2004, IEEE CS Press
(Details)
Schattkowsky, Tim; Loeser, Christoph; Müller, Wolfgang: Peer-to-Peer-based Web Services for Collaborative Engineering Environments. In: Tagungsband der ICN'04, Guadeloupe, France, Los Alamitos, USA, 4. Nov. 2004, IEEE CS Press
(Details)
Eßmann, Bernd; Hampel, Thorsten; Bleckmann, Peter; Sprotte, René: A Whiteboard at Your Fingertips - Automatic Configuration of e-Learning Services in Heterogeneous Network Environments. In: Proceedings of the World Conference on E-Learning in Corporate, Government, Healthcare, & Higher Education 2004 (E-Learn04), Band 1 , S. 2601-2608, Washington, DC, USA, 1. - 5. Nov. 2004 AACE
(Details)
Oesterdiekhoff, Brigitte: Transcoding von Webinhalten. Informatik Spektrum, 27(5): S. 448-452 2004
(Details)
Kutylowski, Jaroslaw; Zagorski, Filip: Broadcasting on a highway - ad-hoc warning systems.
(Details)
Rührup, Stefan; Schindelhauer, Christian: Traffic and Hop Efficient Position-based Routing using a Cell Structure. tr-rsfb-04-075, 2004
(Details)
Brinkmann, André; Salzwedel, Kay; Vodisek, Mario: A Case for Virtualized Arrays of RAID. In: Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os SNAPI 2004, S. 9-16, Antibes Juan-les-pins, France, 30. Sep. 2004
(Details)
Ziegler, Martin; Brattka, Vasco: Computability in linear algebra. Theoretical Computer Science, 326: S. 187-211 2004
(Details)
Nüsken, Michael; Ziegler, Martin: Fast Multipoint Evaluation of Bivariate Polynomials. In: albers, susanne; Radzik, Thomasz (Hrsg.) Proc. 12th Annual Symposium on Algorithms (ESA'04), Lecture Notes in Computer Science, Band 3221 , S. 544-555, 2004, Springer-Verlag
(Details)
Salzwedel, Kay: Data Distribution Algorithms for Storage Networks. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 153, 2004
(Details)
Klein, Jan; Zachmann, Gabriel: Point Cloud Collision Detection. In: Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004), S. 567-576, Grenoble, France, 30. Aug. 2004
(Details)
Oesterdiekhoff, Brigitte: Internet Premium Services for Flexible Format Distributed Devices. In: Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES'04), Toulouse, France, 23. - 26. Aug. 2004, Kluwer Academic Publishers
(Details)
Ziegler, Martin: Computable operators on regular sets. Mathematical Logic Quarterly (MLQ), 50: S. 392-404 2004
(Details)
Klein, Jan; Zachmann, Gabriel: Nice and Fast Implicit Surfaces over Noisy Point Clouds. In: SIGGRAPH 2004, Sketches, Los Angeles, USA, Aug. 2004
(Details)
Volbert, Klaus: Experimental Analysis of Adjustable Sectorized Topologies for Static Ad Hoc Networks. In: DIAL M-POMC 2004 Joint Workshop on Foundations of Mobile Computing, 2004
(Details)
Dangelmaier, Wilhelm; Giese, Holger; Klein, Florian; Renken, Hendrik; Scheideler, Peter: Shared Experiences in Intelligent Transportation Systems. In: 5th IFAC/EURON Symposium on Intelligent Autonomous Vehicles, 5. - 7. Jul. 2004 IFAC, Elsevier Science
(Details)
Schindelhauer, Christian; Volbert, Klaus; Ziegler, Martin: Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In: Fleischer, Rudolf; Trippen, Gerhard (Hrsg.) Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC'04), Springer Lecture Notes in Computer Science LNCS, Band 3341 , S. 805-821, 2004, Springer Verlag
(Details)
Leonardi, Stefano; Marchetti-Spaccamela, Alberto; Meyer auf der Heide, Friedhelm: Scheduling Against an Adversarial Network. In: Proc. 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), S. 151-158, Jun. 2004
(Details)
Klein, Jan; Zachmann, Gabriel: Proximity Graphs for Defining Surfaces over Point Clouds. In: Eurographics Symposium on Point-Based Grahics (SPBG'04), S. 131-138, Zurich, Switzerland, Jun. 2004
(Details)
Bansal, Vikas; Meyer auf der Heide, Friedhelm; Sohler, Christian: Labeling Smart Dust. In: 12th Annual European Symposium on Algorithms (ESA 2004), Jun. 2004
(Details)
Meyer auf der Heide, Friedhelm; Schindelhauer, Christian; Volbert, Klaus; Grünewald, Matthias: Congestion, Dilation, and Energy in Radio Networks. Theory of Computing Systems, 37(3): S. 343-370, Mai 2004
(Details)
Brinkmann, André; Heidebuer, Michael; Meyer auf der Heide, Friedhelm; Rückert, Ulrich; Salzwedel, Kay; Vodisek, Mario: V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In: Proceedings of the 12th NASA Goddard, 21st IEEE Conference on Mass Storage Systems and Technologies (MSST), S. 153 - 157, College Park, Maryland, USA, 13. - 16. Apr. 2004
(Details)
Bienkowski, Marcin; Korzeniowski, Miroslaw; Meyer auf der Heide, Friedhelm: Fighting Against Two Adversaries: Page Migration in Dynamic Network. In: Proc. 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004), Apr. 2004
(Details)
Mueck, Bengt; Dangelmaier, Wilhelm; Laroque, Christoph; Fischer, Matthias; Kortenjan, Michael: Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations. In: Schulz, Thomas; Schlechtweg, Stefan; Hinz, Volkmar (Hrsg.) Simulation and Visualisation 2004, S. 73-83, Magdeburg, 4. - 5. Mrz. 2004, SCS European Publishing House
(Details)
Czumaj, Artur; Sohler, Christian: Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time. In: Proc. 36th ACM Symposium on Theory of Computing (STOC), 2004
(Details)
Briest, Patrick; Brockhoff, Dimo; Degener, Bastian; Englert, Matthias; Gunia, Christian; Heering, Oliver; Jansen, Thomas; Leifhelm, Michael; Plociennik, Kai; Röglin, Heiko; Schweer, Andrea; Sudholt, Dirk; Tannenbaum, Stefan; Wegener, Ingo: The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In: Parallel Problem Solving from Nature - PPSN VIII, 2004
(Details)
Bleckmann, Peter; Bötcher, Stefan; Cesnavicius, Eduardas; De Freitas Francisco, Andre L.; Hollerung, Tim; Kühnel, Birger; Jing Liu, Michelle; Obermeier, S.; Oberthür, Simon; Peter, Felix; Rammig, Franz-Josef; Schindelhauer, Christian; Schomaker, Gunnar; Steenweg, Thorsten; Abas Tarar, Qamar; Tiemeyer, Marcel; Thürling, Adelhard; Vater, Arne: The design of PaMaNet the Paderborn mobile ad-hoc network. In: Proceedings of the second international workshop on Mobility management & wireless access protocols, Nr.1 , S. 119-121, 2004, ACM Press, New York, NY, USA
(Details)
Damerow, Valentina; Sohler, Christian: Smoothed Number of Extreme Points under Uniform Noise. In: Proceedings of the 20th European Workshop on Computational Geometry (EWCG'04), S. 93 - 96, , 2004
(Details)
Damerow, Valentina; Sohler, Christian: Extreme Points under Random Noise. In: Proceedings of the 12th European Symposium on Algorithms (ESA'04), S. 264 - 274, , 2004
(Details)
Briest, Patrick; Brockhoff, Dimo; Degener, Bastian; Englert, Matthias; Gunia, Christian; Heering, Oliver; Jansen, Thomas; Leifhelm, Michael; Plociennik, Kai; Röglin, Heiko; Schweer, Andrea; Sudholt, Dirk; Tannenbaum, Stefan; Wegener, Ingo: Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. In: Parallel Problem Solving from Nature - PPSN VIII, 2004
(Details)
Unsere Publikationen aus dem Jahr 2003:
Salzwedel, Kay: Algorithmic Approaches for Storage Networks. Algorithms for Memory Hierarchies: Advanced Lectures, Springer LNCS 2625: S. 251 ff 2003
(Details)
Fomin, Fedor; Thilikos, Dimitrios: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-up. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003
(Details)
Ziegler, Martin: Quasi-Optimal Arithmetic for Quaternion Polynomials. In: Ibaraki, Toshihide; Katoh, Naoki (Hrsg.) Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC'03), Lecture Notes in Computer Science, Band 2906 , S. 705-715, 2003, Springer-Verlag
(Details)
Czumaj, Artur; Ergun, Funda; Fortnow, Lance; Magen, Avner; Newman, Ilan; Rubinfeld, Ronitt; Sohler, Christian: Sublinear Approximation of Euclidean Minimum Spanning Tree. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), S. 813-822, 2003
(Details)
Adler, Micah; Räcke, Harald; Sivadasan, Naveen; Sohler, Christian; Vöcking, Berthold: Randomized Pursuit-Evasion in Graphs. Combinatorics, Probability & Computing, 12(3): S. 225-244 2003
(Details)
Ziegler, Martin: Stability versus Speed in a Computable Algebraic Model. In: Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, S. 47-64, 2003
(Details)
Ziegler, Martin: Computable Operators on Regular Sets. In: Brattka, Vasco; Schröder, Matthias; Weihrauch, Klaus; Zhong, Ning (Hrsg.) Computability and Complexity in Analysis, Informatik Berichte, Nr.302-8/2003 , S. 389-406, Fachbereich Informatik, Postfach 940, D-58084 Hagen, 2003 FernUniversität in Hagen
(Details)
Ziegler, Martin: Fast Relative Approximation of Potential Fields. In: Proc. 8th Workshop on Algorithms and Data Structures (WADS'03), Lecture Notes in Computer Science, Band 2748 , S. 140-149, 2003, Springer-Verlag
(Details)
Azar, Yossi; Cohen, Edith; Fiat, Amos; Kaplan, Haim; Räcke, Harald: Optimal Oblivious Routing in Polynomial Time. In: Proc. 35th ACM Symposium on Theory of Computing (STOC'03), S. 383-388, 2003
(Details)
Bienkowski, Marcin; Korzeniowski, Miroslaw; Räcke, Harald: A Practical Algorithm for Constructing Oblivious Routing Schemes. In: Proc. 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'2003), S. 24-33, 2003
(Details)
Klein, Jan; Zachmann, Gabriel: ADB-Trees: Controlling the Error of Time-Critical Collision Detection. In: Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003), S. 37-45, Munich, Germany, 2003
(Details)
Terbahl, Martina; Krokowski, Jens: Verteiltes Rendern durch dynamische Bildaufteilung. In: Proceedings of 5. GI-Informatiktage 2003, Bad Schussenried, Germany, 2003
(Details)
Klein, Jan; Zachmann, Gabriel: Time-Critical Collision Detection Using an Average-Case Approach. In: Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003), S. 22-31, Osaka, Japan, 2003
(Details)
Franke, Hubertus; Renken, Hendrik; Scheideler, Peter; Schmidt, Andreas: A Simulation of Intelligent Knowledge-Based Agents Exploring their Environment. In: Bobeanu, Carmen; Martino, Beniamino Di; Yang, Laurence Tianruo (Hrsg.) Modelling and Simulation 2003, S. 192-196, Naples, 27. - 29. Okt. 2003 EUROSIS
(Details)
Mueck, Bengt; Dangelmaier, Wilhelm; Fischer, Matthias: Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In: Verbraeck, Alexander; Hlupic, Vlatka (Hrsg.) 15th European Simulation Symposium (ESS 2003), S. 367-371, 26. - 29. Okt. 2003 SCS - Europe
(Details)
Bonorden, Olaf; Brüls, Nikolaus; Le, Dinh Khoi; Kastens, U.; Meyer auf der Heide, Friedhelm; Niemann, Jörg-Christian; Porrmann, Mario; Rückert, Ulrich; Slowik, Adrian; Thies, Michael: A holistic methodology for network processor design. In: Proceedings of the Workshop on High-Speed Local Networks held in conjunction with the 28th Annual IEEE Conference on Local Computer Networks (LCN2003), S. 583-592, 20. - 24. Okt. 2003
(Details)
Fischer, Matthias; Grafe, Michael; Matysczok, Carsten; Mueck, Bengt; Schoo, Michael: Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In: Zülich, Gert; Stowasser, Sascha; Jagdev, Harinder (Hrsg.) Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management, ESIM - European Series in Industrial Management, Band 5 , S. 170-177, Karlsruhe, 2003, Shaker Verlag
(Details)
Meyer auf der Heide, Friedhelm: Sonderforschungsbereich 376 Massive Parallelität: Algorithmen - Entwurfsmethoden - Anwendungen. it - Information Technology (vormals it+ti), 45(2): S. 108-113, Okt. 2003
(Details)
Rust, Carsten; Stappert, Friedhelm; Lukovszki, Tamás: A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.. In: 7th World Multiconference on Systemics, Cybernetics and Informatics, Orlando, Florida, USA, 12. Sep. 2003
(Details)
Brinkmann, André; Meyer auf der Heide, Friedhelm; Salzwedel, Kay; Scheideler, Christian; Vodisek, Mario; Rückert, Ulrich: Storage Management as Means to cope with Exponential Information Growth. In: Proceedings of SSGRR 2003, L'Aquila, Italy, 28. Jul. - 3. Aug. 2003
(Details)
Schindelhauer, Christian; Lukovszki, Tamás; Rührup, Stefan; Volbert, Klaus: Worst Case Mobility in Ad Hoc Networks. In: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003
(Details)
Awerbuch, Baruch; Brinkmann, André; Scheideler, Christian: Anycasting in Adversarial Systems: Routing and Admission Control. In: Proceedings of the Thirtieth International Colloquium on Automata, Languages and Programming (ICALP 2003), S. 1153-1168, Eindhoven, The Netherlands, 30. Jun. - 4. Jul. 2003
(Details)
Sohler, Christian: Property Testing and Geometry. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 119, 2003
(Details)
Fischer, Matthias; Grafe, Michael; Matysczok, Carsten; Schoo, Michael; Mueck, Bengt: Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. In: Gausemeier, Jürgen; Grafe, Michael (Hrsg.) 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, HNI-Verlagsschriftenreihe, Paderborn, Band 123 , S. 153-166, Paderborn, Jun. 2003, Heinz Nixdorf Institut, Universität Paderborn
(Details)
Dangelmaier, Wilhelm; Franke, Werner; Mueck, Bengt; Fischer, Matthias: Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In: Gausemeier, Jürgen; Grafe, Michael (Hrsg.) 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, HNI-Verlagsschriftenreihe, Paderborn, Band 123 , S. 141-151, Paderborn, Jun. 2003, Heinz Nixdorf Institut, Universität Paderborn
(Details)
Rührup, Stefan; Schindelhauer, Christian; Volbert, Klaus; Grünewald, Matthias: Performance of Distributed Algorithms for Topology Control in Wireless Networks. In: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), S. 28.2, Nice, France, 22. - 26. Apr. 2003
(Details)
Juurlink, Bernhardus; Kolman, Petr; Meyer auf der Heide, Friedhelm; Rieping, Ingo: Optimal Broadcast on Parallel Locality Models. Journal of Discrete Algorithms - selected papers of SIROCCO 2000, 1(2): S. 151-166, Apr. 2003
(Details)
Mahlmann, Peter: Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web.
(Details)
Grünewald, Matthias; Rückert, Ulrich; Schindelhauer, Christian; Volbert, Klaus: Directed power-variable infrared communication for the mini robot Khepera. In: Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment, S. 113-122, Brisbane, Australia, 18. - 21. Feb. 2003
(Details)
Bonorden, Olaf; Juurlink, Bernhardus; von Otte, Ingo; Rieping, Ingo: The Paderborn University BSP (PUB) library. Parallel Computing, 29(2): S. 187-207, Feb. 2003
(Details)
Loeser, Christoph; Müller, Wolfgang; Berger, Frank; Eikerling, Heinz-Josef: Peer-to-Peer Networks for Virtual Home Environments.. In: HICCS-36, Hawaii, USA, 1. Jan. 2003
(Details)
Damerow, Valentina; Meyer auf der Heide, Friedhelm; Räcke, Harald; Scheideler, Christian; Sohler, Christian: Smoothed Motion Complexity. In: Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03), S. 161 - 171, , 2003
(Details)
Gehweiler, Joachim: Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java.
(Details)
Unsere Publikationen aus dem Jahr 2002:
Brinkmann, André; Scheideler, Christian; Awerbuch, Baruch: Anycasting and Multicasting in Adversarial Systems: Routing and Admission Control. , 2002
(Details)
Benczúr, A.; Glässer, Uwe; Lukovszki, Tamás: Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks. In: Börger, E.; Ricconene, E. (Hrsg.) In Proc. of 10th International Workshop on Abstract State Machines, LNCS, 2002, Springer Verlag
(Details)
Klein, Jan; Krokowski, Jens; Fischer, Matthias; Wand, Michael; Wanka, Rolf; Meyer auf der Heide, Friedhelm: The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments. In: Symposium on Virtual Reality Software and Technology (VRST 2002), S. 137 - 146, Okt. 2002, ACM Press
(Details)
Benczúr, A.; Lukovszki, Tamás: A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing.. Technical report tr-ri-02-213, Paderborn, Germany, 2002
(Details)
Grünewald, Matthias; Lukovszki, Tamás; Schindelhauer, Christian; Volbert, Klaus: Distributed Maintenance of Resource Efficient Wireless Network Topologies. In: Proceedings of the 8th International Euro-Par Conference, S. 935-946, Paderborn, Germany, 27. - 30. Aug. 2002
(Details)
Brinkmann, André; Salzwedel, Kay; Scheideler, Christian: Compact, adaptive placement schemes for non-uniform distribution requirements. In: Proc. of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), S. 53-62, Winnipeg, Manitoba, Canada, 11. - 13. Aug. 2002
(Details)
Grünewald, Matthias; Meyer auf der Heide, Friedhelm; Schindelhauer, Christian; Volbert, Klaus: Energy, Congestion and Dilation in Radio Networks. In: Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, Manitoba, Canada, 10. - 13. Aug. 2002
(Details)
Volbert, Klaus: A Simulation Environment for Ad Hoc Networks Using Sector Subdivision. In: Proc. of the 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing (PDP 02), 2002
(Details)
Krick, Christof; Meyer auf der Heide, Friedhelm; Räcke, Harald; Vöcking, Berthold; Westermann, Matthias: Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory Comput. Syst., 35(2)(217-245) 2002
(Details)
Kumar, Mohan; Meyer auf der Heide, Friedhelm; Nikoletseas, Sotiris E.; Spirakis, Paul G.: Mobile Computing, Mobile Networks. Euro-Par 2002: S. 933-934 2002
(Details)
Bonorden, Olaf; Meyer auf der Heide, Friedhelm; Wanka, Rolf: Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In: Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), S. 2202-2208, Jun. 2002
(Details)
Loeser, Christoph; Altenbernd, Peter; Ditze, Michael; Müller, Wolfgang: Distributed Video-on-Demand Services on Peer to Peer Basis. In: Int. Workshop on Real-Time LANs in the Internet Age (RTLIA 2002), Jun. 2002
(Details)
Adler, Micah; Räcke, Harald; Sivadasan, Naveen; Sohler, Christian; Vöcking, Berthold: Randomized Pursuit-Evasion in Graphs. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002
(Details)
Czumaj, Artur; Sohler, Christian: Abstract Combinatorial Programs and Efficient Property Testers. Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS): S. 83-92 2002
(Details)
Mueck, Bengt; Dangelmaier, Wilhelm; Fischer, Matthias; Klemisch, Wolfram: Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In: Schulz, Thomas; Schlechtweg, Stefan; Hinz, Volkmar (Hrsg.) Simulation und Visualisierung, S. 71-84, Ghent, BE, Mrz. 2002, SCS European Publishing House
(Details)
Wanka, Rolf: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs is Asymptotically Optimal. In: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), S. 413-420, 2002
(Details)
Ziegler, Martin: Computability on Regular Subsets of Euclidean Space. Mathematical Logic Quarterly (MLQ), 48(S1): S. 157-181 2002
(Details)
Brattka, Vasco; Ziegler, Martin: Computability of Linear Equations. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, S. 95-106, 2002, Kluwer Academic Publishers
(Details)
Cuntz, Nicolas; Klein, Jan; Krokowski, Jens: Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression. In: Proc. of 4. GI-Informatiktage 2002, S. 224-229, Bad Schussenried, Germany, 2002
(Details)
Wanka, Rolf: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs is Asymptotically Optimal. In: Proceedings Workshop on Graph-Theoretic Concepts in Computer Science, 2002
(Details)
Ziegler, Martin: Zur Berechenbarkeit reeller geometrischer Probleme. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 115, 2002
(Details)
Damerow, Valentina; Finschi, Lukas; Ziegler, Martin: Point Location Algorithms of Minimum Size. In: Wismath, Stephen (Hrsg.) Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG'02), S. 5 - 9, , 2002
(Details)
Unsere Publikationen aus dem Jahr 2001:
Awerbuch, Baruch; Berenbrink, Petra; Brinkmann, André; Scheideler, Christian: Simple Routing Strategies for Adversarial Systems. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), S. 158-167, Las Vegas, USA, 14. - 17. Okt. 2001
(Details)
Wand, Michael; Fischer, Matthias; Peter, Ingmar; Meyer auf der Heide, Friedhelm; Straßer, Wolfgang: The Randomized z-Buffer Algorithm: Interactive Rendering of Highly Complex Scenes. In: Proceedings of the 28th annual conference on Computer graphics and interactive techniques (SIGGRAPH 2001), S. 361 - 370, Okt. 2001, ACM Press
(Details)
Klein, Jan; Fischer, Matthias: Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In: Proc. of 3. GI-Informatiktage 2001, S. 275 - 278, Bad Schussenried, Okt. 2001
(Details)
Lukovszki, Tamás; Maheshwari, A.; Zeh, N.: I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001, Springer-Verlag
(Details)
Meyer auf der Heide, Friedhelm: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark. Proceedings Springer 2001, 28. Aug. 2001
(Details)
Preis, Robert; Salzwedel, Kay; Wolff, Carsten; Hartmann, Georg: Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In: Proceedings of the PDPTA 2001, Band 1 , S. 463-470, Las Vegas, Nevada, USA, 25. - 28. Jun. 2001
(Details)
Bonorden, Olaf; von zur Gathen, Joachim; Gerhard, Jürgen; Nöcker, Michael; Müller, Olaf: Factoring a binary Polynomial of Degree over one Million. ACM SIGSAM Bulletin, 35(1): S. 16-18 2001
(Details)
Meyer auf der Heide, Friedhelm; Scheideler, Christian: Deterministic Routing With Bounded Buffers: Turing Offline Into Online Protocols. COMBINATORICA, 21(1): S. 95-138 2001
(Details)
Meyer auf der Heide, Friedhelm; Wanka, Rolf: Parallel Bridging Models and Their Impact on Algorithm Design. International Conference on Computational Science, 2: S. 628-637 2001
(Details)
Meyer auf der Heide, Friedhelm: Invited Presentation: Data Management in Networks. WG, 8 2001
(Details)
Czumaj, Artur; Sohler, Christian: Soft Kinetic Data Structures. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, S. 865-872, 1. Mai 2001
(Details)
Czumaj, Artur; Sohler, Christian: Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP): S. 493-505 2001
(Details)
Czumaj, Artur; Sohler, Christian: Property Testing with Geometric Queries.. Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01): S. 266-277 2001
(Details)
Meyer auf der Heide, Friedhelm; Wanka, Rolf: Parallel Bridging Models and Their Impact on Algorithm Design. In: Proc. Int. Conf. on Computational Science (ICCS) 2001, Part II, S. 628-637, 2001
(Details)
Emamy-Khansari, M. Reza; Ziegler, Martin: New Bounds for Hypercube Slicing Numbers. In: Cori, Robert; Mazoyer, Jacques; Morvan, Michel; Mosseri, Rémy (Hrsg.) Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG'2001), Discrete Mathematics and Theoretical Computer Science (DMTCS), Band AA , S. 155-164, 2001 Loria
(Details)
Brattka, Vasco; Ziegler, Martin: Turing Computability of (Non-)Linear Optimization. In: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG'01), S. 181-184, 2001
(Details)
Brattka, Vasco; Ziegler, Martin: A Computable Spectral Theorem. In: Blanck, Jens; Brattka, Vasco; Hertling, Peter (Hrsg.) Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000), LNCS, Band 2064 , S. 378-388, 2001, Springer-Verlag
(Details)
Berenbrink, Petra; Brinkmann, André; Scheideler, Christian: SimLab - A Simulation Environment for Storage Area Networks. In: Proceedings of the 9th Euromicro Workshop on Parallel and Distributed Processing (PDP2001), S. 227 - 234, Mantova, Italy, 7. - 9. Feb. 2001
(Details)
Westermann, Matthias: Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 90, 2001
(Details)
Schröder, Klaus: Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 89, 2001
(Details)
Unsere Publikationen aus dem Jahr 2000:
Wand, Michael; Fischer, Matthias; Meyer auf der Heide, Friedhelm: Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. tr-ri-00-217, Okt. 2000
(Details)
Govindarajan, S.; Lukovszki, Tamás; Maheshwari, A.; Zeh, N.: I/O-Efficient Well-Separated Pair Decomposition and its Applications. (Extended Abstract). In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, Springer-Verlag
(Details)
Brinkmann, André; Salzwedel, Kay; Scheideler, Christian: Efficient, Distributed Data Placement Strategies for Storage Area Networks . In: Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA), S. 119 - 128, Bar Harbor, Maine, USA, 9. - 13. Jul. 2000
(Details)
Berenbrink, Petra; Brinkmann, André; Scheideler, Christian: Distributed Path Selection for Storage Networks. In: Proceedings of the 2000 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2000), S. 1097 - 1105, Las Vegas, USA, 26. - 29. Jun. 2000
(Details)
Juurlink, Bernhardus; Kolman, Petr; Meyer auf der Heide, Friedhelm; Rieping, Ingo: Optima Broadcast on Parallel Locality Models. Proc. of 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO): S. 211-226 2000
(Details)
Meyer auf der Heide, Friedhelm; Scheideler, Christian: Deterministic Routing with Bounded Buffers, Turning Offline into Online Protocols. COMBINATORICA 2000
(Details)
Meyer auf der Heide, Friedhelm; Vöcking, Berthold; Westermann, Matthias: Caching in Networks. Proc. of 11th ACM-SIAM-SODA: S. 430-439, Jun. 2000
(Details)
Meyer auf der Heide, Friedhelm; Räcke, Harald; Westermann, Matthias: Data Management in Hierarchical Bus Networks. Proc. of 12th ACM-SPAA: S. 109-118, Jun. 2000
(Details)
Bonorden, Olaf; Juurlink, Bernhardus; von Otte, Ingo; Rieping, Ingo: PUB-Library, Release 7.0, User Guide and Function Reference. tr-rsfb-00-070, Jun. 2000
(Details)
Meyer auf der Heide, Friedhelm; Wanka, Rolf: Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. In: ForschungsForum Paderborn, S. 112-116, Jun. 2000
(Details)
Czumaj, Artur; Meyer auf der Heide, Friedhelm; Stemann, Volker: Contention Resolution in Hashing Based Shared Memory Simulations. In: SIAM Journal on Computation, Band 29 , S. 1703-1739, Jun. 2000
(Details)
Kutylowski, Miroslaw; Lorys, Krzysztof; Oesterdiekhoff, Brigitte; Wanka, Rolf: Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM, 45: S. 944-967 2000
(Details)
Bednara, M.; Teich, Jürgen; Wanka, Rolf; Beyer, Oliver: Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter. In: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), S. 299-308, 2000
(Details)
Brattka, Vasco; Ziegler, Martin: Computing the Dimension of Linear Subspaces. In: Proceedings of the 27th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'2000), Lecture Notes in Computer Science, Band 1963 , S. 450-458, 2000, Springer-Verlag
(Details)
Sohler, Christian; Ziegler, Martin: Computing Cut Numbers. In: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00), S. 73-79, 2000
(Details)
Czumaj, Artur; Sohler, Christian; Ziegler, Martin: Property Testing in Computational Geometry. In: Paterson, Mike (Hrsg.) Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00), Lecture Notes in Computer Science, Band 1879 , S. 155-166, 2000
(Details)
Rieping, Ingo: Communication in Parallel Systems-Models, Algorithms and Implementations. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 81, 2000
(Details)
Scheideler, Christian: Probabilistic Methods for Coordination Problems. Habilitation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 78, 2000
(Details)
Unsere Publikationen aus dem Jahr 1999:
Sohler, Christian: Fast Reconstruction of Delaunay Triangulations. In: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG'99), S. 136-141, 1999
(Details)
Sohler, Christian: Generating Random Star-Shaped Polygons. In: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG'99), S. 174-177, 1999
(Details)
Berenbrink, Petra; Brinkmann, André; Scheideler, Christian: Design of the PRESTO Multimedia Server . In: Proceedings of the International Workshop on Communication and Data Management in Large Networks (CDMLarge), S. 2 - 12, Paderborn, Germany, 5. Okt. 1999
(Details)
Lukovszki, Tamás: New Results on Fault Tolerant Geometric Spanners. In: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS, S. 193-204, 1999, Springer Verlag
(Details)
Fischer, Matthias; Lukovszki, Tamás; Ziegler, Martin: Partitioned Neighborhood Spanners of Minimal Outdegree. In: Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), S. 47-50, Sep. 1999
(Details)
Mattern, Friedemann; Meyer auf der Heide, Friedhelm: Vorwort: Junge Informatik. GI Jahrestagung 1999: S. 137 1999
(Details)
Meyer auf der Heide, Friedhelm; Vöcking, Berthold; Westermann, Matthias: Provably good and practical strategies for non-uniform data management in networks. Proc. of ESA: S. 89-100 1999
(Details)
Krick, Christof; Meyer auf der Heide, Friedhelm; Räcke, Harald; Vöcking, Berthold; Westermann, Matthias: Data Management in networks: experimental evaluation of a provably good strategy. Proc. of 11th ACM-SPAA: S. 165-174 1999
(Details)
Berenbrink, Petra; Meyer auf der Heide, Friedhelm; Schröder, Klaus: Allocating Weighted Jobs in Parallel. Theory of Computing Systems, 32: S. 281-300 1999
(Details)
Meyer auf der Heide, Friedhelm; Vöcking, Berthold: Shortest Paths Routing in Arbitrary Networks. Journal on Algorithms, 31: S. 105-131, Jun. 1999
(Details)
Bonorden, Olaf; Juurlink, Bernhardus; von Otte, Ingo; Rieping, Ingo: The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. In: Proc. of 13th International Parallel Processing Symposium & 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP), S. 99-104, 12. - 16. Apr. 1999
(Details)
Lukovszki, Tamás: New Results on Geometric Spanners and Their Applications. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 63, 1999
(Details)
Czumaj, Artur; Lingas, Andrzej: On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, S. 281-290, 17. - 19. Jan. 1999
(Details)
Unsere Publikationen aus dem Jahr 1998:
Fischer, Matthias; Lukovszki, Tamás; Ziegler, Martin: A Network Based Approach for Realtime Walkthrough of Massive Models. In: Proceedings of the 2nd Workshop on Algorithms Engineering (WAE'98), S. 133-142, Dez. 1998
(Details)
Fischer, Matthias; Lukovszki, Tamás; Ziegler, Martin: Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA'98), LNCS, Band 1461 , S. 163-174, Dez. 1998, Springer
(Details)
Bonorden, Olaf; Juurlink, Bernhardus; von Otte, Ingo; Rieping, Ingo: The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. tr-rsfb-98-063, Nov. 1998
(Details)
Fischer, Matthias; Lukovszki, Tamás; Ziegler, Martin: Multimediale Entdeckungsreisen unserer Welt mit dem Internet. Okt. 1998
(Details)
Meyer auf der Heide, Friedhelm; Schröder, Klaus; Schwarze, Frank: Routing on networks of optical crossbars. Theoretical Computer Science, 196: S. 181-200 1998
(Details)
Bäumker, Armin; Dittrich, Wolfgang; Meyer auf der Heide, Friedhelm: Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSB model.. Theoretical Computer Science, 203 (2): S. 175-203, Jun. 1998
(Details)
Cole, Richard; Maggs, Bruce; Meyer auf der Heide, Friedhelm; Mitzenmacher, Michael; Richa, Andrea; Schröder, Klaus; Sitaraman, Ramesh; Vöcking, Berthold: Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 1998: S. 378 - 388, Jun. 1998
(Details)
Martinez, Gabriel Terán; Meyer auf der Heide, Friedhelm: Communication-efficient parallel multiway- and approximate minimum-cut computation. Proc. of LATIN 1998: S. 316-330, Jun. 1998
(Details)
Vöcking, Berthold: Static and Dynamic Data Management in Networks. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 46, 1998
(Details)
Unsere Publikationen aus dem Jahr 1997:
Lukovszki, Tamás; Strothmann, Willy-Bernhard: Decremental Biconnectivity on Planar Graphs. tr-ri-97-186, Paderborn, 1997
(Details)
Czumaj, Artur; Strothmann, Willy-Bernhard: Bounded Degree Spanning Trees. In: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97), LNCS, Band 1284 , S. 104-117, 1997, Springer Verlag
(Details)
Fischer, Matthias; Meyer auf der Heide, Friedhelm; Strothmann, Willy-Bernhard: Dynamic Data Structures for Realtime Management of Large Geometric Scenes. In: 5th Annual European Symposium on Algorithms (ESA '97), LNCS, Band 1284 , S. 157 - 170, Okt. 1997, Springer
(Details)
Grigoriev, Dima; Karpinski, Marek; Meyer auf der Heide, Friedhelm; Smolensky, Roman: A Lower Bound for Randomized Algebraic Decision Trees. Computational Complexity, 6(4): S. 357-375 1997
(Details)
Meyer auf der Heide, Friedhelm; Storch, Martin; Wanka, Rolf: Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory Comput. Syst., 30(6): S. 627-644 1997
(Details)
Breslauer, Dany; Czumaj, Artur; Devdatt, P. Dubhashi: Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. Inf. Process. Lett., 62(2): S. 103-110 1997
(Details)
Czumaj, Artur; Meyer auf der Heide, Friedhelm; Stemann, Volker: Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Inf. Comput., 137(2): S. 103-120 1997
(Details)
Bock, Stefan; Meyer auf der Heide, Friedhelm; Scheideler, Christian: Optimal Wormhole Routing in the (n, d)-Torus. IPPS 1997: S. 326-332 1997
(Details)
Decker, Thomas; Meyer auf der Heide, Friedhelm: Parallel Computing in Paderborn: The SFB 376. GI Jahrestagung 1999: S. 164-171 1997
(Details)
Karaivazoglou, Efstratios; Meyer auf der Heide, Friedhelm: Routing on Asyncronous Processor Networks. Euro-Par 1997: S. 250-257, Jun. 1997
(Details)
Berenbrink, Petra; Meyer auf der Heide, Friedhelm; Schröder, Klaus: Allocating Weighted Jobs in Parallel. SPAA 1997: S. 302-310, Jun. 1997
(Details)
Maggs, Bruce; Meyer auf der Heide, Friedhelm; Vöcking, Berthold; Westermann, Matthias: Exploiting Locality for Data Management in Systems of Limited Bandwidth. FOCS 1997: S. 284-293, Jun. 1997
(Details)
Bäumker, Armin; Meyer auf der Heide, Friedhelm: Communication Efficient Parallel Searching. IRREGULAR 1997: S. 233-254, Jun. 1997
(Details)
Meyer auf der Heide, Friedhelm; Vöcking, Berthold: Static and Dynamic Data Management in Networks. Euro-Par 1997, (46-56), Jun. 1997
(Details)
Denny, Markus; Sohler, Christian: Encoding a Triangulation as a Permutation of its Point Set. In: Proceedings of the 9th Canadian Conference on Computational Geometry, S. 39-43, 1997
(Details)
Strothmann, Willy-Bernhard: Bounded Degree Spanning Trees. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 35, 1997
(Details)
Bäumker, Armin: Communication Efficient Parallel Searching. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 28, 1997
(Details)
Dittrich, Wolfgang: Communication and I/O Efficient Parallel Data Structures. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 27, 1997
(Details)
Unsere Publikationen aus dem Jahr 1996:
Fischer, Matthias; Rethmann, Jochen; Wachsmann, Alf: A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. tr-rsfb-96-007, Okt. 1996
(Details)
Karp, Richard M.; Luby, Michael; Meyer auf der Heide, Friedhelm: Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica, 16(4/5): S. 517-542 1996
(Details)
Gil, Joseph; Meyer auf der Heide, Friedhelm; Wigderson, Avi: The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computation, 25(5): S. 939-955 1996
(Details)
Meyer auf der Heide, Friedhelm; Oesterdiekhoff, Brigitte; Wanka, Rolf: Strongly Adaptive Token Distribution. Algorithmica, 15(5): S. 413-427 1996
(Details)
Grigoriev, Dima; Karpinski, Marek; Meyer auf der Heide, Friedhelm; Smolensky, Roman: A Lower Bound for Randomized Algebraic Decision Trees. Proc. of 28th ACM-STOC: S. 612-621 1996
(Details)
Czumaj, Artur; Meyer auf der Heide, Friedhelm; Stemann, Volker: Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Technical Report SFB tr-rsfb-96-006, University of Paderborn 1996
(Details)
Meyer auf der Heide, Friedhelm; Scheideler, Christian; Stemann, Volker: Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theoretical Computer Science, 162(2): S. 245-281 1996
(Details)
Cypher, Robert; Meyer auf der Heide, Friedhelm; Scheideler, Christian; Vöcking, Berthold: Universal Algorithms for Store-and-Forward and Wormhole Routing. STOC 1996: S. 356-365 1996
(Details)
Czumaj, Artur; Meyer auf der Heide, Friedhelm; Stemann, Volker: Contention Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB tr-rsfb-96-005, University of Paderborn 1996
(Details)
Ameur, Foued; Fischer, Paul; Höffgen, Klaus-Uwe; Meyer auf der Heide, Friedhelm: Trial and Error. A New Approach to Space-Bounded Learning. ACTA Informatica, 33(7): S. 621-630 1996
(Details)
Meyer auf der Heide, Friedhelm; Monien, Burkhard: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996. Proceedings Springer 1996
(Details)
Meyer auf der Heide, Friedhelm; Schröder, Klaus; Schwarze, Frank: Routing on Networks of Optical Crossbars (Extended Abstract).. Euro-Par 1996, I: S. 299-306 1996
(Details)
Berenbrink, Petra; Meyer auf der Heide, Friedhelm; Stemann, Volker: Fault Tolerant Shared Memory Simulations. Proc. of 13th STACS: S. 181-192, Jun. 1996
(Details)
Bäumker, Armin; Dittrich, Wolfgang; Meyer auf der Heide, Friedhelm; Rieping, Ingo: Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model. Euro-Par 1996, II: S. 369-376, Jun. 1996
(Details)
Fischer, Matthias; Rethmann, Jochen; Wachsmann, Alf: A Realistic Cost Model for the Communication Time in Parallel Programs. In: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW '96), S. 13-27, Amsterdam, 1. Apr. 1996, IOS Press
(Details)
Unsere Publikationen aus dem Jahr 1995:
Breslauer, Dany; Czumaj, Artur; Dubhashi, D.P.; Meyer auf der Heide, Friedhelm: Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. ESA 1995: S. 103-110, 1. Nov. 1995
(Details)
Meyer auf der Heide, Friedhelm; Westermann, Matthias: Hot-Potato Routing on Multi-Dimensional Tori. WG 1995: S. 209-221 1995
(Details)
Meyer auf der Heide, Friedhelm; Westermann, Matthias: Hot-Potato Routing on Multi-Dimensional Tori. WG 1995: S. 209-221 1995
(Details)
Meyer auf der Heide, Friedhelm; Vöcking, Berthold: A Packet Routing Protocol for Arbitrary Networks. STACS 1995: S. 291-302 1995
(Details)
Meyer auf der Heide, Friedhelm; Scheideler, Christian: Space-Efficient Routing in Vertex-Symmetric Networks. SPAA 1995: S. 137-146 1995
(Details)
Meyer auf der Heide, Friedhelm; Storch, Martin; Wanka, Rolf: Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks. SPAA 1995: S. 119-128 1995
(Details)
Czumaj, Artur; Meyer auf der Heide, Friedhelm; Stemann, Volker: Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration. ISTCS 1995: S. 11-19 1995
(Details)
Czumaj, Artur; Meyer auf der Heide, Friedhelm; Stemann, Volker: Shared Memory Simulations with Triple-Logarithmic Delay. ESA 1995: S. 46-59 1995
(Details)
Bäumker, Armin; Dittrich, Wolfgang; Meyer auf der Heide, Friedhelm: Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model. ESA 1995: S. 17-30, Jul. 1995
(Details)
Meyer auf der Heide, Friedhelm; Scheideler, Christian; Stemann, Volker: Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. STACS 1995: S. 267-278, Jul. 1995
(Details)
Grigoriev, Dima; Karpinski, Marek; Meyer auf der Heide, Friedhelm; Smolensky, Roman: A Lower Bound for Randomized Algebraic Decision Trees Electronic Colloquium on Computational Complexity. ECCC, 2(63) 1995
(Details)
Meyer auf der Heide, Friedhelm; Vöcking, Berthold: A Packet Routing Protocol for Arbitrary Networks. In: STACS 1995, S. 291-302, 1995
(Details)
Meyer auf der Heide, Friedhelm; Scheideler, Christian: Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. ESA 1995: S. 341-354, Jul. 1995
(Details)
Czumaj, Artur; Meyer auf der Heide, Friedhelm; Stemann, Volker: Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes. Proc. of the 2nd IEEE Workshop on Reconfigurable Architectures 1995
(Details)
Ameur, Foued: Space-Bounded Learning Algorithms. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 10, 1995
(Details)
Czumaj, Artur: Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 8, 1995
(Details)
Wachsmann, Alf: Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 6, 1995
(Details)
Stemann, Volker: Contention Resolution in Hashing Based Shared Memory Simulations. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, HNI-Verlagsschriftenreihe, Paderborn, Band 3, 1995
(Details)
Unsere Publikationen aus dem Jahr 1994:
Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans; Tarjan, Robert Endre: Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM J. Comput., 23(4): S. 738-761 1994
(Details)
Unsere Publikationen aus dem Jahr 1993:
Meyer auf der Heide, Friedhelm; Monien, Burkhard; Rosenberg, Arnold L.: Parallel Architectures and Their Efficient Use, First Heinz Nixdorf Symposium, Paderborn, Germany. Proceedings Springer, 11. Nov. 1993
(Details)
Kastens, Uwe; Meyer auf der Heide, Friedhelm; Wachsmann, Alf; Wichmann, Friedrich: OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). Proc. 3rd PASA Workshop, PARS Mitteilungen: S. 50-55 1993
(Details)
Meyer auf der Heide, Friedhelm; Oesterdiekhoff, Brigitte; Wanka, Rolf: Strongly Adaptive Token Distribution. ICALP 1993: S. 398-409 1993
(Details)
Dietzfelbinger, Martin; Meyer auf der Heide, Friedhelm: An Optimal Parallel Dictionary. Inf. Comput., 102(2): S. 196-217 1993
(Details)
Dietzfelbinger, Martin; Meyer auf der Heide, Friedhelm: Simple, Efficient Shared Memory Simulations. SPAA 1993: S. 110-119, Jul. 1993
(Details)
Lürwer-Brüggemeier, Katharina; Meyer auf der Heide, Friedhelm: Capabilities and Complexity of Computations with Integer Division. In: Enjalbert, Patrice; Finkel, Alain (Hrsg.) Proc.of the 10th Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, Band 665 , S. 463-472, 1993, Springer-Verlag
(Details)
Unsere Publikationen aus dem Jahr 1992:
Karp, Richard M.; Luby, Michael; Meyer auf der Heide, Friedhelm: Efficient PRAM Simulation on a Distributed Memory Machine. STOC 1992: S. 318-326 1992
(Details)
Meyer auf der Heide, Friedhelm: Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines. Heinz Nixdorf Symposium: S. 20-29 1992
(Details)
Meyer auf der Heide, Friedhelm; Pham, Hieu Thien: On the Performance of Networks with Multiple Busses. STACS 1992: S. 97-108 1992
(Details)
Dietzfelbinger, Martin; Meyer auf der Heide, Friedhelm: High Performance Universal Hashing, with Applications to Shared Memory Simulations. Data Structures and Efficient Algorithms: S. 250-269, Jul. 1992
(Details)
Kutylowski, Miroslaw; Wanka, Rolf: Periodic Sorting on Two-Dimensional Meshes. Parallel Processing Letters 2: S. 213-220 1992
(Details)
Unsere Publikationen aus dem Jahr 1990:
Gil, Joseph; Meyer auf der Heide, Friedhelm; Wigderson, Avi: Not All Keys Can Be Hashed in Constant Time (Preliminary Version). STOC 1990: S. 244-253 1990
(Details)
Dietzfelbinger, Martin; Meyer auf der Heide, Friedhelm: A New Universal Class of Hash Functions and Dynamic Hashing in Real Time. ICALP 1990: S. 6-19 1990
(Details)
Karpinski, Marek; Meyer auf der Heide, Friedhelm: On the Complexity of Genuinely Polynomial Computation. MFCS 1990: S. 362-368 1990
(Details)
Dietzfelbinger, Martin; Meyer auf der Heide, Friedhelm: How to Distribute a Dictionary in a Complete Network. STOC 1990: S. 117-127 1990
(Details)
Meyer auf der Heide, Friedhelm: Das Heinz Nixdorf-Institut der Universität-GH Paderborn. Informatik Spektrum, 13(4): S. 231-232 1990
(Details)
Unsere Publikationen aus dem Jahr 1989:
Meyer auf der Heide, Friedhelm: Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays. STACS 1989: S. 181-192 1989
(Details)
Dietzfelbinger, Martin; Meyer auf der Heide, Friedhelm: An Optimal Parallel Dictionary. SPAA 1989: S. 360-368 1989
(Details)
Meyer auf der Heide, Friedhelm; Wanka, Rolf: Time-Optimal Simulations of Networks by Universal Parallel Computers. STACS 1989: S. 120-131 1989
(Details)
Meyer auf der Heide, Friedhelm: On Genuinely Time Bounded Computations. STACS1989: S. 1-16 1989
(Details)
Bettina, Just; Meyer auf der Heide, Friedhelm; Wigderson, Avi: On Computations with Integer Division. ITA 23, 1(23): S. 101-111, Jul. 1989
(Details)
Unsere Publikationen aus dem Jahr 1988:
Borodin, Allan; Fich, Faith; Meyer auf der Heide, Friedhelm; Upfal, Eli; Wigderson, Avi: A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. Theor. Comput. Sci., 58: S. 57-68 1988
(Details)
Babai, Laszlo; Just, Bettina; Meyer auf der Heide, Friedhelm: On the Limits of Computations with the Floor Function. Inf. Comput 78, 2: S. 99-107 1988
(Details)
Just, Bettina; Meyer auf der Heide, Friedhelm; Wigderson, Avi: On Computations with Integer Division. STACS 1988: S. 29-37 1988
(Details)
Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans; Tarjan, Robert Endre: Dynamic Perfect Hashing: Upper and Lower Bounds. FOCS 1988: S. 524-531 1988
(Details)
Dietzfelbinger, Martin; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans: Upper and Lower Bounds for the Dicrionary Problem (Abstract). SWAT 1988: S. 214-215 1988
(Details)
Meyer auf der Heide, Friedhelm: Fast algorithms for N-dimensional restrictions of hard problems.. J. ACM, 35(3): S. 740-747, Jul. 1988
(Details)
Unsere Publikationen aus dem Jahr 1987:
Borodin, Allan; Fich, Faith; Meyer auf der Heide, Friedhelm; Upfal, Eli; Wigderson, Avi: A Time-Space Tradeoff for Element Distinctness. SIAM J. Comput., 16(1): S. 97-99 1987
(Details)
Meyer auf der Heide, Friedhelm; Wigderson, Avi: The Complexity of Parallel Sorting. SIAM J. Comput., 16(1): S. 100-107, Jul. 1987
(Details)
Unsere Publikationen aus dem Jahr 1986:
Meyer auf der Heide, Friedhelm: Speeding up Random Access Machines by Few Processors. STACS 1986: S. 142-152 1986
(Details)
Borodin, Allan; Fich, Faith; Meyer auf der Heide, Friedhelm; Upfal, Eli; Wigderson, Avi: A Time-Space Tradeoff for Element Distinctness. STACS 1986: S. 353-358 1986
(Details)
Meyer auf der Heide, Friedhelm: Efficient Simulations Among Several Models of Parallel Computers. SIAM J. Comput., 15(1): S. 106-119 1986
(Details)
Borodin, Allan; Fich, Faith; Meyer auf der Heide, Friedhelm; Upfal, Eli; Wigderson, Avi: A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. ICALP 1986: S. 50-59, Jul. 1986
(Details)
Unsere Publikationen aus dem Jahr 1985:
Lautemann, Clemens; Meyer auf der Heide, Friedhelm: Lower Time Bounds for Integer Programming with Two Variables. Inf. Process. Lett., 21(2): S. 101-105 1985
(Details)
Meyer auf der Heide, Friedhelm: Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models. Information and Control, 67(1-3): S. 195-211 1985
(Details)
Meyer auf der Heide, Friedhelm: Simulating Probabilistic by Deterministic Algebraic Computation Trees. Theor. Comput. Sci., 41: S. 325-330 1985
(Details)
Meyer auf der Heide, Friedhelm: Nondeterministic versus Probabilistic Linear Search Algorithms. FOCS 1985: S. 65-73 1985
(Details)
Fich, Faith; Meyer auf der Heide, Friedhelm; Ragde, Prabhakar; Wigderson, Avi: One, Two, Three dots Infinity: Lower Bounds for Parallel Computation. STOC 1985: S. 48-58 1985
(Details)
Meyer auf der Heide, Friedhelm: Fast Algorithms for N-Dimensional Restrictions of Hard Problems. STOC 1985: S. 413-420 1985
(Details)
Meyer auf der Heide, Friedhelm; Wigderson, Avi: The Complexity of Parallel Sorting. FOCS 1985: S. 532-540, Jul. 1985
(Details)
Meyer auf der Heide, Friedhelm: Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines. J. ACM, 32(4): S. 929-937, Jul. 1985
(Details)
Unsere Publikationen aus dem Jahr 1984:
Meyer auf der Heide, Friedhelm: Efficient Simulations among Several Models of Parallel Computers. STACS 1984: S. 218-229 1984
(Details)
Meyer auf der Heide, Friedhelm; Reischuk, Rüdiger: On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication. FOCS 1984: S. 56-64 1984
(Details)
Meyer auf der Heide, Friedhelm: A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem. J. ACM, 31(3): S. 668-676, Jul. 1984
(Details)
Unsere Publikationen aus dem Jahr 1983:
Meyer auf der Heide, Friedhelm: Efficiency of Universal Parallel Computers. Acta Inf. 19: S. 269-296 1983
(Details)
Meyer auf der Heide, Friedhelm: Efficiently of universal parallel computers. Theoretical Computer Science: S. 221-241 1983
(Details)
Klein, Peter; Meyer auf der Heide, Friedhelm: A Lower Time Bound for the Knapsack Problem on Random Access Machines. Acta Inf. 19: S. 385-395 1983
(Details)
Meyer auf der Heide, Friedhelm: Infinite Cube-Connected Cycles. Inf. Process. Lett., 16(1): S. 1-2 1983
(Details)
Meyer auf der Heide, Friedhelm: A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem. STOC 1983: S. 70-79 1983
(Details)
Unsere Publikationen aus dem Jahr 1981:
Meyer auf der Heide, Friedhelm: A Comparison of two Variations of a Pebble Game on Graphs. Theor. Comput. Sci., 13: S. 315-322 1981
(Details)
Meyer auf der Heide, Friedhelm; Rollik, Hans-Anton: Random Access Machines and Straight-Line Programs. FCT 1981: S. 259-264 1981
(Details)
Meyer auf der Heide, Friedhelm: Time-Processor Trade-offs for Universal Parallel Computers. MFCS 1981: S. 433-441 1981
(Details)
Unsere Publikationen aus dem Jahr 1980:
Klein, Peter; Meyer auf der Heide, Friedhelm: Untere Zeitschranken für das Rucksack-Problem. GI Jahrestagung 1980: S. 365-374 1980
(Details)
Unsere Publikationen aus dem Jahr 1979:
Meyer auf der Heide, Friedhelm: A Comparison Between Two Variations of a Pebble Game on Graphs. ICALP 1979: S. 411-421 1979
(Details)


