| Monotonic self-stabilization and its application to robust and adaptive pattern formation | 0 | 0.34 | 2022 |
| Search by a metamorphic robotic system in a finite 2D square Grid | 0 | 0.34 | 2022 |
| Meeting in a polygon by anonymous oblivious robots | 0 | 0.34 | 2020 |
| Oblivious Permutations on the Plane. | 0 | 0.34 | 2019 |
| Constructing Self-stabilizing Oscillators in Population Protocols. | 1 | 0.35 | 2017 |
| FINDING SUBMODULARITY HIDDEN IN SYMMETRIC DIFFERENCE | 1 | 0.38 | 2017 |
| Plane Formation by Synchronous Mobile Robots without Chirality. | 0 | 0.34 | 2017 |
| Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers. | 0 | 0.34 | 2016 |
| Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space. | 2 | 0.38 | 2016 |
| Implicit Function Computation by Oblivious Mobile Robots. | 0 | 0.34 | 2016 |
| Autonomous mobile robots with lights. | 24 | 0.91 | 2016 |
| Universal Systems of Oblivious Mobile Robots. | 0 | 0.34 | 2016 |
| An alternative proof for the equivalence of ∞-searcher and 2-searcher. | 1 | 0.36 | 2016 |
| Forming sequences of geometric patterns with oblivious mobile robots | 20 | 0.79 | 2015 |
| The Parity Hamiltonian Cycle Problem. | 0 | 0.34 | 2015 |
| Pattern Formation by Oblivious Asynchronous Mobile Robots | 21 | 0.79 | 2015 |
| L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains. | 3 | 0.42 | 2014 |
| Deterministic random walks for rapidly mixing chains | 5 | 0.47 | 2013 |
| Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction | 2 | 0.40 | 2013 |
| Expressivity of time-varying graphs | 1 | 0.34 | 2013 |
| Mobile Byzantine Agreement on Arbitrary Network. | 9 | 0.64 | 2013 |
| Rendezvous of Two Robots with Constant Memory | 15 | 0.73 | 2013 |
| The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits | 23 | 1.10 | 2012 |
| Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks | 0 | 0.34 | 2012 |
| The Gathering Problem for Two Oblivious Robots with Unreliable Compasses | 36 | 1.41 | 2012 |
| Asynchronous pattern formation by anonymous oblivious mobile robots | 23 | 0.97 | 2012 |
| Probabilistic Self-Stabilization and Biased Random Walks on Dynamic Graphs. | 0 | 0.34 | 2012 |
| An Extension of Matthews' Bound to Multiplex Random Walks | 0 | 0.34 | 2012 |
| How slow, or fast, are standard random walks?: analysis of hitting and cover times on trees | 2 | 0.43 | 2011 |
| Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol | 2 | 0.41 | 2010 |
| The hitting and cover times of Metropolis walks | 17 | 0.93 | 2010 |
| Characterizing geometric patterns formable by oblivious anonymous mobile robots | 51 | 2.06 | 2010 |
| A generic algorithm for approximately solving stochastic graph optimization problems | 0 | 0.34 | 2009 |
| Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG | 1 | 0.37 | 2009 |
| The hitting and cover times of random walks on finite graphs using local degree information | 29 | 1.45 | 2009 |
| A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots | 9 | 0.66 | 2008 |
| Weak vs. Self vs. Probabilistic Stabilization | 15 | 0.73 | 2008 |
| The Balanced Edge Cover Problem | 2 | 0.38 | 2008 |
| Designing good random walks on finite graphs. | 0 | 0.34 | 2008 |
| Dynamic neighborhood searches for thermodynamically designing DNA sequence | 2 | 0.40 | 2007 |
| Gathering two stateless mobile robots using very inaccurate compasses in finite time | 6 | 0.53 | 2007 |
| Robots and molecules | 0 | 0.34 | 2007 |
| Fault-tolerant simulation of message-passing algorithms by mobile agents | 5 | 0.45 | 2007 |
| DNA sequence design by dynamic neighborhood searches | 4 | 0.45 | 2006 |
| Forest search: a paradigm for faster exploration of scale-free networks | 0 | 0.34 | 2006 |
| Characterization of Polygons Searchable by a Boundary 1-Searcher | 0 | 0.34 | 2006 |
| A probabilistic model of the DNA conformational change | 2 | 0.38 | 2006 |
| Using eventually consistent compasses to gather oblivious mobile robots with limited visibility | 13 | 0.98 | 2006 |
| A generic search strategy for large-scale real-world networks | 3 | 0.40 | 2006 |
| How to collect balls moving in the Euclidean plane | 4 | 0.57 | 2006 |
