The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian Sohler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Markus Denny, Christian Sohler
    Encoding a triangulation as a permutation of its point set. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  2. Christian Sohler
    Fast reconstruction of delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  3. Christian Sohler
    Generating random star-shaped polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  4. Christian Sohler, Martin Ziegler
    Computing Cut Numbers. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  5. Gereon Frahling, Piotr Indyk, Christian Sohler
    Sampling in dynamic data streams and applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:142-149 [Conf]
  6. Gereon Frahling, Christian Sohler
    A fast k-means implementation using coresets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:135-143 [Conf]
  7. Dan Feldman, Morteza Monemizadeh, Christian Sohler
    A PTAS for k-means clustering based on weak coresets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:11-18 [Conf]
  8. Vikas Bansal, Friedhelm Meyer auf der Heide, Christian Sohler
    Labeling Smart Dust. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:77-88 [Conf]
  9. Artur Czumaj, Christian Sohler
    Property Testing with Geometric Queries. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:266-277 [Conf]
  10. Artur Czumaj, Christian Sohler, Martin Ziegler
    Property Testing in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:155-166 [Conf]
  11. Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler
    Smoothed Motion Complexity. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:161-171 [Conf]
  12. Valentina Damerow, Christian Sohler
    Extreme Points Under Random Noise. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:264-274 [Conf]
  13. Harald Räcke, Christian Sohler, Matthias Westermann
    Online Scheduling for Sorting Buffers. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:820-832 [Conf]
  14. Artur Czumaj, Christian Sohler
    Abstract Combinatorial Programs and Efficient Property Testers. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:83-92 [Conf]
  15. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
    Randomized Pursuit-Evasion in Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:901-912 [Conf]
  16. Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler
    Facility Location in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:866-877 [Conf]
  17. Artur Czumaj, Christian Sohler
    Testing Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:493-505 [Conf]
  18. Artur Czumaj, Christian Sohler
    Sublinear-Time Approximation for Clustering Via Random Sampling. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:396-407 [Conf]
  19. Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler
    Counting triangles in data streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:253-262 [Conf]
  20. Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
    Sublinear-time approximation of Euclidean minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:813-822 [Conf]
  21. Artur Czumaj, Christian Sohler
    Soft kinetic data structures. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:865-872 [Conf]
  22. Joachim Gehweiler, Christiane Lammersen, Christian Sohler
    A distributed O(1)-approximation algorithm for the uniform facility location problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:237-243 [Conf]
  23. Artur Czumaj, Christian Sohler
    Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:536-548 [Conf]
  24. Artur Czumaj, Christian Sohler
    Estimating the weight of metric minimum spanning trees in sublinear-time. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:175-183 [Conf]
  25. Gereon Frahling, Christian Sohler
    Coresets in dynamic geometric data streams. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:209-217 [Conf]
  26. Jens Krokowski, Harald Räcke, Christian Sohler, Matthias Westermann
    Reducing State Changes with a Pipeline Buffer. [Citation Graph (0, 0)][DBLP]
    VMV, 2004, pp:217- [Conf]
  27. Christian Sohler
    Fast reconstruction of Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:3, pp:166-178 [Journal]
  28. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, Berthold Vöcking
    Randomized Pursuit-Evasion In Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
  29. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:91-109 [Journal]
  30. Artur Czumaj, Christian Sohler
    Abstract Combinatorial Programs and Efficient Property Testers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:580-615 [Journal]
  31. Artur Czumaj, Christian Sohler
    Testing hypergraph colorability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:37-52 [Journal]
  32. Artur Czumaj, Gereon Frahling, Christian Sohler
    Efficient Kinetic Data Structures for MaxCut. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:157-160 [Conf]
  33. Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Christian Sohler
    Estimating Clustering Indexes in Data Streams. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:618-632 [Conf]
  34. Artur Czumaj, Christian Sohler
    On testable properties in bounded degree graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:494-501 [Conf]

  35. StreamKM++: A Clustering Algorithms for Data Streams. [Citation Graph (, )][DBLP]


  36. 05291 Abstracts Collection -- Sublinear Algorithms. [Citation Graph (, )][DBLP]


  37. d-Dimensional Knapsack in the Streaming Model. [Citation Graph (, )][DBLP]


  38. Facility Location in Dynamic Geometric Data Streams. [Citation Graph (, )][DBLP]


  39. Testing Euclidean Spanners. [Citation Graph (, )][DBLP]


  40. Average case complexity of Voronoi diagrams of n sites from the unit cube. [Citation Graph (, )][DBLP]


  41. Testing Expansion in Bounded-Degree Graphs. [Citation Graph (, )][DBLP]


  42. Clustering for metric and non-metric distance measures. [Citation Graph (, )][DBLP]


  43. Testing Monotone Continuous Distributions on High-dimensional Real Cubes. [Citation Graph (, )][DBLP]


  44. Coresets and Sketches for High Dimensional Subspace Approximation Problems. [Citation Graph (, )][DBLP]


  45. Streaming Embeddings with Slack. [Citation Graph (, )][DBLP]


  46. Finding Cycles and Trees in Sublinear Time [Citation Graph (, )][DBLP]


  47. Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002