Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Sohler
Person information
- affiliation: University of Cologne, Germany
- affiliation (former): Dortmund University of Technology, Germany
- affiliation (former): University of Bonn, Institute for Computer Science
- affiliation (former): University of Paderborn, Department of for Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2003
[b1]Christian Sohler:
Property testing and geometry. University of Paderborn, Germany, 2003, ISBN 978-3-935433-28-0, pp. 1-121
Journal Articles
- 2024
- [j30]Artur Czumaj, Christian Sohler:
Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph. SIAM J. Comput. 53(2): 524-571 (2024) - 2020
- [j29]Leo N. Geppert, Katja Ickstadt, Alexander Munteanu
, Christian Sohler:
Streaming statistical models via Merge & Reduce. Int. J. Data Sci. Anal. 10(4): 331-347 (2020) - [j28]Dan Feldman, Melanie Schmidt, Christian Sohler:
Turning Big Data Into Tiny Data: Constant-Size Coresets for k-Means, PCA, and Projective Clustering. SIAM J. Comput. 49(3): 601-657 (2020) - 2019
- [j27]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar graphs: Random walks and bipartiteness testing. Random Struct. Algorithms 55(1): 104-124 (2019) - [j26]Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad, Christian Sohler:
Testing for forbidden order patterns in an array. Random Struct. Algorithms 55(2): 402-426 (2019) - 2017
- [j25]Leo N. Geppert, Katja Ickstadt, Alexander Munteanu, Jens Quedenfeld, Christian Sohler:
Random projections for Bayesian regression. Stat. Comput. 27(1): 79-101 (2017) - 2015
- [j24]Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Probabilistic k-Median Clustering in Data Streams. Theory Comput. Syst. 56(1): 251-290 (2015) - 2014
- [j23]Joachim Gehweiler, Christiane Lammersen, Christian Sohler:
A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem. Algorithmica 68(3): 643-670 (2014) - [j22]Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler:
Analysis of Agglomerative Clustering. Algorithmica 69(1): 184-215 (2014) - [j21]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding cycles and trees in sublinear time. Random Struct. Algorithms 45(2): 139-184 (2014) - 2013
- [j20]Ilan Newman, Christian Sohler:
Every Property of Hyperfinite Graphs Is Testable. SIAM J. Comput. 42(3): 1095-1112 (2013) - 2012
- [j19]Marcel R. Ackermann, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, Christian Sohler:
StreamKM++: A clustering algorithm for data streams. ACM J. Exp. 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 Trans. Algorithms 8(3): 30:1-30:28 (2012) - 2010
- [j17]Artur Czumaj, Christian Sohler:
Testing Expansion in Bounded-Degree Graphs. Comb. Probab. Comput. 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 Trans. Algorithms 6(4): 59:1-59:26 (2010) - 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) - 2008
- [j11]Gereon Frahling, Piotr Indyk, Christian Sohler:
Sampling in Dynamic Data Streams and Applications. Int. J. Comput. Geom. Appl. 18(1/2): 3-28 (2008) - [j10]Gereon Frahling, Christian Sohler:
A Fast k-Means Implementation Using Coresets. Int. J. Comput. Geom. Appl. 18(6): 605-625 (2008) - [j9]Artur Czumaj, Christian Sohler:
Testing Euclidean minimum spanning trees in the plane. ACM Trans. Algorithms 4(3): 31:1-31:23 (2008) - 2007
- [j8]Artur Czumaj, Christian Sohler:
Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms 30(1-2): 226-256 (2007) - 2006
- [j7]Artur Czumaj, Christian Sohler:
Sublinear-Time Algorithms. Bull. EATCS 89: 23-47 (2006) - [j6]Joachim Gehweiler, Christiane Lammersen, Christian Sohler:
A Distributed Algorithm for the Facility Location Problem. Electron. Notes Discret. Math. 25: 91 (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) - 2003
- [j1]Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking:
Randomized Pursuit-Evasion In Graphs. Comb. Probab. Comput. 12(3): 225-244 (2003)
Conference and Workshop Papers
- 2022
- [c79]Peter Mörters, Christian Sohler, Stefan Walzer:
A Sublinear Local Access Implementation for the Chinese Restaurant Process. APPROX/RANDOM 2022: 28:1-28:18 - [c78]Michael Kapralov, Mikhail Makarov, Sandeep Silwal, Christian Sohler, Jakab Tardos:
Motif Cut Sparsifiers. FOCS 2022: 389-398 - 2021
- [c77]Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson:
Parallel and Efficient Hierarchical k-Median Clustering. NeurIPS 2021: 20333-20345 - [c76]Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler:
Spectral Clustering Oracles in Sublinear Time. SODA 2021: 1598-1617 - 2020
- [c75]Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Testable Properties in General Graphs and Random Order Streaming. APPROX-RANDOM 2020: 16:1-16:20 - [c74]Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson:
Fast and Accurate $k$-means++ via Rejection Sampling. NeurIPS 2020 - [c73]Artur Czumaj, Christian Sohler:
Sublinear time approximation of the cost of a metric k-nearest neighbor graph. SODA 2020: 2973-2992 - 2019
- [c72]Artur Czumaj, Christian Sohler:
A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs). FOCS 2019: 1525-1548 - [c71]Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, David P. Woodruff:
On Coresets for Logistic Regression. GI-Jahrestagung 2019: 267-268 - [c70]Silvio Lattanzi, Christian Sohler:
A Better k-means++ Algorithm via Local Search. ICML 2019: 3662-3671 - [c69]Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. SODA 2019: 714-726 - [c68]Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler:
Fair Coresets and Streaming Algorithms for Fair k-means. WAOA 2019: 232-251 - 2018
- [c67]Andre Esser, Felix Heuer, Robert Kübler, Alexander May, Christian Sohler:
Dissection-BKW. CRYPTO (2) 2018: 638-666 - [c66]Christian Sohler, David P. Woodruff:
Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension. FOCS 2018: 802-813 - [c65]Nils M. Kriege, Christopher Morris, Anja Rey, Christian Sohler:
A Property Testing Framework for the Theoretical Expressivity of Graph Kernels. IJCAI 2018: 2348-2354 - [c64]David Cohen-Steiner, Weihao Kong, Christian Sohler, Gregory Valiant:
Approximating the Spectrum of a Graph. KDD 2018: 1263-1271 - [c63]Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, David P. Woodruff:
On Coresets for Logistic Regression. NeurIPS 2018: 6562-6571 - [c62]Pan Peng, Christian Sohler:
Estimating Graph Parameters from Random Order Streams. SODA 2018: 2449-2466 - 2017
- [c61]Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler:
Testable Bounded Degree Graph Properties Are Random Order Streamable. ICALP 2017: 131:1-131:14 - [c60]Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, Christian Sohler:
Distributed Monitoring of Network Properties: The Power of Hybrid Networks. ICALP 2017: 137:1-137:15 - [c59]Vladimir Braverman, Gereon Frahling, Harry Lang, Christian Sohler, Lin F. Yang:
Clustering High Dimensional Dynamic Data Streams. ICML 2017: 576-585 - [c58]Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad, Christian Sohler:
Testing for Forbidden Order Patterns in an Array. SODA 2017: 1582-1597 - 2016
- [c57]Vincent Cohen-Addad, Chris Schwiegelshohn, Christian Sohler:
Diameter and k-Center in Sliding Windows. ICALP 2016: 19:1-19:12 - [c56]Anne Driemel, Amer Krivosija, Christian Sohler:
Clustering time series under the Fréchet distance. SODA 2016: 766-785 - [c55]Artur Czumaj, Pan Peng, Christian Sohler:
Relating two property testing models for bounded degree directed graphs. STOC 2016: 1033-1045 - 2015
- [c54]Hendrik Fichtenberger, Pan Peng, Christian Sohler:
On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs. APPROX-RANDOM 2015: 786-799 - [c53]Artur Czumaj, Pan Peng, Christian Sohler:
Testing Cluster Structure of Graphs. STOC 2015: 723-732 - 2014
- [c52]Alexander Munteanu, Christian Sohler, Dan Feldman:
Smallest enclosing ball for probabilistic data. SoCG 2014: 214 - [c51]Dominic Siedhoff, Hendrik Fichtenberger, Pascal Libuschewski, Frank Weichert, Christian Sohler, Heinrich Müller:
Signal/Background Classification of Time Series for Biological Virus Detection. GCPR 2014: 388-398 - [c50]Christian Sohler:
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure? MFCS (1) 2014: 44-49 - 2013
- [c49]Hendrik Fichtenberger, Marc Gillé, Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler:
BICO: BIRCH Meets Coresets for k-Means Clustering. ESA 2013: 481-492 - [c48]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 - [c47]Artur Czumaj, Christiane Lammersen, Morteza Monemizadeh, Christian Sohler:
(1+ Є)-approximation for facility location in data streams. SODA 2013: 1710-1728 - 2012
- [c46]Frank Hellweg, Christian Sohler:
Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness. ESA 2012: 599-610 - [c45]Christian Sohler:
Almost Optimal Canonical Property Testers for Satisfiability. FOCS 2012: 541-550 - [c44]Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Probabilistic k-Median Clustering in Data Streams. WAOA 2012: 70-81 - 2011
- [c43]Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff:
Tolerant Algorithms. ESA 2011: 736-747 - [c42]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar Graphs: Random Walks and Bipartiteness Testing. FOCS 2011: 423-432 - [c41]Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler:
Analysis of Agglomerative Clustering. STACS 2011: 308-319 - [c40]Ilan Newman, Christian Sohler:
Every property of hyperfinite graphs is testable. STOC 2011: 675-684 - [c39]Christian Sohler, David P. Woodruff:
Subspace embeddings for the L1-norm with applications. STOC 2011: 755-764 - 2010
- [c38]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 - [c37]Frank Hellweg, Melanie Schmidt, Christian Sohler:
Testing Euclidean Spanners. ESA (1) 2010: 60-71 - [c36]Michal Adamaszek, Artur Czumaj, Christian Sohler:
Testing Monotone Continuous Distributions on High-dimensional Real Cubes. SODA 2010: 56-65 - [c35]Dan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff:
Coresets and Sketches for High Dimensional Subspace Approximation Problems. SODA 2010: 630-649 - 2009
- [c34]Sumit Ganguly, Christian Sohler:
d-Dimensional Knapsack in the Streaming Model. ESA 2009: 468-479 - [c33]Christiane Lammersen, Anastasios Sidiropoulos, Christian Sohler:
Streaming Embeddings with Slack. WADS 2009: 483-494 - 2008
- [c32]Christiane Lammersen, Christian Sohler:
Facility Location in Dynamic Geometric Data Streams. ESA 2008: 660-671 - [c31]Marcel R. Ackermann, Johannes Blömer, Christian Sohler:
Clustering for metric and non-metric distance measures. SODA 2008: 799-808 - 2007
- [c30]Artur Czumaj, Gereon Frahling, Christian Sohler:
Efficient Kinetic Data Structures for MaxCut. CCCG 2007: 157-160 - [c29]Dan Feldman, Morteza Monemizadeh, Christian Sohler:
A PTAS for k-means clustering based on weak coresets. SCG 2007: 11-18 - [c28]Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler:
Estimating Clustering Indexes in Data Streams. ESA 2007: 618-632 - [c27]Artur Czumaj, Christian Sohler:
Testing Expansion in Bounded-Degree Graphs. FOCS 2007: 570-578 - [c26]Artur Czumaj, Christian Sohler:
On testable properties in bounded degree graphs. SODA 2007: 494-501 - [c25]Artur Czumaj, Christian Sohler:
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. STACS 2007: 536-548 - 2006
- [c24]Gereon Frahling, Christian Sohler:
A fast k-means implementation using coresets. SCG 2006: 135-143 - [c23]Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler:
Counting triangles in data streams. PODS 2006: 253-262 - [c22]Joachim Gehweiler, Christiane Lammersen, Christian Sohler:
A distributed O(1)-approximation algorithm for the uniform facility location problem. SPAA 2006: 237-243 - 2005
- [c21]Gereon Frahling, Piotr Indyk, Christian Sohler:
Sampling in dynamic data streams and applications. SCG 2005: 142-149 - [c20]Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler:
Facility Location in Sublinear Time. ICALP 2005: 866-877 - [c19]Gereon Frahling, Christian Sohler:
Coresets in dynamic geometric data streams. STOC 2005: 209-217 - 2004
- [c18]Vikas Bansal, Friedhelm Meyer auf der Heide, Christian Sohler:
Labeling Smart Dust. ESA 2004: 77-88 - [c17]Valentina Damerow, Christian Sohler:
Extreme Points Under Random Noise. ESA 2004: 264-274 - [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
- [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]Artur Czumaj, Christian Sohler:
Property Testing with Geometric Queries. ESA 2001: 266-277 - [c7]Artur Czumaj, Christian Sohler:
Testing Hypergraph Coloring. ICALP 2001: 493-505 - [c6]Artur Czumaj, Christian Sohler:
Soft kinetic data structures. SODA 2001: 865-872 - 2000
- [c5]Christian Sohler, Martin Ziegler:
Computing Cut Numbers. CCCG 2000 - [c4]Artur Czumaj, Christian Sohler, Martin Ziegler:
Property Testing in Computational Geometry. ESA 2000: 155-166 - 1999
- [c3]Christian Sohler:
Fast reconstruction of delaunay triangulations. CCCG 1999 - [c2]Christian Sohler:
Generating random star-shaped polygons. CCCG 1999 - 1997
- [c1]Markus Denny, Christian Sohler:
Encoding a triangulation as a permutation of its point set. CCCG 1997
Parts in Books or Collections
- 2016
- [p4]Johannes Blömer, Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Theoretical Analysis of the k-Means Algorithm - A Survey. Algorithm Engineering 2016: 81-116 - 2010
- [p3]Artur Czumaj, Christian Sohler:
Sublinear-time Algorithms. Property Testing 2010: 41-64 - [p2]Michal Adamaszek, Artur Czumaj, Christian Sohler:
Testing Monotone Continuous Distributions on High-Dimensional Real Cubes. Property Testing 2010: 228-233 - [p1]Frank Hellweg, Melanie Schmidt, Christian Sohler:
Testing Euclidean Spanners. Property Testing 2010: 306-311
Editorship
- 2017
- [e3]Kirk Pruhs, Christian Sohler:
25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria. LIPIcs 87, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-049-1 [contents] - 2008
- [e2]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
Sublinear Algorithms, 17.08. - 22.08.2008. Dagstuhl Seminar Proceedings 08341, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - 2006
- [e1]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
Sublinear Algorithms, 17.07. - 22.07.2005. Dagstuhl Seminar Proceedings 05291, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents]
Reference Works
- 2017
- [r2]Artur Czumaj, Christian Sohler:
Sublinear Clustering. Encyclopedia of Machine Learning and Data Mining 2017: 1205-1209 - 2010
- [r1]Artur Czumaj, Christian Sohler:
Sublinear Clustering. Encyclopedia of Machine Learning 2010: 933-937
Informal and Other Publications
- 2024
- [i33]Michael Kapralov, Mikhail Makarov, Christian Sohler:
On the adversarial robustness of Locality-Sensitive Hashing in Hamming space. CoRR abs/2402.09707 (2024) - 2022
- [i32]Michael Kapralov, Mikhail Makarov, Sandeep Silwal, Christian Sohler, Jakab Tardos:
Motif Cut Sparsifiers. CoRR abs/2204.09951 (2022) - [i31]Jakub Lacki, Vahab Mirrokni, Christian Sohler:
Constant Approximation for Normalized Modularity and Associations Clustering. CoRR abs/2212.14334 (2022) - 2021
- [i30]Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, Christian Sohler:
Spectral Clustering Oracles in Sublinear Time. CoRR abs/2101.05549 (2021) - 2020
- [i29]Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson:
Fast and Accurate k-means++ via Rejection Sampling. CoRR abs/2012.11891 (2020) - 2019
- [i28]Artur Czumaj, Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Testable Properties in General Graphs and Random Order Streaming. CoRR abs/1905.01644 (2019) - [i27]Melanie Schmidt, Christian Sohler:
Fully dynamic hierarchical diameter k-clustering and k-center. CoRR abs/1908.02645 (2019) - [i26]Artur Czumaj, Christian Sohler:
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs). CoRR abs/1909.10647 (2019) - 2018
- [i25]Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, David P. Woodruff:
On Coresets for Logistic Regression. CoRR abs/1805.08571 (2018) - [i24]Dan Feldman, Melanie Schmidt, Christian Sohler:
Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering. CoRR abs/1807.04518 (2018) - [i23]Christian Sohler, David P. Woodruff:
Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension. CoRR abs/1809.02961 (2018) - [i22]Hendrik Fichtenberger, Pan Peng, Christian Sohler:
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty. CoRR abs/1811.02937 (2018) - [i21]Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler:
Fair Coresets and Streaming Algorithms for Fair k-Means Clustering. CoRR abs/1812.10854 (2018) - [i20]Andre Esser, Felix Heuer, Robert Kübler, Alexander May, Christian Sohler:
Dissection-BKW. IACR Cryptol. ePrint Arch. 2018: 569 (2018) - 2017
- [i19]Vladimir Braverman, Gereon Frahling, Harry Lang, Christian Sohler, Lin F. Yang:
Clustering High Dimensional Dynamic Data Streams. CoRR abs/1706.03887 (2017) - [i18]Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler:
Testable Bounded Degree Graph Properties Are Random Order Streamable. CoRR abs/1707.07334 (2017) - [i17]Pan Peng, Christian Sohler:
Estimating Graph Parameters from Random Order Streams. CoRR abs/1711.04881 (2017) - [i16]David Cohen-Steiner, Weihao Kong, Christian Sohler, Gregory Valiant:
Approximating the Spectrum of a Graph. CoRR abs/1712.01725 (2017) - 2016
- [i15]Johannes Blömer, Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Theoretical Analysis of the $k$-Means Algorithm - A Survey. CoRR abs/1602.08254 (2016) - 2015
- [i14]Artur Czumaj, Pan Peng, Christian Sohler:
Testing Cluster Structure of Graphs. CoRR abs/1504.03294 (2015) - [i13]Leo N. Geppert, Katja Ickstadt, Alexander Munteanu, Jens Quedenfeld, Christian Sohler:
Random projections for Bayesian regression. CoRR abs/1504.06122 (2015) - [i12]Anne Driemel, Amer Krivosija, Christian Sohler:
Clustering time series under the Fréchet distance. CoRR abs/1512.04349 (2015) - 2014
- [i11]Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler:
Planar Graphs: Random Walks and Bipartiteness Testing. CoRR abs/1407.2109 (2014) - [i10]Marc Heinrich, Alexander Munteanu, Christian Sohler:
Asymptotically exact streaming algorithms. CoRR abs/1408.1847 (2014) - 2013
- [i9]Frank Hellweg, Christian Sohler:
Property-Testing in Sparse Directed Graphs: 3-Star-Freeness and Connectivity. CoRR abs/1312.0497 (2013) - 2012
- [i8]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding Cycles and Trees in Sublinear Time. Electron. Colloquium Comput. Complex. TR12 (2012) - 2010
- [i7]Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler:
Finding Cycles and Trees in Sublinear Time. CoRR abs/1007.4230 (2010) - [i6]Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler:
Analysis of Agglomerative Clustering. CoRR abs/1012.3697 (2010) - 2008
- [i5]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
08341 Abstracts Collection - Sublinear Algorithms. Sublinear Algorithms 2008 - [i4]Artur Czumaj, S. Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
08341 Executive Summary - Sublinear Algorithms. Sublinear Algorithms 2008 - 2007
- [i3]Artur Czumaj, Asaf Shapira, Christian Sohler:
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2005
- [i2]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
05291 Abstracts Collection -- Sublinear Algorithms. Sublinear Algorithms 2005 - [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
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-06 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
