◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

David Gajser

6 papers hereh-index 245 citations11 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • first author1
  • last author2

Across the 6 of 6 papers where every author was matched, so the position is known.

fields
  • cs.CC1
  • cs.CG1
  • cs.DS1
  • cs.LO1
  • math.CA1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20132023
most citedSimple PTAS's for families of graphs excluding a minor

19 citations · 30 across the 5 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2013

Verifying whether One-Tape Non-Deterministic Turing Machines Run in Time Cn+D

David Gajser

We discuss the following family of problems, parameterized by integers C≥2 and D≥1: Does a given one-tape non-deterministic q-state Turing machine make at most Cn+D…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.