◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hans-Peter Lehmann

13 papers hereh-index 8109 citations14 works total

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

author position
  • first author7
  • middle author6

Across the 13 of 13 papers where every author was matched, so the position is known.

fields
  • cs.DS13

identity via Semantic Scholar / OpenAlex

activity
20212025
most citedShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force

2 citations · 4 across the 8 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.DS2024

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding

Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri +2

A minimal perfect hash function (MPHF) maps a set of n keys to {1, ..., n} without collisions. Such functions find widespread application e.g. in bioinformatics and databases. In t…

◍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.