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
2010 | Conference Paper | LibreCat-ID: 15137
Böttcher, S., Hartel, R., & Messinger, C. (2010). Searchable Compression of Office Documents by XML Schema Subtraction. In Database and XML Technologies - 7th International XML Database Symposium, XSym 2010 (pp. 103–112). Springer. https://doi.org/10.1007/978-3-642-15684-7_9
LibreCat
| DOI
2010 | Book Chapter | LibreCat-ID: 16365
Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In Structural Information and Communication Complexity (pp. 168–182). Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_14
LibreCat
| DOI
2010 | Book (Editor) | LibreCat-ID: 16403
Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1
LibreCat
| DOI
2010 | Book (Editor) | LibreCat-ID: 16404
Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2
LibreCat
| DOI
2010 | Book Chapter | LibreCat-ID: 13301
Trier, M., & Müller, C. (2010). Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes. In Practical Aspects of Knowledge Management. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30545-3_23
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 19724
Bonorden, O., Degener, B., Kempkes, B., & Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In Algorithmic Aspects of Wireless Sensor Networks (pp. 252–262). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-05434-1_25
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 2920
Kakvi, S. (2009). Reinforcement Learning for Blackjack. In Lecture Notes in Computer Science (pp. 300–301). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-04052-8_43
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 3000
Schrieb, J., Wehrheim, H., & Wonisch, D. (2009). Three-Valued Spotlight Abstractions. In FM 2009: Formal Methods (pp. 106–122). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-05089-3_8
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 23744
Briest, P., Hoefer, M., Gualà, L., & Ventre, C. (2009). On Stackelberg Pricing with Computationally Bounded Consumers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_6
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 1830
Biermann, T., Schwabe, A., & Karl, H. (2009). Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE. In NETWORKING 2009 (pp. 883–894). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-01399-7_69
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 9616
Kakvi, S. (2009). Reinforcement Learning for Blackjack. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04052-8_43
LibreCat
| DOI
2008 | Conference Paper | LibreCat-ID: 19686
Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP). https://doi.org/10.1007/978-3-540-70575-8_66
LibreCat
| DOI
2008 | Conference Paper | LibreCat-ID: 19003
Degener, B., Gehweiler, J., & Lammersen, C. (2008). The Kinetic Facility Location Problem. In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT) (pp. 378–389). https://doi.org/10.1007/978-3-540-69903-3_34
LibreCat
| DOI
2008 | Conference Paper | LibreCat-ID: 20367
Hamann, H., & Wörn, H. (2008). Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In The tenth International Conference on Simulation of Adaptive Behavior (SAB’08) (Vol. 5040, pp. 447--456). https://doi.org/10.1007/978-3-540-69134-1_44
LibreCat
| DOI
2008 | Book Chapter | LibreCat-ID: 17978
Lürwer-Brüggemeier, K., & Ziegler, M. (2008). On Faster Integer Calculations Using Non-arithmetic Primitives. In Unconventional Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85194-3_11
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 24276
Bienkowski, M., & Kutyłowski, J. (2007). The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-73951-7_30
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3019
May, A. (2007). Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In Advances in Cryptology — CRYPTO 2002 (pp. 242–256). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45708-9_16
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3020
Blömer, J., & May, A. (2007). Low Secret Exponent RSA Revisited. In Lecture Notes in Computer Science (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44670-2_2
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3021
Blömer, J., & May, A. (2007). Key Revocation with Interval Cover Families. In Selected Areas in Cryptography (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45537-x_26
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3022
May, A., & Silverman, J. H. (2007). Dimension Reduction Methods for Convolution Modular Lattices. In Lecture Notes in Computer Science (pp. 110–125). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44670-2_10
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3026
Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-68530-8_13
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 18929
Dynia, M., Korzeniowski, M., & Kutyłowski, J. (2007). Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs. In Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07) (Vol. 4362, pp. 260--271). https://doi.org/10.1007/978-3-540-69507-3_21
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 17982
Ziegler, M. (2007). (Short) Survey of Real Hypercomputation. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_86
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 17983
Meer, K., & Ziegler, M. (2007). Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_64
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 16640
Monien, B., & Preis, R. (2007). Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In Mathematical Foundations of Computer Science 2001. Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_46
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 15144
Böttcher, S., & Steinmetz, R. (2007). Evaluating XPath Queries on XML Data Streams. In Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24 (pp. 101–113). Springer. https://doi.org/10.1007/978-3-540-73390-4_10
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 15146
Böttcher, S., & Steinmetz, R. (2007). Data Management for Mobile Ajax Web 2.0 Applications. In Database and Expert Systems Applications, 18th International Conference, DEXA 2007 (pp. 424–433). Springer. https://doi.org/10.1007/978-3-540-74469-6_42
LibreCat
| DOI
2006 | Conference Paper | LibreCat-ID: 19838
Rührup, S., & Schindelhauer, C. (2006). Online Multi-path Routing in a Maze. In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). https://doi.org/10.1007/11940128_65
LibreCat
| DOI
2006 | Conference Paper | LibreCat-ID: 24277
Kutyłowski, J., & Zagórski, F. (2006). Reliable Broadcasting Without Collision Detection. SOFSEM 2006: Theory and Practice of Computer Science. https://doi.org/10.1007/11611257_37
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3004
Blömer, J., & Krummel, V. (2006). Fault Based Collision Attacks on AES. In Lecture Notes in Computer Science (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_11
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3005
Blömer, J., & Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In Lecture Notes in Computer Science (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_2
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3007
Blömer, J., Otto, M., & Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In Lecture Notes in Computer Science (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_4
LibreCat
| Files available
| DOI
2006 | Conference Paper | LibreCat-ID: 18926
Dynia, M., Korzeniowski, M., & Schindelhauer, C. (2006). Power-Aware Collective Tree Exploration. In Architecture of Computing Systems - ARCS (pp. 341--351). https://doi.org/10.1007/11682127_24
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 17987
Meer, K., & Ziegler, M. (2006). Uncomputability Below the Real Halting Problem. In Logical Approaches to Computational Barriers. Berlin, Heidelberg. https://doi.org/10.1007/11780342_39
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 16472
Demaine, E. D., Meyer auf der Heide, F., Pagh, R., & Pǎtraşcu, M. (2006). De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/11682462_34
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 16473
Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., & Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/11821069_29
LibreCat
| DOI
2006 | Conference Paper | LibreCat-ID: 15150
Böttcher, S., & Steinmetz, R. (2006). DTD-Driven Structure Preserving XML Compression. In Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23 (pp. 266–269). Berlin, Heidelberg. https://doi.org/10.1007/11788911_27
LibreCat
| DOI
2006 | Conference Paper | LibreCat-ID: 15152
Böttcher, S., & Steinmetz, R. (2006). Information Disclosure by XPath Queries. In Secure Data Management, Third VLDB Workshop, SDM 2006 (pp. 160–174). Springer. https://doi.org/10.1007/11844662_12
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 35958
Fouvry, É., & Klüners, J. (2006). Cohen–Lenstra Heuristics of Quadratic Number Fields. In Lecture Notes in Computer Science. Springer Berlin Heidelberg. https://doi.org/10.1007/11792086_4
LibreCat
| Files available
| DOI
2006 | Book Chapter | LibreCat-ID: 53181
Geiselmann, W., Januszewski, F., Köpfer, H., Pelzl, J., & Steinwandt, R. (2006). A Simpler Sieving Device: Combining ECM and TWIRL. In Information Security and Cryptology – ICISC 2006. Springer Berlin Heidelberg. https://doi.org/10.1007/11927587_12
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 19835
Rührup, S., Schindelhauer, C., & Volbert, K. (2005). Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005) (Vol. 3738, pp. 244–257). https://doi.org/10.1007/11561354_21
LibreCat
| DOI
2005 | Book Chapter | LibreCat-ID: 19836
Schindelhauer, C., & Voß, K. (2005). Probability Distributions for Channel Utilisation. In Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005) (pp. 271–284). https://doi.org/10.1007/11561354_23
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 19912
Loeser, C., Schomaker, G., Brinkmann, A., Vodisek, M., & Heidebuer, M. (2005). Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In Proceedings of the 4th International Conference on Networking (Vol. 3421, pp. 800–810). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_90
LibreCat
| DOI
2005 | Book Chapter | LibreCat-ID: 3006
Blömer, J., & May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_15
LibreCat
| Files available
| DOI
2005 | Book Chapter | LibreCat-ID: 3010
Ernst, M., Jochemsz, E., May, A., & de Weger, B. (2005). Partial Key Exposure Attacks on RSA up to Full Size Exponents. In EUROCRYPT 2005 (pp. 371–386). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_22
LibreCat
| DOI
2005 | Book Chapter | LibreCat-ID: 26991
Rührup, S., & Schindelhauer, C. (2005). Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In Algorithms – ESA 2005. https://doi.org/10.1007/11561071_5
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 18768
Bădoiu, M., Czumaj, A., Indyk, P., & Sohler, C. (2005). Facility Location in Sublinear Time. In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) (pp. 866–877). Berlin, Heidelberg. https://doi.org/10.1007/11523468_70
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 18867
Frahling, G., & Krokowski, J. (2005). Online Occlusion Culling. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer. https://doi.org/10.1007/11561071_67
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 18912
Bienkowski, M., & Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg. https://doi.org/10.1007/11549468_105
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 18915
Bienkowski, M., & Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 815–826). Berlin, Heidelberg: Springer . https://doi.org/10.1007/11561071_72
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 18924
Bienkowski, M., Brinkmann, A., Korzeniowski, M., & Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In Proceedings of the 4th International Conference on Networking (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-31956-6_49
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 18925
Bienkowski, M., Dynia, M., & Korzeniowski, M. (2005). Improved Algorithms for Dynamic Page Migration. In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 365–376). https://doi.org/10.1007/978-3-540-31856-9_30
LibreCat
| DOI
2005 | Book Chapter | LibreCat-ID: 17988
Köhler, S., Schindelhauer, C., & Ziegler, M. (2005). On Approximating Real-World Halting Problems. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/11537311_40
LibreCat
| DOI
2005 | Book Chapter | LibreCat-ID: 17989
Meer, K., & Ziegler, M. (2005). An Explicit Solution to Post’s Problem over the Reals. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/11537311_41
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 18280
Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In Proc. CiE 2005: New Computational Paradigms (Vol. 3526, pp. 562–571). Springer. https://doi.org/10.1007/11494645_68
LibreCat
| DOI
2005 | Book Chapter | LibreCat-ID: 16468
Bienkowski, M., Korzeniowski, M., & Meyer auf der Heide, F. (2005). Dynamic Load Balancing in Distributed Hash Tables. In Peer-to-Peer Systems IV. Berlin, Heidelberg. https://doi.org/10.1007/11558989_20
LibreCat
| DOI
2005 | Book Chapter | LibreCat-ID: 16469
Bienkowski, M., & Meyer auf der Heide, F. (2005). Page Migration in Dynamic Networks. In Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg. https://doi.org/10.1007/11549345_1
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 16470
Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2005). A Web Computing Environment for Parallel Algorithms in Java. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 801–808). https://doi.org/10.1007/11752578_96
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 16471
Bonorden, O., Gehweiler, J., & Meyer auf der Heide, F. (2005). Load Balancing Strategies in a Web Computing Environment. In Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM) (pp. 839–846). https://doi.org/10.1007/11752578_101
LibreCat
| DOI
2005 | Conference Paper | LibreCat-ID: 15156
Böttcher, S., & Steinmetz, R. (2005). Detecting Privacy Violations in Sensitive XML Databases. In Secure Data Management, Second VLDB Workshop, SDM 2005 (pp. 143–154). Springer. https://doi.org/10.1007/11552338_10
LibreCat
| DOI
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 | Book Chapter | LibreCat-ID: 3011
Blömer, J., Guajardo, J., & Krummel, V. (2004). Provably Secure Masking of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_5
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3012
Blömer, J., & May, A. (2004). A Generalized Wiener Attack on RSA. In Public Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_1
LibreCat
| Files available
| DOI
2004 | Book Chapter | LibreCat-ID: 3014
May, A. (2004). Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In Public Key Cryptography – PKC 2004 (pp. 218–230). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_16
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3015
May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In Advances in Cryptology – CRYPTO 2004 (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_13
LibreCat
| DOI
2004 | Conference Paper | LibreCat-ID: 18778
Damerow, V., & Sohler, C. (2004). Extreme Points Under Random Noise. In Proceedings of the 12th European Symposium on Algorithms (ESA’04). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_25
LibreCat
| DOI
2004 | Conference Paper | LibreCat-ID: 18263
Nüsken, M., & Ziegler, M. (2004). Fast Multipoint Evaluation of Bivariate Polynomials. In Proc. 12th Annual Symposium on Algorithms (ESA’04) (Vol. 3221, pp. 544–555). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-30140-0_49
LibreCat
| DOI
2004 | Conference Paper | LibreCat-ID: 18279
Schindelhauer, C., Volbert, K., & Ziegler, M. (2004). Spanners, Weak Spanners, and Power Spanners for Wireless Networks. In Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04) (Vol. 3341, pp. 805–821). Berlin, Heidelberg: Springer . https://doi.org/10.1007/978-3-540-30551-4_69
LibreCat
| DOI
2004 | Conference Paper | LibreCat-ID: 16474
Bansal, V., Meyer auf der Heide, F., & Sohler, C. (2004). Labeling Smart Dust. In 12th Annual European Symposium on Algorithms (ESA 2004) (Vol. 3221). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_9
LibreCat
| DOI
2004 | Conference Paper | LibreCat-ID: 13618
Walder, H., & Platzner, M. (2004). A Runtime Environment for Reconfigurable Hardware Operating Systems. In Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL) (pp. 831–835). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-30117-2_84
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 | Book Chapter | LibreCat-ID: 3016
Blömer, J., & May, A. (2003). New Partial Key Exposure Attacks on RSA. In Advances in Cryptology - CRYPTO 2003 (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45146-4_2
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3018
Blömer, J., & Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In Financial Cryptography (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45126-6_12
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 | 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 | Book Chapter | LibreCat-ID: 16543
Dellnitz, M., & Preis, R. (2003). Congestion and Almost Invariant Sets in Dynamical Systems. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45084-x_8
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 16664
Schütze, O. (2003). A New Data Structure for the Nondominance Problem in Multi-objective Optimization. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_36
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 16665
Schütze, O., Mostaghim, S., Dellnitz, M., & Teich, J. (2003). Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_9
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 15077
Böttcher, S., & Steinmetz, R. (2003). 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 (pp. 400–410). Springer. https://doi.org/10.1007/978-3-540-39403-7_30
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 15078
Böttcher, S., & Steinmetz, R. (2003). A DTD Graph Based XPath Query Subsumption Test. In Database and XML Technologies, First International XML Database Symposium, XSym 2003 (pp. 85–99). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39429-7_6
LibreCat
| DOI
2003 | Conference Paper | LibreCat-ID: 13615
Steiger, C., Walder, H., & Platzner, M. (2003). 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) (pp. 575–584). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-45234-8_56
LibreCat
| DOI
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: 24338
Grünewald, M., Lukovszki, T., Schindelhauer, C., & Volbert, K. (2002). Distributed Maintenance of Resource Efficient Wireless Network Topologies. Proceedings of the 8th International Euro-Par Conference. https://doi.org/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. (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 | 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 | 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: 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 | 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 | 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 | Book Chapter | LibreCat-ID: 3023
Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45022-x_22
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 | 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
1999 | Book Chapter | LibreCat-ID: 2435
Simon, J., Reinefeld, A., & Heinz, O. (1999). Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI. In H. Hellwagner & A. Reinefeld (Eds.), SCI: Scalable Coherent Interface. Architecture and Software for High-Performance Compute Clusters (Vol. 1734, pp. 367–381). Berlin / Heidelberg: Springer. https://doi.org/10.1007/10704208
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 18959
Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS (pp. 193–204). https://doi.org/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. (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: 13608
Eisenring, M., Platzner, M., & Thiele, L. (1999). Communication Synthesis for Reconfigurable Embedded Systems. In Proceedings of the 9th International Workshop on Field Programmable Logic and Applications (FPL) (Vol. 1673, pp. 205–214). Springer. https://doi.org/10.1007/978-3-540-48302-1_21
LibreCat
| DOI
1998 | Book Chapter | LibreCat-ID: 17412
Fischer, M., Lukovszki, T., & Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In Algorithms — ESA’ 98. Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_14
LibreCat
| Files available
| DOI