◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Jurdzinski

15 papers hereh-index 243.4k citations63 works total

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

author position
  • first author6
  • middle author6
  • last author3

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

fields
  • cs.GT7
  • cs.FL3
  • cs.LO3
  • cs.CC1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

activity
20082018
most citedSuccinct progress measures for solving parity games

56 citations · 307 across the 14 of their papers we have counts for

collaborators
Showing 2018Show all

2 papers · 1 filter

cs.FL2018★ 19 cited

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games

Wojciech Czerwiński, Laure Daviaud, Nathanaël Fijalkow +3

Several distinct techniques have been proposed to design quasi-polynomial algorithms for solving parity games since the breakthrough result of Calude, Jain, Khoussainov, Li, and St…

cs.FL2018

When is Containment Decidable for Probabilistic Automata?

Laure Daviaud, Marcin Jurdziński, Ranko Lazić +3

The emptiness and containment problems for probabilistic automata are natural quantitative generalisations of the classical language emptiness and inclusion problems for Boolean au…

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