<?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-20T05:07:15Z</responseDate>
  <request identifier="19367" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:19367</identifier>
        <datestamp>2026-07-01T14:32:04Z</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>Scalable Data Structures (Dagstuhl Seminar 23211)</dc:title>
          <dc:creator>Brodal, Gerth Stølting</dc:creator>
          <dc:creator>Iacono, John</dc:creator>
          <dc:creator>Kozma, László</dc:creator>
          <dc:creator>Ramachandran, Vijaya</dc:creator>
          <dc:creator>Dallant, Justin</dc:creator>
          <dc:subject>algorithms</dc:subject>
          <dc:subject>big data</dc:subject>
          <dc:subject>computational models</dc:subject>
          <dc:subject>data structures</dc:subject>
          <dc:subject>GPU computing</dc:subject>
          <dc:subject>parallel computation</dc:subject>
          <dc:description>This report documents the program and the outcomes of Dagstuhl Seminar 23211 "Scalable Data Structures". Data structures enable the organization, storage and retrieval of data across a variety of applications. As they are deployed at unprecedented scales, data structures can profoundly affect the efficiency of almost all computational tasks. The study of data structures thus continues to be an important and active area of research with an interplay between data structure design and analysis, developments in computer hardware, and the needs of modern applications. The extended abstracts included in this report give a snapshot of the current state of research on scalable data structures and establish directions for future developments in the field.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Gerth Stølting Brodal and John Iacono and László Kozma and Vijaya Ramachandran and Justin Dallant</dc:contributor>
          <dc:date>2023</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 13, Issue 5 (2023)</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.13.5.114</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-193676</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.5.114</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
