Sprungmarken

Servicenavigation

       

Hauptnavigation

Bereichsnavigation

Hauptinhalt

Talks

  • Algorithms on Implicit Networks.
    Held at the annual meeting of the DFG Research Cluster 1126, "Algorithmic Aspects of Large and Complex Networks", on 26.-28. March 2003 at the University of Tübingen, Germany.
    PDF (4,131K)

  • Implicit Flow Maximization by Iterative Squaring.
    Held at the SOFSEM 2004 on 24.-30. January 2004 in the Hotel VZ Merin, Merin, Czech Republic.
    PDF (5,972K)

  • Experimental Studies of Symbolic Shortest-Path Algorithms.
    Held at the WEA 2004 on 25.-28. May 2004 in the Hotel Portogalo, Angra dos Reis, Rio de Janeiro, Brazil.
    PDF (768K)

  • A Symbolic Approach to the All-Pairs Shortest-Paths Problem.
    Held at the WG 2004 on 21.-23. June 2004 in the Hölterhoff House, Bad Honnef, Germany.
    PDF (616K)

  • Symbolische Berechnung kürzester Wege. (Symbolic Computation of Shortest Paths.)
    Held at the Chair of Computer Science 2 on 13. July 2004 at the University of Dortmund, Germany. In german.
    PDF (893K)

  • Symbolische Berechnung kürzester Wege. (Symbolic Computation of Shortest Paths.)
    Held at the annual meeting of the DFG Research Cluster 1126, "Algorithmic Aspects of Large and Complex Networks", on 21.-23. July 2004 at the University of Karlsruhe, Germany. In german.
    PDF (782K)

  • Lower Bounds on the OBDD Size of Graphs of Some Popular Functions.
    Held at the SOFSEM 2005 on 22.-28. January 2005 in the Hotel MAJ, Liptovsky Jan, Slovak Republic.
    PDF (371K)

  • New Results on the OBDD-Size of Graphs.
    Held at the annual meeting of the DFG Research Cluster 1126, "Algorithmic Aspects of Large and Complex Networks", on 10.-12. March 2005 at the Heinz Nixdorf Institute, Paderborn, Germany.
    PDF (382K)

  • On Symbolic Scheduling Independent Tasks with Restricted Execution Times.
    Held at the WEA 2005 on 10.-13. May 2005 in the Hotel Santorini Image, Santorini Island, Greece.
    PDF (407K)

  • Algorithmik implizit repräsentierter Graphen. (Algorithmic Aspects of Implicitly Represented Graphs.)
    Held at the Institute of Computer Science and Applied Mathematics on 26. October 2005 at the University of Kiel, Germany. In german.
    PDF (824K)

  • The Complexity of Problems on Implicitly Represented Inputs.
    Held at the SOFSEM 2006 on 22.-27. January 2006 in the Hotel VZ Merin, Merin, Czech Republic.
    PDF (443K)

  • Die Komplexität von Problemen auf implizit repräsentierten Eingaben. (The Complexity of Problems on Implicitly Represented Inputs.)
    Held at the Chair of Computer Science 2 on 7. February 2006 at the University of Dortmund, Germany. In german.
    PDF (821K)

  • Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.
    Held at the LATIN 2006 on 20.-24. March 2006 in the Hotel Villa del Rio, Valdivia, Chile.
    PDF (259K)

  • The Complexity of Problems on Implicitly Represented Inputs.
    Held at the annual meeting of the DFG Research Cluster 1126, "Algorithmic Aspects of Large and Complex Networks", on 12.-14. June 2006 at the RWTH Aachen, Germany.
    PDF (393K)
Daniel Sawitzki, 10.10.2006