Johannes Blömer

Codes und Kryptographie
bloemer@zitmail.uni-paderborn.de
ID
23

80 Publications

Mark all

[80]
2023 | Conference Paper | LibreCat-ID: 44855
S. Hemmrich, J. Bobolz, D. Beverungen, and J. Blömer, “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain,” presented at the ECIS 2023, 2023.
LibreCat | Files available | Download (ext.)
 
[79]
2023 | Book Chapter | LibreCat-ID: 45901 | OA
J. Blömer, J. Bobolz, F. Eidens, T. Jager, and P. Kramer, “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–246.
LibreCat | Files available | DOI
 
[78]
2023 | Book Chapter | LibreCat-ID: 45891 | OA
J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness and Security,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–164.
LibreCat | Files available | DOI
 
[77]
2023 | Conference Paper | LibreCat-ID: 35014 | OA
J. Blömer, J. Bobolz, and H. Bröcher, “On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC,” presented at the TCC 2023, Taipeh, Taiwan, 2023.
LibreCat | Download (ext.)
 
[76]
2023 | Conference Paper | LibreCat-ID: 43458 | OA
J. Blömer, J. Bobolz, and L. A. Porzenheim, “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” presented at the Asiacrypt 2023, Guangzhou, China, 2023.
LibreCat | Download (ext.)
 
[75]
2020 | Journal Article | LibreCat-ID: 20888
J. Blömer, S. Brauer, and K. Bujna, “A Complexity Theoretical Study of Fuzzy K-Means,” ACM Transactions on Algorithms, vol. 16, no. 4, pp. 1–25, 2020.
LibreCat | DOI
 
[74]
2020 | Journal Article | LibreCat-ID: 10790
J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models,” Advances in Data Analysis and Classification, vol. 14, pp. 147–173, 2020.
LibreCat | DOI
 
[73]
2019 | Conference Paper | LibreCat-ID: 13554 | OA
J. Blömer and N. Löken, “Personal Cross-Platform Reputation,” in Security and Trust Management, STM 2019, 2019, vol. 11738.
LibreCat | Files available | DOI
 
[72]
2019 | Conference Paper | LibreCat-ID: 13557 | OA
J. Blömer and N. Löken, “Dynamic Searchable Encryption with Access Control,” in 12th International Symposium on Foundations and Practice of Security, FPS 2019, 2019, vol. 12056.
LibreCat | Download (ext.)
 
[71]
2019 | Conference Paper | LibreCat-ID: 13904 | OA
J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous Credentials and Applications to Incentive Systems,” presented at the 26th ACM Conference on Computer and Communications Security, London, 2019, doi: 10.1145/3319535.3354223.
LibreCat | Files available | DOI | Download (ext.)
 
[70]
2018 | Conference Paper | LibreCat-ID: 2862 | OA
J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, San Francisco, CA, USA, 2018, pp. 470–490.
LibreCat | Files available | DOI | Download (ext.)
 
[69]
2018 | Journal Article | LibreCat-ID: 2685
J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, pp. 314–338, 2018.
LibreCat | Files available | DOI
 
[68]
2018 | Conference Paper | LibreCat-ID: 3265 | OA
K. Bemmann et al., “Fully-Featured Anonymous Credentials with Reputation System,” in Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, Hamburg, Germany.
LibreCat | Files available | DOI | Download (ext.)
 
[67]
2018 | Conference Paper | LibreCat-ID: 2965
J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, Hamburg, Germany, pp. 25:1--25:10.
LibreCat | Files available | DOI
 
[66]
2018 | Working Paper | LibreCat-ID: 5820
J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments. .
LibreCat | Files available
 
[65]
2018 | Conference Paper | LibreCat-ID: 4344
J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,” in 29th International Symposium on Algorithms and Computation  (ISAAC 2018), Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.
LibreCat | DOI
 
[64]
2018 | Conference Paper | LibreCat-ID: 3873 | OA
J. Blömer, F. Eidens, and J. Juhnke, “Enhanced Security of Attribute-Based Signatures,” in The International Conference on Cryptology And Network Security (CANS), Naples, Italy, 2018, vol. 11124, pp. 235–255, doi: 10.1007/978-3-030-00434-7_12.
LibreCat | Files available | DOI | Download (ext.)
 
[63]
2018 | Conference Paper | LibreCat-ID: 2379 | OA
J. Blömer and J. Bobolz, “Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures,” presented at the The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium, doi: 10.1007/978-3-319-93387-0_12.
LibreCat | Files available | DOI | Download (ext.)
 
[62]
2017 | Conference Paper | LibreCat-ID: 2967 | OA
J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate Encryption with Public Index,” in Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), 2017, vol. 10693, pp. 438–453.
LibreCat | Files available | DOI | Download (ext.)
 
[61]
2017 | Conference Paper | LibreCat-ID: 2344 | OA
J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations,” in Foundations and Practice of Security, 2017, pp. 3–17.
LibreCat | Files available | DOI
 
[60]
2016 | Conference Paper | LibreCat-ID: 2947
J. Blömer and P. Günther, “Singular Curve Point Decompression Attack,” in 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), 2016.
LibreCat | DOI
 
[59]
2016 | Book Chapter | LibreCat-ID: 2968
J. Blömer, C. Lammersen, M. Schmidt, and C. Sohler, “Theoretical Analysis of the k-Means Algorithm – A Survey,” in Algorithm Engineering, Cham: Springer International Publishing, 2016, pp. 81–116.
LibreCat | DOI
 
[58]
2016 | Preprint | LibreCat-ID: 2969 | OA
J. Blömer, S. Brauer, and K. Bujna, “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.
LibreCat | Download (ext.)
 
[57]
2016 | Book Chapter | LibreCat-ID: 2970
J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in Advances in Knowledge Discovery and Data Mining, Cham: Springer International Publishing, 2016, pp. 296–308.
LibreCat | DOI
 
[56]
2016 | Report | LibreCat-ID: 2971
J. Blömer and P. Günther, Effizienz und Sicherheit paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
LibreCat
 
[55]
2016 | Conference Paper | LibreCat-ID: 2367
J. Blömer, S. Brauer, and K. Bujna, “A Theoretical Analysis of the Fuzzy K-Means Problem,” in 2016 IEEE 16th International Conference on Data Mining (ICDM), Barcelona, Spain, 2016, pp. 805–810.
LibreCat | DOI
 
[54]
2016 | Conference Paper | LibreCat-ID: 208
J. Blömer and G. Liske, “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes,” in Proceedings of the CT-RSA 2016, 2016, pp. 431–447.
LibreCat | Files available | DOI
 
[53]
2016 | Book Chapter | LibreCat-ID: 2978
J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in Advances in Knowledge Discovery and Data Mining, Cham: Springer International Publishing, 2016, pp. 296–308.
LibreCat | DOI
 
[52]
2015 | Conference Paper | LibreCat-ID: 253
J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed Traceability,” in Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.
LibreCat | Files available | DOI
 
[51]
2015 | Conference Paper | LibreCat-ID: 322 | OA
J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.
LibreCat | Files available | DOI | Download (ext.)
 
[50]
2015 | Report | LibreCat-ID: 233 | OA
J. Blömer and K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.
LibreCat | Files available | Download (ext.)
 
[49]
2014 | Conference Paper | LibreCat-ID: 355
J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,” in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.
LibreCat | Files available | DOI
 
[48]
2014 | Journal Article | LibreCat-ID: 2976
M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler, “Analysis of Agglomerative Clustering,” Algorithmica, vol. 69, 2014.
LibreCat | DOI
 
[47]
2014 | Conference Paper | LibreCat-ID: 2977
J. Blömer, K. Bujna, and D. Kuntze, “A Theoretical and Experimental Comparison of the EM and SEM Algorithm,” in 2014 22nd International Conference on Pattern Recognition, 2014.
LibreCat | DOI
 
[46]
2014 | Preprint | LibreCat-ID: 442 | OA
J. Blömer and G. Liske, “Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions.” Universität Paderborn, 2014.
LibreCat | Files available | Download (ext.)
 
[45]
2014 | Conference Paper | LibreCat-ID: 463
J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation,” in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136.
LibreCat | Files available | DOI
 
[44]
2013 | Book Chapter | LibreCat-ID: 2979
J. Blömer, P. Günther, and G. Liske, “Improved Side Channel Attacks on Pairing Based Cryptography,” in Constructive Side-Channel Analysis and Secure Design, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 154–168.
LibreCat | DOI
 
[43]
2013 | Conference Paper | LibreCat-ID: 488
J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study,” in Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.
LibreCat | Files available
 
[42]
2013 | Preprint | LibreCat-ID: 538 | OA
J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.
LibreCat | Files available | Download (ext.)
 
[41]
2012 | Journal Article | LibreCat-ID: 2984
J. Blömer, “Turing und Kryptografie,” Informatik-Spektrum, vol. 35, no. 4, 2012.
LibreCat | DOI
 
[40]
2011 | Conference Paper | LibreCat-ID: 2985
M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability of Bregman Clustering Problems.” 2011.
LibreCat
 
[39]
2011 | Book Chapter | LibreCat-ID: 2986
J. Blömer, “How to Share a Secret,” in Algorithms Unplugged, Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.
LibreCat | DOI
 
[38]
2011 | Preprint | LibreCat-ID: 2987
J. Blömer and S. Naewe, “Solving the Closest Vector Problem with respect to Lp Norms,” arXiv:1104.3720. 2011.
LibreCat
 
[37]
2010 | Book Chapter | LibreCat-ID: 2988
M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,” in SWAT 2010, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 212–223.
LibreCat | DOI
 
[36]
2010 | Journal Article | LibreCat-ID: 2990
M. R. Ackermann, J. Blömer, and C. Sohler, “Clustering for Metric and Nonmetric Distance Measures,” ACM Trans. Algorithms, no. 4, pp. 59:1--59:26, 2010.
LibreCat | DOI
 
[35]
2010 | Journal Article | LibreCat-ID: 2991
A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, and J. Blömer, “On the initialization of dynamic models for speech features,” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat
 
[34]
2010 | Conference Paper | LibreCat-ID: 2994
W. Schäfer et al., “Engineering self-coordinating software intensive systems,” in Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10, 2010.
LibreCat | DOI
 
[33]
2009 | Book Chapter | LibreCat-ID: 2995
M. R. Ackermann and J. Blömer, “Coresets and Approximate Clustering for Bregman Divergences,” in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009, pp. 1088–1097.
LibreCat | DOI
 
[32]
2009 | Journal Article | LibreCat-ID: 2999
J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” Theoretical Computer Science, vol. 410, no. 18, pp. 1648–1665, 2009, doi: 10.1016/j.tcs.2008.12.045.
LibreCat | DOI
 
[31]
2007 | Book Chapter | LibreCat-ID: 3002 | OA
J. Blömer and V. Krummel, “Analysis of Countermeasures Against Access Driven Cache Attacks on AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 96–109.
LibreCat | DOI | Download (ext.)
 
[30]
2007 | Book Chapter | LibreCat-ID: 3020
J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.
LibreCat | DOI
 
[29]
2007 | Book Chapter | LibreCat-ID: 3021
J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.
LibreCat | DOI
 
[28]
2007 | Book Chapter | LibreCat-ID: 3026
J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.
LibreCat | DOI
 
[27]
2007 | Conference Paper | LibreCat-ID: 55571
J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” in Proceedings of the 34th ICALP, 2007, vol. 4596, pp. 65–77.
LibreCat
 
[26]
2006 | Journal Article | LibreCat-ID: 3003
J. Blömer, “Randomness and Secrecy - A Brief Introduction,” Journal of Universal Computer Science (J.UCS), no. 6, pp. 654--671, 2006.
LibreCat | DOI
 
[25]
2006 | Book Chapter | LibreCat-ID: 3004
J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120.
LibreCat | DOI
 
[24]
2006 | Book Chapter | LibreCat-ID: 3005
J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.
LibreCat | DOI
 
[23]
2006 | Book Chapter | LibreCat-ID: 3007
J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52.
LibreCat | Files available | DOI
 
[22]
2005 | Book Chapter | LibreCat-ID: 3006
J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.
LibreCat | Files available | DOI
 
[21]
2004 | Book Chapter | LibreCat-ID: 3011
J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.
LibreCat | DOI
 
[20]
2004 | Book Chapter | LibreCat-ID: 3012
J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.
LibreCat | Files available | DOI
 
[19]
2004 | Conference Paper | LibreCat-ID: 3017
J. Blömer, M. Otto, and J.-P. Seifert, “A new CRT-RSA algorithm secure against bellcore attacks,” in Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03, 2004.
LibreCat | DOI
 
[18]
2003 | Book Chapter | LibreCat-ID: 3016
J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.
LibreCat | DOI
 
[17]
2003 | Book Chapter | LibreCat-ID: 3018
J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.
LibreCat | DOI
 
[16]
2002 | Journal Article | LibreCat-ID: 3034
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1737–1744, 2002.
LibreCat | Files available | DOI
 
[15]
2002 | Conference Paper | LibreCat-ID: 3040
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” in Proceedings 35th Annual Symposium on Foundations of Computer Science, 2002.
LibreCat | DOI
 
[14]
2002 | Conference Paper | LibreCat-ID: 3041
J. Blömer, “Computing sums of radicals in polynomial time,” 2002, doi: 10.1109/sfcs.1991.185434.
LibreCat | Files available | DOI
 
[13]
2000 | Book Chapter | LibreCat-ID: 3023
J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,” in Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 248–259.
LibreCat | DOI
 
[12]
1999 | Conference Paper | LibreCat-ID: 3024
J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly independent vectors and short bases in a lattice,” 1999, doi: 10.1145/301250.301441.
LibreCat | Files available | DOI
 
[11]
1998 | Journal Article | LibreCat-ID: 3028
J. Blömer and B. Trachsler, “A lower bound for a class of graph based loss resilient codes,” Technical report/Departement of Computer Science, ETH Zürich, 1998.
LibreCat | Files available
 
[10]
1997 | Book Chapter | LibreCat-ID: 3029
J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.
LibreCat | Files available | DOI
 
[9]
1997 | Journal Article | LibreCat-ID: 3033
J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over finite fields,” Random Structures \& Algorithms, no. 4, pp. 407–419, 1997.
LibreCat | DOI
 
[8]
1995 | Journal Article | LibreCat-ID: 3037
H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
LibreCat
 
[7]
1995 | Report | LibreCat-ID: 3038
J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, An XOR-based erasure-resilient coding scheme. Berkeley, USA, 1995.
LibreCat | Files available
 
[6]
1992 | Dissertation | LibreCat-ID: 3043
J. Blömer, Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
LibreCat | Files available
 
[5]
1992 | Book Chapter | LibreCat-ID: 3046
H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.
LibreCat | DOI
 
[4]
1992 | Conference Paper | LibreCat-ID: 3047
J. Blömer, “How to denest Ramanujan’s nested radicals,” in Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992.
LibreCat | DOI
 
[3]
1991 | Conference Paper | LibreCat-ID: 3048
H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes (extended abstract),” in Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91, 1991.
LibreCat | DOI
 
[2]
1991 | Conference Paper | LibreCat-ID: 3049
J. Blömer, “Computing sums of radicals in polynomial time,” in Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991.
LibreCat | DOI
 
[1]
1990 | Book Chapter | LibreCat-ID: 3050
H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.
LibreCat | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

80 Publications

Mark all

[80]
2023 | Conference Paper | LibreCat-ID: 44855
S. Hemmrich, J. Bobolz, D. Beverungen, and J. Blömer, “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain,” presented at the ECIS 2023, 2023.
LibreCat | Files available | Download (ext.)
 
[79]
2023 | Book Chapter | LibreCat-ID: 45901 | OA
J. Blömer, J. Bobolz, F. Eidens, T. Jager, and P. Kramer, “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–246.
LibreCat | Files available | DOI
 
[78]
2023 | Book Chapter | LibreCat-ID: 45891 | OA
J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness and Security,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–164.
LibreCat | Files available | DOI
 
[77]
2023 | Conference Paper | LibreCat-ID: 35014 | OA
J. Blömer, J. Bobolz, and H. Bröcher, “On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC,” presented at the TCC 2023, Taipeh, Taiwan, 2023.
LibreCat | Download (ext.)
 
[76]
2023 | Conference Paper | LibreCat-ID: 43458 | OA
J. Blömer, J. Bobolz, and L. A. Porzenheim, “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” presented at the Asiacrypt 2023, Guangzhou, China, 2023.
LibreCat | Download (ext.)
 
[75]
2020 | Journal Article | LibreCat-ID: 20888
J. Blömer, S. Brauer, and K. Bujna, “A Complexity Theoretical Study of Fuzzy K-Means,” ACM Transactions on Algorithms, vol. 16, no. 4, pp. 1–25, 2020.
LibreCat | DOI
 
[74]
2020 | Journal Article | LibreCat-ID: 10790
J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models,” Advances in Data Analysis and Classification, vol. 14, pp. 147–173, 2020.
LibreCat | DOI
 
[73]
2019 | Conference Paper | LibreCat-ID: 13554 | OA
J. Blömer and N. Löken, “Personal Cross-Platform Reputation,” in Security and Trust Management, STM 2019, 2019, vol. 11738.
LibreCat | Files available | DOI
 
[72]
2019 | Conference Paper | LibreCat-ID: 13557 | OA
J. Blömer and N. Löken, “Dynamic Searchable Encryption with Access Control,” in 12th International Symposium on Foundations and Practice of Security, FPS 2019, 2019, vol. 12056.
LibreCat | Download (ext.)
 
[71]
2019 | Conference Paper | LibreCat-ID: 13904 | OA
J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous Credentials and Applications to Incentive Systems,” presented at the 26th ACM Conference on Computer and Communications Security, London, 2019, doi: 10.1145/3319535.3354223.
LibreCat | Files available | DOI | Download (ext.)
 
[70]
2018 | Conference Paper | LibreCat-ID: 2862 | OA
J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, San Francisco, CA, USA, 2018, pp. 470–490.
LibreCat | Files available | DOI | Download (ext.)
 
[69]
2018 | Journal Article | LibreCat-ID: 2685
J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, pp. 314–338, 2018.
LibreCat | Files available | DOI
 
[68]
2018 | Conference Paper | LibreCat-ID: 3265 | OA
K. Bemmann et al., “Fully-Featured Anonymous Credentials with Reputation System,” in Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, Hamburg, Germany.
LibreCat | Files available | DOI | Download (ext.)
 
[67]
2018 | Conference Paper | LibreCat-ID: 2965
J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, Hamburg, Germany, pp. 25:1--25:10.
LibreCat | Files available | DOI
 
[66]
2018 | Working Paper | LibreCat-ID: 5820
J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments. .
LibreCat | Files available
 
[65]
2018 | Conference Paper | LibreCat-ID: 4344
J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,” in 29th International Symposium on Algorithms and Computation  (ISAAC 2018), Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.
LibreCat | DOI
 
[64]
2018 | Conference Paper | LibreCat-ID: 3873 | OA
J. Blömer, F. Eidens, and J. Juhnke, “Enhanced Security of Attribute-Based Signatures,” in The International Conference on Cryptology And Network Security (CANS), Naples, Italy, 2018, vol. 11124, pp. 235–255, doi: 10.1007/978-3-030-00434-7_12.
LibreCat | Files available | DOI | Download (ext.)
 
[63]
2018 | Conference Paper | LibreCat-ID: 2379 | OA
J. Blömer and J. Bobolz, “Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures,” presented at the The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium, doi: 10.1007/978-3-319-93387-0_12.
LibreCat | Files available | DOI | Download (ext.)
 
[62]
2017 | Conference Paper | LibreCat-ID: 2967 | OA
J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate Encryption with Public Index,” in Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), 2017, vol. 10693, pp. 438–453.
LibreCat | Files available | DOI | Download (ext.)
 
[61]
2017 | Conference Paper | LibreCat-ID: 2344 | OA
J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations,” in Foundations and Practice of Security, 2017, pp. 3–17.
LibreCat | Files available | DOI
 
[60]
2016 | Conference Paper | LibreCat-ID: 2947
J. Blömer and P. Günther, “Singular Curve Point Decompression Attack,” in 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), 2016.
LibreCat | DOI
 
[59]
2016 | Book Chapter | LibreCat-ID: 2968
J. Blömer, C. Lammersen, M. Schmidt, and C. Sohler, “Theoretical Analysis of the k-Means Algorithm – A Survey,” in Algorithm Engineering, Cham: Springer International Publishing, 2016, pp. 81–116.
LibreCat | DOI
 
[58]
2016 | Preprint | LibreCat-ID: 2969 | OA
J. Blömer, S. Brauer, and K. Bujna, “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.
LibreCat | Download (ext.)
 
[57]
2016 | Book Chapter | LibreCat-ID: 2970
J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in Advances in Knowledge Discovery and Data Mining, Cham: Springer International Publishing, 2016, pp. 296–308.
LibreCat | DOI
 
[56]
2016 | Report | LibreCat-ID: 2971
J. Blömer and P. Günther, Effizienz und Sicherheit paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
LibreCat
 
[55]
2016 | Conference Paper | LibreCat-ID: 2367
J. Blömer, S. Brauer, and K. Bujna, “A Theoretical Analysis of the Fuzzy K-Means Problem,” in 2016 IEEE 16th International Conference on Data Mining (ICDM), Barcelona, Spain, 2016, pp. 805–810.
LibreCat | DOI
 
[54]
2016 | Conference Paper | LibreCat-ID: 208
J. Blömer and G. Liske, “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes,” in Proceedings of the CT-RSA 2016, 2016, pp. 431–447.
LibreCat | Files available | DOI
 
[53]
2016 | Book Chapter | LibreCat-ID: 2978
J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in Advances in Knowledge Discovery and Data Mining, Cham: Springer International Publishing, 2016, pp. 296–308.
LibreCat | DOI
 
[52]
2015 | Conference Paper | LibreCat-ID: 253
J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed Traceability,” in Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.
LibreCat | Files available | DOI
 
[51]
2015 | Conference Paper | LibreCat-ID: 322 | OA
J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.
LibreCat | Files available | DOI | Download (ext.)
 
[50]
2015 | Report | LibreCat-ID: 233 | OA
J. Blömer and K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.
LibreCat | Files available | Download (ext.)
 
[49]
2014 | Conference Paper | LibreCat-ID: 355
J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,” in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.
LibreCat | Files available | DOI
 
[48]
2014 | Journal Article | LibreCat-ID: 2976
M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler, “Analysis of Agglomerative Clustering,” Algorithmica, vol. 69, 2014.
LibreCat | DOI
 
[47]
2014 | Conference Paper | LibreCat-ID: 2977
J. Blömer, K. Bujna, and D. Kuntze, “A Theoretical and Experimental Comparison of the EM and SEM Algorithm,” in 2014 22nd International Conference on Pattern Recognition, 2014.
LibreCat | DOI
 
[46]
2014 | Preprint | LibreCat-ID: 442 | OA
J. Blömer and G. Liske, “Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions.” Universität Paderborn, 2014.
LibreCat | Files available | Download (ext.)
 
[45]
2014 | Conference Paper | LibreCat-ID: 463
J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation,” in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136.
LibreCat | Files available | DOI
 
[44]
2013 | Book Chapter | LibreCat-ID: 2979
J. Blömer, P. Günther, and G. Liske, “Improved Side Channel Attacks on Pairing Based Cryptography,” in Constructive Side-Channel Analysis and Secure Design, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 154–168.
LibreCat | DOI
 
[43]
2013 | Conference Paper | LibreCat-ID: 488
J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study,” in Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.
LibreCat | Files available
 
[42]
2013 | Preprint | LibreCat-ID: 538 | OA
J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.
LibreCat | Files available | Download (ext.)
 
[41]
2012 | Journal Article | LibreCat-ID: 2984
J. Blömer, “Turing und Kryptografie,” Informatik-Spektrum, vol. 35, no. 4, 2012.
LibreCat | DOI
 
[40]
2011 | Conference Paper | LibreCat-ID: 2985
M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability of Bregman Clustering Problems.” 2011.
LibreCat
 
[39]
2011 | Book Chapter | LibreCat-ID: 2986
J. Blömer, “How to Share a Secret,” in Algorithms Unplugged, Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.
LibreCat | DOI
 
[38]
2011 | Preprint | LibreCat-ID: 2987
J. Blömer and S. Naewe, “Solving the Closest Vector Problem with respect to Lp Norms,” arXiv:1104.3720. 2011.
LibreCat
 
[37]
2010 | Book Chapter | LibreCat-ID: 2988
M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,” in SWAT 2010, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 212–223.
LibreCat | DOI
 
[36]
2010 | Journal Article | LibreCat-ID: 2990
M. R. Ackermann, J. Blömer, and C. Sohler, “Clustering for Metric and Nonmetric Distance Measures,” ACM Trans. Algorithms, no. 4, pp. 59:1--59:26, 2010.
LibreCat | DOI
 
[35]
2010 | Journal Article | LibreCat-ID: 2991
A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, and J. Blömer, “On the initialization of dynamic models for speech features,” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat
 
[34]
2010 | Conference Paper | LibreCat-ID: 2994
W. Schäfer et al., “Engineering self-coordinating software intensive systems,” in Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10, 2010.
LibreCat | DOI
 
[33]
2009 | Book Chapter | LibreCat-ID: 2995
M. R. Ackermann and J. Blömer, “Coresets and Approximate Clustering for Bregman Divergences,” in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009, pp. 1088–1097.
LibreCat | DOI
 
[32]
2009 | Journal Article | LibreCat-ID: 2999
J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” Theoretical Computer Science, vol. 410, no. 18, pp. 1648–1665, 2009, doi: 10.1016/j.tcs.2008.12.045.
LibreCat | DOI
 
[31]
2007 | Book Chapter | LibreCat-ID: 3002 | OA
J. Blömer and V. Krummel, “Analysis of Countermeasures Against Access Driven Cache Attacks on AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 96–109.
LibreCat | DOI | Download (ext.)
 
[30]
2007 | Book Chapter | LibreCat-ID: 3020
J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.
LibreCat | DOI
 
[29]
2007 | Book Chapter | LibreCat-ID: 3021
J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.
LibreCat | DOI
 
[28]
2007 | Book Chapter | LibreCat-ID: 3026
J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.
LibreCat | DOI
 
[27]
2007 | Conference Paper | LibreCat-ID: 55571
J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” in Proceedings of the 34th ICALP, 2007, vol. 4596, pp. 65–77.
LibreCat
 
[26]
2006 | Journal Article | LibreCat-ID: 3003
J. Blömer, “Randomness and Secrecy - A Brief Introduction,” Journal of Universal Computer Science (J.UCS), no. 6, pp. 654--671, 2006.
LibreCat | DOI
 
[25]
2006 | Book Chapter | LibreCat-ID: 3004
J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120.
LibreCat | DOI
 
[24]
2006 | Book Chapter | LibreCat-ID: 3005
J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.
LibreCat | DOI
 
[23]
2006 | Book Chapter | LibreCat-ID: 3007
J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52.
LibreCat | Files available | DOI
 
[22]
2005 | Book Chapter | LibreCat-ID: 3006
J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.
LibreCat | Files available | DOI
 
[21]
2004 | Book Chapter | LibreCat-ID: 3011
J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.
LibreCat | DOI
 
[20]
2004 | Book Chapter | LibreCat-ID: 3012
J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.
LibreCat | Files available | DOI
 
[19]
2004 | Conference Paper | LibreCat-ID: 3017
J. Blömer, M. Otto, and J.-P. Seifert, “A new CRT-RSA algorithm secure against bellcore attacks,” in Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03, 2004.
LibreCat | DOI
 
[18]
2003 | Book Chapter | LibreCat-ID: 3016
J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.
LibreCat | DOI
 
[17]
2003 | Book Chapter | LibreCat-ID: 3018
J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.
LibreCat | DOI
 
[16]
2002 | Journal Article | LibreCat-ID: 3034
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1737–1744, 2002.
LibreCat | Files available | DOI
 
[15]
2002 | Conference Paper | LibreCat-ID: 3040
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” in Proceedings 35th Annual Symposium on Foundations of Computer Science, 2002.
LibreCat | DOI
 
[14]
2002 | Conference Paper | LibreCat-ID: 3041
J. Blömer, “Computing sums of radicals in polynomial time,” 2002, doi: 10.1109/sfcs.1991.185434.
LibreCat | Files available | DOI
 
[13]
2000 | Book Chapter | LibreCat-ID: 3023
J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,” in Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 248–259.
LibreCat | DOI
 
[12]
1999 | Conference Paper | LibreCat-ID: 3024
J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly independent vectors and short bases in a lattice,” 1999, doi: 10.1145/301250.301441.
LibreCat | Files available | DOI
 
[11]
1998 | Journal Article | LibreCat-ID: 3028
J. Blömer and B. Trachsler, “A lower bound for a class of graph based loss resilient codes,” Technical report/Departement of Computer Science, ETH Zürich, 1998.
LibreCat | Files available
 
[10]
1997 | Book Chapter | LibreCat-ID: 3029
J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.
LibreCat | Files available | DOI
 
[9]
1997 | Journal Article | LibreCat-ID: 3033
J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over finite fields,” Random Structures \& Algorithms, no. 4, pp. 407–419, 1997.
LibreCat | DOI
 
[8]
1995 | Journal Article | LibreCat-ID: 3037
H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
LibreCat
 
[7]
1995 | Report | LibreCat-ID: 3038
J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, An XOR-based erasure-resilient coding scheme. Berkeley, USA, 1995.
LibreCat | Files available
 
[6]
1992 | Dissertation | LibreCat-ID: 3043
J. Blömer, Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
LibreCat | Files available
 
[5]
1992 | Book Chapter | LibreCat-ID: 3046
H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in Data structures and efficient algorithms, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.
LibreCat | DOI
 
[4]
1992 | Conference Paper | LibreCat-ID: 3047
J. Blömer, “How to denest Ramanujan’s nested radicals,” in Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992.
LibreCat | DOI
 
[3]
1991 | Conference Paper | LibreCat-ID: 3048
H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes (extended abstract),” in Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91, 1991.
LibreCat | DOI
 
[2]
1991 | Conference Paper | LibreCat-ID: 3049
J. Blömer, “Computing sums of radicals in polynomial time,” in Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991.
LibreCat | DOI
 
[1]
1990 | Book Chapter | LibreCat-ID: 3050
H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.
LibreCat | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed