David Gajser

According to our database, David Gajser authored at least 8 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Connectivity with Uncertainty Regions Given as Line Segments.

Sergio Cabello, David Gajser

Algorithmica, May, 2024

2020

Verifying whether one-tape Turing machines run in linear time.

David Gajser

J. Comput. Syst. Sci., 2020

2018

Minimal Normal Graph Covers.

David Gajser, Bojan Mohar

Comb., 2018

2016

On convergence of binomial means, and an application to finite Markov chains.

David Gajser

Ars Math. Contemp., 2016

2015

Verifying time complexity of Turing machines.

David Gajser

Theor. Comput. Sci., 2015

Simple PTAS's for families of graphs excluding a minor.

Sergio Cabello, David Gajser

Discret. Appl. Math., 2015

2013

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

David Gajser

CoRR, 2013

Verifying Time Complexity of Deterministic Turing Machines.

David Gajser

CoRR, 2013