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
Hilfe
Suche: Author="Sohler, Christian"
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
A distributed O(1)-approximation algorithm for the uniform facility location problem
Joachim Gehweiler
,
Christiane Lammersen
,
Christian Sohler
Algorithmica
68
(3), 2014, pp. 643-670
What does the local structure of a planar graph tell us about its global structure?
Christian Sohler
Lecture Notes in Computer Science
8634
, 2014, pp. 44-49
BICO: BIRCH meets coresets for
k
-means clustering
Hendrik Fichtenberger
,
Marc Gillé
,
Melanie Schmidt
,
Chris Schwiegelshohn
,
Christian Sohler
Lecture Notes in Computer Science
8125
, 2013, pp. 481-492
Every property of hyperfinite graphs is testable
Ilan Newman
,
Christian Sohler
SIAM Journal on Computing
42
(3), 2013, pp. 1095-1112
Property testing in sparse directed graphs: Strong connectivity and subgraph-freeness
Frank Hellweg
,
Christian Sohler
Lecture Notes in Computer Science
7501
, 2012, pp. 599-610
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
Tolerant algorithms
Rolf Klein
,
Rainer Penninger
,
Christian Sohler
,
David P. Woodruff
Lecture Notes in Computer Science
6942
, 2011, pp. 736-747
Every property of hyperfinite graphs is testable
Ilan Newman
,
Christian Sohler
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 675-684
Subspace embeddings for the
L_1
-norm with applications
Christian Sohler
,
David P. Woodruff
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 755-764
Small space representations for metric min-sum
k
-clustering and their applications
Artur Czumaj
,
Christian Sohler
Theory of Computing Systems
46
(3), 2010, pp. 416-442
Testing Euclidean spanners
Frank Hellweg
,
Melanie Schmidt
,
Christian Sohler
Lecture Notes in Computer Science
6346
, 2010, pp. 60-71
A sublinear-time approximation scheme for bin packing
Tuğkan Batu
,
Petra Berenbrink
,
Christian Sohler
Theoretical Computer Science
410
(47-49), 2009, pp. 5082-5092
Testing hereditary properties of nonexpanding bounded-degree graphs
Artur Czumaj
,
Asaf Shapira
,
Christian Sohler
SIAM Journal on Computing
38
(6), 2009, pp. 2499-2510
Estimating the weight of metric minimum spanning trees in sublinear time
Artur Czumaj
,
Christian Sohler
SIAM Journal on Computing
39
(3), 2009, pp. 904-922
d
-dimensional knapsack in the streaming model
Sumit Ganguly
,
Christian Sohler
Lecture Notes in Computer Science
5757
, 2009, pp. 468-479
Streaming embeddings with slack
Christiane Lammersen
,
Anastasios Sidiropoulos
,
Christian Sohler
Lecture Notes in Computer Science
5664
, 2009, pp. 483-494
Facility location in dynamic geometric data streams
Christiane Lammersen
,
Christian Sohler
Lecture Notes in Computer Science
5193
, 2008, pp. 660-671
Estimating clustering indexes in data streams
Luciana S. Buriol
,
Gereon Frahling
,
Stefano Leonardi
,
Christian Sohler
Lecture Notes in Computer Science
4698
, 2007, pp. 618-632
Small space representations for metric min-sum
k
-clustering and their applications
Artur Czumaj
,
Christian Sohler
Lecture Notes in Computer Science
4393
, 2007, pp. 536-548
A distributed
O(1)
-approximation algorithm for the uniform facility location problem
Joachim Gehweiler
,
Christiane Lammersen
,
Christian Sohler
Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2006 (Cambridge, Massachusetts, USA, July 30 - August 2, 2006)
, 2006, pp. 237-243
Facility location in sublinear time
Mihai Bȃdoiu
,
Artur Czumaj
,
Piotr Indyk
,
Christian Sohler
Lecture Notes in Computer Science
3580
, 2005, pp. 866-877
Approximating the weight of the Euclidean minimum spanning tree in sublinear time
Artur Czumaj
,
Funda Ergün
,
Lance Fortnow
,
Avner Magen
,
Ilan Newman
,
Ronitt Rubinfeld
,
Christian Sohler
SIAM Journal on Computing
35
(1), 2005, pp. 91-109
Abstract combinatorial programs and efficient property testers
Artur Czumaj
,
Christian Sohler
SIAM Journal on Computing
34
(3), 2005, pp. 580-615
Testing hypergraph colorability
Artur Czumaj
,
Christian Sohler
Theoretical Computer Science
331
(1), 2005, pp. 37-52
Seiten 1
2
>