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, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.
LibreCat
| DOI
2010 | Book Chapter | LibreCat-ID: 13301
Trier, Matthias, and Claudia Müller. “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes.” Practical Aspects of Knowledge Management, 2010, doi:10.1007/978-3-540-30545-3_23.
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 19724
Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” Algorithmic Aspects of Wireless Sensor Networks, Springer, 2009, pp. 252–62, doi:10.1007/978-3-642-05434-1_25.
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 2920
Kakvi, Saqib. “Reinforcement Learning for Blackjack.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2009, pp. 300–01, doi:10.1007/978-3-642-04052-8_43.
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 3000
Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.” FM 2009: Formal Methods, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:10.1007/978-3-642-05089-3_8.
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 23744
Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded Consumers.” Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-10841-9_6.
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 1830
Biermann, Thorsten, et al. “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE.” NETWORKING 2009, Springer Berlin Heidelberg, 2009, pp. 883–94, doi:10.1007/978-3-642-01399-7_69.
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 9616
Kakvi, Saqib. “Reinforcement Learning for Blackjack.” Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-04052-8_43.
LibreCat
| DOI
2008 | Conference Paper | LibreCat-ID: 19686
Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008, doi:10.1007/978-3-540-70575-8_66.
LibreCat
| DOI
2008 | Conference Paper | LibreCat-ID: 19003
Degener, Bastian, et al. “The Kinetic Facility Location Problem.” Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–89, doi:10.1007/978-3-540-69903-3_34.
LibreCat
| DOI
2008 | Conference Paper | LibreCat-ID: 20367
Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.” The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), vol. 5040, 2008, pp. 447--456, doi:10.1007/978-3-540-69134-1_44.
LibreCat
| DOI
2008 | Book Chapter | LibreCat-ID: 17978
Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” Unconventional Computing, 2008, doi:10.1007/978-3-540-85194-3_11.
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 24276
Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” Lecture Notes in Computer Science, 2007, doi:10.1007/978-3-540-73951-7_30.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3019
May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.” Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, 2007, pp. 242–56, doi:10.1007/3-540-45708-9_16.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3020
Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3021
Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:10.1007/3-540-45537-x_26.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3022
May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 110–25, doi:10.1007/3-540-44670-2_10.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3026
Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” Algorithms — ESA’ 98, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:10.1007/3-540-68530-8_13.
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 18929
Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.” Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), vol. 4362, 2007, pp. 260--271, doi:10.1007/978-3-540-69507-3_21.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 17982
Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” Lecture Notes in Computer Science, 2007, doi:10.1007/978-3-540-73001-9_86.
LibreCat
| DOI