Dominic Dotterrer
2010
A researcher in the Science corpus: 1 paper; trusts 5 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Dominic Dotterrer trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Devdatt P. Dubhashi
- Alessandro Panconesi
- Dmitry N. Kozlov
- Alan M. Frieze
- Shlomo Hoory
- N. Linial
- Eric K. Babson
Who trusts Dominic Dotterrer overall
Papers from Dominic Dotterrer's perspective
Ordered by how strongly the researchers Dominic Dotterrer trusts endorse each paper. Same corpus, a different order for every researcher.
- Homological Connectivity Of Random 2-Complexes (Comb.)
- Expander Graphs and their Applications
- The fundamental group of random 2-complexes
- The threshold function for vanishing of the top homology group of random $d$-complexes
- Random graphs
- Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009 (SIGA)
- Mathematical results on scale‐free random graphs
- MAX k-CUT and approximating the chromatic number of random graphs
- Fast subtree kernels on graphs
- Comparison of descriptor spaces for chemical compound retrieval and classification
Their papers
- Coboundary expanders (2010) — 55 citations