Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Christian Sohler
2010 – today
- 2013
[j20]Ilan Newman, Christian Sohler: Every Property of Hyperfinite Graphs Is Testable. SIAM J. Comput. 42(3): 1095-1112 (2013)- [c53]Hendrik Fichtenberger, Marc Gillé, Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler: BICO: BIRCH Meets Coresets for k-Means Clustering. ESA 2013: 481-492
- [c52]Dan Feldman, Melanie Schmidt, Christian Sohler: Turning big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering. SODA 2013: 1434-1453
- [c51]Artur Czumaj, Christiane Lammersen, Morteza Monemizadeh, Christian Sohler: (1+ Є)-approximation for facility location in data streams. SODA 2013: 1710-1728
- 2012
- [j19]Marcel R. Ackermann, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, Christian Sohler: StreamKM++: A clustering algorithm for data streams. ACM Journal of Experimental Algorithmics 17(1) (2012)
- [j18]Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, Till Tantau: Smoothed analysis of left-to-right maxima with applications. ACM Transactions on Algorithms 8(3): 30 (2012)
- [c50]Frank Hellweg, Christian Sohler: Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness. ESA 2012: 599-610
- [c49]
- [c48]Christiane Lammersen, Melanie Schmidt, Christian Sohler: Probabilistic k-Median Clustering in Data Streams. WAOA 2012: 70-81
- [i5]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler: Finding Cycles and Trees in Sublinear Time. Electronic Colloquium on Computational Complexity (ECCC) 19: 35 (2012)
- 2011
- [c47]Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff: Tolerant Algorithms. ESA 2011: 736-747
- [c46]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler: Planar Graphs: Random Walks and Bipartiteness Testing. FOCS 2011: 423-432
- [c45]Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler: Analysis of Agglomerative Clustering. STACS 2011: 308-319
- [c44]
- [c43]Christian Sohler, David P. Woodruff: Subspace embeddings for the L1-norm with applications. STOC 2011: 755-764
- 2010
- [j17]Artur Czumaj, Christian Sohler: Testing Expansion in Bounded-Degree Graphs. Combinatorics, Probability & Computing 19(5-6): 693-709 (2010)
- [j16]Artur Czumaj, Christian Sohler: Small Space Representations for Metric Min-sum k-Clustering and Their Applications. Theory Comput. Syst. 46(3): 416-442 (2010)
- [j15]Marcel R. Ackermann, Johannes Blömer, Christian Sohler: Clustering for metric and nonmetric distance measures. ACM Transactions on Algorithms 6(4) (2010)
- [c42]Marcel R. Ackermann, Christiane Lammersen, Marcus Märtens, Christoph Raupach, Christian Sohler, Kamil Swierkot: StreamKM++: A Clustering Algorithms for Data Streams. ALENEX 2010: 173-187
- [c41]
- [c40]
- [c39]Michal Adamaszek, Artur Czumaj, Christian Sohler: Testing Monotone Continuous Distributions on High-Dimensional Real Cubes. Property Testing 2010: 228-233
- [c38]Frank Hellweg, Melanie Schmidt, Christian Sohler: Testing Euclidean Spanners. Property Testing 2010: 306-311
- [c37]Michal Adamaszek, Artur Czumaj, Christian Sohler: Testing Monotone Continuous Distributions on High-dimensional Real Cubes. SODA 2010: 56-65
- [c36]Dan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff: Coresets and Sketches for High Dimensional Subspace Approximation Problems. SODA 2010: 630-649
- [r1]Artur Czumaj, Christian Sohler: Sublinear Clustering. Encyclopedia of Machine Learning 2010: 933-937
- [i4]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler: Finding Cycles and Trees in Sublinear Time. CoRR abs/1007.4230 (2010)
- [i3]Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler: Analysis of Agglomerative Clustering. CoRR abs/1012.3697 (2010)
2000 – 2009
- 2009
- [j14]Artur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs. SIAM J. Comput. 38(6): 2499-2510 (2009)
- [j13]Artur Czumaj, Christian Sohler: Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time. SIAM J. Comput. 39(3): 904-922 (2009)
- [j12]Tugkan Batu, Petra Berenbrink, Christian Sohler: A sublinear-time approximation scheme for bin packing. Theor. Comput. Sci. 410(47-49): 5082-5092 (2009)
- [c35]
- [c34]Christiane Lammersen, Anastasios Sidiropoulos, Christian Sohler: Streaming Embeddings with Slack. WADS 2009: 483-494
- 2008
- [j11]Gereon Frahling, Piotr Indyk, Christian Sohler: Sampling in Dynamic Data Streams and Applications. Int. J. Comput. Geometry Appl. 18(1/2): 3-28 (2008)
- [j10]Gereon Frahling, Christian Sohler: A Fast k-Means Implementation Using Coresets. Int. J. Comput. Geometry Appl. 18(6): 605-625 (2008)
- [j9]Artur Czumaj, Christian Sohler: Testing Euclidean minimum spanning trees in the plane. ACM Transactions on Algorithms 4(3) (2008)
- [c33]Christiane Lammersen, Christian Sohler: Facility Location in Dynamic Geometric Data Streams. ESA 2008: 660-671
- [c32]Marcel R. Ackermann, Johannes Blömer, Christian Sohler: Clustering for metric and non-metric distance measures. SODA 2008: 799-808
- 2007
- [j8]Artur Czumaj, Christian Sohler: Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms 30(1-2): 226-256 (2007)
- [c31]Artur Czumaj, Gereon Frahling, Christian Sohler: Efficient Kinetic Data Structures for MaxCut. CCCG 2007: 157-160
- [c30]Dan Feldman, Morteza Monemizadeh, Christian Sohler: A PTAS for k-means clustering based on weak coresets. Symposium on Computational Geometry 2007: 11-18
- [c29]Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler: Estimating Clustering Indexes in Data Streams. ESA 2007: 618-632
- [c28]
- [c27]
- [c26]Artur Czumaj, Christian Sohler: Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. STACS 2007: 536-548
- [i2]Artur Czumaj, Asaf Shapira, Christian Sohler: Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(083) (2007)
- 2006
- [j7]
- [j6]Joachim Gehweiler, Christiane Lammersen, Christian Sohler: A Distributed Algorithm for the Facility Location Problem. Electronic Notes in Discrete Mathematics 25: 91 (2006)
- [c25]Gereon Frahling, Christian Sohler: A fast k-means implementation using coresets. Symposium on Computational Geometry 2006: 135-143
- [c24]Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler: Counting triangles in data streams. PODS 2006: 253-262
- [c23]Joachim Gehweiler, Christiane Lammersen, Christian Sohler: A distributed O(1)-approximation algorithm for the uniform facility location problem. SPAA 2006: 237-243
- [e1]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler (Eds.): Sublinear Algorithms, 17.07. - 22.07.2005. Dagstuhl Seminar Proceedings 05291, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- 2005
- [j5]Christian Sohler: Fast reconstruction of Delaunay triangulations. Comput. Geom. 31(3): 166-178 (2005)
- [j4]Artur Czumaj, Christian Sohler: Abstract Combinatorial Programs and Efficient Property Testers. SIAM J. Comput. 34(3): 580-615 (2005)
- [j3]Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM J. Comput. 35(1): 91-109 (2005)
- [j2]Artur Czumaj, Christian Sohler: Testing hypergraph colorability. Theor. Comput. Sci. 331(1): 37-52 (2005)
- [c22]Gereon Frahling, Piotr Indyk, Christian Sohler: Sampling in dynamic data streams and applications. Symposium on Computational Geometry 2005: 142-149
- [c21]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler: 05291 Abstracts Collection -- Sublinear Algorithms. Sublinear Algorithms 2005
- [c20]Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler: Facility Location in Sublinear Time. ICALP 2005: 866-877
- [c19]
- [i1]Marcin Bienkowski, Valentina Damerow, Friedhelm Meyer auf der Heide, Christian Sohler: Average case complexity of Voronoi diagrams of n sites from the unit cube. EuroCG 2005: 167-170
- 2004
- [c18]
- [c17]
- [c16]Artur Czumaj, Christian Sohler: Sublinear-Time Approximation for Clustering Via Random Sampling. ICALP 2004: 396-407
- [c15]Artur Czumaj, Christian Sohler: Estimating the weight of metric minimum spanning trees in sublinear-time. STOC 2004: 175-183
- [c14]Jens Krokowski, Harald Räcke, Christian Sohler, Matthias Westermann: Reducing State Changes with a Pipeline Buffer. VMV 2004: 217
- 2003
- [j1]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion In Graphs. Combinatorics, Probability & Computing 12(3): 225-244 (2003)
- [c13]Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler: Smoothed Motion Complexity. ESA 2003: 161-171
- [c12]Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler: Sublinear-time approximation of Euclidean minimum spanning tree. SODA 2003: 813-822
- 2002
- [c11]Harald Räcke, Christian Sohler, Matthias Westermann: Online Scheduling for Sorting Buffers. ESA 2002: 820-832
- [c10]Artur Czumaj, Christian Sohler: Abstract Combinatorial Programs and Efficient Property Testers. FOCS 2002: 83-92
- [c9]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking: Randomized Pursuit-Evasion in Graphs. ICALP 2002: 901-912
- 2001
- [c8]
- [c7]
- [c6]
- 2000
- [c5]
- [c4]Artur Czumaj, Christian Sohler, Martin Ziegler: Property Testing in Computational Geometry. ESA 2000: 155-166
1990 – 1999
- 1999
- [c3]
- [c2]
- 1997
- [c1]Markus Denny, Christian Sohler: Encoding a triangulation as a permutation of its point set. CCCG 1997
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:07 CEST by the dblp team