2 citations · 2 across the 4 of their papers we have counts for
4 papers
Stochastic well-structured transition systems
James Aspnes
Extending well-structured transition systems to incorporate a probabilistic scheduling rule, we define a new class of stochastic well-structured transition systems that includes po…
Motivic homotopy theory with ramification filtrations
Junnosuke Koizumi, Hiroyasu Miyazaki, Shuji Saito
We construct a generalization of Morel--Voevodsky's motivic homotopy theory that captures non--homotopy-invariant phenomena, such as wild ramification and irregular s…
Stably computable relations and predicates
James Aspnes
A population protocol stably computes a relation R(x,y) if its output always stabilizes and R(x,y) holds if and only if y is a possible output for input x. Alternatively, a populat…
Notes on Randomized Algorithms
James Aspnes
Lecture notes for the Yale Computer Science course CPSC 4690/5690 Randomized Algorithms. Suitable for use as a supplementary text for an introductory graduate or advanced undergrad…