Alexander O. Brodsky, Alexander Brodsky
List of publications from the
2008 |
20 | EE | Alex Brodsky:
Our brothers' keepers.
PODC 2008: 430 |
19 | EE | Alex Brodsky,
Scott Lindenberg:
Our Brothers' Keepers: Secure Routing with High Performance.
SSS 2008: 218-232 |
18 | EE | Alex Brodsky,
Scott Lindenberg:
Our Brothers' Keepers: Secure Routing with High Performance
CoRR abs/0808.1744: (2008) |
17 | EE | Jan Bækgaard Pedersen,
Alex Brodsky,
Jeffrey Sampson:
Approximating the buffer allocation problem using epochs.
J. Parallel Distrib. Comput. 68(9): 1263-1282 (2008) |
16 | EE | Alex Brodsky,
Shlomo Hoory:
Simple permutations mix even better.
Random Struct. Algorithms 32(3): 274-289 (2008) |
2007 |
15 | EE | Alex Brodsky,
Dmitry Brodsky:
Trinity: distributed defense against transient spam-bots.
PODC 2007: 378-379 |
2006 |
14 | EE | Alex Brodsky,
Faith Ellen,
Philipp Woelfel:
Fully-Adaptive Algorithms for Long-Lived Renaming.
DISC 2006: 413-427 |
2005 |
13 | EE | Matei David,
Alex Brodsky,
Faith Ellen Fich:
Restricted Stack Implementations.
DISC 2005: 137-151 |
12 | EE | Alex Brodsky:
An impossibility gap between width-4 and width-5 permutation branching programs.
Inf. Process. Lett. 94(4): 159-164 (2005) |
11 | EE | Alex Brodsky,
Jan Bækgaard Pedersen,
Alan S. Wagner:
On the complexity of buffer allocation in message passing systems.
J. Parallel Distrib. Comput. 65(6): 692-713 (2005) |
2004 |
10 | | Alex Brodsky:
Reversible Circuit Realizations of Boolean Functions.
IFIP TCS 2004: 67-80 |
9 | EE | Alex Brodsky,
Faith Ellen Fich:
Efficient synchronous snapshots.
PODC 2004: 70-79 |
2003 |
8 | EE | Alex Brodsky,
Jan Bækgaard Pedersen,
Alan S. Wagner:
On the Complexity of Buffer Allocation in Message Passing Systems
CoRR cs.DC/0301035: (2003) |
7 | EE | Alex Brodsky,
Nicholas Pippenger:
The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function
CoRR cs.DM/0302028: (2003) |
6 | EE | Alex Brodsky,
Stephane Durocher,
Ellen Gethner:
Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics.
Discrete Mathematics 262(1-3): 59-77 (2003) |
2002 |
5 | EE | Dmitry Brodsky,
Alex Brodsky,
Jody Pomkoski,
Shihao Gong,
Michael J. Feeley,
Norman C. Hutchinson:
Using File-Grain Connectivity to Implement a Peer-to-Peer File System.
SRDS 2002: 318-323 |
4 | EE | Alex Brodsky,
Nicholas Pippenger:
Characterizations of 1-Way Quantum Finite Automata.
SIAM J. Comput. 31(5): 1456-1478 (2002) |
2001 |
3 | EE | Alex Brodsky,
Stephane Durocher,
Ellen Gethner:
The Rectilinear Crossing Number of K10 is 62.
Electr. J. Comb. 8(1): (2001) |
2000 |
2 | EE | Alex Brodsky,
Stephane Durocher,
Ellen Gethner:
The Rectilinear Crossing Number of K_10 is 62
CoRR cs.DM/0009023: (2000) |
1 | EE | Alex Brodsky,
Stephane Durocher,
Ellen Gethner:
Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics
CoRR cs.DM/0009028: (2000) |