◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

I. H. Sudborough

8 papers hereh-index 313.6k citations141 works total

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

author position
  • middle author2
  • last author6

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

fields
  • math.CO6
  • cs.DM1
  • cs.IT1

identity via Semantic Scholar / OpenAlex

activity
20062023
most citedNew Lower Bounds for Permutation Arrays Using Contraction

1 citations · 2 across the 7 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2015

Constructing Permutation Arrays from Groups

Sergey Bereg, Avi Levy, I. Hal Sudborough

Let M(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to…

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