E-LIB Suche - Ergebnisse für: Martinsson, Anders

1

Reconstructibility of the K-count from n − 1 cards:

Knierim, Charlotte ; Martinsson, Anders
Discrete Mathematics. 347 (2024) 6 - p. 113950 , 2024

Link: https://doi.org/10.1016/..

2

On connectivity in random graph models with limited depende..:

Lengler, Johannes ; Martinsson, Anders ; Petrova, Kalina...
Random Structures & Algorithms. , 2024

Link: https://doi.org/10.1002/..

3

Strengthening Hadwiger's conjecture for 4- and 5-chromatic ..:

Martinsson, Anders ; Steiner, Raphael
Journal of Combinatorial Theory, Series B. 164 (2024) - p. 1-16 , 2024

Link: https://doi.org/10.1016/..

4

Parallel Breadth-First Search and Exact Shortest Paths and ..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Rozhoň, Václav ; Haeupler, Bernhard ; Martinsson, Anders.. - p. 321-334 , 2023

Link: https://dl.acm.org/doi/1..

5

Hat Guessing Numbers of Strongly Degenerate Graphs:

Knierim, Charlotte ; Martinsson, Anders ; Steiner, Raphael
SIAM Journal on Discrete Mathematics. 37 (2023) 2 - p. 1331-1347 , 2023

Link: https://doi.org/10.1137/..

6

Cycle lengths modulo k in expanders:

Martinsson, Anders ; Steiner, Raphael
European Journal of Combinatorics. 109 (2023) - p. 103642 , 2023

Link: https://doi.org/10.1016/..

7

Mastermind with a linear number of queries:

Martinsson, Anders ; Su, Pascal
Combinatorics, Probability and Computing. 33 (2023) 2 - p. 143-156 , 2023

Link: https://doi.org/10.1017/..

8

Long cycles, heavy cycles and cycle decompositions in digra..:

Knierim, Charlotte ; Larcher, Maxime ; Martinsson, Anders.
Journal of Combinatorial Theory, Series B. 148 (2021) - p. 125-148 , 2021

Link: https://doi.org/10.1016/..

9

Navigating an infinite space with unreliable movements:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,

Martinsson, Anders ; Uitto, Jara - p. 1170-1179 , 2020

Link: https://dl.acm.org/doi/1..

10

The edge-statistics conjecture for ℓ ≪ k6/5:

Martinsson, Anders ; Mousset, Frank ; Noever, Andreas.
Israel Journal of Mathematics. 234 (2019) 2 - p. 677-690 , 2019

Link: https://doi.org/10.1007/..

11

A Linear Threshold for Uniqueness of Solutions to Random Ji..:

MARTINSSON, ANDERS
Combinatorics, Probability and Computing. 28 (2019) 2 - p. 287-302 , 2019

Link: https://doi.org/10.1017/..

12

The (1 + 1)-EA with mutation rate (1 + ϵ)/n is efficient on..:

, In: Proceedings of the Genetic and Evolutionary Computation Conference Companion,

Lengler, Johannes ; Martinsson, Anders ; Steger, Angelika - p. 25-26 , 2019

Link: https://dl.acm.org/doi/1..

13

FIRST-PASSAGE PERCOLATION ON CARTESIAN POWER GRAPHS:

Martinsson, Anders
The Annals of Probability. 46 (2018) 2 - p. 1004-1041 , 2018

Link: https://www.jstor.org/st..

14

Most edge‐orderings of Kn have maximal altitude:

Martinsson, Anders
Random Structures & Algorithms. 54 (2018) 3 - p. 559-585 , 2018

Link: https://doi.org/10.1002/..

15

Segregating Markov Chains:

Hirscher, Timo ; Martinsson, Anders
Journal of Theoretical Probability. 31 (2017) 3 - p. 1512-1538 , 2017

Link: https://doi.org/10.1007/..