Johannes Blömer

	2011
48		Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler: Analysis of Agglomerative Clustering. STACS 2011: 308-319
47		Johannes Blömer: How to Share a Secret. Algorithms Unplugged 2011: 159-168
46		Johannes Blömer, Stefanie Naewe: Solving the Closest Vector Problem with respect to $\ell_p$ Norms CoRR abs/1104.3720: (2011)
45		Marcel R. Ackermann, Johannes Blömer, Christoph Scholz: Hardness and Non-Approximability of Bregman Clustering Problems. Electronic Colloquium on Computational Complexity (ECCC) 18: 15 (2011)
44		Johannes Blömer, Peter Günther, Gennadij Liske: Improved Side Channel Attacks on Pairing Based Cryptography. IACR Cryptology ePrint Archive 2011: 706 (2011)
	2010
43		Wilhelm Schäfer, Mauro Birattari, Johannes Blömer, Marco Dorigo, Gregor Engels, Rehan O'Grady, Marco Platzner, Franz-Josef Rammig, Wolfgang Reif, Ansgar Trächtler: Engineering self-coordinating software intensive systems. FoSER 2010: 321-324
42		Marcel R. Ackermann, Johannes Blömer: Bregman Clustering for Separable Instances. SWAT 2010: 212-223
41		Marcel R. Ackermann, Johannes Blömer, Christian Sohler: Clustering for metric and nonmetric distance measures. ACM Transactions on Algorithms 6(4): (2010)
40		Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler: Analysis of Agglomerative Clustering CoRR abs/1012.3697: (2010)
	2009
39		Marcel R. Ackermann, Johannes Blömer: Coresets and approximate clustering for Bregman divergences. SODA 2009: 1088-1097
38		Johannes Blömer, Stefanie Naewe: Sampling methods for shortest vectors, closest vectors and successive minima. Theor. Comput. Sci. 410(18): 1648-1665 (2009)
	2008
37		Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer: Cryptography, 16.09. - 21.09.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
36		Marcel R. Ackermann, Johannes Blömer, Christian Sohler: Clustering for metric and non-metric distance measures. SODA 2008: 799-808
35		Johannes Blömer: Teilen von Geheimnissen. Taschenbuch der Algorithmen 2008: 171-180
	2007
34		Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer: 07381 Abstracts Collection -- Cryptography. Cryptography 2007
33		Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer: 07381 Executive Summary - Cryptography. Cryptography 2007
32		Johannes Blömer, Stefanie Naewe: Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima. ICALP 2007: 65-77
31		Johannes Blömer, Volker Krummel: Analysis of Countermeasures Against Access Driven Cache Attacks on AES. Selected Areas in Cryptography 2007: 96-109
30		Johannes Blömer, Volker Krummel: Analysis of countermeasures against access driven cache attacks on AES. IACR Cryptology ePrint Archive 2007: 282 (2007)
	2006
29		Johannes Blömer, Volker Krummel: Fault Based Collision Attacks on AES. FDTC 2006: 106-120
28		Johannes Blömer, Martin Otto: Wagner's Attack on a Secure CRT-RSA Algorithm Reconsidered. FDTC 2006: 13-23
27		Johannes Blömer, Martin Otto, Jean-Pierre Seifert: Sign Change Fault Attacks on Elliptic Curve Cryptosystems. FDTC 2006: 36-52
26		Johannes Blömer: Randomness and Secrecy - A Brief Introduction. J. UCS 12(6): 654-671 (2006)
	2005
25		Johannes Blömer, Alexander May: A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. EUROCRYPT 2005: 251-267
	2004
24		Johannes Blömer, Alexander May: A Generalized Wiener Attack on RSA. Public Key Cryptography 2004: 1-13
23		Johannes Blömer, Jorge Guajardo, Volker Krummel: Provably Secure Masking of AES. Selected Areas in Cryptography 2004: 69-83
22		Johannes Blömer, Jorge Guajardo, Volker Krummel: Provably Secure Masking of AES. IACR Cryptology ePrint Archive 2004: 101 (2004)
21		Johannes Blömer, Martin Otto, Jean-Pierre Seifert: Sign Change Fault Attacks On Elliptic Curve Cryptosystems. IACR Cryptology ePrint Archive 2004: 227 (2004)
	2003
20		Johannes Blömer, Martin Otto, Jean-Pierre Seifert: A new CRT-RSA algorithm secure against bellcore attacks. ACM Conference on Computer and Communications Security 2003: 311-320
19		Johannes Blömer, Alexander May: New Partial Key Exposure Attacks on RSA. CRYPTO 2003: 27-43
18		Johannes Blömer, Jean-Pierre Seifert: Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). Financial Cryptography 2003: 162-181
	2002
17		Johannes Blömer, Jean-Pierre Seifert: Fault based cryptanalysis of the Advanced Encryption Standard. IACR Cryptology ePrint Archive 2002: 75 (2002)
	2001
16		Johannes Blömer, Alexander May: Low Secret Exponent RSA Revisited. CaLC 2001: 4-19
15		Johannes Blömer, Alexander May: Key Revocation with Interval Cover Families. Selected Areas in Cryptography 2001: 325-341
	2000
14		Johannes Blömer: Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. ICALP 2000: 248-259
13		Johannes Blömer: Denesting by Bounded Degree Radicals. Algorithmica 28(1): 2-15 (2000)
	1999
12		Johannes Blömer, Jean-Pierre Seifert: On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice. STOC 1999: 711-720
	1998
11		Johannes Blömer: A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers. ESA 1998: 151-162
	1997
10		Johannes Blömer: Denesting by Bounded Degree Radicals. ESA 1997: 53-63
9		Johannes Blömer, Richard M. Karp, Emo Welzl: The rank of sparse random matrices over finite fields. Random Struct. Algorithms 10(4): 407-419 (1997)
	1996
8		Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan: Priority encoding transmission. IEEE Transactions on Information Theory 42(6): 1737-1744 (1996)
	1995
7		Helmut Alt, Bernd Behrends, Johannes Blömer: Approximate Matching of Polygonal Shapes. Ann. Math. Artif. Intell. 13(3-4): 251-265 (1995)
	1994
6		Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan: Priority Encoding Transmission FOCS 1994: 604-612
	1992
5		Helmut Alt, Johannes Blömer: Resemblance and Symmetries of Geometric Patterns. Data Structures and Efficient Algorithms 1992: 1-24
4		Johannes Blömer: How to Denest Ramanujan's Nested Radicals FOCS 1992: 447-456
	1991
3		Johannes Blömer: Computing Sums of Radicals in Polynomial Time FOCS 1991: 670-677
2		Helmut Alt, Bernd Behrends, Johannes Blömer: Approximate Matching of Polygonal Shapes (Extended Abstract). Symposium on Computational Geometry 1991: 186-193
	1990
1		Helmut Alt, Johannes Blömer, Hubert Wagener: Approximation of Convex Polygons. ICALP 1990: 703-716

Coauthor Index

1	Marcel R. Ackermann	[36] [39] [40] [41] [42] [45] [48]
2	Andres Albanese	[6] [8]
3	Helmut Alt	[1] [2] [5] [7]
4	Bernd Behrends	[2] [7]
5	Mauro Birattari	[43]
6	Dan Boneh	[33] [34] [37]
7	Ronald Cramer	[33] [34] [37]
8	Marco Dorigo	[43]
9	Jeff Edmonds	[6] [8]
10	Gregor Engels	[43]
11	Jorge Guajardo	[22] [23]
12	Peter Günther	[44]
13	Richard M. Karp	[9]
14	Volker Krummel	[22] [23] [29] [30] [31]
15	Daniel Kuntze	[40] [48]
16	Gennadij Liske	[44]
17	Michael Luby	[6] [8]
18	Ueli Maurer (Ueli M. Maurer)	[33] [34] [37]
19	Alexander May	[15] [16] [19] [24] [25]
20	Stefanie Naewe	[32] [38] [46]
21	Rehan O'Grady	[43]
22	Martin Otto	[20] [21] [27] [28]
23	Marco Platzner	[43]
24	Franz Josef Rammig (Franz-Josef Rammig, Franz J. Rammig)	[43]
25	Wolfgang Reif	[43]
26	Wilhelm Schäfer	[43]
27	Christoph Scholz	[45]
28	Jean-Pierre Seifert	[12] [17] [18] [20] [21] [27]
29	Christian Sohler	[36] [40] [41] [48]
30	Madhu Sudan	[6] [8]
31	Ansgar Trächtler	[43]
32	Hubert Wagener	[1]
33	Emo Welzl	[9]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page