# Michael Okun

According to our database

Collaborative distances:

^{1}, Michael Okun authored at least 18 papers between 2002 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Artefactual origin of biphasic cortical spike-LFP correlation.

Journal of Computational Neuroscience, 2017

2016

Byzantine Agreement.

Encyclopedia of Algorithms, 2016

2014

Local Field Potential, Relationship to Membrane Synaptic Potentials.

Proceedings of the Encyclopedia of Computational Neuroscience, 2014

2010

Strong order-preserving renaming in the synchronous message passing model.

Theor. Comput. Sci., 2010

2009

Balance of excitation and inhibition.

Scholarpedia, 2009

On the round complexity of Byzantine agreement without initial set-up.

Inf. Comput., 2009

Randomized gossip algorithms for maintaining a distributed bulletin board with guaranteed age properties.

Concurrency and Computation: Practice and Experience, 2009

2008

Byzantine Agreement.

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Efficient Algorithms for Anonymous Byzantine Agreement.

Theory Comput. Syst., 2008

Renaming in synchronous message passing systems with Byzantine failures.

Distributed Computing, 2008

2007

On the Power of Impersonation Attacks.

Proceedings of the Distributed Computing, 21st International Symposium, 2007

An On-line Algorithm for Fair-Share Node Allocations in a Cluster.

Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2007), 2007

2006

Renaming in Message Passing Systems with Byzantine Failures.

Proceedings of the Distributed Computing, 20th International Symposium, 2006

2005

On approximation of the vertex cover problem in hypergraphs.

Discrete Optimization, 2005

Agreement Among Unacquainted Byzantine Generals.

Proceedings of the Distributed Computing, 19th International Conference, 2005

2004

Atomic Writes for data integrity and consistency in shared storage devices for clusters.

Future Generation Comp. Syst., 2004

2003

A new approach for approximating node deletion problems.

Inf. Process. Lett., 2003

2002

On Node State Reconstruction for Fault Tolerant Distributed Algorithms.

Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002