BibSonomy

The blue social bookmark and publication sharing system.

( en | de | ru )

 

tag
  • tag
  • user
  • group
  • author
  • concept
  • BibTeX key
  • search
  • sign in
  • register
  • groups
  • genealogy
  • popular 
    • posts
    • tags
    • authors
    • concepts
    • discussions
  • sign in
  • register

Login

Log in with your username.

@

I've lost my password.


Log in with your OpenID-Provider.

  • Other OpenID-Provider
  1. tag
  2. parallel algorithm seminar

Publication title

bookmarks  (hide)
  • display
  • all
  • bookmarks only
  • bookmarks per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • sort by
  • added at
  • title
  • RSS
  • BibTeX
  • XML

    No matching posts.
  • ⟨⟨
  • ⟨
  • ⟩
  • ⟩⟩

publications  (hide)2  
  • display
  • all
  • publications only
  • publications per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • sort by
  • added at
  • title
  • author
  • publication date
  • entry type
  • help for advanced sorting...
  • RSS
  • BibTeX
  • RDF
  • more...

  •  

     
    2Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort
     

    G. Sepesi. (2007)cite arxiv:0706.2893Comment: 4 pages, 4 figures.
    15 years ago by @mwetzel
    show all tags
    • 2011
    • algorithm
    • heapsort
    • kde
    • parallel
    • seminar
    • sorting
     
      2011algorithmheapsortkdeparallelseminarsorting
      (0)
      copydeleteadd this publication to your clipboard
      • community post
      • history of this post
      • URL
      • DOI
      • BibTeX
      • EndNote
      • APA
      • Chicago
      • DIN 1505
      • Harvard
      • MSOffice XML
       
       
    •  

       
      3A Practical Quicksort Algorithm for Graphics Processors.
       

      D. Cederman, and P. Tsigas. ESA, volume 5193 of Lecture Notes in Computer Science, page 246-258. Springer, (2008)
      15 years ago by @mwetzel
      show all tags
      • 2011
      • algorithm
      • kde
      • parallel
      • quicksort
      • seminar
      • sorting
       
        2011algorithmkdeparallelquicksortseminarsorting
        (0)
        copydeleteadd this publication to your clipboard
        • community post
        • history of this post
        • URL
        • DOI
        • BibTeX
        • EndNote
        • APA
        • Chicago
        • DIN 1505
        • Harvard
        • MSOffice XML
         
         
      • ⟨⟨
      • ⟨
      • 1
      • ⟩
      • ⟩⟩

      browse

      • parallel as concept from all users
      • algorithm as concept from all users
      • seminar as concept from all users
      • parallel algorithm seminar as concept from all users

      related tags

      • + | 2011
      • + | kde
      • + | sorting
      • + | quicksort
      • + | heapsort
      What is BibSonomy?
      Getting Started
      Browser Buttons
      Help
      Developer
      Overview
      API Documentation
      Contact & Privacy
      Contact
      Privacy & Terms of Use
      Cookies
      Report Issues
      BibSonomy Wiki
      Integration
      PUMA
      TYPO3 Extension
      WordPress Plugin
      Java REST Client
      Supported Sites
      more
      About BibSonomy
      Team
      Blog
      Mailing List
      Social Media
       Follow us on Twitter

      BibSonomy is offered by the Data Science Chair of the University of Würzburg, the Information Processing and Analytics Group of the Humboldt-Unversität zu Berlin, the KDE Group of the University of Kassel, and the L3S Research Center.