default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Okun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j10]Michael Okun
:
Artefactual origin of biphasic cortical spike-LFP correlation. J. Comput. Neurosci. 42(1): 31-35 (2017)- 2016
- [r3]Michael Okun:
Byzantine Agreement. Encyclopedia of Algorithms 2016: 255-259 - 2014
- [r2]Aryeh H. Taub, Ilan Lampl, Michael Okun:
Local Field Potential, Relationship to Membrane Synaptic Potentials. Encyclopedia of Computational Neuroscience 2014 - 2010
- [j9]Michael Okun:
Strong order-preserving renaming in the synchronous message passing model. Theor. Comput. Sci. 411(40-42): 3787-3794 (2010) - [i1]Michael Okun:
On the Power of Impersonation Attacks. CoRR abs/1007.1086 (2010)
2000 – 2009
- 2009
- [j8]Lior Amar, Amnon Barak, Zvi Drezner, Michael Okun:
Randomized gossip algorithms for maintaining a distributed bulletin board with guaranteed age properties. Concurr. Comput. Pract. Exp. 21(15): 1907-1927 (2009) - [j7]Michael Okun:
On the round complexity of Byzantine agreement without initial set-up. Inf. Comput. 207(12): 1351-1368 (2009) - [j6]Michael Okun, Ilan Lampl:
Balance of excitation and inhibition. Scholarpedia 4(8): 7467 (2009) - 2008
- [j5]Michael Okun, Amnon Barak, Eli Gafni:
Renaming in synchronous message passing systems with Byzantine failures. Distributed Comput. 20(6): 403-413 (2008) - [j4]Michael Okun, Amnon Barak:
Efficient Algorithms for Anonymous Byzantine Agreement. Theory Comput. Syst. 42(2): 222-238 (2008) - [r1]Michael Okun:
Byzantine Agreement. Encyclopedia of Algorithms 2008 - 2007
- [c5]Lior Amar, Amnon Barak, Ely Levy, Michael Okun:
An On-line Algorithm for Fair-Share Node Allocations in a Cluster. CCGRID 2007: 83-91 - [c4]Michael Okun:
On the Power of Impersonation Attacks. DISC 2007: 494-495 - 2006
- [c3]Michael Okun, Amnon Barak:
Renaming in Message Passing Systems with Byzantine Failures. DISC 2006: 16-30 - 2005
- [b1]Michael Okun:
Distributed computing among unacqainted processors in the presence of Byzantine failures (חישוב מבוזר בין מעבדים חסרי היכרות מוקדמת במערכת עם נפילות ביזנטיות.). Hebrew University of Jerusalem, Israel, 2005 - [j3]Michael Okun:
On approximation of the vertex cover problem in hypergraphs. Discret. Optim. 2(1): 101-111 (2005) - [c2]Michael Okun:
Agreement Among Unacquainted Byzantine Generals. DISC 2005: 499-500 - 2004
- [j2]Michael Okun, Amnon Barak:
Atomic Writes for data integrity and consistency in shared storage devices for clusters. Future Gener. Comput. Syst. 20(4): 539-547 (2004) - 2003
- [j1]Michael Okun, Amnon Barak:
A new approach for approximating node deletion problems. Inf. Process. Lett. 88(5): 231-236 (2003) - 2002
- [c1]Michael Okun, Amnon Barak:
On Node State Reconstruction for Fault Tolerant Distributed Algorithms. SRDS 2002: 160-
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
