Artëm Sapozhnikov
2010
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Artëm Sapozhnikov trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Artëm Sapozhnikov's perspective
Ordered by how strongly the researchers Artëm Sapozhnikov trusts endorse each paper. Same corpus, a different order for every researcher.
- Random walk on a discrete torus and random interlacements
- Intersections of random walks
- Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models
- The NP-Completeness Column: An Ongoing Guide
- Learning representations by back-propagating errors
- Markov chains and mixing times
- Loading Deep Networks Is Hard
- On the size of a finite vacant cluster of random interlacements with small intensity
- The Loading Problem for Pyramidal Neural NetworksMarc
- Original Contribution: Training a 3-node neural network is NP-complete
Their papers
- Connectivity properties of random interlacement and intersection of random walks (2010) — 53 citations