◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Nikolaj Hass

1 paper hereh-index 12 citations1 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.DS1

identity via Semantic Scholar / OpenAlex

collaborators

1 paper

cs.DS2018

Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme

Martin Aumüller, Nikolaj Hass

This paper presents simple variants of the BlockQuicksort algorithm described by Edelkamp and Weiss (ESA 2016). The simplification is achieved by using Lomuto's partitioning scheme…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.