Dr. Alex Brodsky
Education:
Ph.D - University of British Columbia (2003)
M.Sc - University of British Columbia (1999)
B.Math - University of Waterloo (1997)
Research Interests:
Distributed computing and distributed systems, Discrete mathematics and computation complexity, Operating systems and related topics
Bio:
Dr. Brodsky completed his Ph.D. degree in computer science in 2003 under the supervision of Dr. Pippenger at the University of British Columbia, Canada. He received his B.Math in computer science from the University of Waterloo, Canada in 1997 and his M.Sc. in computer science from the University of British Columbia, Canada in 1999. Between 2003 and 2005 he was a post-doctoral fellow at the Department of Computer Science, University of Toronto, where he investigated the implementation of various shared memory objects in synchronous and asynchronous systems. Between 2005 and 2009 he was an assistant professor at the University of Winnipeg. He is presently an instructor in the Faculty of Computer Science at Dalhousie University.
Publications:
Journal Publications
- Jan Baekgaard Pedersen, Alex Brodsky, and Jeffery Samson, "Approximating the Buffer Allocation Problem Using Epochs", Journal of Parallel and Distributed Computing, 68, 1263-1282, 2008.
- Alex Brodsky and Shlomo Hoory, "Simple Permutations Mix Even Better", Random Structures and Algorithms, 32(3), 274-289, 2008.
- Alex Brodsky and Nicholas Pippenger, "The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function", Random Structures and Algorithms, 27(4), 490--519, 2005.
- Alex Brodsky, Jan Baekgaard Pedersen, and Alan Wagner, "On the Complexity of Buffer Allocation in Message Passing Systems", Journal of Parallel and Distributed Computing, 65(6), 692-713, 2005.
- Alex Brodsky, "An Impossibility Gap Between Width-4 and Width-5 Permutation Branching Programs", Information Processing Letters, 94(4), 159-164, 2005.
- Alex Brodsky, Stephane Durocher, and Ellen Gethner, "Toward the Rectilinear Crossing Number of Kn: New Drawings, Upper Bounds, and Asymptotics", Journal of Discrete Math, 262, 2003.
- Alex Brodsky and Nicholas Pippenger, "Characterizations of 1-Way Quantum Finite Automata", SIAM Journal on Computing, 31(5), 1456-1478, 2002.
- Alex Brodsky, Stephane Durocher, and Ellen Gethner, "The Rectilinear Crossing Number of K10 is 62", The Electronic Journal of Combinatorics, 8(1), R23, 2001.
Conference and Workshop Publications
- Alex Brodsky and Scott Lindenberg, "Our Brothers' Keepers: Secure Routing with High Performance", Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems", 2008.
- Alex Brodsky, "Brief Announcement: Our Brothers' Keepers: Secure Routing with High Performance", Proceedings of the 27th Symposium on Principles of Distributed Computing, 2008.
- Alex Brodsky and Dmitry Brodsky, "Brief Announcement: Trinity, A Distributed Defense Against Transient Spam-bots", Proceedings of the 26th Symposium on Principles of Distributed Computing, 2007.
- Alex Brodsky and Dmitry Brodsky, "A Distributed Content Independent Method for Spam Detection", Proceedings of the 1st USENIX Workshop on Hot Topics in Understanding Botnets, 2007.
- Alex Brodsky, Faith Ellen Fich, and Philipp Woelfel, "Fully-Adaptive Algorithms for Long-Lived Renaming", Proceedings of the 20th International Symposium on Distributed Computing", LNCS 4167, 413-427, 2006.
- Jan Baekgaard Pedersen and Alex Brodsky, "Approximating the Buffer Allocation Problem Using Epochs", Proceedings of the 18th IASTED International Conference on Parallel and Distributed Computing and Systems, 50-59, 2006.
- Matei David, Alex Brodsky, and Faith Ellen Fich, "Restricted Stack Implementations" Proceedings of the 19th International Symposium on Distributed Computing", LNCS 3724, 137-151, 2005.
- Alex Brodsky and Faith Ellen Fich, "Efficient Synchronous Snapshots", Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, 70-79, 2004.
- Alex Brodsky, "Reversible Circuit Realizations of Boolean Functions", Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science, 2004.
- Dmitry Brodsky, Alex Brodsky, Jody Pomkoski, Shihao Gong, Michael J. Feeley, and Norman C. Hutchinson, "Using File-Grain Connectivity to Implement a Peer-to-Peer File System", Proc. of the 21st IEEE Symposium on Reliable Distributed Systems -- Workshop on Peer-to-peer Reliable Distributed Systems, 318-323, 2002.
- Dmitry Brodsky, Jody Pomkoski, Alex Brodsky, Michael J. Feeley, Norman C. Hutchinson, "Exploiting Version Immutability to Simplify File Replication", 18th ACM Symposium on Operating Systems Principles, (poster), October, 2001.
- Alex Brodsky, Dmitry Brodsky, Ida Chan, Yvonne Coady, Stephan Gudmundson, Jody Pomkoski, Joon Suan Ong, "Coping with Evolution: Aspects vs Aspirin?". OOPSLA Workshop on Advanced Separation of Concerns, October, 2001.
- Yvonne Coady, Alex Brodsky, Dmitry Brodsky, Jody Pomkoski, Stephan Gudmundson, Joon Suan Ong, Gregor Kiczales, "Can AOP Support Extensibility in Client-Server Architectures?" ECOOP 2001 - Advanced Separation of Concerns Workshop, 2001.