pith. sign in

Title resolution pending

Zielonka, W · 1998 · DOI 10.1016/s0304-3975(98)00009-7

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.GT 1 cs.LO 1

years

2026 1 2023 1

verdicts

ACCEPT 1 UNVERDICTED 1

representative citing papers

Doubly Fair Parity Games

cs.GT · 2023-10-20 · accept · novelty 7.0

Fair parity/parity games with fairness constraints on both players are solvable via a polynomial gadget reduction to ordinary parity games or a direct symbolic fixpoint algorithm.

Symbolic Synthesis for LTLf+ Obligations

cs.LO · 2026-04-20 · unverdicted · novelty 6.0

Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.

citing papers explorer

Showing 2 of 2 citing papers.

  • Doubly Fair Parity Games cs.GT · 2023-10-20 · accept · none · ref 24

    Fair parity/parity games with fairness constraints on both players are solvable via a polynomial gadget reduction to ordinary parity games or a direct symbolic fixpoint algorithm.

  • Symbolic Synthesis for LTLf+ Obligations cs.LO · 2026-04-20 · unverdicted · none · ref 6

    Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.