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.
281 Publications
2008 | Conference Paper | LibreCat-ID: 20367
Hamann H, Wörn H. 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. ; 2008:447--456. doi:10.1007/978-3-540-69134-1_44
LibreCat
| DOI
2008 | Book Chapter | LibreCat-ID: 17978
Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic Primitives. In: Unconventional Computing. Berlin, Heidelberg; 2008. doi:10.1007/978-3-540-85194-3_11
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 24276
Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. In: Lecture Notes in Computer Science. ; 2007. doi:10.1007/978-3-540-73951-7_30
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3019
May A. Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In: Advances in Cryptology — CRYPTO 2002. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:242-256. doi:10.1007/3-540-45708-9_16
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3020
Blömer J, May A. Low Secret Exponent RSA Revisited. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19. doi:10.1007/3-540-44670-2_2
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3021
Blömer J, May A. Key Revocation with Interval Cover Families. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341. doi:10.1007/3-540-45537-x_26
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3022
May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:110-125. doi:10.1007/3-540-44670-2_10
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3026
Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In: Algorithms — ESA’ 98. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:151-162. doi:10.1007/3-540-68530-8_13
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 18929
Dynia M, Korzeniowski M, Kutyłowski J. 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. ; 2007:260--271. doi:10.1007/978-3-540-69507-3_21
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 17982
Ziegler M. (Short) Survey of Real Hypercomputation. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-73001-9_86
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 17983
Meer K, Ziegler M. Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In: Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-74456-6_64
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 16640
Monien B, Preis R. Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In: Mathematical Foundations of Computer Science 2001. Berlin, Heidelberg; 2007. doi:10.1007/3-540-44683-4_46
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 15144
Böttcher S, Steinmetz R. Evaluating XPath Queries on XML Data Streams. In: Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24. Springer; 2007:101-113. doi:10.1007/978-3-540-73390-4_10
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 15146
Böttcher S, Steinmetz R. Data Management for Mobile Ajax Web 2.0 Applications. In: Database and Expert Systems Applications, 18th International Conference, DEXA 2007. Springer; 2007:424-433. doi:10.1007/978-3-540-74469-6_42
LibreCat
| DOI
2006 | Conference Paper | LibreCat-ID: 19838
Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). ; 2006. doi:10.1007/11940128_65
LibreCat
| DOI
2006 | Conference Paper | LibreCat-ID: 24277
Kutyłowski J, Zagórski F. Reliable Broadcasting Without Collision Detection. In: SOFSEM 2006: Theory and Practice of Computer Science. ; 2006. doi:10.1007/11611257_37
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3004
Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:106-120. doi:10.1007/11889700_11
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3005
Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:13-23. doi:10.1007/11889700_2
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3007
Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:36-52. doi:10.1007/11889700_4
LibreCat
| Files available
| DOI
2006 | Conference Paper | LibreCat-ID: 18926
Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration. In: Architecture of Computing Systems - ARCS. ; 2006:341--351. doi:10.1007/11682127_24
LibreCat
| DOI