Dangelmaier, Wilhelm, et al. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 2005, pp. 267–70.
LibreCat: /record/18366

Loeser, Christoph, et al. “Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario.” IEEE International Conference on Industrial Informatics (INDIN), 2005.
LibreCat: /record/18449

Oesterdiekhoff, Brigitte. “Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices.” IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), 2005.
LibreCat: /record/18450

Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.”10.1007/11558989_20__Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20.
LibreCat: /record/16468
DOI: 10.1007/11558989_20

Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.”10.1007/11549345_1__Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1.
LibreCat: /record/16469
DOI: 10.1007/11549345_1

Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms in Java.”10.1007/11752578_96__Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–08, doi:10.1007/11752578_96.
LibreCat: /record/16470
DOI: 10.1007/11752578_96

Bonorden, Olaf, et al. “Load Balancing Strategies in a Web Computing Environment.”10.1007/11752578_101__Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–46, doi:10.1007/11752578_101.
LibreCat: /record/16471
DOI: 10.1007/11752578_101

Bienkowski, Marcin, et al. “Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.” Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, Technische Universiteit Eindhoven, 2005.
LibreCat: /record/17112

Leonardi, Stefano, et al., editors. Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks. Vol. 05361, 2005.
LibreCat: /record/17113

Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”10.1016/j.tcs.2005.09.053__Theoretical Computer Science, 2005, pp. 14–26, doi:10.1016/j.tcs.2005.09.053.
LibreCat: /record/15058
DOI: 10.1016/j.tcs.2005.09.053

Salzwedel, Kay. Data Distribution Algorithms for Storage Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004.
LibreCat: /record/19616

Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.”10.1007/978-3-540-30217-9_4__Parallel Problem Solving from Nature - PPSN VIII, 2004, doi:10.1007/978-3-540-30217-9_4.
LibreCat: /record/19692
DOI: 10.1007/978-3-540-30217-9_4

Schweer, Andrea, et al. “Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.” Parallel Problem Solving from Nature - PPSN VIII, 2004.
LibreCat: /record/19693

Brinkmann, André, et al. “A Case for Virtualized Arrays of RAID.”10.1145/1162628.1162630__Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04, 2004, pp. 9–16, doi:10.1145/1162628.1162630.
LibreCat: /record/19800
DOI: 10.1145/1162628.1162630

Schindelhauer, Christian, et al. “The Design of PaMaNet the Paderborn Mobile Ad-Hoc Network.”10.1145/1023783.1023807__Proceedings of the Second International Workshop on Mobility Management &; Wireless Access Protocols, 2004, doi:10.1145/1023783.1023807.
LibreCat: /record/19807
DOI: 10.1145/1023783.1023807

Bleckmann, Peter, et al. “Virtualization with Prefetching Abilities Based on ISCSI.”10.1145/1162628.1162634__Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, no. 2, 2004, pp. 40–47, doi:10.1145/1162628.1162634.
LibreCat: /record/19851
DOI: 10.1145/1162628.1162634

Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric Proximity Graphs.”10.1016/j.cag.2004.08.012__Computers and Graphics, vol. 28, no. 6, 2004, pp. 839–50, doi:10.1016/j.cag.2004.08.012.
LibreCat: /record/19879
DOI: 10.1016/j.cag.2004.08.012

Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces over Point Clouds.” Eurographics Symposium on Point-Based Grahics (SPBG’04), 2004, pp. 131–38.
LibreCat: /record/19883

Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over Noisy Point Clouds.” SIGGRAPH 2004, Sketches, 2004.
LibreCat: /record/19889

Klein, Jan, and Gabriel Zachmann. “Point Cloud Collision Detection.” Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004), 2004, pp. 567–76.
LibreCat: /record/19891

Volbert, Klaus. “Experimental Analysis of Adjustable Sectorized Topologies for Static Ad Hoc Networks.”10.1145/1022630.1022646__Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing  - DIALM-POMC ’04, 2004, doi:10.1145/1022630.1022646.
LibreCat: /record/26411
DOI: 10.1145/1022630.1022646

Rührup, Stefan, and Christian Schindelhauer. Traffic and Hop Efficient Position-Based Routing Using a Cell Structure. 2004.
LibreCat: /record/26992

Brinkmann, André, et al. “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.” 21st IEEE Conference on Mass Storage Systems and Technologies / 12th NASA Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, edited by Ben Kobler and P. C. Hariharan, IEEE, 2004, pp. 153--157.
LibreCat: /record/17346

Sohler, Christian, and Valentina Damerow. “Smoothed Number of Extreme Points under Uniform Noise.” Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04), 2004, pp. 93–96.
LibreCat: /record/18777

Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.”10.1007/978-3-540-30140-0_25__Proceedings of the 12th European Symposium on Algorithms (ESA’04), 2004, doi:10.1007/978-3-540-30140-0_25.
LibreCat: /record/18778
DOI: 10.1007/978-3-540-30140-0_25

Sohler, Christian, et al. “Reducing State Changes with a Pipeline Buffer.” Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004), 2004.
LibreCat: /record/18785

Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation for Clustering via Random Sampling.” Automata, Languages and Programming (ICALP), no. 1, 2004, pp. 396–407.
LibreCat: /record/18786

Ziegler, Martin, and Vasco Brattka. “Computability in Linear Algebra.”https://doi.org/10.1016/j.tcs.2004.06.022__Theoretical Computer Science, vol. 326, no. 1–3, 2004, pp. 187–211, doi:https://doi.org/10.1016/j.tcs.2004.06.022.
LibreCat: /record/17986
DOI: https://doi.org/10.1016/j.tcs.2004.06.022

Ziegler, Martin. “Computable Operators on Regular Sets.”10.1002/malq.200310107__Computability and Complexity in Analysis, vol. 50, no. 4–5, 2004, pp. 392–404, doi:10.1002/malq.200310107.
LibreCat: /record/18260
DOI: 10.1002/malq.200310107

Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate Polynomials.”10.1007/978-3-540-30140-0_49__Proc. 12th Annual Symposium on Algorithms (ESA’04), vol. 3221, Springer, 2004, pp. 544–55, doi:10.1007/978-3-540-30140-0_49.
LibreCat: /record/18263
DOI: 10.1007/978-3-540-30140-0_49

Schindelhauer, Christian, et al. “Spanners, Weak Spanners, and Power Spanners for Wireless Networks.”10.1007/978-3-540-30551-4_69__Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), vol. 3341, Springer , 2004, pp. 805–21, doi:10.1007/978-3-540-30551-4_69.
LibreCat: /record/18279
DOI: 10.1007/978-3-540-30551-4_69

Mueck, Bengt, et al. “Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations.” Simulation and Visualisation 2004, SCS European Publishing House, 2004, pp. 73–83.
LibreCat: /record/18364

Oesterdiekhoff, Brigitte. “Transcoding von Webinhalten.” Informatik Spektrum, vol. 27, no. 5, 2004, pp. 448–52.
LibreCat: /record/18447

Oesterdiekhoff, Brigitte. “Internet Premium Services for Flexible Format Distributed Devices.” Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES’04), 2004.
LibreCat: /record/18448

Bansal, Vikas, et al. “Labeling Smart Dust.”10.1007/978-3-540-30140-0_9__12th Annual European Symposium on Algorithms (ESA 2004), vol. 3221, 2004, doi:10.1007/978-3-540-30140-0_9.
LibreCat: /record/16474
DOI: 10.1007/978-3-540-30140-0_9

Bienkowski, Marcin, et al. “Fighting against Two Adversaries.”10.1145/1007912.1007923__Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’04, 2004, doi:10.1145/1007912.1007923.
LibreCat: /record/16475
DOI: 10.1145/1007912.1007923

Meyer auf der Heide, Friedhelm, et al. “Congestion, Dilation, and Energy in Radio Networks.”10.1007/s00224-004-1124-z__Theory of Computing Systems, 2004, pp. 343–70, doi:10.1007/s00224-004-1124-z.
LibreCat: /record/16477
DOI: 10.1007/s00224-004-1124-z

Leonardi, S., et al. “Scheduling against an Adversarial Network.”10.1145/1007912.1007936__SPAA ’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004, doi:10.1145/1007912.1007936.
LibreCat: /record/16480
DOI: 10.1145/1007912.1007936

Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments.”10.1162/1054746043280619__Presence: Teleoperators and Virtual Environments, 2004, pp. 617–37, doi:10.1162/1054746043280619.
LibreCat: /record/16399
DOI: 10.1162/1054746043280619

Liu Jing, Michelle, et al. “Sensor Networks with More Features Using Less Hardware.” GOR/NGB Conference Tilburg 2004, 2004.
LibreCat: /record/13071

Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library.”10.1016/s0167-8191(02)00218-1__Parallel Computing, 2003, pp. 187–207, doi:10.1016/s0167-8191(02)00218-1.
LibreCat: /record/19726
DOI: 10.1016/s0167-8191(02)00218-1

Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.”10.1007/3-540-36574-5_12__Algorithms for Memory Hierarchies, vol. 2625, 2003, doi:10.1007/3-540-36574-5_12.
LibreCat: /record/19785
DOI: 10.1007/3-540-36574-5_12

Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.
LibreCat: /record/19790

Rührup, Stefan, et al. “Performance of Distributed Algorithms for Topology Control in Wireless Networks.”10.1109/ipdps.2003.1213107__Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003, doi:10.1109/ipdps.2003.1213107.
LibreCat: /record/19806
DOI: 10.1109/ipdps.2003.1213107

Mahlmann, Peter. Implementierung Und Vergleich von Verfahren Zum Information Retrieval Im World Wide Web. 2003.
LibreCat: /record/19828

Volbert, Klaus, et al. “Directed Power-Variable Infrared Communication for the Mini Robot Khepera.” Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment, 2003, pp. 113–22.
LibreCat: /record/19833

Klein, Jan, and Gabriel Zachmann. “ADB-Trees: Controlling the Error of Time-Critical Collision Detection.” Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003), 2003, pp. 37–45.
LibreCat: /record/19874

Klein, Jan, and Gabriel10.1145/1008653.1008660__Zachmann. “Time-Critical Collision Detection Using an Average-Case Approach.”10.1145/1008653.1008660__10.1145/1008653.1008660__Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003), 2003, pp. 22–31, doi:10.1145/1008653.1008660.
LibreCat: /record/19900
DOI: 10.1145/1008653.1008660

Fomin, Fedor V., and Dimitrios M. Thilikos. “Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.”10.1137/s0097539702419649__Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, doi:10.1137/s0097539702419649.
LibreCat: /record/19952
DOI: 10.1137/s0097539702419649

Terbahl, Martina, and Jens Krokowski. “Verteiltes Rendern Durch Dynamische Bildaufteilung.” Proceedings of 5. GI-Informatiktage 2003, 2003.
LibreCat: /record/24273

Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” Proc. 5th Conference on Real Numbers and Computers (RN), INRIA, 2003, pp. 47–64.
LibreCat: /record/26263

Ziegler, Martin. “Computable Operators on Regular Sets.” Computability and Complexity in Analysis, vol. 302-8/2003, 2003, pp. 389–406.
LibreCat: /record/26277

Damerow, Valentina, et al. “Smoothed Motion Complexity.”10.1007/978-3-540-39658-1_17__ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.
LibreCat: /record/2128
DOI: 10.1007/978-3-540-39658-1_17

Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.
LibreCat: /record/2129

Mueck, Bengt, et al. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” 15th European Simulation Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–71.
LibreCat: /record/17423

Magen, Avner, et al. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822.
LibreCat: /record/18791

Bienkowski, Marcin, et al. “A Practical Algorithm for Constructing Oblivious Routing Schemes.”10.1145/777412.777418__Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003, doi:10.1145/777412.777418.
LibreCat: /record/18907
DOI: 10.1145/777412.777418

Rust, Carsten, et al. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.
LibreCat: /record/18947

Schindelhauer, Christian, et al. “Worst Case Mobility in Ad Hoc Networks.”10.1145/777412.777448__Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPA), 2003, doi:10.1145/777412.777448.
LibreCat: /record/18960
DOI: 10.1145/777412.777448

Azar, Yossi, et al. “Optimal Oblivious Routing in Polynomial Time.”10.1145/780542.780599__Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003, doi:10.1145/780542.780599.
LibreCat: /record/18966
DOI: 10.1145/780542.780599

Gehweiler, Joachim. Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java. 2003.
LibreCat: /record/18982

Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” Complex Systems, vol. 14, no. 3, 2003, pp. 263--268.
LibreCat: /record/20435

Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.”10.1007/978-3-540-24587-2_72__Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–15, doi:10.1007/978-3-540-24587-2_72.
LibreCat: /record/18196
DOI: 10.1007/978-3-540-24587-2_72

Ziegler, Martin. “Fast Relative Approximation of Potential Fields.”10.1007/978-3-540-45078-8_13__Lecture Notes in Computer Science, edited by F. Dehne et al., vol. 2748, Springer, 2003, doi:10.1007/978-3-540-45078-8_13.
LibreCat: /record/18258
DOI: 10.1007/978-3-540-45078-8_13

Fischer, Matthias, et al. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management, vol. 5, Shaker Verlag, 2003, pp. 170–77.
LibreCat: /record/18367

Dangelmaier, Wilhelm, et al. “Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen in Virtuellen Umgebungen.” 2. Paderborner Workshop Augmented &; Virtual Reality in Der Produktentstehung, vol. 123, 2003, pp. 141–51.
LibreCat: /record/18372

Fischer, Matthias, et al. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten Simulation.” 2. Paderborner Workshop Augmented &; Virtual Reality in Der Produktentstehung, vol. 123, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–66.
LibreCat: /record/18374

Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” Combinatorics, Probability &; Computing, 2003, pp. 225–44.
LibreCat: /record/18567

Sohler, Christian. Property Testing and Geometry. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.
LibreCat: /record/18573

Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).”10.1524/itit.45.2.108.19606__It - Information Technology, 2003, doi:10.1524/itit.45.2.108.19606.
LibreCat: /record/16481
DOI: 10.1524/itit.45.2.108.19606

Juurlink, Bernhardus, et al. “Optimal Broadcast on Parallel Locality Models.”10.1016/s1570-8667(03)00023-6__Journal of Discrete Algorithms, 2003, pp. 151–66, doi:10.1016/s1570-8667(03)00023-6.
LibreCat: /record/16482
DOI: 10.1016/s1570-8667(03)00023-6

Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, editors. Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03. 2003, doi:10.1145/777412.
LibreCat: /record/16484
DOI: 10.1145/777412

Bonorden, Olaf, et al. “A Holistic Methodology for Network Processor Design.”10.1109/LCN.2003.1243185__28th Annual IEEE International Conference on Local Computer Networks, 2003, doi:10.1109/LCN.2003.1243185.
LibreCat: /record/16720
DOI: 10.1109/LCN.2003.1243185

Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–08.
LibreCat: /record/19727

Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.”10.1007/3-540-36379-3_36__Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2002, pp. 413–20, doi:10.1007/3-540-36379-3_36.
LibreCat: /record/19850
DOI: 10.1007/3-540-36379-3_36

Klein, Jan, et al. “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression.” Proc. of 4. GI-Informatiktage, 2002, pp. 224–29.
LibreCat: /record/19873

Benczúr, András, et al. “Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks.” Proc. of 10th International Workshop on Abstract State Machines, LNCS, 2002.
LibreCat: /record/24336

Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”10.1007/3-540-45706-2_134__Proceedings of the 8th International Euro-Par Conference, 2002, doi:10.1007/3-540-45706-2_134.
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134

Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector Subdivision.”10.1109/empdp.2002.994324__Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, 2002, doi:10.1109/empdp.2002.994324.
LibreCat: /record/26412
DOI: 10.1109/empdp.2002.994324

Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.
LibreCat: /record/2136

Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient Property Testers.” Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), 2002, pp. 83–92.
LibreCat: /record/18853

Lukovszki, Tamás, and A. Benczúr. A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. 2002.
LibreCat: /record/18961

Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
LibreCat: /record/18169

Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.”10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4__Mathematical Logic Quarterly (MLQ), vol. 48, no. , 2002, pp. 157–81, doi:10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4.
LibreCat: /record/18176
DOI: 10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4

Ziegler, Martin, et al. “Point Location Algorithms of Minimum Size.” Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.
LibreCat: /record/18177

Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.”10.1007/978-0-387-35608-2_9__Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, 2002, pp. 95–106, doi:10.1007/978-0-387-35608-2_9.
LibreCat: /record/18179
DOI: 10.1007/978-0-387-35608-2_9

Mueck, Bengt, et al. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” Simulation Und Visualisierung, SCS European Publishing House, 2002, pp. 71–84.
LibreCat: /record/18369

Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.”10.1007/3-540-45465-9_77__Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002, doi:10.1007/3-540-45465-9_77.
LibreCat: /record/18566
DOI: 10.1007/3-540-45465-9_77

Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.”10.1007/s00224-001-1045-z__Theory of Computing Systems, 2002, pp. 217–45, doi:10.1007/s00224-001-1045-z.
LibreCat: /record/16489
DOI: 10.1007/s00224-001-1045-z

Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.”10.1145/585740.585764__Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02, 2002, doi:10.1145/585740.585764.
LibreCat: /record/16490
DOI: 10.1145/585740.585764

Meyer auf der Heide, Friedhelm, et al. “Energy, Congestion and Dilation in Radio Networks.”10.1145/564870.564910__Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02, 2002, doi:10.1145/564870.564910.
LibreCat: /record/16491
DOI: 10.1145/564870.564910

Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.”10.1007/3-540-45706-2_133__Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, 2002, doi:10.1007/3-540-45706-2_133.
LibreCat: /record/16723
DOI: 10.1007/3-540-45706-2_133

Schröder, Klaus. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.
LibreCat: /record/19622

Salzwedel, Kay, et al. “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN).” Proceedings of the PDPTA 2001, vol. 1, 2001, pp. 463–70.
LibreCat: /record/19797

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.”10.1007/s004930170007__Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.
LibreCat: /record/2139
DOI: 10.1007/s004930170007

Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat: /record/2141

Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.”10.1007/3-540-48224-5_41__Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.
LibreCat: /record/18749
DOI: 10.1007/3-540-48224-5_41

Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–72.
LibreCat: /record/18750

Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.”10.1007/3-540-44676-1_22__Proceedings of the 9th Annual European Symposium on Algorithms (ESA), 2001, pp. 266–77, doi:10.1007/3-540-44676-1_22.
LibreCat: /record/18857
DOI: 10.1007/3-540-44676-1_22

Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.”10.1007/3-540-45294-x_21__Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001, doi:10.1007/3-540-45294-x_21.
LibreCat: /record/18964
DOI: 10.1007/3-540-45294-x_21