The Rectilinear Crossing Number of K_10 is 62 - Alex Brodsky; Stephane Durocher; Ellen Gethner (CoRR, 2000)

Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics - Alex Brodsky; Stephane Durocher; Ellen Gethner (CoRR, 2000)

The Rectilinear Crossing Number of K10 is 62. - Alex Brodsky; Stephane Durocher; Ellen Gethner (Electron. J. Comb., 2001)

Using File-Grain Connectivity to Implement a Peer-to-Peer File System. - Dmitry Brodsky; Alex Brodsky; Jody Pomkoski; Shihao Gong; Michael J. Feeley; Norman C. Hutchinson (SRDS, 2002)

Characterizations of 1-Way Quantum Finite Automata. - Alex Brodsky; Nicholas Pippenger (SIAM J. Comput., 2002)

The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function - Alex Brodsky; Nicholas Pippenger (CoRR, 2003)

Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics. - Alex Brodsky; Stephane Durocher; Ellen Gethner (Discret. Math., 2003)

Reversible Circuit Realizations of Boolean Functions. - Alex Brodsky (IFIP TCS, 2004)

Efficient synchronous snapshots. - Alex Brodsky; Faith Ellen Fich (PODC, 2004)

Restricted Stack Implementations. - Matei David; Alex Brodsky; Faith Ellen Fich (DISC, 2005)

An impossibility gap between width-4 and width-5 permutation branching programs. - Alex Brodsky (Inf. Process. Lett., 2005)

On the complexity of buffer allocation in message passing systems. - Alex Brodsky; Jan Bækgaard Pedersen; Alan S. Wagner (J. Parallel Distributed Comput., 2005)

A Distributed Content Independent Method for Spam Detection. - Alex Brodsky; Dmitry Brodsky (HotBots, 2007)

Trinity: distributed defense against transient spam-bots. - Alex Brodsky; Dmitry Brodsky (PODC, 2007)

Our brothers' keepers. - Alex Brodsky (PODC, 2008)

Our Brothers' Keepers: Secure Routing with High Performance. - Alex Brodsky; Scott Lindenberg (SSS, 2008)

Approximating the buffer allocation problem using epochs. - Jan Bækgaard Pedersen; Alex Brodsky; Jeffrey Sampson (J. Parallel Distributed Comput., 2008)

Simple permutations mix even better. - Alex Brodsky; Shlomo Hoory (Random Struct. Algorithms, 2008)

Fully-adaptive algorithms for long-lived renaming. - Alex Brodsky; Faith Ellen; Philipp Woelfel (Distributed Comput., 2011)

Editorial. - Maria Virvou; Alex Brodsky; Nikolaos G. Bourbakis (Int. J. Artif. Intell. Tools, 2018)

Exploring the Use of Auto-Grading Systems to Improve the Efficacy of Feedback through Small, Scaffolded Programming Assignments. - Angela A. Siegel; Tavis Bragg; Alexander Brodsky 003; Eric Poitras (ITiCSE (2), 2021)