Alex Brodsky

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Efficient synchronous snapshots Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing	2015-08-03	Paper
Brief announcement: Trinity. A distributed defense against transient spam-bots Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing	2014-03-13	Paper
Approximating the buffer allocation problem using epochs Journal of Parallel and Distributed Computing	2012-07-26	Paper
Fully-adaptive algorithms for long-lived renaming Distributed Computing	2012-02-06	Paper
An impossibility gap between width-4 and width-5 permutation branching programs Information Processing Letters	2009-12-04	Paper
Fully-Adaptive Algorithms for Long-Lived Renaming Lecture Notes in Computer Science	2008-09-09	Paper
Simple permutations mix even better Random Structures \& Algorithms	2008-06-05	Paper
Distributed Computing Lecture Notes in Computer Science	2006-11-01	Paper
The Boolean functions computed by random Boolean formulas or how to grow the right function Random Structures \& Algorithms	2006-01-10	Paper
On the complexity of buffer allocation in message passing systems Journal of Parallel and Distributed Computing	2005-06-30	Paper
scientific article; zbMATH DE number 2163011 (Why is no real title available?)	2005-04-29	Paper
Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics Discrete Mathematics	2003-04-28	Paper
Characterizations of 1-Way Quantum Finite Automata SIAM Journal on Computing	2002-09-29	Paper
The rectilinear crossing number of \(K_{10}\) is 62 The Electronic Journal of Combinatorics	2001-06-18	Paper

Research outcomes over time

This page was built for person: Alex Brodsky