<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>thesis</genre>

<titleInfo><title>Improved lower bounds for request-response and finitary Streett games</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>IST Austria Technical Report</title>
</titleInfo>

<note type="publicationStatus">published</note>



<name type="personal">
  <namePart type="given">Krishnendu</namePart>
  <namePart type="family">Chatterjee</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">2E5DCA20-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-4561-241X</description></name>
<name type="personal">
  <namePart type="given">Thomas A</namePart>
  <namePart type="family">Henzinger</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">40876CD8-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000−0002−2985−7724</description></name>
<name type="personal">
  <namePart type="given">Florian</namePart>
  <namePart type="family">Horn</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">37327ACE-F248-11E8-B48F-1D18A9856A87</identifier></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">KrCh</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>

<name type="corporate">
  <namePart></namePart>
  <identifier type="local">ToHe</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">We consider two-player games played on graphs with request-response and finitary Streett objectives. We show these games are PSPACE-hard, improving the previous known NP-hardness. We also improve the lower bounds on memory required by the winning strategies for the players.</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="IST-2009-0002_IST-2009-0002.pdf">https://research-explorer.ista.ac.at/download/5394/5511/IST-2009-0002_IST-2009-0002.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>IST Austria</publisher><dateIssued encoding="w3cdtf">2009</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host">
  <identifier type="issn">2664-1690</identifier><identifier type="doi">10.15479/AT:IST-2009-0002</identifier>
<part><extent unit="pages">11</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<apa>Chatterjee, K., Henzinger, T. A., &amp;#38; Horn, F. (2009). &lt;i&gt;Improved lower bounds for request-response and finitary Streett games&lt;/i&gt;. IST Austria. &lt;a href=&quot;https://doi.org/10.15479/AT:IST-2009-0002&quot;&gt;https://doi.org/10.15479/AT:IST-2009-0002&lt;/a&gt;</apa>
<ista>Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.</ista>
<mla>Chatterjee, Krishnendu, et al. &lt;i&gt;Improved Lower Bounds for Request-Response and Finitary Streett Games&lt;/i&gt;. IST Austria, 2009, doi:&lt;a href=&quot;https://doi.org/10.15479/AT:IST-2009-0002&quot;&gt;10.15479/AT:IST-2009-0002&lt;/a&gt;.</mla>
<chicago>Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. &lt;i&gt;Improved Lower Bounds for Request-Response and Finitary Streett Games&lt;/i&gt;. IST Austria, 2009. &lt;a href=&quot;https://doi.org/10.15479/AT:IST-2009-0002&quot;&gt;https://doi.org/10.15479/AT:IST-2009-0002&lt;/a&gt;.</chicago>
<ieee>K. Chatterjee, T. A. Henzinger, and F. Horn, &lt;i&gt;Improved lower bounds for request-response and finitary Streett games&lt;/i&gt;. IST Austria, 2009.</ieee>
<ama>Chatterjee K, Henzinger TA, Horn F. &lt;i&gt;Improved Lower Bounds for Request-Response and Finitary Streett Games&lt;/i&gt;. IST Austria; 2009. doi:&lt;a href=&quot;https://doi.org/10.15479/AT:IST-2009-0002&quot;&gt;10.15479/AT:IST-2009-0002&lt;/a&gt;</ama>
<short>K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>5394</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-12T11:39:05Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2024-10-09T21:08:23Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
