"Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs."

Krishnendu Chatterjee et al. (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CONCUR.2019.7

access: open

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/concur/ChatterjeeDHS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/concur/ChatterjeeDHS19
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CONCUR 2019: 7:1-7:16

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.