◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Nick Wormald

6 papers here

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

author position
  • last author6

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

fields
  • math.CO4
  • cs.DM1
  • math.PR1

identity via Semantic Scholar / OpenAlex

activity
20142024
most citedThe number of satisfying assignments of random regular k-SAT formulas

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

collaborators
Showing 2016Show all

2 papers · 1 filter

math.CO2016★ 4 cited

The number of satisfying assignments of random regular k-SAT formulas

Amin Coja-Oghlan, Nick Wormald

Let Φ be a random k-SAT formula in which every variable occurs precisely d times positively and d times negatively. Assuming that k is sufficiently large and that d is…

math.CO2016

The probability of nonexistence of a subgraph in a moderately sparse random graph

Dudley Stark, Nick Wormald

We develop a general procedure that finds recursions for statistics counting isomorphic copies of a graph G0​ in the common random graph models G(n,m) and ${\cal G}(n,p)…

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