default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohan Wästlund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i6]Johan Wästlund:
Faulty picture-hanging improved. CoRR abs/2102.00984 (2021)
2010 – 2019
- 2014
- [j15]Urban Larsson, Johan Wästlund:
Maharaja Nim: Wythoff's Queen meets the Knight. Integers 14: G5 (2014) - 2013
- [j14]Urban Larsson, Johan Wästlund:
From Heaps of Matches to the Limits of Computability. Electron. J. Comb. 20(3): 41 (2013) - [j13]Olle Häggström, Johan Wästlund:
Rigorous Computer Analysis of the Chow-Robbins Game. Am. Math. Mon. 120(10): 893-900 (2013) - 2012
- [i5]Olle Häggström, Johan Wästlund:
Rigorous computer analysis of the Chow-Robbins game. CoRR abs/1201.0626 (2012) - [i4]Urban Larsson, Johan Wästlund:
From heaps of matches to the limits of computability. CoRR abs/1202.0664 (2012) - 2011
- [j12]Johan Wästlund:
The Blind Passenger and the Assignment Problem. Comb. Probab. Comput. 20(3): 467-480 (2011) - [i3]Johan Wästlund:
When only the last one will do. CoRR abs/1104.3049 (2011) - 2010
- [i2]Ragnar Freij, Johan Wästlund:
Partially ordered secretaries. CoRR abs/1008.3310 (2010)
2000 – 2009
- 2009
- [j11]Niklas Eriksen, Ragnar Freij, Johan Wästlund:
Enumeration of Derangements with Descents in Prescribed Positions. Electron. J. Comb. 16(1) (2009) - [i1]Johan Wästlund:
The strange algebra of combinatorial games. CoRR abs/0912.0448 (2009) - 2007
- [j10]Svante Linusson, Johan Wästlund:
Completing a (k - 1)-Assignment. Comb. Probab. Comput. 16(4): 621-629 (2007) - [j9]Johan Håstad
, Svante Linusson, Johan Wästlund:
A Smaller Sleeping Bag for a Baby Snake. Discret. Comput. Geom. 38(1): 171 (2007) - [j8]Johan Wästlund:
An Elementary Proof of the Wallis Product Formula for pi. Am. Math. Mon. 114(10): 914-917 (2007) - 2006
- [j7]Svante Janson, Johan Wästlund:
Addendum to "The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph". Random Struct. Algorithms 28(4): 511-512 (2006) - 2005
- [j6]Johan Wästlund:
A Solution of Two-Person Single-Suit Whist. Electron. J. Comb. 12 (2005) - [j5]Johan Wästlund:
Two-Person Symmetric Whist. Electron. J. Comb. 12 (2005) - [j4]Johan Wästlund:
A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment. Random Struct. Algorithms 26(1-2): 237-251 (2005) - 2003
- [j3]Johan Wästlund:
Perfect Packings of Squares Using the Stack-Pack Strategy. Discret. Comput. Geom. 29(4): 625-631 (2003) - 2001
- [j2]Johan Håstad, Svante Linusson, Johan Wästlund:
A Smaller Sleeping Bag for a Baby Snake. Discret. Comput. Geom. 26(1): 173-181 (2001) - [j1]Henrik Eriksson, Kimmo Eriksson, Johan Karlander, Lars J. Svensson, Johan Wästlund:
Sorting a bridge hand. Discret. Math. 241(1-3): 289-300 (2001)
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-24 23:04 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:
