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, Henning, and Kathrin Bujna. “Back to the Roots of Genres: Text Classification by Language Function.” In Proceedings of 5th International Joint Conference on Natural Language Processing, edited by Bettina Berendt, Arjen de Vries, Wenfei Fan, Craig Macdonald, Iadh Ounis, and Ian Ruthven, 632–40, 2011.
LibreCat | Download (ext.)
 

2011 | Conference Paper | LibreCat-ID: 3875
Wachsmuth, Henning, Benno Stein, and Gregor Engels. “Constructing Efficient Information Extraction Pipelines.” In 20th ACM International Conference on Information and Knowledge Management, edited by Bettina Berendt, Arjen de Vries, Wenfei Fan, Craig Macdonald, Iadh Ounis, and Ian Ruthven, 2237–40, 2011.
LibreCat | Download (ext.)
 

2011 | Mastersthesis | LibreCat-ID: 2902
Märtens, Marcus. The Monotone Complexity of Computing K-Clique on Random Graphs, 2011.
LibreCat
 

2011 | Dissertation | LibreCat-ID: 2910
Naewe, Stefanie. Algorithms for Lattice Problems with Respect to General Norms. Universität Paderborn, 2011.
LibreCat | Download (ext.)
 

2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011.
LibreCat
 

2011 | Book Chapter | LibreCat-ID: 2986
Blömer, Johannes. “How to Share a Secret.” In Algorithms Unplugged, 159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. https://doi.org/10.1007/978-3-642-15328-0_17.
LibreCat | DOI
 

2011 | Preprint | LibreCat-ID: 2987
Blömer, Johannes, and Stefanie Naewe. “Solving the Closest Vector Problem with Respect to Lp Norms.” ArXiv:1104.3720, 2011.
LibreCat
 

2011 | Conference Paper | LibreCat-ID: 3137
Hofheinz, Dennis, Tibor Jager, and Eike Kiltz. “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, 647--666, 2011. https://doi.org/10.1007/978-3-642-25385-0_35.
LibreCat | DOI
 

2011 | Conference Paper | LibreCat-ID: 3138
Jager, Tibor, and Juraj Somorovsky. “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, 413--422, 2011. https://doi.org/10.1145/2046707.2046756.
LibreCat | DOI
 

2011 | Journal Article | LibreCat-ID: 3183
Schneider, Steve, Helen Treharne, and Heike Wehrheim. “Bounded Retransmission in Event-B{\(\parallel\)}CSP: A Case Study.” Electr. Notes Theor. Comput. Sci., 2011, 69--80. https://doi.org/10.1016/j.entcs.2011.11.019.
LibreCat | DOI
 

Filters and Search Terms

department=7

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed