◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

L. Kozma

30 papers hereh-index 16643 citations77 works total

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

author position
  • sole author3
  • first author6
  • middle author13
  • last author8

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

fields
  • cs.DS23
  • math.DG5
  • cs.CG2

identity via Semantic Scholar / OpenAlex

activity
20112023
most citedThe landscape of bounds for binary search trees

4 citations · 13 across the 20 of their papers we have counts for

collaborators
Showing 2020Show all

2 papers · 1 filter

cs.DS2020

Splay trees on trees

Benjamin Aram Berendsohn, László Kozma

Search trees on trees (STTs) are a far-reaching generalization of binary search trees (BSTs), allowing the efficient exploration of tree-structured domains. (BSTs are the special c…

cs.CG2020★ 1 cited

Geometric group testing

Benjamin Aram Berendsohn, László Kozma

Group testing is concerned with identifying t defective items in a set of m items, where each test reports whether a specific subset of items contains at least one defective. I…

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