26 citations · 60 across the 7 of their papers we have counts for
7 papers
Our Brothers' Keepers: Secure Routing with High Performance
Alex Brodsky, Scott Lindenberg
The Trinity (Brodsky et al., 2007) spam classification system is based on a distributed hash table that is implemented using a structured peer-to-peer overlay. Such an overlay must…
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…
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…
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…
Toward the Rectilinear Crossing Number of : New Drawings, Upper Bounds, and Asymptotics
Alex Brodsky, Stephane Durocher, Ellen Gethner
Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A re…
The Rectilinear Crossing Number of K_10 is 62
Alex Brodsky, Stephane Durocher, Ellen Gethner
A drawing of a graph G in the plane is said to be a rectilinear drawing of G if the edges are required to be line segments (as opposed to Jordan curves). We assume no three vertice…