Daniel Sawitzki

According to our database1, Daniel Sawitzki authored at least 12 papers between 2002 and 2007.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
Lower bounds on the OBDD size of two fundamental functions' graphs.
Inf. Process. Lett., 2007

Implicit Simulation of FNC Algorithms.
Electron. Colloquium Comput. Complex., 2007

2006
Algorithmik und Komplexität OBDD-repräsentierter Graphen.
PhD thesis, 2006

The Complexity of Problems on Implicitly Represented Inputs.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
On Symbolic Scheduling Independent Tasks with Restricted Execution Times.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Lower Bounds on the OBDD Size of Graphs of Some Popular Functions.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

2004
A Symbolic Approach to the All-Pairs Shortest-Paths Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Experimental Studies of Symbolic Shortest-Path Algorithms.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Implicit Flow Maximization by Iterative Squaring.
Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Blockmodels.
Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

2002
Automatic Generation of Control Programs for Walking Robots Using Genetic Programming.
Proceedings of the Genetic Programming, 5th European Conference, 2002


  Loading...