Bal'azs R'ath
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 Bal'azs R'ath trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Bal'azs R'ath's perspective
Ordered by how strongly the researchers Bal'azs R'ath 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
- Learning representations by back-propagating errors
- The NP-Completeness Column: An Ongoing Guide
- Loading Deep Networks Is Hard
- Original Contribution: Training a 3-node neural network is NP-complete
- Markov chains and mixing times
- On the size of a finite vacant cluster of random interlacements with small intensity
- The Loading Problem for Pyramidal Neural NetworksMarc
Their papers
- Connectivity properties of random interlacement and intersection of random walks (2010) — 53 citations