W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, and C.  Laroque, “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, 2005, pp. 267–270.
LibreCat: /record/18366

C. Loeser, I. Drüke, and B. Oesterdiekhoff, “Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario,” in IEEE International Conference on Industrial Informatics (INDIN), 2005.
LibreCat: /record/18449

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

M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Dynamic Load Balancing in Distributed Hash Tables,” in Peer-to-Peer Systems IV, Berlin, Heidelberg, 2005.
LibreCat: /record/16468
DOI: 10.1007/11558989_20

M. Bienkowski and F. Meyer auf der Heide, “Page Migration in Dynamic Networks,” in Mathematical Foundations of Computer Science 2005, Berlin, Heidelberg, 2005.
LibreCat: /record/16469
DOI: 10.1007/11549345_1

O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “A Web Computing Environment for Parallel Algorithms in Java,” in Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 801–808.
LibreCat: /record/16470
DOI: 10.1007/11752578_96

O. Bonorden, J. Gehweiler, and F. Meyer auf der Heide, “Load Balancing Strategies in a Web Computing Environment,” in Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2005, pp. 839–846.
LibreCat: /record/16471
DOI: 10.1007/11752578_101

M. Bienkowski, V. Damerow, F. Meyer auf der Heide, and C. Sohler, “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, 2005.
LibreCat: /record/17112

S. Leonardi, F. Meyer auf der Heide, and D. Wagner, Eds., Abstracts Collection -- Algorithmic Aspects of Large and Complex Networks, vol. 05361. 2005.
LibreCat: /record/17113

M. Ziegler, “Stability versus speed in a computable algebraic model,” Theoretical Computer Science, pp. 14–26, 2005.
LibreCat: /record/15058
DOI: 10.1016/j.tcs.2005.09.053

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

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

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

A. Brinkmann, K. Salzwedel, and M. Vodisek, “A case for virtualized arrays of RAID,” in Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI ’04, 2004, pp. 9–16.
LibreCat: /record/19800
DOI: 10.1145/1162628.1162630

C. Schindelhauer, S. Böttcher, and F. Rammig, “The design of PaMaNet the Paderborn mobile ad-hoc network,” in Proceedings of the second international workshop on Mobility management &; wireless access protocols, 2004.
LibreCat: /record/19807
DOI: 10.1145/1023783.1023807

P. Bleckmann, G. Schomaker, and A. Slowik, “Virtualization with prefetching abilities based on iSCSI,”10.1145/1162628.1162634__in Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 2004, no. 2, pp. 40–47, doi:10.1145/1162628.1162634 .
LibreCat: /record/19851
DOI: 10.1145/1162628.1162634

J. Klein and G. Zachmann, “Point Cloud Surfaces using Geometric Proximity Graphs,” Computers and Graphics, vol. 28, no. 6, pp. 839–850, 2004.
LibreCat: /record/19879
DOI: 10.1016/j.cag.2004.08.012

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

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

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

K. Volbert, “Experimental analysis of adjustable sectorized topologies for static ad hoc networks,”10.1145/1022630.1022646__2004, doi:10.1145/1022630.1022646 .
LibreCat: /record/26411
DOI: 10.1145/1022630.1022646

S. Rührup and C. Schindelhauer, Traffic and Hop Efficient Position-based Routing using a Cell Structure. Heinz Nixdorf Institut, Universität Paderborn, 2004.
LibreCat: /record/26992

A. Brinkmann, M. Heidebuer, F. Meyer auf der Heide, U. Rückert, K. Salzwedel, and M. Vodisek, “V:Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System,” in 21st IEEE Conference on Mass Storage Systems and Technologies / 12th NASA Goddard Conference on Mass Storage Systems and Technologies, Greenbelt, Maryland, USA, 2004, pp. 153--157.
LibreCat: /record/17346

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

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

C. Sohler, J. Krokowski, H. Räcke, and M. Westermann, “Reducing State Changes with a Pipeline Buffer,” in Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004), 2004.
LibreCat: /record/18785

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

M. Ziegler and V. Brattka, “Computability in linear algebra,” Theoretical Computer Science, vol. 326, no. 1–3, pp. 187–211, 2004.
LibreCat: /record/17986
DOI: https://doi.org/10.1016/j.tcs.2004.06.022

M. Ziegler, “Computable operators on regular sets,”10.1002/malq.200310107__in Computability and Complexity in Analysis, 2004, vol. 50, no. 4–5, pp. 392–404, doi:10.1002/malq.200310107 .
LibreCat: /record/18260
DOI: 10.1002/malq.200310107

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

C. Schindelhauer, K. Volbert, and M. Ziegler, “Spanners, Weak Spanners, and Power Spanners for Wireless Networks,” in Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), 2004, vol. 3341, pp. 805–821.
LibreCat: /record/18279
DOI: 10.1007/978-3-540-30551-4_69

B. Mueck, W. Dangelmaier, C. Laroque, M. Fischer, and M. Kortenjan, “Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations,” in Simulation and Visualisation 2004, 2004, pp. 73–83.
LibreCat: /record/18364

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

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

V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in 12th Annual European Symposium on Algorithms (ESA 2004), 2004, vol. 3221.
LibreCat: /record/16474
DOI: 10.1007/978-3-540-30140-0_9

M. Bienkowski, M. Korzeniowski, and F. Meyer auf der Heide, “Fighting against two adversaries,” in Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’04, 2004.
LibreCat: /record/16475
DOI: 10.1145/1007912.1007923

F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Congestion, Dilation, and Energy in Radio Networks,” Theory of Computing Systems, pp. 343–370, 2004.
LibreCat: /record/16477
DOI: 10.1007/s00224-004-1124-z

S. Leonardi, A. Marchetti-Spaccamela, and F. Meyer auf der Heide, “Scheduling against an adversarial network,” in SPAA ’04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004.
LibreCat: /record/16480
DOI: 10.1145/1007912.1007936

J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der Heide, “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments,” Presence: Teleoperators and Virtual Environments, pp. 617–637, 2004.
LibreCat: /record/16399
DOI: 10.1162/1054746043280619

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

O. Bonorden, B. Juurlink, I. von Otte, and I. Rieping, “The Paderborn University BSP (PUB) library,” Parallel Computing, pp. 187–207, 2003.
LibreCat: /record/19726
DOI: 10.1016/s0167-8191(02)00218-1

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

C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in Proceedings of SSGRR 2003, 2003.
LibreCat: /record/19790

S. Rührup, C. Schindelhauer, K. Volbert, and M. Grünewald, “Performance of distributed algorithms for topology control in wireless networks,”10.1109/ipdps.2003.1213107__2003, doi:10.1109/ipdps.2003.1213107 .
LibreCat: /record/19806
DOI: 10.1109/ipdps.2003.1213107

P. Mahlmann, Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web. 2003.
LibreCat: /record/19828

K. Volbert, M. Grünewald, C. Schindelhauer, and U. Rückert, “Directed power-variable infrared communication for the mini robot Khepera,” in Proceedings of the 2nd International Conference on Autonomous Minirobots for Research and Edutainment, 2003, pp. 113–122.
LibreCat: /record/19833

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

J. Klein and G.  Zachmann, “Time-Critical Collision Detection Using an Average-Case Approach,” in  Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003), 2003, pp. 22–31.
LibreCat: /record/19900
DOI: 10.1145/1008653.1008660

F. V. Fomin and D. M. Thilikos, “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.
LibreCat: /record/19952
DOI: 10.1137/s0097539702419649

M. Terbahl and J. Krokowski, “Verteiltes Rendern durch dynamische Bildaufteilung,” 2003.
LibreCat: /record/24273

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

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

V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.
LibreCat: /record/2128
DOI: 10.1007/978-3-540-39658-1_17

B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.
LibreCat: /record/2129

B. Mueck, W. Dangelmaier, and M. Fischer, “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment,” in 15th European Simulation Symposium (ESS 2003), 2003, pp. 367–371.
LibreCat: /record/17423

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

M. Bienkowski, M. Korzeniowski, and H. Räcke, “A practical algorithm for constructing oblivious routing schemes,” in Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03, 2003.
LibreCat: /record/18907
DOI: 10.1145/777412.777418

C. Rust, F. Stappert, and T. Lukovszki, “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture,” in 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.
LibreCat: /record/18947

C. Schindelhauer, T. Lukovszki, S. Rührup, and K. Volbert, “Worst case mobility in ad hoc networks,” in Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPA), 2003.
LibreCat: /record/18960
DOI: 10.1145/777412.777448

Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke, “Optimal oblivious routing in polynomial time,” in Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03, 2003.
LibreCat: /record/18966
DOI: 10.1145/780542.780599

J. Gehweiler, Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. Universität Paderborn, 2003.
LibreCat: /record/18982

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

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

M. Ziegler, “Fast Relative Approximation of Potential Fields,” in Lecture Notes in Computer Science, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.
LibreCat: /record/18258
DOI: 10.1007/978-3-540-45078-8_13

M. Fischer, M. Grafe, C. Matysczok, B. Mueck, and M. Schoo, “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, 2003, vol. 5, pp. 170–177.
LibreCat: /record/18367

W. Dangelmaier, W.  Franke, B. Mueck, and M. Fischer, “Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen,” in 2. Paderborner Workshop Augmented &; Virtual Reality in der Produktentstehung, 2003, vol. 123, pp. 141–151.
LibreCat: /record/18372

M. Fischer, M. Grafe, C. Matysczok, M. Schoo, and B. Mueck, “Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation,” in 2. Paderborner Workshop Augmented &; Virtual Reality in der Produktentstehung, 2003, vol. 123, pp. 153–166.
LibreCat: /record/18374

M. Adler, B. Vöcking, C. Sohler, H. Räcke, and N. Sivadasan, “Randomized Pursuit-Evasion in Graphs,” Combinatorics, Probability &; Computing, pp. 225–244, 2003.
LibreCat: /record/18567

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

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

B. Juurlink, P. Kolman, F. Meyer auf der Heide, and I. Rieping, “Optimal broadcast on parallel locality models,” Journal of Discrete Algorithms, pp. 151–166, 2003.
LibreCat: /record/16482
DOI: 10.1016/s1570-8667(03)00023-6

A. L. Rosenberg and F. Meyer auf der Heide, Eds., Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03. 2003.
LibreCat: /record/16484
DOI: 10.1145/777412

O. Bonorden et al., “A holistic methodology for network processor design,” in 28th Annual IEEE International Conference on Local Computer Networks, 2003.
LibreCat: /record/16720
DOI: 10.1109/LCN.2003.1243185

O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “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), 2002, pp. 2202–2208.
LibreCat: /record/19727

R. Wanka, “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), 2002, pp. 413–420.
LibreCat: /record/19850
DOI: 10.1007/3-540-36379-3_36

J. Klein, J. Krokowski, and N. Cuntz, “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression,” in Proc. of 4. GI-Informatiktage, 2002, pp. 224–229.
LibreCat: /record/19873

A.  Benczúr, U. Glässer, and T. Lukovszki, “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

M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed Maintenance of Resource Efficient Wireless Network Topologies,”10.1007/3-540-45706-2_134__2002, doi:10.1007/3-540-45706-2_134 .
LibreCat: /record/24338
DOI: 10.1007/3-540-45706-2_134

K. Volbert, “A simulation environment for ad hoc networks using sector subdivision,”10.1109/empdp.2002.994324__2002, doi:10.1109/empdp.2002.994324 .
LibreCat: /record/26412
DOI: 10.1109/empdp.2002.994324

A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.
LibreCat: /record/2136

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

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

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

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

M. Ziegler, V. Damerow, and L. Finschi, “Point Location Algorithms of Minimum Size,” in Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.
LibreCat: /record/18177

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

B. Mueck, W. Dangelmaier, M. Fischer, and W. Klemisch, “Bi-directional Coupling of Simulation Tools with a Walkthrough-System,” in Simulation und Visualisierung, 2002, pp. 71–84.
LibreCat: /record/18369

M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion in Graphs,” in Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002.
LibreCat: /record/18566
DOI: 10.1007/3-540-45465-9_77

C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann, “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy,”10.1007/s00224-001-1045-z__Theory of Computing Systems, pp. 217–245, 2002, doi:10.1007/s00224-001-1045-z .
LibreCat: /record/16489
DOI: 10.1007/s00224-001-1045-z

J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der Heide, “The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments,” in Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02, 2002.
LibreCat: /record/16490
DOI: 10.1145/585740.585764

F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Energy, congestion and dilation in radio networks,” in Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02, 2002.
LibreCat: /record/16491
DOI: 10.1145/564870.564910

F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile Computing, Mobile Networks,” in Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.
LibreCat: /record/16723
DOI: 10.1007/3-540-45706-2_133

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

K. Salzwedel, G. Hartmann, C. Wolff, and R. Preis, “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN),” in Proceedings of the PDPTA 2001, 2001, vol. 1, pp. 463–470.
LibreCat: /record/19797

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

P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234.
LibreCat: /record/2141

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

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

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

T. Lukovszki, A. Maheshwari, and N. Zeh, “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.
LibreCat: /record/18964
DOI: 10.1007/3-540-45294-x_21