default search action
Carlos Pereira dos Santos
Person information
- affiliation: University of Lisbon, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j17]Alda Carvalho
, Carlos Pereira dos Santos
Some notes on disjunctive short sum: polychromatic nim. Discret. Appl. Math. 324: 113-125 (2023) - [j16]Alexandre M. Silva, Carlos Pereira dos Santos, João Pedro Neto
Disjunctive sums of quasi-nimbers. Theor. Comput. Sci. 945: 113665 (2023) - [i3]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos
Infinitely many absolute universes. CoRR abs/2303.05198 (2023) - [i2]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos
A complete solution for a nontrivial ruleset with entailing moves. CoRR abs/2304.00588 (2023) - 2021
- [j15]Richard J. Nowakowski, Carlos Pereira dos Santos, Alexandre M. Silva:
Three-player nim with podium rule. Int. J. Game Theory 50(3): 623-633 (2021) - [j14]Alda Carvalho
On lattices from combinatorial game theory: infinite case. Int. J. Game Theory 50(3): 655-670 (2021) - [j13]Svenja Huntemann, Richard J. Nowakowski
Bounding game temperature using confusion intervals. Theor. Comput. Sci. 855: 43-60 (2021) - [i1]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos:
Impartial games with entailing moves. CoRR abs/2101.11699 (2021) - 2020
- [j12]Alda Carvalho, João Pedro Neto, Carlos Pereira dos Santos:
Combinatorics of JENGA. Australas. J Comb. 76: 87-104 (2020) - [j11]Michael Fisher, Neil A. McKay, Richard J. Nowakowski, Paul Ottaway, Carlos Pereira dos Santos:
Atomic Weight Calculus of Spindly Games. Integers 20: G2 (2020)
2010 – 2019
- 2018
- [j10]Alda Carvalho
Ordinal sums of impartial games. Discret. Appl. Math. 243: 39-45 (2018) - [j9]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) - [j8]Michael Fisher, Richard J. Nowakowski, Carlos Pereira dos Santos:
Sterling stirling play. Int. J. Game Theory 47(2): 557-576 (2018) - [j7]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) - [j6]Urban Larsson
Game comparison through play. Theor. Comput. Sci. 725: 52-63 (2018) - 2016
- [j5]Urban Larsson, Richard J. Nowakowski, João Pedro Neto, Carlos Pereira dos Santos:
Guaranteed Scoring Games. Electron. J. Comb. 23(3): 3 (2016) - 2014
- [j4]Alex Fink, Aviezri S. Fraenkel, Carlos Pereira dos Santos
LIM is not slim. Int. J. Game Theory 43(2): 269-281 (2014) - [j3]Alda Carvalho
On lattices from combinatorial game theory modularity and a representation theorem: Finite case. Theor. Comput. Sci. 527: 37-49 (2014) - 2012
- [j2]Alda Carvalho, Carlos Pereira dos Santos, Cátia Lente Dias, Francisco Coelho, João Pedro Neto, Sandra Vinagre:
A Recursive Process Related to a Partizan Variation of Wythoff. Integers 12: G3 (2012) - 2011
- [j1]Carlos Pereira dos Santos:
Embedding processes in combinatorial game theory. Discret. Appl. Math. 159(8): 675-682 (2011)
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 2024-04-25 21:01 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: