default search action
Tony Johansson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j8]Michael Albert, Cecilia Holmgren, Tony Johansson
, Fiona Skerman
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees. Algorithmica 82(3): 589-615 (2020) - [j7]Tony Johansson:
The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd Degree. Electron. J. Comb. 27(4): 4 (2020) - [j6]Tony Johansson:
On Hamilton cycles in Erdős-Rényi subgraphs of large graphs. Random Struct. Algorithms 57(1): 132-149 (2020)
2010 – 2019
- 2019
- [j5]Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman
Inversions in Split Trees and Conditional Galton-Watson Trees. Comb. Probab. Comput. 28(3): 335-364 (2019) - [j4]Alan M. Frieze, Tony Johansson:
On the insertion time of random walk cuckoo hashing. Random Struct. Algorithms 54(4): 721-729 (2019) - 2018
- [j3]Alan M. Frieze, Tony Johansson:
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph. Comb. Probab. Comput. 27(2): 228-244 (2018) - [c5]Michael Albert, Cecilia Holmgren, Tony Johansson, Fiona Skerman
Permutations in Binary Trees and Split Trees. AofA 2018: 9:1-9:12 - [c4]Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman
Inversions in Split Trees and Conditional Galton-Watson Trees. AofA 2018: 15:1-15:12 - [c3]Colin Cooper, Alan M. Frieze, Tony Johansson:
The Cover Time of a Biased Random Walk on a Random Cubic Graph. AofA 2018: 16:1-16:12 - [c2]Tony Johansson:
The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd Degree. APPROX-RANDOM 2018: 45:1-45:14 - [i5]Colin Cooper, Alan M. Frieze, Tony Johansson:
The cover time of a biased random walk on a random cubic graph. CoRR abs/1801.00760 (2018) - [i4]Tony Johansson:
The cover time of a biased random walk on a random regular graph of odd degree. CoRR abs/1805.05780 (2018) - 2017
- [j2]Alan M. Frieze, Tony Johansson:
On random k-out subgraphs of large graphs. Random Struct. Algorithms 50(2): 143-157 (2017) - [j1]Alan M. Frieze, Tony Johansson:
Minimum Cost Matching in a Random Graph with Random Costs. SIAM J. Discret. Math. 31(1): 489-510 (2017) - [c1]Alan M. Frieze, Tony Johansson:
On the insertion time of random walk cuckoo hashing. SODA 2017: 1497-1502 - 2016
- [i3]Alan M. Frieze, Tony Johansson:
On the insertion time of random walk cuckoo hashing. CoRR abs/1602.04652 (2016)
2000 – 2009
- 2005
- [i2]Pat R. Calhoun, Tony Johansson, Charles E. Perkins, Tom Hiller, Peter J. McCann:
Diameter Mobile IPv4 Application. RFC 4004: 1-53 (2005) - 2004
- [i1]Fredrik Johansson, Tony Johansson:
Mobile IPv4 Extension for Carrying Network Access Identifiers. RFC 3846: 1-8 (2004)
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 05:57 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: