David Gajser

According to our database1, David Gajser authored at least 9 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2024
Connectivity with Uncertainty Regions Given as Line Segments.
Algorithmica, May, 2024

2018
Minimal Normal Graph Covers.
Comb., 2018

2017
Verifying time complexity of Turing machines ; Preverjanje časovne zahtevnosti Turingovih strojev.
PhD thesis, 2017

2016
On convergence of binomial means, and an application to finite Markov chains.
Ars Math. Contemp., 2016

2015
Verifying time complexity of Turing machines.
Theor. Comput. Sci., 2015

Verifying whether One-Tape Turing Machines Run in Linear Time.
Electron. Colloquium Comput. Complex., 2015

Simple PTAS's for families of graphs excluding a minor.
Discret. Appl. Math., 2015

2013
Verifying whether one-tape NTMs run in time $Cn+D$.
CoRR, 2013

Verifying Time Complexity of Deterministic Turing Machines.
CoRR, 2013


  Loading...