◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Lengler

36 papers hereh-index 221.5k citations99 works total

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

author position
  • sole author4
  • first author8
  • middle author10
  • last author13

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

fields
  • cs.NE21
  • math.PR6
  • math.CO3
  • math.NT2
  • cs.CG1
  • cs.DC1
same name
  • J. Lengler — 1 paper, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20092023
most citedAverage Distance in a General Class of Scale-Free Networks with Underlying Geometry

23 citations · 87 across the 20 of their papers we have counts for

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.NE2011

Black-Box Complexities of Combinatorial Problems

Benjamin Doerr, Timo Kötzing, Johannes Lengler +1

Black-box complexity is a complexity theoretic measure for how difficult a problem is to be optimized by a general purpose optimization algorithm. It is thus one of the few means 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.