Остановите войну!
for scientists:
default search action
Gadi Taubenfeld
- > Home > Persons > Gadi Taubenfeld
Publications
- 2013
- [j28]Michael Merritt, Gadi Taubenfeld:
Computing with infinitely many processes. Inf. Comput. 233: 12-31 (2013) - 2008
- [j25]Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld:
Sequentially consistent versus linearizable counting networks. Distributed Comput. 21(4): 249-269 (2008) - [c35]Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld:
Group Renaming. OPODIS 2008: 58-72 - 2005
- [j23]Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright:
Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Comput. 18(2): 99-109 (2005) - 2003
- [j22]Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld:
Objects shared by Byzantine processes. Distributed Comput. 16(1): 37-48 (2003) - [c29]Michael Merritt, Gadi Taubenfeld:
Resilient Consensus for Infinitely Many Processes. DISC 2003: 1-15 - 2002
- [c27]Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright:
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. DISC 2002: 222-236 - 2001
- [c26]Eli Gafni, Michael Merritt, Gadi Taubenfeld:
The concurrency hierarchy, and algorithms for unbounded concurrency. PODC 2001: 161-169 - 2000
- [c25]Michael Merritt, Gadi Taubenfeld:
Computing with Infinitely Many Processes. DISC 2000: 164-178 - [c24]Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld:
Objects Shared by Byzantine Processes. DISC 2000: 345-359 - 1999
- [j20]Yehuda Afek, Michael Merritt, Gadi Taubenfeld:
The Power of Multiobjects. Inf. Comput. 153(1): 117-138 (1999) - [c23]Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld:
Sequentially Consistent versus Linearizable Counting Networks. PODC 1999: 133-142 - 1998
- [c22]Michael Merritt, Gadi Taubenfeld:
Fairness of Shared Objects. DISC 1998: 303-317 - 1997
- [c21]Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou:
Disentangling Multi-Object Operations (Extended Abstract). PODC 1997: 111-120 - 1996
- [c19]Yehuda Afek, Michael Merritt, Gadi Taubenfeld:
The Power of Multi-objects (Extended Abstract). PODC 1996: 213-222 - 1995
- [j10]Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld:
Computing With Faulty Shared Objects. J. ACM 42(6): 1231-1274 (1995) - 1994
- [j9]Michael Merritt, Gadi Taubenfeld:
Atomic m-Register Operations. Distributed Comput. 7(4): 213-221 (1994) - 1993
- [j7]Michael Merritt, Gadi Taubenfeld:
Knowledge in Shared Memory Systems. Distributed Comput. 7(2): 99-109 (1993) - [j5]Michael Merritt, Gadi Taubenfeld:
Speeding Lamport's Fast Mutual Exclusion Algorithm. Inf. Process. Lett. 45(3): 137-142 (1993) - [c13]Yehuda Afek, Michael Merritt, Gadi Taubenfeld:
Benign Failure Models for Shared Memory (Preliminary Version). WDAG 1993: 69-83 - 1992
- [c12]Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld:
Computing with Faulty Shared Memory (Extended Abstract). PODC 1992: 47-58 - 1991
- [c8]Michael Merritt, Gadi Taubenfeld:
Knowledge in Shared Memory Systems (Preliminary Version). PODC 1991: 189-200 - [c7]Michael Merritt, Gadi Taubenfeld:
Atomic m-Register Operations (Extended Abstract). WDAG 1991: 289-294
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-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint