The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

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

Publications of Author

  1. Stefan Rührup, Christian Schindelhauer, Klaus Volbert
    Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2005, pp:244-257 [Conf]
  2. Christian Schindelhauer, Kerstin Voß
    Probability Distributions for Channel Utilisation. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2005, pp:271-284 [Conf]
  3. Christian Schindelhauer
    On the inapproximability of broadcasting time. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:226-237 [Conf]
  4. Miroslaw Dynia, Miroslaw Korzeniowski, Christian Schindelhauer
    Power-Aware Collective Tree Exploration. [Citation Graph (0, 0)][DBLP]
    ARCS, 2006, pp:341-351 [Conf]
  5. Antonio Piccolboni, Christian Schindelhauer
    Discrete Prediction Games with Arbitrary Feedback and Loss. [Citation Graph (0, 0)][DBLP]
    COLT/EuroCOLT, 2001, pp:208-223 [Conf]
  6. Stefan Rührup, Christian Schindelhauer
    Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:23-34 [Conf]
  7. Matthias Grünewald, Tamás Lukovszki, Christian Schindelhauer, Klaus Volbert
    Distributed Maintenance of Resource Efficient Wireless Network Topologies (Distinguished Paper). [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:935-946 [Conf]
  8. Sven Köhler, Christian Schindelhauer, Martin Ziegler
    On Approximating Real-World Halting Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:454-466 [Conf]
  9. Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking
    Randomized Rumor Spreading. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:565-574 [Conf]
  10. Andreas Jakoby, Christian Schindelhauer
    Efficient Addition on Field Programmable Gate Arrays. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:219-231 [Conf]
  11. Christian Schindelhauer, Andreas Jakoby
    The Non-Recursive Power of Erroneous Computation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:394-406 [Conf]
  12. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis
    The Average Case Complexity of the Parallel Prefix Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:593-604 [Conf]
  13. Christian Schindelhauer, Gunnar Schomaker
    SAN Optimal Multi Parameter Access Scheme. [Citation Graph (0, 0)][DBLP]
    ICN/ICONS/MCL, 2006, pp:28- [Conf]
  14. Stefan Rührup, Christian Schindelhauer
    Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  15. Stefan Rührup, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald
    Performance of Distributed Algorithms for Topology Control in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:28- [Conf]
  16. Christian Schindelhauer
    Oblivious parallel probabilistic channel utilization without control channels. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  17. Kishore Kothapalli, Christian Scheideler, Melih Onus, Christian Schindelhauer
    Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  18. Stefan Rührup, Christian Schindelhauer
    Online Multi-path Routing in a Maze. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:650-659 [Conf]
  19. Christian Schindelhauer, Klaus Volbert, Martin Ziegler
    Spanners, Weak Spanners, and Power Spanners for Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:805-821 [Conf]
  20. Christian Schindelhauer, Birgitta Weber
    Tree-Approximations for the Weighted Cost-Distance Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:185-195 [Conf]
  21. Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Christian Schindelhauer
    Smart Robot Teams Exploring Sparse Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:327-338 [Conf]
  22. Christian Schindelhauer, Stefan Büttcher, Franz-Josef Rammig
    The design of PaMaNet the Paderborn mobile ad-hoc network. [Citation Graph (0, 0)][DBLP]
    Mobility Management & Wireless Access Protocols, 2004, pp:119-121 [Conf]
  23. Christian Schindelhauer
    Mobility in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:100-116 [Conf]
  24. Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald
    Energy, congestion and dilation in radio networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:230-237 [Conf]
  25. Peter Mahlmann, Christian Schindelhauer
    Peer-to-peer networks based on random transformations of connected regular undirected graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:155-164 [Conf]
  26. Peter Mahlmann, Christian Schindelhauer
    Distributed random digraph transformations for peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:308-317 [Conf]
  27. Christian Schindelhauer, Tamás Lukovszki, Stefan Rührup, Klaus Volbert
    Worst case mobility in ad hoc networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:230-239 [Conf]
  28. Christian Schindelhauer, Gunnar Schomaker
    Weighted distributed hash tables. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:218-227 [Conf]
  29. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    Malign Distributions for Average Case Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:628-639 [Conf]
  30. Andreas Jakoby, Christian Schindelhauer
    On the Complexity of Worst Case and Expected Time in a Circuit. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:295-306 [Conf]
  31. Rüdiger Reischuk, Christian Schindelhauer
    Precise Average Case Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:650-661 [Conf]
  32. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    Circuit complexity: from the worst case to the average case. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:58-67 [Conf]
  33. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    The Complexity of Broadcasting in Planar and Decomposable Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:219-231 [Conf]
  34. Rüdiger Reischuk, Christian Schindelhauer
    An Average Complexity Measure that Yields Tight Hierarchies. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:2, pp:133-173 [Journal]
  35. Christian Schindelhauer, Klaus Volbert, Martin Ziegler
    Geometric spanners with applications in wireless networks. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:3, pp:197-214 [Journal]
  36. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    The complexity of broadcasting in planar and decomposable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:179-206 [Journal]
  37. Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
    Malign Distributions for Average Case Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:150, n:2, pp:187-208 [Journal]
  38. Tamás Lukovszki, Christian Schindelhauer, Klaus Volbert
    Resource Efficient Maintenance of Wireless Network Topologies. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2006, v:12, n:9, pp:1292-1311 [Journal]
  39. Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald
    Congestion, Dilation, and Energy in Radio Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:3, pp:343-370 [Journal]
  40. Miroslaw Dynia, Jakub Lopuszanski, Christian Schindelhauer
    Why Robots Need Maps. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:41-50 [Conf]
  41. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
    Improving the Average Delay of Sorting. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:330-341 [Conf]

  42. Decentralized hash tables for mobile robot teams solving intra-logistics tasks. [Citation Graph (, )][DBLP]


  43. Optimized Java Binary and Virtual Machine for Tiny Motes. [Citation Graph (, )][DBLP]


  44. DT-DYMO: Delay-Tolerant Dynamic MANET On-demand Routing. [Citation Graph (, )][DBLP]


  45. Detours Save Energy in Mobile Wireless Networks. [Citation Graph (, )][DBLP]


  46. Coverage-hole trap model in target tracking using distributed relay-robot network. [Citation Graph (, )][DBLP]


  47. Introducing TakaTuka: a java virtualmachine for motes. [Citation Graph (, )][DBLP]


  48. Classifying peer-to-peer network coding schemes. [Citation Graph (, )][DBLP]


  49. Tree network coding for peer-to-peer networks. [Citation Graph (, )][DBLP]


  50. Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. [Citation Graph (, )][DBLP]


  51. Paircoding: Improving File Sharing Using Sparse Network Codes. [Citation Graph (, )][DBLP]


  52. Minimal energy path planning for wireless robots. [Citation Graph (, )][DBLP]


  53. Smart ring: utilizing coverage holes for mobile target tracking. [Citation Graph (, )][DBLP]


  54. Improving geometric distance estimation for sensor networks and unit disk graphs. [Citation Graph (, )][DBLP]


Search in 0.017secs, Finished in 0.020secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002