Found: 7
Select item for more details and to access through your institution.
Counting independent sets in graphs with bounded bipartite pathwidth.
- Published in:
- Random Structures & Algorithms, 2021, v. 59, n. 2, p. 204, doi. 10.1002/rsa.21003
- By:
- Publication type:
- Article
Ranking graphs through hitting times of Markov chains.
- Published in:
- Random Structures & Algorithms, 2021, v. 59, n. 2, p. 189, doi. 10.1002/rsa.20998
- By:
- Publication type:
- Article
The Moran forest.
- Published in:
- Random Structures & Algorithms, 2021, v. 59, n. 2, p. 155, doi. 10.1002/rsa.20997
- By:
- Publication type:
- Article
Stretched exponential decay for subcritical parking times on Z<sup>d</sup>.
- Published in:
- Random Structures & Algorithms, 2021, v. 59, n. 2, p. 143, doi. 10.1002/rsa.21001
- By:
- Publication type:
- Article
Corrigendum to "Online purchasing under uncertainty".
- Published in:
- Random Structures & Algorithms, 2021, v. 59, n. 2, p. 288, doi. 10.1002/rsa.21012
- Publication type:
- Article
Optimal stopping for many connected components in a graph.
- Published in:
- Random Structures & Algorithms, 2021, v. 59, n. 2, p. 267, doi. 10.1002/rsa.21000
- By:
- Publication type:
- Article
Biased random k-SAT.
- Published in:
- Random Structures & Algorithms, 2021, v. 59, n. 2, p. 238, doi. 10.1002/rsa.20996
- By:
- Publication type:
- Article