◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Enno Ohlebusch

5 papers hereh-index 296.6k citations107 works total

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

author position
  • middle author2
  • last author3

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

fields
  • cs.DS4
  • q-bio.GN1

identity via Semantic Scholar / OpenAlex

activity
20102025
most citedLightweight LCP-Array Construction in Linear Time

4 citations · 5 across the 3 of their papers we have counts for

collaborators
Showing 2010Show all

1 paper · 1 filter

cs.DS2010★ 4 cited

Lightweight LCP-Array Construction in Linear Time

Simon Gog, Enno Ohlebusch

The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) a…

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