default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. S. Thejaswini
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]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- [c7]Rupak Majumdar
, Irmak Saglam, K. S. Thejaswini:
Rabin Games and Colourful Universal Trees. TACAS (3) 2024: 213-231 - [c6]Anne-Kathrin Schmuck, K. S. Thejaswini, Irmak Saglam, Satya Prakash Nayak:
Solving Two-Player Games Under Progress Assumptions. VMCAI (1) 2024: 208-231 - [i7]Rupak Majumdar, Irmak Saglam, K. S. Thejaswini:
Rabin Games and Colourful Universal Trees. CoRR abs/2401.07548 (2024) - 2023
- [c5]Aditya Prakash, K. S. Thejaswini:
On History-Deterministic One-Counter Nets. FoSSaCS 2023: 218-239 - [i6]Anne-Kathrin Schmuck, K. S. Thejaswini, Irmak Saglam, Satya Prakash Nayak:
Solving Two-Player Games under Progress Assumptions. CoRR abs/2310.12767 (2023) - [i5]Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini:
Simple and tight complexity lower bounds for solving Rabin games. CoRR abs/2310.20433 (2023) - 2022
- [c4]Marcin Jurdzinski, Rémi Morvan, K. S. Thejaswini:
Universal Algorithms for Parity Games and Nested Fixpoints. Principles of Systems Design 2022: 252-271 - [c3]K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdzinski:
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. FSTTCS 2022: 44:1-44:20 - [i4]Aditya Prakash, K. S. Thejaswini:
On History-Deterministic One-Counter Nets. CoRR abs/2210.10084 (2022) - 2021
- [c2]A. R. Balasubramanian, K. S. Thejaswini:
Adaptive Synchronisation of Pushdown Automata. CONCUR 2021: 17:1-17:15 - [i3]A. R. Balasubramanian, K. S. Thejaswini:
Adaptive Synchronisation of Pushdown Automata. CoRR abs/2102.06897 (2021) - 2020
- [c1]Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini:
The Strahler Number of a Parity Game. ICALP 2020: 123:1-123:19 - [i2]Laure Daviaud, Marcin Jurdzinski, K. S. Thejaswini:
The Strahler number of a parity game. CoRR abs/2003.08627 (2020) - [i1]Marcin Jurdzinski, Rémi Morvan, Pierre Ohlmann, K. S. Thejaswini:
A symmetric attractor-decomposition lifting algorithm for parity games. CoRR abs/2010.08288 (2020)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
