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.
286 Publications
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