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.
264 Publications
2003 | Journal Article | LibreCat-ID: 19785
Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” Algorithms for Memory Hierarchies 2625 (2003). https://doi.org/10.1007/3-540-36574-5_12.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” In Advances in Cryptology - CRYPTO 2003, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45146-4_2.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3018
Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” In Financial Cryptography, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45126-6_12.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 18196
Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” In Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 705–15. Lecture Notes in Computer Science, Vol 2906. Springer, Berlin, Heidelberg, 2003. https://doi.org/10.1007/978-3-540-24587-2_72.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 18258
Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” In Lecture Notes in Computer Science, edited by F. Dehne, JR. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2003. https://doi.org/10.1007/978-3-540-45078-8_13.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 16543
Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets in Dynamical Systems.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003. https://doi.org/10.1007/3-540-45084-x_8.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 16664
Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective Optimization.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003. https://doi.org/10.1007/3-540-36970-8_36.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 16665
Schütze, Oliver, Sanaz Mostaghim, Michael Dellnitz, and Jürgen Teich. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2003. https://doi.org/10.1007/3-540-36970-8_9.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 15077
Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients.” In Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, 400–410. Springer, 2003. https://doi.org/10.1007/978-3-540-39403-7_30.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 15078
Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption Test.” In Database and XML Technologies, First International XML Database Symposium, XSym 2003, 85–99. Berlin, Heidelberg, 2003. https://doi.org/10.1007/978-3-540-39429-7_6.
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 13615
Steiger, Christoph, Herbert Walder, and Marco Platzner. “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), 575–84. Berlin, Heidelberg: Springer, 2003. https://doi.org/10.1007/978-3-540-45234-8_56.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 19850
Wanka, Rolf. “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), 413–20. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-36379-3_36.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 24338
Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.” In Proceedings of the 8th International Euro-Par Conference. Paderborn, Germany, 2002. https://doi.org/10.1007/3-540-45706-2_134.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 18566
Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. “Randomized Pursuit-Evasion in Graphs.” In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-45465-9_77.
LibreCat
| DOI
2002 | Book Chapter | LibreCat-ID: 16723
Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul Spirakis. “Mobile Computing, Mobile Networks.” In Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-45706-2_133.
LibreCat
| DOI
2001 | Journal Article | LibreCat-ID: 18749
Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, 493–505. https://doi.org/10.1007/3-540-48224-5_41.
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18964
Lukovszki, Tamás, Anil Maheshwari, and Norbert 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. https://doi.org/10.1007/3-540-45294-x_21.
LibreCat
| DOI
2001 | Conference Paper | LibreCat-ID: 18152
Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45335-0_23.
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16493
Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In Graph-Theoretic Concepts in Computer Science, Vol. 2204. Lecture Notes in Computer Science. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45477-2_2.
LibreCat
| DOI
2001 | Book Chapter | LibreCat-ID: 16494
Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” In Computational Science - ICCS 2001. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45718-6_68.
LibreCat
| DOI