Alex Brodsky

Affiliations:
  • Dalhousie University, Halifax, Canada
  • University of Winnipeg, Canada (2005 - 2009)
  • University of British Columbia, Canada (PhD 2003)


According to our database1, Alex Brodsky authored at least 21 papers between 2000 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Exploring the Use of Auto-Grading Systems to Improve the Efficacy of Feedback through Small, Scaffolded Programming Assignments.
Proceedings of the ITiCSE '21: Proceedings of the 26th ACM Conference on Innovation and Technology in Computer Science Education V.2, Virtual Event, Germany, June 26, 2021

2018
Editorial.
Int. J. Artif. Intell. Tools, 2018

2011
Fully-adaptive algorithms for long-lived renaming.
Distributed Comput., 2011

2008
Simple permutations mix even better.
Random Struct. Algorithms, 2008

Approximating the buffer allocation problem using epochs.
J. Parallel Distributed Comput., 2008

Our Brothers' Keepers: Secure Routing with High Performance.
Proceedings of the Stabilization, 2008

Our brothers' keepers.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007
Trinity: distributed defense against transient spam-bots.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

A Distributed Content Independent Method for Spam Detection.
Proceedings of the First Workshop on Hot Topics in Understanding Botnets, 2007

2005
On the complexity of buffer allocation in message passing systems.
J. Parallel Distributed Comput., 2005

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

Restricted Stack Implementations.
Proceedings of the Distributed Computing, 19th International Conference, 2005

2004
Efficient synchronous snapshots.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Reversible Circuit Realizations of Boolean Functions.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Toward the rectilinear crossing number of <i>K<sub>n</sub></i>: new drawings, upper bounds, and asymptotics.
Discret. Math., 2003

The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function
CoRR, 2003

2002
Characterizations of 1-Way Quantum Finite Automata.
SIAM J. Comput., 2002

Using File-Grain Connectivity to Implement a Peer-to-Peer File System.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

2001
The Rectilinear Crossing Number of K<sub>10</sub> is 62.
Electron. J. Comb., 2001

2000
Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics
CoRR, 2000

The Rectilinear Crossing Number of K_10 is 62
CoRR, 2000


  Loading...