◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

U. Larsson

47 papers hereh-index 9325 citations70 works total

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

author position
  • sole author11
  • first author23
  • middle author7
  • last author5

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

fields
  • math.CO35
  • cs.GT7
  • cs.DM2
  • math.NT2
  • cs.CC1

identity via Semantic Scholar / OpenAlex

activity
20092024
most citedAbsolute Combinatorial Game Theory

10 citations · 36 across the 43 of their papers we have counts for

collaborators
Showing 2022Show all

2 papers · 1 filter

cs.GT2022★ 1 cited

Constructive comparison in bidding combinatorial games

Prem Kant, Urban Larsson, Ravi K. Rai +1

A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning opt…

cs.GT2022

Bidding combinatorial games

Prem Kant, Urban Larsson, Ravi K. Rai +1

Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention…

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