David Gajser
From MaRDI portal
Person:496006
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 |
|---|---|---|
| Connectivity with uncertainty regions given as line segments | 2023-03-17 | Paper |
| Verifying whether one-tape Turing machines run in linear time Journal of Computer and System Sciences | 2019-11-29 | Paper |
| Minimal normal graph covers Combinatorica | 2019-05-23 | Paper |
| On convergence of binomial means, and an application to finite Markov chains Ars Mathematica Contemporanea | 2016-10-21 | Paper |
| Verifying time complexity of Turing machines Theoretical Computer Science | 2015-09-16 | Paper |
| Simple PTAS's for families of graphs excluding a minor Discrete Applied Mathematics | 2015-06-30 | Paper |
| The limit of binomial means of a sequence | 2014-07-15 | Paper |
Research outcomes over time
This page was built for person: David Gajser
