#### Filter Results:

- Full text PDF available (55)

#### Publication Year

1997

2018

- This year (6)
- Last 5 years (28)
- Last 10 years (62)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marcel R. Ackermann, Marcus MÃ¤rtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, Christian Sohler
- ACM Journal of Experimental Algorithmics
- 2012

We develop a new <it>k</it>-means clustering algorithm for data streams of points from a Euclidean space. We call this algorithm StreamKM++. Our algorithm computes a small weighted sample of the dataâ€¦ (More)

We present two space bounded random sampling algorithms that compute an approximation of the number of triangles in an undirected graph given as a stream of edges. Our first algorithm does not makeâ€¦ (More)

We analyze a randomized pursuit-evasion game on graphs. Thi game is played by two players, ahunterand arabbit. LetG be any connected, undirected graph with n nodes. The game is played in rounds andâ€¦ (More)

- Gereon Frahling, Christian Sohler
- STOC
- 2005

A dynamic geometric data stream consists of a sequence of <i>m</i> insert/delete operations of points from the discrete space 1,â€¦,Î”<i><sup>d</sup></i> [26]. We develop streaming (1 + Îµ)-approximationâ€¦ (More)

- Dan Feldman, Melanie Schmidt, Christian Sohler
- SODA
- 2013

We develop and analyze a method to reduce the size of a very large set of data points in a high dimensional Euclidean space Rd to a small set of weighted points such that the result of aâ€¦ (More)

- Dan Feldman, Morteza Monemizadeh, Christian Sohler
- Symposium on Computational Geometry
- 2007

Given a point set P âŠ† R<sup>d</sup> the k-means clustering problem is to find a set C=(c<sub>1</sub>,...,c<sub>k</sub>) of k points and a partition of P into k clustersâ€¦ (More)

We introduce the online scheduling problem for sorting buffers. A service station and a sorting buffer are given. An input sequence of items which are only characterized by a specific attribute hasâ€¦ (More)

- Gereon Frahling, Piotr Indyk, Christian Sohler
- Symposium on Computational Geometry
- 2005

A dynamic geometric data stream is a sequence of m <sc>Add/Remove</sc> operations of points from a discrete geometric space (1,...,Î”)<sup>d</sup> [21]. <sc>Add</sc>(p) inserts a point p fromâ€¦ (More)

- Christian Sohler, David P. Woodruff
- STOC
- 2011

We show there is a distribution over linear mappings R:l<sub>1</sub><sup>n</sup> -> l<sub>1</sub><sup>O(d log d)</sup>, such that with arbitrarily large constant probability, for any fixedâ€¦ (More)

- Artur Czumaj, Christian Sohler
- FOCS
- 2007