◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

John Fearnley

48 papers hereh-index 191.3k citations67 works total

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

author position
  • sole author3
  • first author22
  • middle author21

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

fields
  • cs.GT21
  • cs.CC13
  • cs.DS6
  • cs.FL3
  • cs.LO2
  • math.NT2

identity via Semantic Scholar / OpenAlex

activity
20042026
most citedReachability in Two-Clock Timed Automata is PSPACE-complete

27 citations · 187 across the 36 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.GT2011★ 3 cited

Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width

John Fearnley, Sven Schewe

Parity games are a much researched class of games in NP intersect CoNP that are not known to be in P. Consequently, researchers have considered specialised algorithms for the case…

◍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.