◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Matoušek

4 papers hereh-index 6014.5k citations330 works total

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

author position
  • first author1
  • middle author2
  • last author1

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

fields
  • math.CO3
  • math.MG1

identity via Semantic Scholar / OpenAlex

activity
19982005
most citedTopological lower bounds for the chromatic number: A hierarchy

35 citations · 45 across the 3 of their papers we have counts for

collaborators
Showing 2003Show all

1 paper · 1 filter

math.CO2003

Expected length of the longest common subsequence for large alphabets

Marcos Kiwi, Martin Loebl, Jiri Matousek

We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield…

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