Selected Publications of Christian Schindelhauer

Journals

[JRS99]
A. Jakoby, R. Reischuk, C. Schindelhauer, Malign Distributions for Circuit Complexity, Information and Computation, 150, 1999, 187-208. (ic00.ps.gz), preliminary version appeared in Proceedings of the 12th Symposium on Theoretical Aspects in Computer Science (STACS'95 - inofficial best paper), 1995, 629 - 639.
[JRS98]
A. Jakoby, R. Reischuk, C. Schindelhauer, The Complexity of Broadcasting in Planar and Decomposable Graphs, Discrete Applied Mathematics 83, 1998, 179-206. preliminary version appeared in 20. International Workshop on Graph-Theoretic Concepts in Computer Science (WG' 94), 1994, 219-231.
[RS96]
R. Reischuk, C. Schindelhauer, An Average Complexity Measure That Yields Tight Hierarchies, Comput. complex. 1996/1997, 133-173 (average.ps.gz)

Conferences

[SW01]
C. Schindelhauer, B. Weber Tree Approximation for the Weighted Cost-Distance Problem, to appear at the ISAAC International Symposium on Algorithms and Computation, Dec 19-21, 2001 Christchurch, New Zealand , 2001, (birgitta.ps.gz)
[JS01]
A. Jakoby, C. Schindelhauer, Efficient Addition on Field Programmable Gate Arrays, to appeat at the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 13-15, 2001 Indian Institute of Science, Bangalore, India (fpga-add.ps.gz)
[PS01]
A. Piccolboni, C. Schindelhauer, Discrete Prediction Games with arbitrary Feedback and Loss, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, 2001, 208-223 (prediction.ps.gz), (Technical Report: Schriftenreihe der Institute für Informatik und Mathematik Technical Report, SIIM-TR-A-00-18, (siim-tr-00-18.ps.gz, siim-tr-00-18.pdf))
[KSSV00]
R. Karp, S. Shenker, C. Schindelhauer, B. Vöcking, Randomized Rumor Spreading, 41st Symposium on Foundation on Computer Science (FOCS'00), 2000, 565-574, (rumor.ps.gz).
[S00b]
C. Schindelhauer, On the Inapproximability of Broadcasting Time, 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'00), 2000, 226-237 ( bc-approx.ps.gz).
[JS99]
A. Jakoby, C. Schindelhauer, The Non-Recursive Power of Erroneous Computation, Foundations of Software Technology and Theoretical Computer Science, FST&TCS 1999, 394-406 (fsttcs.ps.gz).
[JS96]
A. Jakoby, C. Schindelhauer, On the Complexity of Worst Case and Expected Time in a Circuit, Proceedings of the 13th Symposium on Theoretical Aspects in Computer Science (STACS'96), 1996, 295 - 306 (stacs96.ps.gz).
[JRS94a]
A. Jakoby, R. Reischuk, C. Schindelhauer, Circuit Complexity: From the Worst Case to the Average Case, Proceedings of the 26. Symposium on the Theory of Computer Science (STOC'94), 1994, 58-67 (stoc94.ps.gz).
[JRS94b]
A. Jakoby, R. Reischuk, C. Schindelhauer, St. Weis, The Average Case Complexity of the Parallel Prefix Problem, 21. International Conference of Algorithms, Languages and Programming (ICALP), 1994, 593-604 (icalp94.ps.gz).
[RS93]
R. Reischuk, C. Schindelhauer, Precise Average Case Complexity , Proceedings of the 10. Symposium on Theoretical Aspects of Computer Science (STACS'93), 1993, 650-661.

Theses and Technical Reports

[GLSV02]
Matthias Grünewald, Tamás Lukovszki, Christian Schindelhauer, Klaus Volbert, Distributed Maintenance of Resource Efficient Wireless Network Topologies , extended abstract, 2002, (dinet.ps.gz)
[MSVG01]
Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald Congestion, Energy and Delay in Radio Networks , technical report, Universit&aauml;t Paderborn, 2001, tr-ri-01-229, (3-trade.ps.gz)
[SV01]
C. Schindelhauer, B. Vöcking, Fair and Distributed Bandwidth Allocation under Adversarial Timing, draft paper, 2001, (rasmus.ps.gz)
[S00a]
C. Schindelhauer, Broadcasting Time cannot be Approximated within a Factor of 57/56-epsilon, ICSI Technical Report TR-00-002, (tr-00-002.ps.gz)
[S98]
C. Schindelhauer, A Toolbox for Mental Card Games, Technical Report, A-98-14, University of Lübeck, 1998.
[JS97]
A. Jakoby, C. Schindelhauer, Optimization of Unary Costs, Technical Report, A-97-16, University of Lübeck, 1997.
[S96]
C. Schindelhauer, Average- und Median-Komplexitätsklassen, phd thesis, Medizinische Universität Lübeck, 1996. (diss.ps.gz-german)
[S91]
C. Schindelhauer, Neue Average Case Komplexitätsklassen, diploma thesis, Technical University of Darmstadt, 1991.
[S90]
C. Schindelhauer, Implementation of the Digital Signature Scheme of Goldwasser, Micali and Rivest, student's project, Technische Universität Darmstadt, 1990.

© Copyright Notice:
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Last Change Feb. 02, 2002