Schindelhauer, C., &; Voß, K. (2005). Probability Distributions for Channel Utilisation. In Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005) (pp. 271–284).https://doi.org/10.1007/11561354_23 

Schindelhauer, C., Weikum, G., Hales, D., &; Triantafillou, P. (2005). Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search. In European Conference on Complex Systems (ECCS 2005).

Brinkmann, A., Effert, S., Heidebuer, M., &; Vodisek, M. (2005). Distributed MD. In In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (pp. 81–88).

Brinkmann, A., Effert, S., Heidebuer, M., Vodisek, M., &; Baars, H. (2005). 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 (pp. 1–8).

Klein, J., &; Zachmann, G. (2005). The expected running time of hierarchical collision detection. In ACM SIGGRAPH 2005 Posters on https://doi.org/10.1145/1186954.1187087__- SIGGRAPH ’05.https://doi.org/10.1145/1186954.1187087 

Klein, J., &; Zachmann, G. (2005). 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) (pp. 163–170).https://doi.org/10.1145/1186223.1186329 

Loeser, C., Schomaker, G., Brinkmann, A., Vodisek, M., &; Heidebuer, M. (2005). Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts. In Proceedings of the 4th International Conference on Networking (Vol. 3421, pp. 800–810). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-31957-3_90 

Ziegler, M., &; Fuchssteiner, B. (2005). Nonlinear Reformulation of Heisenberg’s Dynamics. International Journal of Theoretical Physics, 693–717.https://doi.org/10.1007/s10773-005-7048-9 

Schindelhauer, C., &; Schomaker, G. (2005). Weighted distributed hash tables. SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, Nevada, USA.https://doi.org/10.1145/1073970.1074008 

Rührup, S., &; Schindelhauer, C. (2005). Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In Algorithms – ESA 2005.https://doi.org/10.1007/11561071_5 

Fischer, M. (2005). Design, analysis, and evaluation of a data structure for distributed virtual environments (Vol. 164). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Dangelmaier, W., Fischer, M., Gausemeier, J., Grafe, M., Matysczok, C., &; Mueck, B. (2005). Virtual and augmented reality support for discrete manufacturing system simulation. Computers in Industry, 371–383.https://doi.org/10.1016/j.compind.2005.01.007 

Fischer, M., Mueck, B., Mahajan, K., Kortenjan, M., Laroque, C., &; Dangelmaier, W. (2005). Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations. In Proceedings of the Winter Simulation Conference.https://doi.org/10.1109/wsc.2005.1574470 

Czumaj, A., &; Sohler, C. (2005). Abstract Combinatorial Programs and Efficient Property Testers. SIAM Journal on Computing, 34(3), 580–615.https://doi.org/10.1137/s009753970444199x 

Bdoiu, M., Czumaj, A., Indyk, P., &; Sohler, C. (2005). Facility Location in Sublinear Time. In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) (pp. 866–877). Berlin, Heidelberg.https://doi.org/10.1007/11523468_70 

Sohler, C., &; Frahling, G. (2005). Coresets in Dynamic Geometric Data Streams. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC) (pp. 209–217).

Czumaj, A., &; Sohler, C. (2005). Testing hypergraph colorability. Theoretical Computer Science, 331(1), 37–52.https://doi.org/10.1016/j.tcs.2004.09.031 

Czumaj, A., Ergün, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., &; Sohler, C. (2005). Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing, 35(1), 91–109.https://doi.org/10.1137/s0097539703435297 

Frahling, G., &; Krokowski, J. (2005). Online Occlusion Culling. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer.https://doi.org/10.1007/11561071_67 

Bienkowski, M., &; Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg.https://doi.org/10.1007/11549468_105 

Bienkowski, M., &; Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 815–826). Berlin, Heidelberg: Springer .https://doi.org/10.1007/11561071_72 

Bienkowski, M. (2005). Dynamic Page Migration with Stochastic Requests. In Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005) (pp. 270–278). Las Vegas, Nevada, USA: ACM Press, NY, USA.

Bienkowski, M., Brinkmann, A., Korzeniowski, M., &; Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In Proceedings of the 4th International Conference on Networking (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-31956-6_49 

Bienkowski, M., Dynia, M., &; Korzeniowski, M. (2005). Improved Algorithms for Dynamic Page Migration. In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 365–376).https://doi.org/10.1007/978-3-540-31856-9_30 

Räcke, H. (2005). Data Management and Routing in General Networks (Vol. 154). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Frahling, G., Indyk, P., &; Sohler, C. (2005). Sampling in dynamic data streams and applications. In Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05.https://doi.org/10.1145/1064092.1064116 

Köhler, S., Schindelhauer, C., &; Ziegler, M. (2005). On Approximating Real-World Halting Problems. In Fundamentals of Computation Theory. Berlin, Heidelberg.https://doi.org/10.1007/11537311_40 

Meer, K., &; Ziegler, M. (2005). An Explicit Solution to Post’s Problem over the Reals. In Fundamentals of Computation Theory. Berlin, Heidelberg.https://doi.org/10.1007/11537311_41 

Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In Proc. CiE 2005: New Computational Paradigms (Vol. 3526, pp. 562–571). Springer.https://doi.org/10.1007/11494645_68 

Ziegler, M. (2005). Computational Power of Infinite Quantum Parallelism. International Journal of Theoretical Physics, 44(11), 2059–2071.https://doi.org/10.1007/s10773-005-8984-0 

Dangelmaier, W., Mueck, B., Fischer, M., Mahajan, K., &;  Laroque, C. (2005). Methods to lead the user to significant processes in a 3D material flow simulation. In Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005 (pp. 267–270).

Loeser, C., Drüke, I., &; Oesterdiekhoff, B. (2005).  Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario. In IEEE International Conference on Industrial Informatics (INDIN).

Oesterdiekhoff, B. (2005). Glaschick, Rainer; Service Oriented Interface Design for Embedded Devices. In IEEE International Conference on Emerging Technologies and Factory Automation (ETFA).

Bienkowski, M., Korzeniowski, M., &; Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV. Berlin, Heidelberg.https://doi.org/10.1007/11558989_20 

Bienkowski, M., &; Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg.https://doi.org/10.1007/11549345_1 

Bonorden, O., Gehweiler, J., &; Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 801–808).https://doi.org/10.1007/11752578_96 

Bonorden, O., Gehweiler, J., &; Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 839–846).https://doi.org/10.1007/11752578_101 

Bienkowski, M., Damerow, V., Meyer auf der Heide, F., &; Sohler, C. (2005). Average case complexity of Voronoi diagrams of n sites from the unit cube. In Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005. Technische Universiteit Eindhoven.

Leonardi, S., Meyer auf der Heide, F., &; Wagner, D. (Eds.). (2005). Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks (Vol. 05361). Presented at the Dagstuhl Seminar Proceedings, Schloss Dagstuhl, Germany.

Ziegler, M. (2005). Stability versus speed in a computable algebraic model. Theoretical Computer Science, 14–26.https://doi.org/10.1016/j.tcs.2005.09.053 

Salzwedel, K. (2004). Data Distribution Algorithms for Storage Networks (Vol. 153). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O.,https://doi.org/10.1007/978-3-540-30217-9_4__Wegener, I. (2004). The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30217-9_4 

Schweer, A., Leifhelm, M., Degener, B., Heering, O., Tannenbaum, S., Röglin, H.,  Plociennik, K. (2004). Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. In Parallel Problem Solving from Nature - PPSN VIII.

Brinkmann, A., Salzwedel, K., &; Vodisek, M. (2004). A case for virtualized arrays of RAID. In Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI ’04 (pp. 9–16).https://doi.org/10.1145/1162628.1162630 

Schindelhauer, C., Böttcher, S., &; Rammig, F. (2004). The design of PaMaNet the Paderborn mobile ad-hoc network. In Proceedings of the second international workshop on Mobility management &; wireless access protocols.https://doi.org/10.1145/1023783.1023807 

Bleckmann, P., Schomaker, G., &; Slowik, A. (2004). Virtualization with prefetching abilities based on iSCSI. Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 2, 40–47.https://doi.org/10.1145/1162628.1162634 

Klein, J., &; Zachmann, G. (2004). Point Cloud Surfaces using Geometric Proximity Graphs. Computers and Graphics, 28(6), 839–850.https://doi.org/10.1016/j.cag.2004.08.012 

Klein, J., &; Zachmann, G. (2004). Proximity Graphs for Defining Surfaces over Point Clouds. In Eurographics Symposium on Point-Based Grahics (SPBG’04) (pp. 131–138).

Klein, J., &; Zachmann, G. (2004). Nice and Fast Implicit Surfaces over Noisy Point Clouds. In SIGGRAPH 2004, Sketches.

Klein, J., &; Zachmann, G. (2004). Point Cloud Collision Detection. In Computer Graphics Forum (Proceedings of EUROGRAPHICS 2004) (pp. 567–576).

Volbert, K. (2004). Experimental analysis of adjustable sectorized topologies for static ad hoc networks. Proceedings of the 2004 Joint Workshop on Foundations of Mobile Computing  - DIALM-POMC ’04.https://doi.org/10.1145/1022630.1022646 

Rührup, S., &; Schindelhauer, C. (2004). Traffic and Hop Efficient Position-based Routing using a Cell Structure.

Brinkmann, A., Heidebuer, M., Meyer auf der Heide, F., Rückert, U., Salzwedel, K., &; Vodisek, M. (2004). V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System. In B. Kobler &; P. C. Hariharan (Eds.), 21st IEEE Conference on Mass Storage Systems and Technologies / 12th NASA Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA (pp. 153--157). IEEE.

Sohler, C., &; Damerow, V. (2004). Smoothed Number of Extreme Points under Uniform Noise. In Proceedings of the 20th European Workshop on Computational Geometry (EWCG’04) (pp. 93–96).

Damerow, V., &; Sohler, C. (2004). Extreme Points Under Random Noise. In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30140-0_25 

Sohler, C., Krokowski, J., Räcke, H., &; Westermann, M. (2004). Reducing State Changes with a Pipeline Buffer. In Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004).

Sohler, C., &; Czumaj, A. (2004). Sublinear-Time Approximation for Clustering via Random Sampling. In Automata, Languages and Programming (ICALP) (pp. 396–407).

Ziegler, M., &; Brattka, V. (2004). Computability in linear algebra. Theoretical Computer Science, 326(1–3), 187–211.https://doi.org/10.1016/j.tcs.2004.06.022 

Ziegler, M. (2004). Computable operators on regular sets. Computability and Complexity in Analysis, 50(4–5), 392–404.https://doi.org/10.1002/malq.200310107 

Nüsken, M., &; Ziegler, M. (2004). Fast Multipoint Evaluation of Bivariate Polynomials. In Proc. 12th Annual Symposium on Algorithms (ESA’04) (Vol. 3221, pp. 544–555). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-30140-0_49 

Schindelhauer, C., Volbert, K., &; Ziegler, M. (2004). Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04) (Vol. 3341, pp. 805–821). Berlin, Heidelberg: Springer .https://doi.org/10.1007/978-3-540-30551-4_69 

Mueck, B., Dangelmaier, W., Laroque, C., Fischer, M., &; Kortenjan, M. (2004). Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations. In Simulation and Visualisation 2004 (pp. 73–83). Magdeburg: SCS European Publishing House.

Oesterdiekhoff, B. (2004). Transcoding von Webinhalten. Informatik Spektrum, 27(5), 448–452.

Oesterdiekhoff, B. (2004). Internet Premium Services for Flexible Format Distributed Devices. In Proceedings of IFIP Working Conference on Distributed and Parallel Embedded Systems (DIPES’04).

Bansal, V., Meyer auf der Heide, F., &; Sohler, C. (2004). Labeling Smart Dust. In 12th Annual European Symposium on Algorithms (ESA 2004) (Vol. 3221). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30140-0_9 

Bienkowski, M., Korzeniowski, M., &; Meyer auf der Heide, F. (2004). Fighting against two adversaries. In Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’04.https://doi.org/10.1145/1007912.1007923 

Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., &; Grünewald, M. (2004). Congestion, Dilation, and Energy in Radio Networks. Theory of Computing Systems, 343–370.https://doi.org/10.1007/s00224-004-1124-z 

Leonardi, S., Marchetti-Spaccamela, A., &; Meyer auf der Heide, F. (2004). Scheduling against an adversarial network. In SPAA ’04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures.https://doi.org/10.1145/1007912.1007936 

Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., &; Meyer auf der Heide, F. (2004). The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. Presence: Teleoperators and Virtual Environments, 617–637.https://doi.org/10.1162/1054746043280619 

Liu Jing, M., Ruehrup, S., Schindelhauer, C., Volbert, K., Dierkes, M., Bellgardt, A.,  Hilleringmann, U. (2004). Sensor Networks with More Features Using Less Hardware. In GOR/NGB Conference Tilburg 2004. Tilburg, Netherlands.

Bonorden, O., Juurlink, B., von Otte, I., &; Rieping, I. (2003). The Paderborn University BSP (PUB) library. Parallel Computing, 187–207.https://doi.org/10.1016/s0167-8191(02)00218-1 

Salzwedel, K. A. (2003). Algorithmic Approaches for Storage Networks. Algorithms for Memory Hierarchies, 2625.https://doi.org/10.1007/3-540-36574-5_12 

Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek, M., &; Rückert, U. (2003). Storage Management as Means to cope with Exponential Information Growth. In Proceedings of SSGRR 2003.

Rührup, S., Schindelhauer, C., Volbert, K., &; Grünewald, M. (2003). Performance of distributed algorithms for topology control in wireless networks. Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS).https://doi.org/10.1109/ipdps.2003.1213107 

Mahlmann, P. (2003). Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web.

Volbert, K., Grünewald, M., Schindelhauer, C., &; Rückert, U. (2003). Directed power-variable infrared communication for the mini robot Khepera. In Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment (pp. 113–122).

Klein, J., &; Zachmann, G. (2003). ADB-Trees: Controlling the Error of Time-Critical Collision Detection. In Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (VMV 2003) (pp. 37–45).

Klein, J., &;https://doi.org/10.1145/1008653.1008660__Zachmann, G. (2003). Time-Critical Collision Detection Using an Average-Case Approach. In https://doi.org/10.1145/1008653.1008660__Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003) (pp. 22–31).https://doi.org/10.1145/1008653.1008660 

Fomin, F. V., &; Thilikos, D. M. (2003). Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003).https://doi.org/10.1137/s0097539702419649 

Terbahl, M., &; Krokowski, J. (2003). Verteiltes Rendern durch dynamische Bildaufteilung. Proceedings of 5. GI-Informatiktage 2003.

Ziegler, M. (2003). Stability versus Speed in a Computable Algebraic Model. Proc. 5th Conference on Real Numbers and Computers (RN), INRIA, 47–64.

Ziegler, M. (2003). Computable Operators on Regular Sets. Computability and Complexity in Analysis, 302-8/2003, 389–406.

Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &; Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer.https://doi.org/10.1007/978-3-540-39658-1_17 

Awerbuch, B., Brinkmann, A., &; Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.

Mueck, B., Dangelmaier, W., &; Fischer, M. (2003). Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In 15th European Simulation Symposium (ESS 2003) (pp. 367–371). SCS - Europe.

Magen, A., Ergun, F., Sohler, C., Rubinfeld, R., Czumaj, A., Newman, I., &; Fortnow, L. (2003). Sublinear Approximation of Euclidean Minimum Spanning Tree. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) (pp. 813–822).

Bienkowski, M., Korzeniowski, M., &; Räcke, H. (2003). A practical algorithm for constructing oblivious routing schemes. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03.https://doi.org/10.1145/777412.777418 

Rust, C., Stappert, F., &; Lukovszki, T. (2003). A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In 7th World Multiconference on Systemics, Cybernetics and Informatics.

Schindelhauer, C., Lukovszki, T., Rührup, S., &; Volbert, K. (2003). Worst case mobility in ad hoc networks. In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPA).https://doi.org/10.1145/777412.777448 

Azar, Y., Cohen, E., Fiat, A., Kaplan, H., &; Racke, H. (2003). Optimal oblivious routing in polynomial time. In Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03.https://doi.org/10.1145/780542.780599 

Gehweiler, J. (2003). Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. Universität Paderborn.

Hamann, H. (2003). Definition and Behavior of Langton’s Ant in Three Dimensions. Complex Systems, 14(3), 263--268.

Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03) (pp. 705–715).https://doi.org/10.1007/978-3-540-24587-2_72 

Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F. Dehne, J. Sack, M. Smid, &; Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science (Vol. 2748). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-540-45078-8_13 

Fischer, M., Grafe, M., Matysczok, C., Mueck, B., &; Schoo, M. (2003). Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management (Vol. 5, pp. 170–177). Karlsruhe: Shaker Verlag.

Dangelmaier, W.,  Franke, W., Mueck, B., &; Fischer, M. (2003). Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In 2. Paderborner Workshop Augmented &; Virtual Reality in der Produktentstehung (Vol. 123, pp. 141–151).

Fischer, M., Grafe, M., Matysczok, C., Schoo, M., &; Mueck, B. (2003). Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. 2. Paderborner Workshop Augmented &; Virtual Reality in Der Produktentstehung, 123, 153–166.

Adler, M., Vöcking, B., Sohler, C., Räcke, H., &; Sivadasan, N. (2003). Randomized Pursuit-Evasion in Graphs. Combinatorics, Probability &; Computing, 225–244.

Sohler, C. (2003). Property Testing and Geometry (Vol. 119). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.

Meyer auf der Heide, F. (2003). Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). It - Information Technology.https://doi.org/10.1524/itit.45.2.108.19606