7 citations · 7 across the 3 of their papers we have counts for
8 papers
The Geometry of Fixed-Magnetization Spin Systems at Low Temperature
Jacob Calvert, Shunhao Oh, Dana Randall
Spin systems are fundamental models of statistical physics that provide insight into collective behavior across scientific domains. Their interest to computer science stems in part…
Single Bridge Formation in Self-Organizing Particle Systems
Shunhao Oh, Joseph Briones, Jacob Calvert +3
Local interactions of uncoordinated individuals produce the collective behaviors of many biological systems, inspiring much of the current research in programmable matter. A striki…
Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks
Shunhao Oh, Dana Randall, Andréa W. Richa
We develop a framework for self-induced phase changes in programmable matter in which a collection of agents with limited computational and communication capabilities can collectiv…
Foraging in Particle Systems via Self-Induced Phase Changes
Shunhao Oh, Dana Randall, Andréa W. Richa
The foraging problem asks how a collective of particles with limited computational, communication and movement capabilities can autonomously compress around a food source and dispe…
Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems
Hridesh Kedia, Shunhao Oh, Dana Randall
We present local distributed, stochastic algorithms for \emph{alignment} in self-organizing particle systems (SOPS) on two-dimensional lattices, where particles occupy unique sites…
Periodic Bandits and Wireless Network Selection
Shunhao Oh, Anuja Meetoo Appavoo, Seth Gilbert
Bandit-style algorithms have been studied extensively in stochastic and adversarial settings. Such algorithms have been shown to be useful in multiplayer settings, e.g. to solve th…
A Reallocation Algorithm for Online Split Packing of Circles
Shunhao Oh, Seth Gilbert
The Split Packing algorithm \cite{splitpacking_ws, splitpackingsoda, splitpacking} is an offline algorithm that packs a set of circles into triangles and squares up to critical den…
Edge N-Level Sparse Visibility Graphs: Fast Optimal Any-Angle Pathfinding Using Hierarchical Taut Paths
Shunhao Oh, Hon Wai Leong
In the Any-Angle Pathfinding problem, the goal is to find the shortest path between a pair of vertices on a uniform square grid, that is not constrained to any fixed number of poss…