Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Sven Kosub - Publications

1. Benjamin Hummel and Sven Kosub.
   Acyclic Type-of-Relationship Problems on the Internet: An Experimental Analysis.
   In Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference (IMC'2007), pages 221-226. ACM Press, New York, 2007.
   Technical Report TUM-I0709, Technische Universität München, Institut für Informatik, February 2007.
   

2. Sven Kosub.
   Dichotomy Results for Fixed-Point Existence Problems for Boolean Dynamical Systems.
   Mathematics in Computer Science, special issue on Modeling and Analysis of Complex Systems. To appear.
   Technical Report TUM-I0701, Technische Universität München, Institut für Informatik, January 2007.
   

3. Sven Kosub and Christopher M. Homan.
   Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems.
   In Proceedings of the 10th Italian Conference on Theoretical Computer Science (ICTCS'2007), pages 163-174. World Scientific Publishing, Singapore, 2007.
   Technical Report TUM-I0706, Technische Universität München, Institut für Informatik, January 2007.
   

4. Stefan Eckhardt, Sven Kosub, Moritz G. Maaß, Hanjo Täubig, and Sebastian Wernicke.
   Combinatorial Network Abstraction by Trees and Distances.
   Theoretical Computer Science. To appear (subject to revision).
   In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC'2005), volume 3827 of Lecture Notes in Computer Science, pages 1100-1109. Springer-Verlag, Berlin, 2005.
   Technical Report TUM-I0502, Technische Universität München, Institut für Informatik, March 2005.

5. Stefan Eckhardt, Sven Kosub and Johannes Nowak.
   Smoothed Analysis of Trie Height.
   Technical Report TUM-I0715, Technische Universität München, Institut für Informatik, July 2007.
   

6. Lane A. Hemaspaandra, Christopher M. Homan, and Sven Kosub.
   Cluster Computing and the Power of Edge Recognition.
   Information and Computation, 205(8):1274-1293, 2007.
   In Proceedings of the 3rd Annual Conference Theory and Applications of Models of Computation (TAMC'2006), volume 3959 of Lecture Notes in Computer Science, pages 283-294. Springer-Verlag, Berlin, 2006.
   Technical Report URCS-TR-2005-878, University of Rochester, Department of Computer Science, September 2005, and Technical Report cs.CC/0509060, ACM Computing Research Repository, September 2005.
   

7. Matthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, and Johannes Nowak.
   All-Pairs Common-Ancestor Problems in Weighted Dags.
   In Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE'2007). volume 4614 of Lecture Notes in Computer Science, pages 282-293. Springer-Verlag, Berlin, 2007.
   Technical Report TUM-I0606, Technische Universität München, Institut für Informatik, April 2006.
   

8. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, and Klaus W. Wagner.
   The Complexity of Computing the Size of an Interval.
   SIAM Journal on Computing, 36(5):1264-1300, 2006.
   Technical Report URCS-TR-2005-856, University of Rochester, Department of Computer Science, February 2005, and Technical Report cs.CC/0502058, ACM Computing Research Repository, February 2005.
   Preliminary version in Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP'2001), volume 2076 of Lecture Notes in Computer Science, pages 1040-1051. Springer-Verlag, Berlin, 2001.
   

9. Sven Kosub and Klaus W. Wagner.
   The Boolean Hierarchy of NP-Partitions.
   Information and Computation. To Appear.
   In Proceedings of the 17th Symposium on Theoretical Aspects of Computer Science (STACS'2000), volume 1770 of Lecture Notes in Computer Science, pages 157-168. Springer-Verlag, Berlin, 2000.
   Technical Report No. 233, Julius-Maximilians-Universität Würzburg, Institut für Informatik, Juli 1999. Revised and expanded version as Technical Report TUM-I0209, Technische Universität München, Institut für Informatik, September 2002.
   

10. Sven Kosub, Moritz G. Maaß, and Hanjo Täubig.
    Acyclic Type-of-Relationship Problems on the Internet.
    In Proceedings of the 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN'2006), volume 4235 of Lecture Notes in Computer Science, pages 98-111. Springer-Verlag, Berlin, 2006.
    Technical Report TUM-I0605, Technische Universität München, Institut für Informatik, March 2006.
    

11. Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, and Hanjo Täubig.
    The Complexity of Detecting Fixed-Density Clusters.
    Discrete Applied Mathematics, 154(11), 1547-1562, 2006.
    In Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC'2003), volume 2653 of Lecture Notes in Computer Science, pages 201-212. Springer-Verlag, Berlin, 2003.
    Technical Report TUM-I0212, Technische Universität München, Institut für Informatik, December 2002.
    

12. Sven Kosub.
    Local Density.
    In Ulrik Brandes, Thomas Erlebach (eds.), Network Analysis - Methodological Foundations, volume 3418 of Lecture Notes in Computer Science, chapter 6, pages 112-142. Springer-Verlag, Berlin, 2005.
    Technical Report TUM-I0421, Technische Universität München, Institut für Informatik, Dezember 2004.
    

13. Sven Kosub.
    NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems.
    Theory of Computing Systems, 38(1), 83-113, 2005.
    In Proceedings of the 25th Symposium on Mathematical Foundations of Computer Science (MFCS'2000), volume 1893 of Lecture Notes in Computer Science, pages 467-476. Springer-Verlag, Berlin, 2000.
    Technical Report No. 257, Julius-Maximilians-Universität Würzburg, Institut für Informatik, April 2000.
    

14. Sven Kosub.
    Boolean NP-Partitions and Projective Closure.
    In Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science (DMTCS'2003), volume 2731 of Lecture Notes in Computer Science, pages 225-236. Springer-Verlag, Berlin, 2003.
    Technical Report No. 266, Julius-Maximilians-Universität Würzburg, Institut für Informatik, November 2000.
    

15. Matthias Galota, Sven Kosub, and Heribert Vollmer.
    Generic Separations and Leaf Languages.
    Mathematical Logic Quarterly, 49(4), 353-362, 2003.
    Technical Report TUM-I0104, Technische Universität München, Institut für Informatik, September 2001, and Technical Report No. 281, Julius-Maximilians-Universität Würzburg, Institut für Informatik, September 2001.
    

16. Sven Kosub, Heinz Schmitz, and Heribert Vollmer.
    Uniform Characterizations of Complexity Classes of Functions.
    International Journal of Foundations of Computer Science, 11(4), 525-551, 2000.
    In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science (STACS'98), volume 1373 of Lecture Notes in Computer Science, pages 607-617. Springer-Verlag, Berlin, 1998.
    Technical Report No. 183, Julius-Maximilians-Universität Würzburg, Institut für Informatik, September 1997.
    

17. Sven Kosub.
    Complexity and Partitions.
    Dissertation, Julius-Maximilians-Universität Würzburg, Fakultät für Mathematik und Informatik, November 2000.
    

18. Sven Kosub.
    Types of Separability.
    Technical Report No. 267, Julius-Maximilians-Universität Würzburg, Institut für Informatik, November 2000.
    

19. Sven Kosub.
    A Note on Unambiguous Function Classes.
    Information Processing Letters, 72(5-6), 197-203, 1999.
    Technical Report No. 172, Julius-Maximilians-Universität Würzburg, Institut für Informatik, May 1997.
    

20. Daniel Görsch, Sven Kosub, and Klaus-Peter Zocher.
    Generalized Tolerance-Group Optimization Systems. (In German)
    In Proceedings of the 44th International Scientific Colloquium (IWK'99), volume 1, pages 411-417, Technische Universität Ilmenau, Ilmenau, 1999.
    

21. Daniel Görsch, Sven Kosub, and Klaus-Peter Zocher.
    Tolerance-Group Optimization in Adaptive and Selective Assembly. (In German)
    In Proceedings of the 44th International Scientific Colloquium (IWK'99), volume 3, pages 463-469, Technische Universität Ilmenau, Ilmenau, 1999.
    

22. Sven Kosub.
    Persistent Computations.
    Technical Report No. 217, Julius-Maximilians-Universität Würzburg, Institut für Informatik, December 1998.
    

23. Sven Kosub.
    Clustermaschinen. (In German)
    Diplomarbeit, Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, February 1996.
    

Please note: The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that the publications are offered here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each copyright holder, and make use of the documents only for research and education purpose. These publications may not be reposted without the explicit permission of the copyright holder.