Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

735 Publications


2004 | Conference Paper | LibreCat-ID: 18364
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.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 19800
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
LibreCat | DOI
 

2004 | Journal Article | LibreCat-ID: 19879
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
LibreCat | DOI
 

2004 | Journal Article | LibreCat-ID: 16477
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
LibreCat | DOI
 

2004 | Journal Article | LibreCat-ID: 18447
Oesterdiekhoff, B. (2004). Transcoding von Webinhalten. Informatik Spektrum, 27(5), 448–452.
LibreCat
 

2004 | Dissertation | LibreCat-ID: 19616
Salzwedel, K. (2004). Data Distribution Algorithms for Storage Networks.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 19692
Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O., … 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
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 19851
Bleckmann, P., Schomaker, G., & Slowik, A. (2004). Virtualization with prefetching abilities based on iSCSI. In Proceeding of International Workshop on Storage Network Architecture and Parallel I/O (pp. 40–47). https://doi.org/10.1145/1162628.1162634
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 18258
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
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 18791
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).
LibreCat
 

2003 | Conference Paper | LibreCat-ID: 18260
Ziegler, M. (2003). Computable operators on regular sets. In Computability and Complexity in Analysis (pp. 389–406). https://doi.org/10.1002/malq.200310107
LibreCat | DOI
 

2003 | Dissertation | LibreCat-ID: 18967
Räcke, H. (2003). Data Management and Routing in General Networks. Universität Paderborn.
LibreCat | Files available
 

2003 | Conference Paper | LibreCat-ID: 19833
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).
LibreCat
 

2003 | Journal Article | LibreCat-ID: 16481
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
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 18196
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
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 18367
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.
LibreCat | Files available
 

2003 | Conference Paper | LibreCat-ID: 18374
Fischer, M., Grafe, M., Matysczok, C., Schoo, M., & Mueck, B. (2003). Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. In 2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung (Vol. 123, pp. 153–166).
LibreCat | Files available
 

2003 | Mastersthesis | LibreCat-ID: 18982
Gehweiler, J. (2003). Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. Universität Paderborn.
LibreCat | Files available
 

2003 | Journal Article | LibreCat-ID: 19726
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
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 19790
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.
LibreCat | Files available
 

2003 | Journal Article | LibreCat-ID: 16482
Juurlink, B., Kolman, P., Meyer auf der Heide, F., & Rieping, I. (2003). Optimal broadcast on parallel locality models. Journal of Discrete Algorithms, 151–166. https://doi.org/10.1016/s1570-8667(03)00023-6
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 17423
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.
LibreCat
 

2003 | Conference Paper | LibreCat-ID: 18907
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
LibreCat | DOI
 

2003 | Mastersthesis | LibreCat-ID: 19828
Mahlmann, P. (2003). Implementierung und Vergleich von Verfahren zum Information Retrieval im World Wide Web.
LibreCat
 

2003 | Conference Paper | LibreCat-ID: 19900
Klein, J., & Zachmann, G. (2003). Time-Critical Collision Detection Using an Average-Case Approach. In Proc. ACM Symposium on Virtual Reality Software and Technology (VRST 2003) (pp. 22–31). https://doi.org/10.1145/1008653.1008660
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 2128
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
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 18960
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 (SPAA03). https://doi.org/10.1145/777412.777448
LibreCat | DOI
 

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

2003 | Conference Paper | LibreCat-ID: 19874
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).
LibreCat
 

2003 | Conference Paper | LibreCat-ID: 2129
Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.
LibreCat | Files available
 

2003 | Conference (Editor) | LibreCat-ID: 16484
Rosenberg, A. L., & Meyer auf der Heide, F. (Eds.). (2003). Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03. https://doi.org/10.1145/777412
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 16720
Bonorden, O., Bruls, N., Kastens, U., Le, D. K., Meyer auf der Heide, F., Niemann, J.-C., … Thies, M. (2003). A holistic methodology for network processor design. In 28th Annual IEEE International Conference on Local Computer Networks. https://doi.org/10.1109/LCN.2003.1243185
LibreCat | DOI
 

2003 | Conference Paper | LibreCat-ID: 18372
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).
LibreCat | Files available
 

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

2003 | Conference Paper | LibreCat-ID: 18947
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.
LibreCat
 

2003 | Conference Paper | LibreCat-ID: 18966
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
LibreCat | DOI
 

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

2003 | Conference Paper | LibreCat-ID: 19952
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
LibreCat | DOI
 

2003 | Journal Article | LibreCat-ID: 20435
Hamann, H. (2003). Definition and Behavior of Langton’s Ant in Three Dimensions. Complex Systems, 14(3), 263--268.
LibreCat
 

2002 | Journal Article | LibreCat-ID: 18176
Ziegler, M. (2002). Computability on Regular Subsets of Euclidean Space. Mathematical Logic Quarterly (MLQ), 48(S1), 157–181. https://doi.org/10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4
LibreCat | DOI
 

2002 | Dissertation | LibreCat-ID: 18169
Ziegler, M. (2002). Zur Berechenbarkeit reeller geometrischer Probleme. Universität Paderborn.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 18177
Ziegler, M., Damerow, V., & Finschi, L. (2002). Point Location Algorithms of Minimum Size. In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02).
LibreCat
 

2002 | Book Chapter | LibreCat-ID: 16723
Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., & Spirakis, P. (2002). Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_133
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 19727
Bonorden, O., Meyer auf der Heide, F., & Wanka, R. (2002). 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) (pp. 2202–2208).
LibreCat
 

2002 | Conference Paper | LibreCat-ID: 19873
Klein, J., Krokowski, J., & Cuntz, N. (2002). Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression. In Proc. of 4. GI-Informatiktage (pp. 224–229).
LibreCat
 

2002 | Conference Paper | LibreCat-ID: 18179
Brattka, V., & Ziegler, M. (2002). Computability of Linear Equations. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (pp. 95–106). Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_9
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 16490
Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf der Heide, F. (2002). 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. https://doi.org/10.1145/585740.585764
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 18369
Mueck, B., Dangelmaier, W., Fischer, M., & Klemisch, W. (2002). Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In Simulation und Visualisierung (pp. 71–84). Ghent, BE: SCS European Publishing House.
LibreCat
 

2002 | Conference Paper | LibreCat-ID: 18566
Adler, M., Räcke, H., Sivadasan, N., Sohler, C., & Vöcking, B. (2002). Randomized Pursuit-Evasion in Graphs. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_77
LibreCat | DOI
 

2002 | Dissertation | LibreCat-ID: 18573
Sohler, C. (2002). Property Testing and Geometry. Universität Paderborn.
LibreCat | Files available
 

2002 | Conference Paper | LibreCat-ID: 19850
Wanka, R. (2002). 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) (pp. 413–420). Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_36
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 2136
Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).
LibreCat | Files available
 

2002 | Journal Article | LibreCat-ID: 16489
Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann, M. (2002). Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory of Computing Systems, 217–245. https://doi.org/10.1007/s00224-001-1045-z
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 16491
Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., & Grünewald, M. (2002). Energy, congestion and dilation in radio networks. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02. https://doi.org/10.1145/564870.564910
LibreCat | DOI
 

2002 | Journal Article | LibreCat-ID: 18853
Sohler, C., & Czumaj, A. (2002). Abstract Combinatorial Programs and Efficient Property Testers. Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), 83–92.
LibreCat
 

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

2001 | Conference Paper | LibreCat-ID: 18152
Ziegler, M., & Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000) (Vol. 2064, pp. 378–388). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_23
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 16492
Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., & Straßer, W. (2001). The randomized z-buffer algorithm. In Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01. https://doi.org/10.1145/383259.383299
LibreCat | DOI
 

2001 | Book (Editor) | LibreCat-ID: 16722
Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer . https://doi.org/10.1007/3-540-44676-1
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic Concepts in Computer Science (Vol. 2204). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_2
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 2141
Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.
LibreCat | Files available
 

2001 | Journal Article | LibreCat-ID: 2139
Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide, F., & Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In Computational Science - ICCS 2001. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_68
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 18166
Ziegler, M., & Emamy-Khansari, M. R. (2001). New Bounds for Hypercube Slicing Numbers. In Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001) (Vol. AA, pp. 155–164).
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18370
Klein, J., & Fischer, M. (2001). Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In Proc. of 3. GI-Informatiktage 2001 (pp. 275–278). Bad Schussenried.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 18750
Sohler, C., & Czumaj, A. (2001). Soft Kinetic Data Structures. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (pp. 865–872).
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18964
Lukovszki, T., Maheshwari, A., & Zeh, N. (2001). 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. https://doi.org/10.1007/3-540-45294-x_21
LibreCat | DOI
 

2001 | Journal Article | LibreCat-ID: 18749
Czumaj, A., & Sohler, C. (2001). Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 493–505. https://doi.org/10.1007/3-540-48224-5_41
LibreCat | DOI
 

2001 | Journal Article | LibreCat-ID: 18857
Sohler, C., & Czumaj, A. (2001). Property Testing with Geometric Queries. Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01), 266–277. https://doi.org/10.1007/3-540-44676-1_22
LibreCat | DOI
 

2001 | Dissertation | LibreCat-ID: 19622
Schröder, K. (2001). Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Universität Paderborn.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 19797
Salzwedel, K., Hartmann, G., Wolff, C., & Preis, R. (2001). Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In Proceedings of the PDPTA 2001 (Vol. 1, pp. 463–470).
LibreCat
 

2001 | Conference Paper | LibreCat-ID: 18168
Brattka, V., & Ziegler, M. (2001). Turing Computability of (Non-)Linear Optimization. In Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01) (pp. 181–184).
LibreCat
 

2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide, F., Kutyłowski, M., & Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-x_59
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 17010
Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing, 1703–1739. https://doi.org/10.1137/s009753979529564x
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 17990
Czumaj, A., Sohler, C., & Ziegler, M. (2000). Property Testing in Computational Geometry. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00) (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-45253-2_15
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18962
Govindarajan, S., Lukovszki, T., Maheshwari, A., & Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS (pp. 585–614). https://doi.org/10.1007/s00453-005-1197-3
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 2145
Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18146
Ziegler, M., & Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In SOFSEM 2000: Theory and Practice of Informatics (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-44411-4_34
LibreCat | DOI
 

2000 | Dissertation | LibreCat-ID: 19620
Rieping, I. (2000). Communication in Parallel Systems-Models, Algorithms and Implementations. Universität Paderborn.
LibreCat
 

2000 | Report | LibreCat-ID: 19733
Bonorden, O., Rieping, I., von Otte, I., & Juurlink, B. (2000). PUB-Library, Release 7.0, User Guide and Function Reference.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2146
Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2211
Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47).
LibreCat | Files available
 

2000 | Report | LibreCat-ID: 17865
Wand, M., Fischer, M., & Meyer auf der Heide, F. (2000). Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn.
LibreCat | Files available
 

2000 | Dissertation | LibreCat-ID: 19621
Westermann, M. (2000). Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Universität Paderborn.
LibreCat | Files available
 

2000 | Habilitation | LibreCat-ID: 19784
Scheideler, C. (2000). Probabilistic Methods for Coordination Problems.
LibreCat
 

2000 | Conference Paper | LibreCat-ID: 2147
Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 16495
Meyer auf der Heide, F., Räcke, H., & Westermann, M. (2000). Data management in hierarchical bus networks. In Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’00. https://doi.org/10.1145/341800.341814
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18150
Ziegler, M., & Sohler, C. (2000). Computing Cut Numbers. In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00) (pp. 73–79).
LibreCat
 

2000 | Journal Article | LibreCat-ID: 18446
Lorys, K., Wanka, R., Oesterdiekhoff, B., & Kutylowski, M. (2000). Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM, 45, 944–967.
LibreCat
 

2000 | Journal Article | LibreCat-ID: 2143
Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 2150
Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.
LibreCat | Files available
 

2000 | Journal Article | LibreCat-ID: 2148
Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.
LibreCat
 

2000 | Journal Article | LibreCat-ID: 16345
Meyer auf der Heide, F., & Wanka, R. (2000). Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. ForschungsForum Paderborn, 112–116.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 16496
Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (2000). Caching in networks. In SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 430–439).
LibreCat
 

2000 | Conference Paper | LibreCat-ID: 19849
Bednara, M., Beyer, O., Teich, J., & Wanka, R. (2000). Tradeoff analysis and architecture design of a hybrid hardware/software sorter. In Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP) (pp. 299–308). https://doi.org/10.1109/asap.2000.862400
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 2149
Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).
LibreCat | Files available
 

1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_9
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 19732
Bonorden, O., Juurlink, B., Von Otte, I., & Rieping, I. (1999). The Paderborn university BSP (PUB) library-design, implementation and performance. In Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing (pp. 99–104). https://doi.org/10.1109/ipps.1999.760442
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 2210
Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).
LibreCat | Files available
 

1999 | Conference Paper | LibreCat-ID: 2164
Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).
LibreCat | Files available
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed