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