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.

262 Publications


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
 

Filters and Search Terms

issn=0302-9743

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed