default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUrban Larsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Prem Kant, Urban Larsson, Ravi Kant Rai
, Akshay V. Upasany:
Bidding Combinatorial Games. Electron. J. Comb. 31(1) (2024)- [j31]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos:
A Complete Solution for a Nontrivial Ruleset with Entailing Moves. Electron. J. Comb. 31(4) (2024) - [j30]Prem Kant, Urban Larsson, Ravi Kant Rai, Akshay V. Upasany:
Constructive comparison in bidding combinatorial games. Int. J. Game Theory 53(4): 1223-1248 (2024) - [j29]Tomoaki Abuku, Shun-ichi Kimura, Hironori Kiya, Urban Larsson, Indrajit Saha, Koki Suetsugu, Takahiro Yamashita:
Enforce and selective operators of combinatorial games. Int. J. Game Theory 53(4): 1249-1273 (2024) - [j28]Urban Larsson, Indrajit Saha, Makoto Yokoo:
Subtraction games in more than one dimension. Theor. Comput. Sci. 1016: 114775 (2024) - 2023
- [j27]Urban Larsson, Richard J. Nowakowski:
Atomic weights and the combinatorial game of bipass. Discret. Math. 346(2): 113229 (2023) - [i17]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos:
Infinitely many absolute universes. CoRR abs/2303.05198 (2023) - [i16]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos:
A complete solution for a nontrivial ruleset with entailing moves. CoRR abs/2304.00588 (2023) - 2022
- [i15]Prem Kant, Urban Larsson, Ravi Kant Rai, Akshay V. Upasany:
Bidding combinatorial games. CoRR abs/2207.08073 (2022) - [i14]Prem Kant, Urban Larsson, Ravi Kant Rai, Akshay V. Upasany:
Constructive comparison in bidding combinatorial games. CoRR abs/2207.11596 (2022) - 2021
- [j26]Ravi Kant Rai, Urban Larsson, Neel Patel:
Discrete Richman-bidding scoring games. Int. J. Game Theory 50(3): 695-728 (2021) - [j25]Urban Larsson, Yakov Babichenko:
Golden games. Theor. Comput. Sci. 891: 50-58 (2021) - [i13]Douglas E. Iannucci, Urban Larsson:
Game values of arithmetic functions. CoRR abs/2101.07608 (2021) - [i12]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos:
Impartial games with entailing moves. CoRR abs/2101.11699 (2021) - 2020
- [j24]Antoine Dailly, Éric Duchêne, Urban Larsson, Gabrielle Paris:
Partition games. Discret. Appl. Math. 285: 509-525 (2020) - [i11]Urban Larsson, Neel Patel, Ravi Kant Rai:
Discrete Richman-bidding Scoring Games. CoRR abs/2003.05635 (2020) - [i10]Urban Larsson, Reshef Meir, Yair Zick:
Cumulative Games: Who is the current player? CoRR abs/2005.06326 (2020) - [i9]Urban Larsson, Richard J. Nowakowski:
Atomic weights and the combinatorial game of Bipass. CoRR abs/2007.03949 (2020)
2010 – 2019
- 2019
- [j23]Gal Cohensius, Urban Larsson, Reshef Meir, David Wahlstedt:
Cumulative Subtraction Games. Electron. J. Comb. 26(4): 4 (2019) - [j22]Aviezri S. Fraenkel, Urban Larsson:
Games on Arbitrarily Large Rats and Playability. Integers 19: G4 (2019) - [i8]Urban Larsson, Yakov Babichenko:
Golden games. CoRR abs/1909.04231 (2019) - 2018
- [j21]Aviezri S. Fraenkel, Urban Larsson, Carlos Pereira dos Santos, Bernhard von Stengel:
Special issue on combinatorial game theory. Int. J. Game Theory 47(2): 375-377 (2018) - [j20]Jonathan Chappelon, Urban Larsson, Akihiro Matsuura:
Two-player Tower of Hanoi. Int. J. Game Theory 47(2): 463-486 (2018) - [j19]Urban Larsson, Simon Rubinstein-Salzedo:
Global Fibonacci nim. Int. J. Game Theory 47(2): 595-611 (2018) - [j18]Urban Larsson, Neil A. McKay, Richard J. Nowakowski, Angela A. Siegel:
Wythoff partizan subtraction. Int. J. Game Theory 47(2): 613-652 (2018) - [j17]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos:
Games with guaranteed scores and waiting moves. Int. J. Game Theory 47(2): 653-671 (2018) - [j16]Éric Duchêne, Marc Heinrich, Urban Larsson, Aline Parreau:
The switch operators and push-the-button games: A sequential compound over rulesets. Theor. Comput. Sci. 715: 71-85 (2018) - [j15]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos:
Game comparison through play. Theor. Comput. Sci. 725: 52-63 (2018) - [i7]Antoine Dailly, Éric Duchêne, Urban Larsson, Gabrielle Paris:
Partition games are pure breaking games. CoRR abs/1803.02621 (2018) - [i6]Gal Cohensius, Urban Larsson, Reshef Meir, David Wahlstedt:
Cumulative subtraction games. CoRR abs/1805.09368 (2018) - 2017
- [j14]Matthew Cook, Urban Larsson, Turlough Neary:
A cellular automaton for blocking queen games. Nat. Comput. 16(3): 397-410 (2017) - [i5]Éric Duchêne, Marc Heinrich, Urban Larsson, Aline Parreau:
The switch operators and push-the-button games: a sequential compound over rulesets. CoRR abs/1707.07966 (2017) - 2016
- [j13]Urban Larsson, Richard J. Nowakowski, João Pedro Neto, Carlos Pereira dos Santos:
Guaranteed Scoring Games. Electron. J. Comb. 23(3): 3 (2016) - [j12]Urban Larsson, Simon Rubinstein-Salzedo:
Grundy values of Fibonacci nim. Int. J. Game Theory 45(3): 617-625 (2016) - [j11]Éric Duchêne, Matthieu Dufour, Silvia Heubach, Urban Larsson:
Building Nim. Int. J. Game Theory 45(4): 859-873 (2016) - 2015
- [j10]Urban Larsson, Nathan Fox:
An Aperiodic Subtraction Game of Nim-Dimension Two. J. Integer Seq. 18(7): 15.7.4 (2015) - [c1]Matthew Cook, Urban Larsson, Turlough Neary:
A Cellular Automaton for Blocking Queen Games. Automata 2015: 71-84 - [i4]Éric Duchêne, Matthieu Dufour, Silvia Heubach, Urban Larsson:
Building Nim. CoRR abs/1502.04068 (2015) - [i3]Jonathan Chappelon, Urban Larsson, Akihiro Matsuura:
Two-Player Tower of Hanoi. CoRR abs/1503.03345 (2015) - 2014
- [j9]Urban Larsson, Johan Wästlund:
Maharaja Nim: Wythoff's Queen meets the Knight. Integers 14: G5 (2014) - [j8]Urban Larsson:
Wythoff Nim Extensions and Splitting Sequences. J. Integer Seq. 17(5): 14.5.7 (2014) - 2013
- [j7]Urban Larsson, Johan Wästlund:
From Heaps of Matches to the Limits of Computability. Electron. J. Comb. 20(3): 41 (2013) - [j6]Urban Larsson:
Impartial games emulating one-dimensional cellular automata and undecidability. J. Comb. Theory A 120(5): 1116-1130 (2013) - 2012
- [j5]Urban Larsson:
A Generalized Diagonal Wythoff Nim. Integers 12: G2 (2012) - [j4]Urban Larsson:
The *-operator and invariant subtraction games. Theor. Comput. Sci. 422: 52-58 (2012) - [i2]Urban Larsson:
Impartial games emulating one-dimensional cellular automata and undecidability. CoRR abs/1201.1039 (2012) - [i1]Urban Larsson, Johan Wästlund:
From heaps of matches to the limits of computability. CoRR abs/1202.0664 (2012) - 2011
- [j3]Urban Larsson:
Blocking Wythoff Nim. Electron. J. Comb. 18(1) (2011) - [j2]Urban Larsson, Peter Hegarty, Aviezri S. Fraenkel:
Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture. Theor. Comput. Sci. 412(8-10): 729-735 (2011)
2000 – 2009
- 2005
- [j1]Andreas Baltz, Peter Hegarty, Jonas Knape, Urban Larsson, Tomasz Schoen:
The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc. Electron. J. Comb. 12 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-03 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
