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 |
|---|---|---|
| Finding compact scheme forests in nested normal form is NP-hard Information and Computation | 1995-01-12 | Paper |
| scientific article; zbMATH DE number 219207 (Why is no real title available?) | 1993-06-29 | Paper |
| Assigning dependency graphs onto processor networks Parallel Computing | 1991-01-01 | Paper |
| Losslessness and project-join constructibility in relational databases Acta Informatica | 1987-01-01 | Paper |
| On finding a worst-case optimal fourth normal form database decomposition BIT | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4033148 (Why is no real title available?) | 1986-01-01 | Paper |
| Testing a dependency-preserving decomposition for losslessness Information Systems | 1983-01-01 | Paper |
| Enumerating the cycles of a digraph: a new preprocessing strategy Information Sciences | 1982-01-01 | Paper |
Research outcomes over time
This page was built for person: Peter Thanisch
