26 citations · 60 across the 7 of their papers we have counts for
Showing 2003Show all
2 papers · 1 filter
cs.DM2003★ 13 cited
The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function
Alex Brodsky, Nicholas Pippenger
Among their many uses, growth processes (probabilistic amplification), were used for constructing reliable networks from unreliable components, and deriving complexity bounds of va…
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…