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.

322 Publications


2009 | Book Chapter | LibreCat-ID: 19724
O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in Algorithmic Aspects of Wireless Sensor Networks, Berlin, Heidelberg: Springer, 2009, pp. 252–262.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 2920
S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 300–301.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 3000
J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 23744
P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with Computationally Bounded Consumers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 1830
T. Biermann, A. Schwabe, and H. Karl, “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE,” in NETWORKING 2009, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 883–894.
LibreCat | DOI
 

2009 | Book Chapter | LibreCat-ID: 9616
S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.
LibreCat | DOI
 

2009 | Conference (Editor) | LibreCat-ID: 61021
B. Mertsching, M. Hund, and Z. Aziz, Eds., KI 2009: Advances in Artificial Intelligence. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.
LibreCat | DOI
 

2009 | Conference Paper | LibreCat-ID: 66535
M. Hund and B. Mertsching, “Occlusion as a Monocular Depth Cue Derived from Illusory Contour Perception,” presented at the KI 2009, Paderborn, 2009, doi: 10.1007/978-3-642-04617-9_13.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 19686
P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 19003
B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location Problem,” in Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 20367
H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem,” in The tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, vol. 5040, pp. 447--456.
LibreCat | DOI
 

2008 | Book Chapter | LibreCat-ID: 17978
K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using Non-arithmetic Primitives,” in Unconventional Computing, Berlin, Heidelberg, 2008.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 24276
M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces,” 2007, doi: 10.1007/978-3-540-73951-7_30.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3019
A. May, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent,” in Advances in Cryptology — CRYPTO 2002, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 242–256.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3020
J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3021
J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3022
A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution Modular Lattices,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–125.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3026
J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.
LibreCat | DOI
 

2007 | Conference Paper | LibreCat-ID: 18929
M. Dynia, M. Korzeniowski, and J. Kutyłowski, “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), 2007, vol. 4362, pp. 260--271.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 17982
M. Ziegler, “(Short) Survey of Real Hypercomputation,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.
LibreCat | DOI
 

Filters and Search Terms

issn=0302-9743

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed