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.

792 Publications


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
 

2002 | Dissertation | LibreCat-ID: 18169
Ziegler, M. (2002). Zur Berechenbarkeit reeller geometrischer Probleme (Vol. 115). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat | Files available
 

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 | 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 | 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: 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 | 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: 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: 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 | 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
 

2001 | Dissertation | LibreCat-ID: 19622
Schröder, K. (2001). Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing (Vol. 89). Verlagsschriftenreihe des Heinz Nixdorf Instituts, 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 | 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 | Conference Paper | LibreCat-ID: 2141 | OA
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: 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 | 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 | 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 | 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: 23731
Bonorden, O., von zur Gathen, J., Gerhard, J., & Müller, O. (2001). Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin, 16–18. https://doi.org/10.1145/504331.504333
LibreCat | DOI
 

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: 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: 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
 

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: 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 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 | 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 | 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
 

2000 | Dissertation | LibreCat-ID: 19620
Rieping, I. (2000). Communication in Parallel Systems-Models, Algorithms and Implementations (Vol. 81). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat
 

2000 | Dissertation | LibreCat-ID: 19621
Westermann, M. (2000). Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints (Vol. 90). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat | Files available
 

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 | Habilitation | LibreCat-ID: 19784
Scheideler, C. (2000). Probabilistic Methods for Coordination Problems.
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. Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 299–308. https://doi.org/10.1109/asap.2000.862400
LibreCat | DOI
 

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 | 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: 2146 | OA
Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.
LibreCat | Files available
 

2000 | Conference Paper | LibreCat-ID: 2147 | OA
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 | 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 | Conference Paper | LibreCat-ID: 2149 | OA
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
 

2000 | Conference Paper | LibreCat-ID: 2150 | OA
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 | 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 | 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 | 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: 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 | 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. https://doi.org/10.1145/355483.355490
LibreCat | DOI
 

2000 | Conference Paper | LibreCat-ID: 2211 | OA
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 | Conference Paper | LibreCat-ID: 16495
Meyer auf der Heide, F., Räcke, H., & Westermann, M. (2000). Data management in hierarchical bus networks. 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: 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
 

Filters and Search Terms

department=63

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed