Tony Johansson

Orcid: 0000-0002-9264-3462

According to our database1, Tony Johansson authored at least 12 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
On Hamilton cycles in Erdős-Rényi subgraphs of large graphs.
Random Struct. Algorithms, 2020

Embedding Small Digraphs and Permutations in Binary Trees and Split Trees.
Algorithmica, 2020

2018
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph.
Comb. Probab. Comput., 2018

The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd Degree.
Proceedings of the Approximation, 2018

The Cover Time of a Biased Random Walk on a Random Cubic Graph.
Proceedings of the 29th International Conference on Probabilistic, 2018

Inversions in Split Trees and Conditional Galton-Watson Trees.
Proceedings of the 29th International Conference on Probabilistic, 2018

Permutations in Binary Trees and Split Trees.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Minimum Cost Matching in a Random Graph with Random Costs.
SIAM J. Discret. Math., 2017

On random <i>k</i>-out subgraphs of large graphs.
Random Struct. Algorithms, 2017

On the insertion time of random walk cuckoo hashing.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2005
Diameter Mobile IPv4 Application.
RFC, August, 2005

2004
Mobile IPv4 Extension for Carrying Network Access Identifiers.
RFC, June, 2004


  Loading...