default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKimmo Eriksson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j41]Elena Miu
, Luke Rendell, Sam Bowles, Rob Boyd, Daniel Cownden, Magnus Enquist, Kimmo Eriksson, Marcus W. Feldman, Timothy P. Lillicrap, Richard McElreath, Stuart Murray, James Ounsley, Kevin N. Lala:
The refinement paradox and cumulative cultural evolution: Complex products of collective improvement favor conformist outcomes, blind copying, and hyper-credulity. PLoS Comput. Biol. 20(9): 1012436 (2024)
2010 – 2019
- 2018
- [j40]Kimmo Eriksson, Markus Jonsson, Jonas Sjöstrand:
An Exponential Limit Shape of Random q-proportion Bulgarian Solitaire. Integers 18: A58 (2018) - [j39]Kimmo Eriksson, Markus Jonsson, Jonas Sjöstrand:
Markov Chains on Graded Posets - Compatibility of Up-Directed and Down-Directed Transition Probabilities. Order 35(1): 93-109 (2018) - [j38]Daniel Cownden, Kimmo Eriksson, Pontus Strimling:
The implications of learning across perceptually and strategically distinct situations. Synth. 195(2): 511-528 (2018) - 2017
- [j37]Kimmo Eriksson, Marcus Lindskog:
Encoding of Numerical Information in Memory: Magnitude or Nominal? J. Numer. Cogn. 3(1): 58-76 (2017) - 2015
- [j36]Kimmo Eriksson, Pontus Strimling:
Group differences in broadness of values may drive dynamics of public opinion on moral issues. Math. Soc. Sci. 77: 1-8 (2015) - 2012
- [j35]Kimmo Eriksson, Jonas Sjöstrand:
Limiting shapes of birth-and-death processes on Young diagrams. Adv. Appl. Math. 48(4): 575-602 (2012) - 2011
- [j34]Kimmo Eriksson, Fredrik Jansson, Thomas Vetander:
The Assignment Game with Negative Externalities and Bounded Rationality. IGTR 13(4): 443-459 (2011) - 2010
- [j33]Henrik Eriksson, Kimmo Eriksson:
Words with Intervening Neighbours in Infinite Coxeter Groups are Reduced. Electron. J. Comb. 17(1) (2010) - [j32]Kimmo Eriksson:
A Note on the Exact Expected Length of the kth Part of a Random Partition. Integers 10: A25 (2010)
2000 – 2009
- 2009
- [j31]Kimmo Eriksson, Pontus Strimling:
Partner Search Heuristics in the Lab: Stability of Matchings Under Various Preference Structures. Adapt. Behav. 17(6): 524-536 (2009) - [j30]Henrik Eriksson, Kimmo Eriksson:
Conjugacy of Coxeter Elements. Electron. J. Comb. 16(2) (2009) - 2008
- [j29]Kimmo Eriksson, Olle Häggström:
Instability of matchings in decentralized markets with various preference structures. Int. J. Game Theory 36(3-4): 409-420 (2008) - [j28]Kimmo Eriksson, Jonas Sjöstrand, Pontus Strimling:
Asymmetric equilibria in dynamic two-sided matching markets with independent preferences. Int. J. Game Theory 36(3-4): 421-440 (2008) - 2007
- [j27]Kimmo Eriksson, Jonas Sjöstrand:
On Two Theorems of Quinzii and Rent Controlled housing Allocation in Sweden. IGTR 9(3): 515-525 (2007) - [j26]Kimmo Eriksson, Jonas Sjöstrand, Pontus Strimling:
Optimal Expected Rank in a Two-Sided Secretary Problem. Oper. Res. 55(5): 921-931 (2007) - 2006
- [j25]Kimmo Eriksson, Jonas Sjöstrand, Pontus Strimling:
Three-dimensional stable matching with cyclic preferences. Math. Soc. Sci. 52(1): 77-87 (2006) - 2003
- [j24]Henrik Eriksson, Kimmo Eriksson, Jonas Sjöstrand:
Exact Expectations for Random Graphs and Assignments. Comb. Probab. Comput. 12(4): 401-412 (2003) - 2002
- [j23]Robin Chapman, Kimmo Eriksson, Richard P. Stanley, Reiner Martin:
On the Number of Divisors of n in a Special Interval: 10847. Am. Math. Mon. 109(1): 80 (2002) - 2001
- [j22]Henrik Eriksson, Kimmo Eriksson, Jonas Sjöstrand:
Note on the Lamp Lighting Problem. Adv. Appl. Math. 27(Issues): 357-366 (2001) - [j21]Henrik Eriksson, Kimmo Eriksson, Johan Karlander, Lars J. Svensson, Johan Wästlund:
Sorting a bridge hand. Discret. Math. 241(1-3): 289-300 (2001) - [j20]Kimmo Eriksson, Johan Karlander:
Stable outcomes of the roommate game with transferable utility. Int. J. Game Theory 29(4): 555-569 (2001) - [j19]Robin Chapman, Kimmo Eriksson, Richard P. Stanley:
Problem 10847. Am. Math. Mon. 108(1): 77 (2001) - 2000
- [j18]Kimmo Eriksson, Svante Linusson:
A Combinatorial Theory of Higher-Dimensional Permutation Arrays. Adv. Appl. Math. 25(2): 194-211 (2000) - [j17]Kimmo Eriksson, Svante Linusson:
A Decomposition of Fl(n)d Indexed by Permutation Arrays. Adv. Appl. Math. 25(2): 212-227 (2000) - [j16]Niklas Eriksen, Henrik Eriksson, Kimmo Eriksson:
Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations. Electron. J. Comb. 7 (2000) - [j15]Kimmo Eriksson, Johan Karlander:
Stable matching in a common generalization of the marriage and assignment models. Discret. Math. 217(1-3): 135-156 (2000) - [j14]Kimmo Eriksson, Johan Karlander, Lars-Erik Öller:
Becker's assortative assignments: stability and fairness. Math. Soc. Sci. 39(2): 109-118 (2000)
1990 – 1999
- 1999
- [j13]Mireille Bousquet-Mélou, Kimmo Eriksson:
A Refinement of the Lecture Hall Theorem. J. Comb. Theory A 86(1): 63-84 (1999) - 1998
- [j12]Henrik Eriksson, Kimmo Eriksson:
Affine Weyl Groups as Infinite Permutations. Electron. J. Comb. 5 (1998) - [j11]Gerd Eriksson, Henrik Eriksson, Kimmo Eriksson:
Moving a Food Trolley Around a Corner. Theor. Comput. Sci. 191(1-2): 193-203 (1998) - 1997
- [j10]Kimmo Eriksson:
Autocorrelation and the Enumeration of Strings Avoiding a Fixed String. Comb. Probab. Comput. 6(1): 45-48 (1997) - 1996
- [j9]Kimmo Eriksson:
Strong convergence and the polygon property of 1-player games. Discret. Math. 153(1-3): 105-122 (1996) - [j8]Kimmo Eriksson:
Reduced words in affine Coxeter groups. Discret. Math. 157(1-3): 127-146 (1996) - [j7]Kimmo Eriksson:
Strong Convergence and a Game of Numbers. Eur. J. Comb. 17(4): 379-390 (1996) - [j6]Kimmo Eriksson:
Chip-Firing Games on Mutating Graphs. SIAM J. Discret. Math. 9(1): 118-128 (1996) - 1995
- [j5]Kimmo Eriksson:
Classroom note: An easy bijective proof of the matrix-forest theorem. Australas. J Comb. 12: 301-304 (1995) - [j4]Kimmo Eriksson, Svante Linusson:
The size of Fulton's essential set. Electron. J. Comb. 2 (1995) - [j3]Kimmo Eriksson:
The numbers game and coxeter groups. Discret. Math. 139(1-3): 155-166 (1995) - 1994
- [j2]Anders Björner, Kimmo Eriksson:
Extendable shellability for rank 3 matroid complexes. Discret. Math. 132(1-3): 373-376 (1994) - [j1]Kimmo Eriksson:
Reachability is Decidable in the Numbers Game. Theor. Comput. Sci. 131(2): 431-439 (1994)
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-12-02 21:27 CET 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:
