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.
265 Publications
2003 | Conference Paper | LibreCat-ID: 15078
Böttcher S, Steinmetz R. A DTD Graph Based XPath Query Subsumption Test. In: Database and XML Technologies, First International XML Database Symposium, XSym 2003. Berlin, Heidelberg; 2003:85-99. doi:10.1007/978-3-540-39429-7_6
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 13615
Steiger C, Walder H, Platzner M. Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices. In: Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL). Berlin, Heidelberg: Springer; 2003:575-584. doi:10.1007/978-3-540-45234-8_56
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 19850
Wanka R. 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). Berlin, Heidelberg; 2002:413-420. doi:10.1007/3-540-36379-3_36
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 24338
Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance of Resource Efficient Wireless Network Topologies. In: Proceedings of the 8th International Euro-Par Conference. ; 2002. doi:10.1007/3-540-45706-2_134
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 18566
Adler M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion in Graphs. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45465-9_77
LibreCat
| DOI
2002 | Book Chapter | LibreCat-ID: 16723
Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing, Mobile Networks. In: Euro-Par 2002 Parallel Processing. Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45706-2_133
LibreCat
| DOI
2001 | Journal Article | LibreCat-ID: 18749
Czumaj A, Sohler C. Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP). 2001:493-505. doi:10.1007/3-540-48224-5_41
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18964
Lukovszki T, Maheshwari A, Zeh N. 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. doi:10.1007/3-540-45294-x_21
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18152
Ziegler M, Brattka V. A Computable Spectral Theorem. In: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide F. Data Management in Networks. In: Graph-Theoretic Concepts in Computer Science. Vol 2204. Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: Computational Science - ICCS 2001. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45718-6_68
LibreCat
| DOI
2001 | Book (Editor) | LibreCat-ID: 16722
Meyer auf der Heide F, ed. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin, Heidelberg: Springer ; 2001. doi:10.1007/3-540-44676-1
LibreCat
| DOI
2000 | Book Chapter | LibreCat-ID: 3023
Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In: Automata, Languages and Programming. Berlin, Heidelberg: Springer Berlin Heidelberg; 2000:248-259. doi:10.1007/3-540-45022-x_22
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 17990
Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:10.1007/3-540-45253-2_15
LibreCat
| DOI
2000 | Conference Paper | LibreCat-ID: 18146
Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: SOFSEM 2000: Theory and Practice of Informatics. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:10.1007/3-540-44411-4_34
LibreCat
| DOI
2000 | Book Chapter | LibreCat-ID: 16497
Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms. In: Euro-Par 2000 Parallel Processing. Berlin, Heidelberg; 2000. doi:10.1007/3-540-44520-x_59
LibreCat
| DOI
1999 | Book Chapter | LibreCat-ID: 2435
Simon J, Reinefeld A, Heinz O. Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI. In: Hellwagner H, Reinefeld A, eds. SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters. Vol 1734. Lecture Notes in Computer Science (LNCS). Berlin / Heidelberg: Springer; 1999:367-381. doi:10.1007/10704208
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 18959
Lukovszki T. New Results on Fault Tolerant Geometric Spanners. In: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS. ; 1999:193-204. doi:10.1007/3-540-48447-7_20
LibreCat
| DOI
1999 | Book Chapter | LibreCat-ID: 17053
Meyer auf der Heide F, Vöcking B, Westermann M. Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In: Algorithms - ESA’ 99. Berlin, Heidelberg; 1999. doi:10.1007/3-540-48481-7_9
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 13608
Eisenring M, Platzner M, Thiele L. Communication Synthesis for Reconfigurable Embedded Systems. In: Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL). Vol 1673. LCS. Springer; 1999:205-214. doi:10.1007/978-3-540-48302-1_21
LibreCat
| DOI