26 citations · 60 across the 7 of their papers we have counts for
3 papers · 1 filter
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…
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…