Stefan Reisch
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 |
|---|---|---|
| Upper bounds for sorting integers on random access machines Theoretical Computer Science | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3846871 (Why is no real title available?) | 1982-01-01 | Paper |
| Hex ist Pspace-vollständig. (Hex is Pspace-complete) Acta Informatica | 1981-01-01 | Paper |
| A gap between the actual complexity of permutations and their entropy defined by Stoss Acta Informatica | 1981-01-01 | Paper |
| Gobang is PSPACE-complete Acta Informatica | 1980-01-01 | Paper |
Research outcomes over time
This page was built for person: Stefan Reisch
