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.
229 Publications
2013 | Preprint | LibreCat-ID: 538 | 
Blömer, J., & Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.
LibreCat
| Files available
| Download (ext.)
2013 | Bachelorsthesis | LibreCat-ID: 553
Kohn, K. (2013). Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn.
LibreCat
2012 | Conference Paper | LibreCat-ID: 2982
Ackermann, M. R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., & Sohler, C. (2012). StreamKM++: A clustering algorithm for data streams. New York, NY, USA: ACM. https://doi.org/10.1145/2133803.2184450
LibreCat
| DOI
2012 | Journal Article | LibreCat-ID: 2984
Blömer, J. (2012). Turing und Kryptografie. Informatik-Spektrum, 35(4). https://doi.org/10.1007/s00287-012-0622-7
LibreCat
| DOI
2012 | Bachelorsthesis | LibreCat-ID: 606
Löken, N. (2012). Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn.
LibreCat
2012 | Bachelorsthesis | LibreCat-ID: 607
Haarhoff, T. (2012). Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn.
LibreCat
2012 | Bachelorsthesis | LibreCat-ID: 629
Schleiter, P. (2012). Attribute-basierte Verschlüsselung. Universität Paderborn.
LibreCat
2011 | Bachelorsthesis | LibreCat-ID: 2872
Böttger, T. (2011). Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen.
LibreCat
| Files available
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 | Mastersthesis | LibreCat-ID: 659
Liske, G. (2011). Fault attacks in pairing-based cryptography. Universität Paderborn.
LibreCat
| Files available
2010 | Book Chapter | LibreCat-ID: 2988
Ackermann, M. R., & Blömer, J. (2010). Bregman Clustering for Separable Instances. In SWAT 2010 (pp. 212–223). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_21
LibreCat
| DOI
2010 | Journal Article | LibreCat-ID: 2990
Ackermann, M. R., Blömer, J., & Sohler, C. (2010). Clustering for Metric and Nonmetric Distance Measures. ACM Trans. Algorithms, (4), 59:1--59:26. https://doi.org/10.1145/1824777.1824779
LibreCat
| DOI
2010 | Journal Article | LibreCat-ID: 2991
Krueger, A., Leutnant, V., Haeb-Umbach, R., Ackermann, M., & Blömer, J. (2010). On the initialization of dynamic models for speech features. Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany.
LibreCat
2010 | Conference Paper | LibreCat-ID: 2993
Schrieb, J. (2010). Efficient and Compact CCA Security from Partitioned IBKEM.
LibreCat
2010 | Conference Paper | LibreCat-ID: 2994
Schäfer, W., Trächtler, A., Birattari, M., Blömer, J., Dorigo, M., Engels, G., … Reif, W. (2010). Engineering self-coordinating software intensive systems. In Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10. ACM Press. https://doi.org/10.1145/1882362.1882428
LibreCat
| DOI
2010 | Misc | LibreCat-ID: 47684 |
Postler, T. (2010). Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung.
LibreCat
| Files available
2009 | Bachelorsthesis | LibreCat-ID: 2880
Schröer, C. (2009). Hierarchisches Clustering mit minimalen Cluster-Durchmessern.
LibreCat
| Files available
2009 | Bachelorsthesis | LibreCat-ID: 2896 |
Liske, G. (2009). Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens.
LibreCat
| Files available
2009 | Mastersthesis | LibreCat-ID: 2904
Scholz, C. (2009). Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen.
LibreCat
| Files available
2009 | Dissertation | LibreCat-ID: 2911
Ackermann, M. R. (2009). Algorithms for the Bregman k-Median Problem. Universität Paderborn.
LibreCat
| Download (ext.)
2009 | Book Chapter | LibreCat-ID: 2995
Ackermann, M. R., & Blömer, J. (2009). Coresets and Approximate Clustering for Bregman Divergences. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1088–1097). Philadelphia, PA: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973068.118
LibreCat
| DOI
2009 | Journal Article | LibreCat-ID: 2999
Blömer, J., & Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science, (18), 1648–1665. https://doi.org/10.1016/j.tcs.2008.12.045
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 3000
Schrieb, J., Wehrheim, H., & Wonisch, D. (2009). Three-Valued Spotlight Abstractions. In FM 2009: Formal Methods (pp. 106–122). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-05089-3_8
LibreCat
| DOI
2008 | Conference Paper | LibreCat-ID: 3001
Stern, C., Adelt, P., Krummel, V., & Ackermann, M. R. (2008). Reliable Evidence of Data Integrity from an Untrusted Storage Service. In Fourth International Conference on Networking and Services (icns 2008). IEEE. https://doi.org/10.1109/icns.2008.28
LibreCat
| DOI
2008 | Misc | LibreCat-ID: 47685 |
Schrieb, J. (2008). Construction and Applications of Identity-Based Encryption without Pairings.
LibreCat
| Files available
2007 | Dissertation | LibreCat-ID: 2912
Krummel, V. (2007). Tamper Resistance of AES -- Models, Attacks and Countermeasures. Universität Paderborn.
LibreCat
| Download (ext.)
2007 | Book Chapter | LibreCat-ID: 3002 |
Blömer, J., & Krummel, V. (2007). Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In Selected Areas in Cryptography (pp. 96–109). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-77360-3_7
LibreCat
| DOI
| Download (ext.)
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
2007 | Bachelorsthesis | LibreCat-ID: 47650
Ziegert, S. (2007). Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem.
LibreCat
2007 | Bachelorsthesis | LibreCat-ID: 47651
Richert, M. (2007). Sichere Kryptosysteme durch Zero-Knowledge.
LibreCat
2007 | Misc | LibreCat-ID: 47688
Klein, W. (2007). Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln.
LibreCat
2007 | Misc | LibreCat-ID: 47690
Käthler, O. (2007). Kryptanalyse des EAC-Protokolls biometrischer Reisepässe.
LibreCat
2007 | Misc | LibreCat-ID: 47687 |
Brieden, B. (2007). Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode.
LibreCat
| Files available
2007 | Misc | LibreCat-ID: 47689 |
Kuntze, D. (2007). Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz.
LibreCat
| Files available
2007 | Misc | LibreCat-ID: 47686 |
Borghoff, J. (2007). Vergleich multivariater Varianten der Methode von Coppersmith.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 2887 |
Landwehr, A. C. (2007). Untersuchungen zur Sicherheit einzelner RSA Bits.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 47653 |
Klose, J. (2007). Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 47652 |
Niemeier, M. (2007). Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 47654 |
Birkner, S. (2007). Behandlung von Korrekturtermen in der Methode von Coppersmith.
LibreCat
| Files available
2006 | Journal Article | LibreCat-ID: 3003
Blömer, J. (2006). Randomness and Secrecy - A Brief Introduction. Journal of Universal Computer Science (J.UCS), (6), 654--671. https://doi.org/10.3217/jucs-012-06-0654
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3004
Blömer, J., & Krummel, V. (2006). Fault Based Collision Attacks on AES. In Lecture Notes in Computer Science (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_11
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3005
Blömer, J., & Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In Lecture Notes in Computer Science (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_2
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3007
Blömer, J., Otto, M., & Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In Lecture Notes in Computer Science (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_4
LibreCat
| Files available
| DOI
2006 | Bachelorsthesis | LibreCat-ID: 47649
Funke, R. (2006). Implementierung und Simulation von Cache-Angriffen auf AES.
LibreCat
2006 | Bachelorsthesis | LibreCat-ID: 47648 |
Schrieb, J. (2006). Von identitätsbasierten Kryptosystemen zu CCA-Sicherheit.
LibreCat
| Files available
2006 | Misc | LibreCat-ID: 47692 |
Naewe, S. (2006). Samplemethoden in der algorithmischen Geometrie der Zahlen.
LibreCat
| Files available
2006 | Misc | LibreCat-ID: 47691 |
Gorski, M. (2006). Boomerang- und Rechteckangriff auf AES.
LibreCat
| Files available
2005 | Dissertation | LibreCat-ID: 2913
Otto, M. (2005). Fault Attacks and Countermeasures. Universität Paderborn.
LibreCat
| Download (ext.)
2005 | Book Chapter | LibreCat-ID: 3006
Blömer, J., & May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_15
LibreCat
| Files available
| DOI
2005 | Book Chapter | LibreCat-ID: 3010
Ernst, M., Jochemsz, E., May, A., & de Weger, B. (2005). Partial Key Exposure Attacks on RSA up to Full Size Exponents. In EUROCRYPT 2005 (pp. 371–386). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_22
LibreCat
| DOI
2005 | Bachelorsthesis | LibreCat-ID: 47647
Hornkamp, C. (2005). Implementierung von wichtigen Teilen des Schoof-Elkies-Atkin Algorithmus zum Bestimmen der Punktanzahl einer elliptischen Kurve.
LibreCat
2005 | Bachelorsthesis | LibreCat-ID: 47646
Süß, T. (2005). Laufzeitanalyse- und vergleich verschiedener Algorithmen zur schnellen skalaren Multiplikation auf elliptischen Kurven.
LibreCat
2005 | Misc | LibreCat-ID: 47693
Ernst, M. (2005). Analyse von RSA mittels Coppersmith Methode.
LibreCat
2005 | Misc | LibreCat-ID: 47694 |
Spanke, C. (2005). Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA.
LibreCat
| Files available
2004 | Book Chapter | LibreCat-ID: 3011
Blömer, J., Guajardo, J., & Krummel, V. (2004). Provably Secure Masking of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_5
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3012
Blömer, J., & May, A. (2004). A Generalized Wiener Attack on RSA. In Public Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_1
LibreCat
| Files available
| DOI
2004 | Book Chapter | LibreCat-ID: 3014
May, A. (2004). Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In Public Key Cryptography – PKC 2004 (pp. 218–230). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_16
LibreCat
| DOI
2004 | Book Chapter | LibreCat-ID: 3015
May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In Advances in Cryptology – CRYPTO 2004 (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_13
LibreCat
| DOI
2004 | Conference Paper | LibreCat-ID: 3017
Blömer, J., Otto, M., & Seifert, J.-P. (2004). A new CRT-RSA algorithm secure against bellcore attacks. In Proceedings of the 10th ACM conference on Computer and communication security - CCS ’03. ACM Press. https://doi.org/10.1145/948109.948151
LibreCat
| DOI
2004 | Bachelorsthesis | LibreCat-ID: 47645
Dumrauf, D. (2004). Neue Schranken für die Coppersmith-Methode über den ganzen Zahlen.
LibreCat
2004 | Bachelorsthesis | LibreCat-ID: 47642
Herden, T. (2004). Implementierung und Evaluierung eines Angriffs auf DSA.
LibreCat
2004 | Bachelorsthesis | LibreCat-ID: 47644 |
Gesemann, S. (2004). Implementierung eines Verfahrens zur Berechnung optimaler längenbeschränkter Präfix-Codes.
LibreCat
| Files available
2004 | Bachelorsthesis | LibreCat-ID: 47643 |
Gorski, M. (2004). Implementierung und Evaluation einiger Algorithmen für Kryptosysteme auf elliptischen Kurven.
LibreCat
| Files available
2003 | Dissertation | LibreCat-ID: 2914
May, A. (2003). New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn.
LibreCat
| Download (ext.)
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, J., & May, A. (2003). New Partial Key Exposure Attacks on RSA. In Advances in Cryptology - CRYPTO 2003 (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45146-4_2
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3018
Blömer, J., & Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In Financial Cryptography (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45126-6_12
LibreCat
| DOI
2003 | Bachelorsthesis | LibreCat-ID: 47641
Ernst, M. (2003). Asymptotische Optimalität von LZ77 bei beschränktem Speicher.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47635
Voß, K. (2003). Asymptotische Optimalität von Lempel-Ziv bei Markowprozessen.
LibreCat
2003 | Misc | LibreCat-ID: 47696 |
Hoppe, U. (2003). Markovprozesse zur Modellierung bei Codekompression.
LibreCat
| Files available
2003 | Bachelorsthesis | LibreCat-ID: 47636 |
Unterkirchner, C. (2003). Implementierung eines arithmetischen Dekodierers in Java.
LibreCat
| Files available
2003 | Bachelorsthesis | LibreCat-ID: 47640 |
Kuntze, D. (2003). Tabellenbasierte arithmetische Codierung.
LibreCat
| Files available
2003 | Bachelorsthesis | LibreCat-ID: 47638
Soltenborn, C. (2003). Kompressionsverlust bei arithmetischer Codierung mit endlicher Präzision.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47637
Todtenbier, C. (2003). Implementierung eines arithmetischen Kodierers in Java.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47634
Ziegler, M. (2003). Fehlerangriffe auf spezielle Implementierungen von RSA.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47639
Lindner, M. (2003). Verkürzte Huffman-Codierung zur Codekompression.
LibreCat
2003 | Misc | LibreCat-ID: 47695 |
Ackermann, M. R. (2003). Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten.
LibreCat
| Files available
2002 | Journal Article | LibreCat-ID: 3034
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. IEEE Transactions on Information Theory, 42(6), 1737–1744. https://doi.org/10.1109/18.556670
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1994.365731
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
Blömer, J. (2002). Computing sums of radicals in polynomial time. [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. https://doi.org/10.1109/sfcs.1991.185434
LibreCat
| Files available
| DOI
2002 | Journal Article | LibreCat-ID: 35857
Blömer, J. (2002). Denesting by Bounded Degree Radicals. Algorithmica, 28(1), 2–15. https://doi.org/10.1007/s004530010028
LibreCat
| DOI
2002 | Misc | LibreCat-ID: 47698 |
Fricke, B. (2002). Construction of Pseudorandom Functions.
LibreCat
| Files available
2002 | Misc | LibreCat-ID: 47697
Deveci, D. (2002). Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems.
LibreCat
2002 | Misc | LibreCat-ID: 47699
Helbich, A. (2002). The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography.
LibreCat
2002 | Misc | LibreCat-ID: 47700
Schepers, D. (2002). Timing Attacks for Cryptosystems based on Elliptic Curves.
LibreCat
2002 | Bachelorsthesis | LibreCat-ID: 47633 |
Hoppe, U. (2002). Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47701 |
Krummel, V. (2001). Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47702 |
Otto, M. (2001). Brauer Addition-Subtraction Chains.
LibreCat
| Files available
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45022-x_22
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, J., & Seifert, J.-P. (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99. https://doi.org/10.1145/301250.301441
LibreCat
| Files available
| DOI
1998 | Journal Article | LibreCat-ID: 3028
Blömer, J., & Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. Technical Report/Departement of Computer Science, ETH Zürich.
LibreCat
| Files available
1997 | Book Chapter | LibreCat-ID: 3029
Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-63397-9_5
LibreCat
| Files available
| DOI
1997 | Journal Article | LibreCat-ID: 3033
Blömer, J., Karp, R., & Welzl, E. (1997). The rank of sparse random matrices over finite fields. Random Structures \& Algorithms, (4), 407–419. https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
LibreCat
| DOI