PUMA publications for /user/03159043/algorithmhttps://puma.uni-kassel.de/user/03159043/algorithmPUMA RSS feed for /user/03159043/algorithm2024-03-29T12:52:19+01:00- Merge Sort Algorithm (Remark on Algorithm 426).https://puma.uni-kassel.de/bibtex/225501f34498a5562c8c50ed70bea2199/03159043031590432014-06-24T12:55:46+02:001974 algorithm bron merge mergesort sort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Coenraad Bron" itemprop="url" href="/author/Coenraad%20Bron"><span itemprop="name">C. Bron</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">17 </span></span>(<span itemprop="issueNumber">12</span>):
<span itemprop="pagination">706</span></em> </span>(<em><span>1974<meta content="1974" itemprop="datePublished"/></span></em>)
- Parallel Quicksort.https://puma.uni-kassel.de/bibtex/2b144e04820bca889124e7791d330aff6/03159043031590432014-06-24T12:40:45+02:001991 algorithm chlebus parallel programming quicksort sort sorting vrto <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Bogdan S. Chlebus" itemprop="url" href="/author/Bogdan%20S.%20Chlebus"><span itemprop="name">B. Chlebus</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Imrich Vrto" itemprop="url" href="/author/Imrich%20Vrto"><span itemprop="name">I. Vrto</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>J. Parallel Distrib. Comput.</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">11 </span></span>(<span itemprop="issueNumber">4</span>):
<span itemprop="pagination">332-337</span></em> </span>(<em><span>1991<meta content="1991" itemprop="datePublished"/></span></em>)
- Parallel Shellsort Algorithm for Many-Core GPUs with CUDA.https://puma.uni-kassel.de/bibtex/2819d2f02cc699fd0f3ccfb172e60dce9/03159043031590432014-06-24T12:39:42+02:002012 algorithm cuda gpu lee lin multi parallel shell shellsort sort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Chun-Yuan Lin" itemprop="url" href="/author/Chun-Yuan%20Lin"><span itemprop="name">C. Lin</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Wei Sheng Lee" itemprop="url" href="/author/Wei%20Sheng%20Lee"><span itemprop="name">W. Lee</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Chuan Yi Tang" itemprop="url" href="/author/Chuan%20Yi%20Tang"><span itemprop="name">C. Tang</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>IJGHPC</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">4 </span></span>(<span itemprop="issueNumber">2</span>):
<span itemprop="pagination">1-16</span></em> </span>(<em><span>2012<meta content="2012" itemprop="datePublished"/></span></em>)
- Optimal Sampling Strategies in Quicksort and Quickselect.https://puma.uni-kassel.de/bibtex/20e9c2082f1b09156e42de7226786e1ba/03159043031590432014-06-24T12:38:48+02:002001 algorithm martinez programming quick quickselect quicksort roura sampling sort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Conrado MartÃnez" itemprop="url" href="/author/Conrado%20Mart%c3%adnez"><span itemprop="name">C. MartÃnez</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Salvador Roura" itemprop="url" href="/author/Salvador%20Roura"><span itemprop="name">S. Roura</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>SIAM J. Comput.</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">31 </span></span>(<span itemprop="issueNumber">3</span>):
<span itemprop="pagination">683-705</span></em> </span>(<em><span>2001<meta content="2001" itemprop="datePublished"/></span></em>)
- Enhanced Shell Sorting Algorithm.https://puma.uni-kassel.de/bibtex/27825106029dc781e39c89517a06cef95/03159043031590432014-06-24T12:37:22+02:002007 afzal algo algorithm enhanced shahzad shell shellsort sort sorting <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Basit Shahzad" itemprop="url" href="/author/Basit%20Shahzad"><span itemprop="name">B. Shahzad</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Muhammad Tanvir Afzal" itemprop="url" href="/author/Muhammad%20Tanvir%20Afzal"><span itemprop="name">M. Afzal</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Enformatika</em></span></span> </span>(<em><span>2007<meta content="2007" itemprop="datePublished"/></span></em>)
- Analysis of Shellsort and Related Algorithms.https://puma.uni-kassel.de/bibtex/2a0f574d6dfc03e06162c839c8d46eb9f/03159043031590432014-06-24T12:30:43+02:001996 algorithm analysis comparison sedgewick shell shellsort sort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Robert Sedgewick" itemprop="url" href="/author/Robert%20Sedgewick"><span itemprop="name">R. Sedgewick</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">ESA</span>, </em></span><em>Volume 1136 von Lecture Notes in Computer Science, </em><em>Seite <span itemprop="pagination">1-11</span>. </em><em><span itemprop="publisher">Springer</span>, </em>(<em><span>1996<meta content="1996" itemprop="datePublished"/></span></em>)dblp
- An empirical study of minimal storage sorting.https://puma.uni-kassel.de/bibtex/237a9fbf89bcc3ac388141deca54f0205/03159043031590432014-06-24T12:29:34+02:001963 algo algorithm hibbard minimal programming sorting storage study <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Thomas N. Hibbard" itemprop="url" href="/author/Thomas%20N.%20Hibbard"><span itemprop="name">T. Hibbard</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Commun. ACM</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">6 </span></span>(<span itemprop="issueNumber">5</span>):
<span itemprop="pagination">206-213</span></em> </span>(<em><span>1963<meta content="1963" itemprop="datePublished"/></span></em>)dblp
- Efficient unbalanced merge-sort.https://puma.uni-kassel.de/bibtex/2c6705389899c14860cdfca5fc1822a83/03159043031590432014-06-24T12:28:24+02:002006 algorithm efficient enrico guido merge nardelli proietti sort unbalanced <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Enrico Nardelli" itemprop="url" href="/author/Enrico%20Nardelli"><span itemprop="name">E. Nardelli</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Guido Proietti" itemprop="url" href="/author/Guido%20Proietti"><span itemprop="name">G. Proietti</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Inf. Sci.</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">176 </span></span>(<span itemprop="issueNumber">10</span>):
<span itemprop="pagination">1321-1337</span></em> </span>(<em><span>2006<meta content="2006" itemprop="datePublished"/></span></em>)dblp
- M Pivot Sort - Replacing Quick Sort.https://puma.uni-kassel.de/bibtex/26b23433b75923b34b951cfbd3c503283/03159043031590432014-06-24T12:26:55+02:002005 algorithm edmondson pivot quick sort <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="James R. Edmondson" itemprop="url" href="/author/James%20R.%20Edmondson"><span itemprop="name">J. Edmondson</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">AMCS</span>, </em></span><em>Seite <span itemprop="pagination">47-53</span>. </em><em><span itemprop="publisher">CSREA Press</span>, </em>(<em><span>2005<meta content="2005" itemprop="datePublished"/></span></em>)dblp