Daniel Sawitzki

12 papers B 6Journal 2Unranked 3
YearRankTypeTitle / Venue / Authors
2007 J jnl
Implicit Simulation of FNC Algorithms.
Electron. Colloquium Comput. Complex.
Daniel Sawitzki
2007 J jnl
Lower bounds on the OBDD size of two fundamental functions' graphs.
Inf. Process. Lett.
Daniel Sawitzki
2006 — —
Algorithmik und Komplexität OBDD-repräsentierter Graphen.
Daniel Sawitzki
2006 B conf
Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.
LATIN
Daniel Sawitzki
2006 B conf
The Complexity of Problems on Implicitly Represented Inputs.
SOFSEM
Daniel Sawitzki
2005 B conf
Lower Bounds on the OBDD Size of Graphs of Some Popular Functions.
SOFSEM
Daniel Sawitzki
2005 — conf
On Symbolic Scheduling Independent Tasks with Restricted Execution Times.
WEA
Daniel Sawitzki
2004 B conf
A Symbolic Approach to the All-Pairs Shortest-Paths Problem.
WG
Daniel Sawitzki
2004 — conf
Blockmodels.
Network Analysis
Marc Nunkesser, Daniel Sawitzki
2004 — conf
Experimental Studies of Symbolic Shortest-Path Algorithms.
WEA
Daniel Sawitzki
2004 B conf
Implicit Flow Maximization by Iterative Squaring.
SOFSEM
Daniel Sawitzki
2002 B conf
Automatic Generation of Control Programs for Walking Robots Using Genetic Programming.
EuroGP
Jens Busch, Jens Ziegler, Christian Aue, Andree Roß, Daniel Sawitzki, Wolfgang Banzhaf