Daniel Sawitzki - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2007

Lower bounds on the OBDD size of two fundamental functions graphsDaniel Sawitzki. ipl, 101(2):66-71, 2007. [doi]

Implicit Simulation of FNC AlgorithmsDaniel Sawitzki. eccc, 14(028), 2007. [doi]

2006

The Complexity of Problems on Implicitly Represented InputsDaniel Sawitzki. sofsem 2006: 471-482 [doi]

Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph AlgorithmsDaniel Sawitzki. latin 2006: 781-792 [doi]

Algorithmik und Komplexität OBDD-repräsentierter GraphenDaniel Sawitzki. PhD thesis, Dortmund University of Technology, 2006. [doi]

2005

On Symbolic Scheduling Independent Tasks with Restricted Execution TimesDaniel Sawitzki. wea 2005: 277-289 [doi]

Lower Bounds on the OBDD Size of Graphs of Some Popular FunctionsDaniel Sawitzki. sofsem 2005: 298-309 [doi]

2004

BlockmodelsMarc Nunkesser, Daniel Sawitzki. Dagstuhl 2005: 253-292 [doi]

Implicit Flow Maximization by Iterative SquaringDaniel Sawitzki. sofsem 2004: 301-313 [doi]

A Symbolic Approach to the All-Pairs Shortest-Paths ProblemDaniel Sawitzki. criwg 2004: 154-167 [doi]

Experimental Studies of Symbolic Shortest-Path AlgorithmsDaniel Sawitzki. wea 2004: 482-497 [doi]

2002

Automatic Generation of Control Programs for Walking Robots Using Genetic ProgrammingJens Busch, Jens Ziegler, Christian Aue, Andree Ross, Daniel Sawitzki, Wolfgang Banzhaf. eurogp 2002: 258-267 [doi]

Sign in or sign up to see more results.

runs on WebDSL