<?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-20T10:41:59Z</responseDate>
  <request identifier="3536" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:3536</identifier>
        <datestamp>2024-03-06T10:25:49Z</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>Applications of Combinatorial Topology to Computer Science (Dagstuhl Seminar 12121)</dc:title>
          <dc:creator>Fajstrup, Lisbeth</dc:creator>
          <dc:creator>Feichtner-Kozlov, Dmitry</dc:creator>
          <dc:creator>Herlihy, Maurice</dc:creator>
          <dc:subject>Combinatorial topology</dc:subject>
          <dc:subject>Distributed computing</dc:subject>
          <dc:subject>Persistent homology</dc:subject>
          <dc:subject>Program semantics</dc:subject>
          <dc:subject>Sensor networks</dc:subject>
          <dc:description>This report documents the program of Dagstuhl Seminar 12121 "Applications of Combinatorial Topology to Computer Science". The seminar brought together researchers working on applications of combinatorial topology to various fields of computer science. The goal was to foster communication across these fields by providing researchers in each field the opportunity to explain their research programs to the others. The fields covered included distributed computing, persistent homology, semantics of concurrency, and sensor networks.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Lisbeth Fajstrup and Dmitry Feichtner-Kozlov and Maurice Herlihy</dc:contributor>
          <dc:date>2012</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 2, Issue 3 (2012)</dc:relation>
          <dc:type>Article</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/DagRep.2.3.50</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-35363</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.3.50</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
