List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Long-term balanced allocation via thinning The Annals of Applied Probability | 2024-04-09 | Paper |
| Long-term balanced allocation via thinning The Annals of Applied Probability | 2024-04-09 | Paper |
| Recurrence of a weighted random walk on a circle packing with parabolic carrier Israel Journal of Mathematics | 2022-05-31 | Paper |
| The power of thinning in balanced allocation Electronic Communications in Probability | 2022-01-06 | Paper |
| Random walk in changing environment Stochastic Processes and their Applications | 2021-02-18 | Paper |
| The Dirichlet problem for orthodiagonal maps Advances in Mathematics | 2020-10-08 | Paper |
| A note on costs minimization with stochastic target constraints Electronic Communications in Probability | 2020-05-26 | Paper |
| A note on costs minimization with stochastic target constraints Electronic Communications in Probability | 2020-05-26 | Paper |
| Invariant \(\rho\)-percolation on regular trees Unimodularity in Randomly Generated Graphs | 2019-10-16 | Paper |
| Finding hidden cliques in linear time with high probability 2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
| A combinatorial criterion for macroscopic circles in planar triangulations | 2019-06-04 | Paper |
| The power of online thinning in reducing discrepancy Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2019-05-23 | Paper |
| A density version for H\"aggstr\"om's theorem | 2017-02-15 | Paper |
| Recurrence of multiply-ended planar triangulations Electronic Communications in Probability | 2017-02-07 | Paper |
| Recurrence of multiply-ended planar triangulations Electronic Communications in Probability | 2017-02-07 | Paper |
| Site recurrence for coalescing random walk Electronic Communications in Probability | 2016-08-22 | Paper |
| Site recurrence for coalescing random walk Electronic Communications in Probability | 2016-08-22 | Paper |
| Boundaries of planar graphs, via circle packings The Annals of Probability | 2016-07-14 | Paper |
| Boundaries of planar graphs, via circle packings The Annals of Probability | 2016-07-14 | Paper |
| Localization for controlled random walks and martingales Electronic Communications in Probability | 2014-09-24 | Paper |
| Choice-Memory Tradeoff in Allocations 2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
| Finding hidden cliques in linear time with high probability Combinatorics, Probability and Computing | 2014-05-02 | Paper |
| Poisson thickening Israel Journal of Mathematics | 2013-11-01 | Paper |
| Nonconcentration of return times The Annals of Probability | 2013-05-24 | Paper |
| Nonconcentration of return times The Annals of Probability | 2013-05-24 | Paper |
| Recurrence of planar graph limits Annals of Mathematics. Second Series | 2013-04-23 | Paper |
| Linear cover time is exponentially unlikely Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2013-03-04 | Paper |
| Stationary map coloring Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2012-06-04 | Paper |
| Stationary map coloring Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2012-06-04 | Paper |
| Giant components in biased graph processes Indiana University Mathematics Journal | 2012-04-10 | Paper |
| Giant components in biased graph processes Indiana University Mathematics Journal | 2012-04-10 | Paper |
| On K-wise Independent Distributions and Boolean Functions | 2012-01-16 | Paper |
| Optimal discovery strategies in white space networks Algorithms – ESA 2011 | 2011-09-16 | Paper |
| On fixation of activated random walks Electronic Communications in Probability | 2011-09-09 | Paper |
| On fixation of activated random walks Electronic Communications in Probability | 2011-09-09 | Paper |
| Cutpoints and resistance of random walk paths The Annals of Probability | 2011-05-06 | Paper |
| Pursuit-evasion games with incomplete information in discrete time International Journal of Game Theory | 2011-05-05 | Paper |
| Choice-memory tradeoff in allocations The Annals of Applied Probability | 2010-09-01 | Paper |
| The diameter of a random Cayley graph of \({\mathbb{Z}}_q\) Groups - Complexity - Cryptology | 2010-08-19 | Paper |
| Branching random walk with exponentially decreasing steps, and stochastically self-similar measures Transactions of the American Mathematical Society | 2009-03-30 | Paper |
| The Biham-Middleton-Levine traffic model for a single junction (available as arXiv preprint) | 2008-11-10 | Paper |
| Recurrence of random walk traces The Annals of Probability | 2007-07-09 | Paper |
| Almost Sure Recurrence of the Simple Random Walk Path | 2005-08-15 | Paper |
Research outcomes over time
This page was built for person: Ori Gurel-Gurevich
