Daniel Sawitzki
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Lower bounds on the OBDD size of two fundamental functions' graphs Information Processing Letters | 2010-01-29 | Paper |
| SOFSEM 2004: Theory and Practice of Computer Science Lecture Notes in Computer Science | 2009-06-04 | Paper |
| Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science Lecture Notes in Computer Science | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science Lecture Notes in Computer Science | 2005-12-08 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science Lecture Notes in Computer Science | 2005-12-07 | Paper |
| Experimental and Efficient Algorithms Lecture Notes in Computer Science | 2005-11-30 | Paper |
| Network Analysis Lecture Notes in Computer Science | 2005-11-11 | Paper |
| scientific article; zbMATH DE number 2087200 (Why is no real title available?) | 2004-08-11 | Paper |
Research outcomes over time
This page was built for person: Daniel Sawitzki
