6 citations · 6 across the 2 of their papers we have counts for
3 papers
math.CO2004★ 6 cited
Simple Permutations Mix Even Better
Shlomo Hoory, Alex Brodsky
We study the random composition of a small family of O(n^3) simple permutations on {0,1}^n. Specifically we ask how many randomly selected simple permutations need be composed to y…
cs.DC2003
On the Complexity of Buffer Allocation in Message Passing Systems
Alex Brodsky, Jan B. Pedersen, Alan Wagner
Message passing programs commonly use buffers to avoid unnecessary synchronizations and to improve performance by overlapping communication with computation. Unfortunately, using b…
quant-ph1999
Characterizations of 1-Way Quantum Finite Automata
Alex Brodsky, Nicholas Pippenger
The 2-way quantum finite automaton introduced by Kondacs and Watrous can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automato…