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