default search action
Ohad Shacham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c12]Amir Watad, Alexander Libov, Ohad Shacham, Edward Bortnikov, Mark Silberstein:
Achieving Scalability in a k-NN Multi-GPU Network Service with Centaur. PACT 2019: 245-257 - 2018
- [j3]Ohad Shacham, Yonatan Gottesman, Aran Bergman, Edward Bortnikov, Eshcar Hillel, Idit Keidar:
Taking Omid to the Clouds: Fast, Scalable Transactions for Real-Time Cloud Analytics. Proc. VLDB Endow. 11(12): 1795-1808 (2018) - 2017
- [c11]Yonatan Gottesman, Aran Bergman, Edward Bortnikov, Eshcar Hillel, Idit Keidar, Ohad Shacham:
Fragola: low-latency transactions in distributed data stores. SoCC 2017: 642 - [c10]Edward Bortnikov, Eshcar Hillel, Idit Keidar, Ivan Kelly, Matthieu Morel, Sameer Paranjpye, Francisco Perez-Sorrosal, Ohad Shacham:
Omid, Reloaded: Scalable and Highly-Available Transaction Processing. FAST 2017: 167-180 - 2014
- [c9]Ohad Shacham, Eran Yahav, Guy Golan-Gueta, Alex Aiken, Nathan Grasso Bronson, Mooly Sagiv, Martin T. Vechev:
Verifying atomicity via data independence. ISSTA 2014: 26-36 - 2012
- [b1]Ohad Shacham:
Verifying atomicity of composed concurrent operations. Tel Aviv University, Israel, 2012 - 2011
- [j2]Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman:
Reducing the size of resolution proofs in linear time. Int. J. Softw. Tools Technol. Transf. 13(3): 263-272 (2011) - [c8]Ohad Shacham, Nathan Grasso Bronson, Alex Aiken
, Mooly Sagiv, Martin T. Vechev, Eran Yahav:
Testing atomicity of composed concurrent operations. OOPSLA 2011: 51-64
2000 – 2009
- 2009
- [c7]Ohad Shacham, Martin T. Vechev, Eran Yahav:
Chameleon: adaptive selection of collections. PLDI 2009: 408-418 - 2008
- [c6]Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman:
Linear-Time Reductions of Resolution Proofs. Haifa Verification Conference 2008: 114-128 - 2007
- [j1]Ohad Shacham, Mooly Sagiv, Assaf Schuster:
Scaling model checking of dataraces using dynamic information. J. Parallel Distributed Comput. 67(5): 536-550 (2007) - [c5]Ohad Shacham, Karen Yorav:
On-The-Fly Resolve Trace Minimization. DAC 2007: 594-599 - 2005
- [c4]Ohad Shacham, Mooly Sagiv, Assaf Schuster:
Scaling model checking of dataraces using dynamic information. PPoPP 2005: 107-118 - [c3]Ohad Shacham, Karen Yorav:
Adaptive Application of SAT Solving Techniques. BMC@CAV 2005: 35-50 - [c2]Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Rabinovitz, Ohad Shacham, Rachel Tzoref:
Supporting SAT based BMC on Finite Path Models. BMC@CAV 2005: 67-77 - 2003
- [c1]Ohad Shacham, Emmanuel Zarpas:
Tuning the VSIDS Decision Heuristic for Bounded Model Checking. MTV 2003: 75-
Coauthor Index
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:42 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: