Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Simple and tight complexity lower bounds for solving Rabin games."

Antonio Casares et al. (2024)

> Home

Details and statistics

DOI: 10.1137/1.9781611977936.16

access: closed

type: Conference or Workshop Paper

metadata version: 2024-04-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sosa/CasaresPPST24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sosa/CasaresPPST24
Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini:
Simple and tight complexity lower bounds for solving Rabin games. SOSA 2024: 160-167

a service of

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.