| |
| 2007 | ||
|---|---|---|
| 11 | EE | Daniel Sawitzki: Implicit Simulation of FNC Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 14(028): (2007) |
| 10 | EE | Daniel Sawitzki: Lower bounds on the OBDD size of two fundamental functions' graphs. Inf. Process. Lett. 101(2): 66-71 (2007) |
| 2006 | ||
| 9 | EE | Daniel Sawitzki: Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms. LATIN 2006: 781-792 |
| 8 | EE | Daniel Sawitzki: The Complexity of Problems on Implicitly Represented Inputs. SOFSEM 2006: 471-482 |
| 2005 | ||
| 7 | EE | Daniel Sawitzki: Lower Bounds on the OBDD Size of Graphs of Some Popular Functions. SOFSEM 2005: 298-309 |
| 6 | EE | Daniel Sawitzki: On Symbolic Scheduling Independent Tasks with Restricted Execution Times. WEA 2005: 277-289 |
| 2004 | ||
| 5 | EE | Marc Nunkesser, Daniel Sawitzki: Blockmodels. Network Analysis 2004: 253-292 |
| 4 | EE | Daniel Sawitzki: Implicit Flow Maximization by Iterative Squaring. SOFSEM 2004: 301-313 |
| 3 | EE | Daniel Sawitzki: Experimental Studies of Symbolic Shortest-Path Algorithms. WEA 2004: 482-497 |
| 2 | EE | Daniel Sawitzki: A Symbolic Approach to the All-Pairs Shortest-Paths Problem. WG 2004: 154-167 |
| 2002 | ||
| 1 | EE | Jens Busch, Jens Ziegler, Christian Aue, Andree Ross, Daniel Sawitzki, Wolfgang Banzhaf: Automatic Generation of Control Programs for Walking Robots Using Genetic Programming. EuroGP 2002: 258-267 |
| 1 | Christian Aue | [1] |
| 2 | Wolfgang Banzhaf | [1] |
| 3 | Jens Busch | [1] |
| 4 | Marc Nunkesser | [5] |
| 5 | Andree Ross | [1] |
| 6 | Jens Ziegler | [1] |