Maryam Helmi

According to our database1, Maryam Helmi authored at least 9 papers between 2011 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
The Space Complexity of Distributed Tasks in the Shared Memory Model.
PhD thesis, 2016

Deterministic and Fast Randomized Test-and-Set in Optimal Space.
CoRR, 2016

2015
Test-and-Set in Optimal Space.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations.
J. ACM, 2014

Space Bounds for Adaptive Renaming.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

2013
An O(sqrt n) Space Bound for Obstruction-Free Leader Election.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

2012
Strongly linearizable implementations: possibilities and impossibilities.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
A review of PODC 2011.
SIGACT News, 2011

An empirical investigation into application of a fast discrete 2D S-transform algorithm to provide localized measures of texture in images.
Proceedings of the 24th Canadian Conference on Electrical and Computer Engineering, 2011


  Loading...