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.
5685 Publications
2011 | Conference Paper | LibreCat-ID: 3811
Wachsmuth, H., & Bujna, K. (2011). Back to the Roots of Genres: Text Classification by Language Function. In B. Berendt, A. de Vries, W. Fan, C. Macdonald, I. Ounis, & I. Ruthven (Eds.), Proceedings of 5th International Joint Conference on Natural Language Processing (pp. 632–640).
LibreCat
| Download (ext.)
2011 | Conference Paper | LibreCat-ID: 3875
Wachsmuth, H., Stein, B., & Engels, G. (2011). Constructing Efficient Information Extraction Pipelines. In B. Berendt, A. de Vries, W. Fan, C. Macdonald, I. Ounis, & I. Ruthven (Eds.), 20th ACM International Conference on Information and Knowledge Management (pp. 2237–2240).
LibreCat
| Download (ext.)
2011 | Mastersthesis | LibreCat-ID: 2902
Märtens, M. (2011). The Monotone Complexity of Computing k-Clique on Random Graphs.
LibreCat
2011 | Dissertation | LibreCat-ID: 2910
Naewe, S. (2011). Algorithms for lattice problems with respect to general norms. Universität Paderborn.
LibreCat
| Download (ext.)
2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, M. R., Blömer, J., & Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.
LibreCat
2011 | Book Chapter | LibreCat-ID: 2986
Blömer, J. (2011). How to Share a Secret. In Algorithms Unplugged (pp. 159–168). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_17
LibreCat
| DOI
2011 | Preprint | LibreCat-ID: 2987
Blömer, J., & Naewe, S. (2011). Solving the Closest Vector Problem with respect to Lp Norms. ArXiv:1104.3720.
LibreCat
2011 | Conference Paper | LibreCat-ID: 3137
Hofheinz, D., Jager, T., & Kiltz, E. (2011). Short Signatures from Weaker Assumptions. In Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings (pp. 647--666). https://doi.org/10.1007/978-3-642-25385-0_35
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 3138
Jager, T., & Somorovsky, J. (2011). How to break XML encryption. In Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, October 17-21, 2011 (pp. 413--422). https://doi.org/10.1145/2046707.2046756
LibreCat
| DOI
2011 | Journal Article | LibreCat-ID: 3183
Schneider, S., Treharne, H., & Wehrheim, H. (2011). Bounded Retransmission in Event-B{\(\parallel\)}CSP: a Case Study. Electr. Notes Theor. Comput. Sci., 69--80. https://doi.org/10.1016/j.entcs.2011.11.019
LibreCat
| DOI