Travelled to:1 × Finland
1 × Greece
1 × Portugal
1 × Spain
5 × USA
Collaborated with:A.Czumaj G.Frahling I.Newman D.P.Woodruff P.Peng M.Badoiu P.Indyk L.S.Buriol S.Leonardi A.Marchetti-Spaccamela M.Adler H.Räcke N.Sivadasan B.Vöcking
Talks about:sublinear (3) graph (3) time (3) cluster (2) stream (2) random (2) test (2) data (2) hypergraph (1) hyperfinit (1)
Person: Christian Sohler
DBLP: Sohler:Christian
Contributed to:
20152011
2006
200520052004200420022001Wrote 10 papers:
- STOC-2015-CzumajPS #clustering #graph #testing
- Testing Cluster Structure of Graphs (AC, PP, CS), pp. 723–732.
- STOC-2011-NewmanS #graph
- Every property of hyperfinite graphs is testable (IN, CS), pp. 675–684.
- STOC-2011-SohlerW
- Subspace embeddings for the L1-norm with applications (CS, DPW), pp. 755–764.
- PODS-2006-BuriolFLMS #data type
- Counting triangles in data streams (LSB, GF, SL, AMS, CS), pp. 253–262.
- ICALP-2005-BadoiuCIS #sublinear
- Facility Location in Sublinear Time (MB, AC, PI, CS), pp. 866–877.
- STOC-2005-FrahlingS #data type #geometry
- Coresets in dynamic geometric data streams (GF, CS), pp. 209–217.
- ICALP-2004-CzumajS #approximate #clustering #random
- Sublinear-Time Approximation for Clustering Via Random Sampling (AC, CS), pp. 396–407.
- STOC-2004-CzumajS #metric
- Estimating the weight of metric minimum spanning trees in sublinear-time (AC, CS), pp. 175–183.
- ICALP-2002-AdlerRSSV #graph #random
- Randomized Pursuit-Evasion in Graphs (MA, HR, NS, CS, BV), pp. 901–912.
- ICALP-2001-CzumajS #testing
- Testing Hypergraph Coloring (AC, CS), pp. 493–505.