Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bl{\"o}mer, Johannes"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Analysis of agglomerative clustering
Marcel R. Ackermann
,
Johannes Blömer
,
Daniel Kuntze
,
Christian Sohler
Algorithmica
69
(1), 2014, pp. 184-215
Analysis of agglomerative clustering
Marcel R. Ackermann
,
Johannes Blömer
,
Daniel Kuntze
,
Christian Sohler
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 308-319
Bregman clustering for separable instances
Marcel R. Ackermann
,
Johannes Blömer
Lecture Notes in Computer Science
6139
, 2010, pp. 212-223
Teilen von Geheimnissen
Johannes Blömer
eXamen.press
, 2008, pp. 171-180
Sampling methods for shortest vectors, closest vectors and successive minima
Johannes Blömer
,
Stefanie Naewe
Lecture Notes in Computer Science
4596
, 2007, pp. 65-77
Closest vectors, successive minima, and dual HKZ-bases of lattices
Johannes Blömer
Lecture Notes in Computer Science
1853
, 2000, pp. 248-259
On the complexity of computing short linearly independent vectors and short bases in a lattice
Johannes Blömer
,
Jean-Pierre Seifert
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 711-720
A probabilistic zero-test for expressions involving roots of rational numbers
Johannes Blömer
Lecture Notes in Computer Science
1461
, 1998, pp. 151-162
Denesting by bounded degree radicals
Johannes Blömer
Lecture Notes in Computer Science
1284
, 1997, pp. 53-63
Priority encoding transmission
Andres Albanese
,
Johannes Blömer
,
Jeff Edmonds
,
Michael Luby
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 604-612
Resemblance and symmetries of geometric patterns
Helmut Alt
,
Johannes Blömer
Lecture Notes in Computer Science
594
, 1992, pp. 1-24
How to denest Ramanujan's nested radicals
Johannes Blömer
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 447-456
Computing sums of radicals in polynomial time
Johannes Blömer
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 670-677
Approximation of convex polygons
Helmut Alt
,
Johannes Blömer
,
Michael Godau
,
Hubert Wagener
Lecture Notes in Computer Science
443
, 1990, pp. 703-716