Joel Larsson Danielsson

201320142015201620172018201920202021202220231 1 1 1 3 4 3

Public access

2 articles

0 articles

available

not available

Based on funding mandates

Klas MarkströmInstitutionen för Matematik och Matematisk statistik, Umeå universitetVerified email at umu.se
Victor Falgas-RavryInstitutionen för matematik och matematisk statistik, Umeå UniversitetVerified email at math.umu.se
Lorenzo FedericoLUISS Guido CarliVerified email at luiss.it

Joel Larsson Danielsson

Verified email at chalmers.se - Homepage


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Speed and concentration of the covering time for structured coupon collectors V Falgas-Ravry, J Larsson, K Markström Advances in Applied Probability 52 (2), 433-462, 2020	7*	2020
The minimum perfect matching in pseudo-dimension 0< q< 1 J Larsson Combinatorics, Probability and Computing 30 (3), 374-397, 2021	5*	2021
Biased random k‐SAT J Larsson, K Markström Random Structures & Algorithms 59 (2), 238-266, 2021	2	2021
On random cover and matching problems J Larsson Umeå Universitet, 2016	1	2016
Minimal H-factors and covers L Federico, JL Danielsson arXiv preprint arXiv:2302.12184, 2023		2023
Polarised random κ-SAT JL Danielsson, K Markström Combinatorics, probability & computing, 2023		2023
On random satisfiability and optimization problems J Larsson Umeå Universitet, 2018		2018

The system can't perform the operation now. Try again later.

Articles 1–7

Citations per year