<?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-20T09:02:04Z</responseDate>
  <request identifier="839" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:839</identifier>
        <datestamp>2024-03-06T11:06:44Z</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>In-Place Randomized Slope-Selection</dc:title>
          <dc:creator>Blunck, Henrik</dc:creator>
          <dc:creator>Vahrenhold, Jan</dc:creator>
          <dc:subject>In-Place Algorithms</dc:subject>
          <dc:subject>Slope Selection</dc:subject>
          <dc:description>Slope selection is a well-known algorithmic tool used in the context of computing robust&#13;
estimators for fitting a line to a collection $mathcal{P}$ of $n$ points in the plane.  We &#13;
demonstrate that it is possible to perform slope selection in expected $mathcal{O}(n log n)$ &#13;
time using only constant extra space in addition to the space needed for representing the input.  &#13;
Our solution is based upon a space-efficient variant of Matouv{s}ek's randomized interpolation &#13;
search, and we believe that the techniques developed in this paper will prove helpful in the &#13;
design of space-efficient randomized algorithms using samples.  To underline this, we also sketch &#13;
how to compute the repeated median line estimator in an in-place setting.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Henrik Blunck and Jan Vahrenhold</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 6091, Data Structures (2006)</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/DagSemProc.06091.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-8390</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06091.4</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>
