Source: OpenCitations
Rotor Walks on General Trees
SIAM Journal on Discrete Mathematics
Journal reference : Volume 25, 2011, pp. 423-446
DOI : 10.1137/100814299Rotor walks and Markov chains
Contemporary mathematics - American Mathematical Society
Journal reference : Volume , 2010, pp. 105-126
DOI : 10.1090/conm/520/10256Total variation discrepancy of deterministic random walks for ergodic Markov chains
Theoretical Computer Science
Journal reference : Volume 699, 2016, pp. 63-74
DOI : 10.1016/j.tcs.2016.11.017Deterministic Random Walks for Rapidly Mixing Chains
SIAM Journal on Discrete Mathematics
Journal reference : Volume 32, 2018, pp. 2180-2193
DOI : 10.1137/16m1087667L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains
Lecture notes in computer science
Journal reference : Volume , 2014, pp. 25-36
DOI : 10.1007/978-3-319-08783-2_3Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router
Lecture notes in computer science
Journal reference : Volume , 2014, pp. 544-555
DOI : 10.1007/978-3-662-43951-7_46Quasirandom Rumor Spreading
ACM Transactions on Algorithms
Journal reference : Volume 11, 2014, pp. 1-35
DOI : 10.1145/2650185Fast simulation of large‐scale growth models
Random Structures and Algorithms
Journal reference : Volume 42, 2012, pp. 185-213
DOI : 10.1002/rsa.20412Unbounded Discrepancy of Deterministic Random Walks on Grids
SIAM Journal on Discrete Mathematics
Journal reference : Volume 32, 2018, pp. 2441-2452
DOI : 10.1137/17m1131088Does adding more agents make a difference? A case study of cover time for the rotor-router
Journal of Computer and System Sciences
Journal reference : Volume 106, 2019, pp. 80-93
DOI : 10.1016/j.jcss.2019.07.001Proppian random walks in Z
Discrete Mathematics
Journal reference : Volume 311, 2010, pp. 349-361
DOI : 10.1016/j.disc.2010.11.001Memory Efficient Anonymous Graph Exploration
Lecture notes in computer science
Journal reference : Volume , 2008, pp. 14-29
DOI : 10.1007/978-3-540-92248-3_2Deterministic random walks on finite graphs
Random Structures and Algorithms
Journal reference : Volume 46, 2014, pp. 739-761
DOI : 10.1002/rsa.20533Parallel rotor walks on finite graphs and applications in discrete load balancing
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Journal reference : Volume , 2013, pp. 186-195
DOI : 10.1145/2486159.2486178The cover time of deterministic random walks for general transition probabilities
Theoretical Computer Science
Journal reference : Volume 815, 2020, pp. 153-162
DOI : 10.1016/j.tcs.2020.02.009The Cover Time of Deterministic Random Walks
Lecture notes in computer science
Journal reference : Volume , 2010, pp. 130-139
DOI : 10.1007/978-3-642-14031-0_16Unbounded Discrepancy of Deterministic Random Walks on Grids
Lecture notes in computer science
Journal reference : Volume , 2015, pp. 212-222
DOI : 10.1007/978-3-662-48971-0_19Deterministic walks with choice
Discrete Applied Mathematics
Journal reference : Volume 162, 2013, pp. 100-107
DOI : 10.1016/j.dam.2013.08.031Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
Advances in Applied Mathematics
Journal reference : Volume 70, 2015, pp. 45-53
DOI : 10.1016/j.aam.2015.06.006A simple approach for adapting continuous load balancing processes to discrete settings
Distributed Computing
Journal reference : Volume 29, 2016, pp. 143-161
DOI : 10.1007/s00446-016-0266-yFast Simulation of Large-Scale Growth Models
Lecture notes in computer science
Journal reference : Volume , 2011, pp. 555-566
DOI : 10.1007/978-3-642-22935-0_47Some basic properties of a rotor-router model with i.i.d. initial rotor-routers on the line
Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications
Journal reference : Volume 2014, 2014, pp. 303-306
DOI : 10.5687/sss.2014.303Discrete analog computing with rotor-routers
arXiv (Cornell University)
Journal reference : Volume 20, 2010, pp. 037110
DOI : 10.1063/1.3489886Deterministic Random Walks on Regular Trees
arXiv (Cornell University)
Journal reference : Volume 29, 2007, pp. 353-366
DOI : 10.1002/rsa.20314Randomness in algorithm design
Journal of Physics Conference Series
Journal reference : Volume 473, 2013, pp. 012014
DOI : 10.1088/1742-6596/473/1/012014Abelian networks IV. Dynamics of nonhalting networks
arXiv (Cornell University)
Journal reference : Volume 276, 2022, pp.
DOI : 10.1090/memo/1358