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
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 | Files available
 

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

2004 | Journal Article | LibreCat-ID: 19879
J. Klein and G. Zachmann, “Point Cloud Surfaces using Geometric Proximity Graphs,” Computers and Graphics, vol. 28, no. 6, pp. 839–850, 2004.
LibreCat | DOI
 

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

2004 | Journal Article | LibreCat-ID: 18447
B. Oesterdiekhoff, “Transcoding von Webinhalten,” Informatik Spektrum, vol. 27, no. 5, pp. 448–452, 2004.
LibreCat
 

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

2004 | Conference Paper | LibreCat-ID: 19692
P. Briest et al., “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes,” in Parallel Problem Solving from Nature - PPSN VIII, 2004.
LibreCat | DOI
 

2004 | Conference Paper | LibreCat-ID: 19851
P. Bleckmann, G. Schomaker, and A. Slowik, “Virtualization with prefetching abilities based on iSCSI,” in Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 2004, no. 2, pp. 40–47.
LibreCat | DOI
 

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

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

2003 | Conference Paper | LibreCat-ID: 18260
M. Ziegler, “Computable operators on regular sets,” in Computability and Complexity in Analysis, 2003, no. 302–8/2003, pp. 389–406.
LibreCat | DOI
 

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

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

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

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

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

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

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

2003 | Journal Article | LibreCat-ID: 19726
O. Bonorden, B. Juurlink, I. von Otte, and I. Rieping, “The Paderborn University BSP (PUB) library,” Parallel Computing, pp. 187–207, 2003.
LibreCat | DOI
 

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

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

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

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

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

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

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

2003 | Conference Paper | LibreCat-ID: 18960
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 (SPAA03), 2003.
LibreCat | DOI
 

2003 | Journal Article | LibreCat-ID: 19785
K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” Algorithms for Memory Hierarchies, vol. 2625, 2003.
LibreCat | DOI
 

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

2003 | Conference Paper | LibreCat-ID: 2129
B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.
LibreCat | Files available
 

2003 | Conference (Editor) | LibreCat-ID: 16484
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 | DOI
 

2003 | Conference Paper | LibreCat-ID: 16720
O. Bonorden et al., “A holistic methodology for network processor design,” in 28th Annual IEEE International Conference on Local Computer Networks, 2003.
LibreCat | DOI
 

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

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

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

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

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

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

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

2002 | Journal Article | LibreCat-ID: 18176
M. Ziegler, “Computability on Regular Subsets of Euclidean Space,” Mathematical Logic Quarterly (MLQ), vol. 48, no. S1, pp. 157–181, 2002.
LibreCat | DOI
 

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

2002 | Conference Paper | LibreCat-ID: 18177
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
 

2002 | Book Chapter | LibreCat-ID: 16723
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 | DOI
 

2002 | Conference Paper | LibreCat-ID: 19727
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
 

2002 | Conference Paper | LibreCat-ID: 19873
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
 

2002 | Conference Paper | LibreCat-ID: 18179
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 | DOI
 

2002 | Conference Paper | LibreCat-ID: 16490
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 | DOI
 

2002 | Conference Paper | LibreCat-ID: 18369
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
 

2002 | Conference Paper | LibreCat-ID: 18566
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 | DOI
 

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

2002 | Conference Paper | LibreCat-ID: 19850
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 | DOI
 

2002 | Conference Paper | LibreCat-ID: 2136
A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.
LibreCat | Files available
 

2002 | Journal Article | LibreCat-ID: 16489
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,” Theory of Computing Systems, pp. 217–245, 2002.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 16491
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 | DOI
 

2002 | Journal Article | LibreCat-ID: 18853
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
 

2002 | Report | LibreCat-ID: 18961
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
 

2001 | Conference Paper | LibreCat-ID: 18152
M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2001, vol. 2064, pp. 378–388.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 16492
M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The randomized z-buffer algorithm,” in Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01, 2001.
LibreCat | DOI
 

2001 | Book (Editor) | LibreCat-ID: 16722
F. Meyer auf der Heide, Ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.
LibreCat | DOI
 

2001 | Book Chapter | LibreCat-ID: 16493
F. Meyer auf der Heide, “Data Management in Networks,” in Graph-Theoretic Concepts in Computer Science, vol. 2204, Berlin, Heidelberg, 2001.
LibreCat | DOI
 

2001 | Conference Paper | LibreCat-ID: 2141
P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234.
LibreCat | Files available
 

2001 | Journal Article | LibreCat-ID: 2139
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 | DOI
 

2001 | Book Chapter | LibreCat-ID: 16494
F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.
LibreCat | DOI
 

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

2001 | Conference Paper | LibreCat-ID: 18370
J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph,” in Proc. of 3. GI-Informatiktage 2001, 2001, pp. 275–278.
LibreCat | Files available
 

2001 | Conference Paper | LibreCat-ID: 18750
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
 

2001 | Conference Paper | LibreCat-ID: 18964
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 | DOI
 

2001 | Journal Article | LibreCat-ID: 18749
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 | DOI
 

2001 | Journal Article | LibreCat-ID: 18857
C. Sohler and A. Czumaj, “Property Testing with Geometric Queries,” Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01), pp. 266–277, 2001.
LibreCat | DOI
 

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

2001 | Conference Paper | LibreCat-ID: 19797
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
 

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

2000 | Book Chapter | LibreCat-ID: 16497
F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and Algorithms,” in Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 17010
A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution in Hashing Based Shared Memory Simulations,” SIAM Journal on Computing, pp. 1703–1739, 2000.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 17990
A. Czumaj, C. Sohler, and M. Ziegler, “Property Testing in Computational Geometry,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 2000, vol. 4698, pp. 155–166.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18962
S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated Pair Decomposition and Applications,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.
LibreCat | DOI
 

2000 | Journal Article | LibreCat-ID: 2145
C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol. 30, no. 4, pp. 1126--1155, 2000.
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 18146
M. Ziegler and V. Brattka, “Computing the Dimension of Linear Subspaces,” in SOFSEM 2000: Theory and Practice of Informatics, 2000, vol. 1963, pp. 450–458.
LibreCat | DOI
 

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

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

2000 | Conference Paper | LibreCat-ID: 2146
P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2211
A. Czumaj and C. Scheideler, “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, 2000, pp. 38–47.
LibreCat | Files available
 

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

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

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

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

2000 | Conference Paper | LibreCat-ID: 16495
F. Meyer auf der Heide, H. Räcke, and M. Westermann, “Data management in hierarchical bus networks,” in Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’00, 2000.
LibreCat | DOI
 

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

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

2000 | Journal Article | LibreCat-ID: 2143
M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000.
LibreCat | DOI
 

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

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

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

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

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

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

1999 | Book Chapter | LibreCat-ID: 17053
F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Provably Good and Practical Strategies for Non-uniform Data Management in Networks,” in Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 19732
O. Bonorden, B. Juurlink, I. Von Otte, and I. Rieping, “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, 1999, pp. 99–104.
LibreCat | DOI
 

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

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

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed