<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T12:30:22Z</responseDate>
  <request identifier="8901" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:8901</identifier>
        <datestamp>2024-03-06T10:43:42Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Periods in Subtraction Games (Keynote Speakers)</dc:title>
          <dc:creator>Benesh, Bret</dc:creator>
          <dc:creator>Carter, Jamylle</dc:creator>
          <dc:creator>Coleman, Deidra A.</dc:creator>
          <dc:creator>Crabill, Douglas G.</dc:creator>
          <dc:creator>Good, Jack H.</dc:creator>
          <dc:creator>Smith, Michael A.</dc:creator>
          <dc:creator>Travis, Jennifer</dc:creator>
          <dc:creator>Ward, Mark Daniel</dc:creator>
          <dc:subject>combinatorial games</dc:subject>
          <dc:subject>subtraction games</dc:subject>
          <dc:subject>periods</dc:subject>
          <dc:subject>asymptotic structure</dc:subject>
          <dc:description>We discuss the structure of periods in subtraction games. In particular, we discuss ways that a computational approach yields insights to the periods that emerge in the asymptotic structure of these combinatorial games.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Bret Benesh and Jamylle Carter and Deidra A. Coleman and Douglas G. Crabill and Jack H. Good and Michael A. Smith and Jennifer Travis and Mark Daniel Ward</dc:contributor>
          <dc:date>2018</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 110, 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.AofA.2018.8</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-89015</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2018.8</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
