Flora M. Spieksma
2011–2016
A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Flora M. Spieksma trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Flora M. Spieksma overall
Papers from Flora M. Spieksma's perspective
Ordered by how strongly the researchers Flora M. Spieksma trusts endorse each paper. Same corpus, a different order for every researcher.
- Non-negative Matrices and Markov Chains
- Spectra of Graphs
- The Laplacian spectrum of graphs
- Graph Spectra for Complex Networks
- A Survey of Monte Carlo Tree Search Methods
- Solving Hanabi: Estimating Hands by Opponent's Actions in Cooperative Game with Incomplete Information
- Algebraic connectivity of graphs
- An Algebraic Identity Leading to Wilson Theorem
- Linear Programming and Extensions
- Computing the norm ∥A∥∞,1 is NP-hard
Their papers
- Aspects of the Cooperative Card Game Hanabi (2016) — 29 citations
- Effective graph resistance (2011) — 303 citations