default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoav Rodeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Petra Hozzová, Jaroslav Bendík, Alexander Nutz, Yoav Rodeh:
Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification. CoRR abs/2402.10174 (2024)- 2023
- [c17]Petra Hozzová, Jaroslav Bendík, Alexander Nutz, Yoav Rodeh:
Overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification. LPAR 2023: 257-269 - 2021
- [j11]Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh:
Navigating in Trees with Permanently Noisy Advice. ACM Trans. Algorithms 17(2): 15:1-15:27 (2021) - 2020
- [j10]Amos Korman, Yoav Rodeh
:
Multi-round cooperative search games with multiple players. J. Comput. Syst. Sci. 113: 125-149 (2020)
2010 – 2019
- 2019
- [j9]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel Bayesian Search with No Coordination. J. ACM 66(3): 17:1-17:28 (2019) - [c16]Amos Korman, Yoav Rodeh:
Multi-Round Cooperative Search Games with Multiple Players. ICALP 2019: 146:1-146:14 - 2018
- [j8]Amos Korman, Yoav Rodeh:
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. ACM Trans. Algorithms 14(4): 43:1-43:23 (2018) - [c15]Lucas Boczkowski, Amos Korman, Yoav Rodeh:
Searching a Tree with Permanently Noisy Advice. ESA 2018: 54:1-54:13 - [i7]Amos Korman, Yoav Rodeh:
Cooperative Search Games: Symmetric Equilibria, Robustness, and Price of Anarchy. CoRR abs/1811.01270 (2018) - 2017
- [j7]Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh:
Fast rendezvous on a cycle by agents with different speeds. Theor. Comput. Sci. 688: 77-85 (2017) - [c14]Amos Korman, Yoav Rodeh:
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. ICALP 2017: 81:1-81:13 - [c13]Amos Korman, Yoav Rodeh:
Parallel Search with No Coordination. SIROCCO 2017: 195-211 - [i6]Amos Korman, Yoav Rodeh:
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. CoRR abs/1704.06096 (2017) - [i5]Amos Korman, Yoav Rodeh:
Parallel Search with no Coordination. CoRR abs/1705.05704 (2017) - 2016
- [c12]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel exhaustive search without coordination. STOC 2016: 312-323 - [i4]Amos Korman, Yoav Rodeh:
Parallel Linear Search with no Coordination for a Randomly Placed Treasure. CoRR abs/1602.04952 (2016) - [i3]Lucas Boczkowski, Amos Korman, Yoav Rodeh:
Searching on Trees with Noisy Memory. CoRR abs/1611.01403 (2016) - 2015
- [i2]Pierre Fraigniaud, Amos Korman, Yoav Rodeh:
Parallel Exhaustive Search without Coordination. CoRR abs/1511.00486 (2015) - 2014
- [c11]Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh:
Fast Rendezvous on a Cycle by Agents with Different Speeds. ICDCN 2014: 1-13 - 2012
- [i1]Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh:
Rendezvous of Agents with Different Speeds. CoRR abs/1211.5787 (2012) - 2010
- [j6]Amos Korman, David Peleg, Yoav Rodeh:
Constructing Labeling Schemes through Universal Matrices. Algorithmica 57(4): 641-652 (2010)
2000 – 2009
- 2006
- [j5]Yoav Rodeh, Ofer Strichman:
Building small equality graphs for deciding equality logic with uninterpreted functions. Inf. Comput. 204(1): 26-59 (2006) - [c10]Amos Korman, David Peleg, Yoav Rodeh:
Constructing Labeling Schemes Through Universal Matrices. ISAAC 2006: 409-418 - 2004
- [j4]Amos Korman, David Peleg, Yoav Rodeh:
Labeling Schemes for Dynamic Tree Networks. Theory Comput. Syst. 37(1): 49-75 (2004) - 2003
- [j3]Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel:
Erratum ("The small model property: how small can it be?" Volume 178, Number 1 [2002], pages 279-293). Inf. Comput. 184(1): 227 (2003) - [c9]Michael Langberg, Amir Pnueli, Yoav Rodeh:
The ROBDD Size of Simple CNF Formulas. CHARME 2003: 363-377 - [c8]Sharon Keidar, Yoav Rodeh:
Searching for Counter-Examples Adaptively. IWFM 2003 - 2002
- [j2]Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel:
The Small Model Property: How Small Can It Be? Inf. Comput. 178(1): 279-293 (2002) - [c7]Amos Korman, David Peleg, Yoav Rodeh:
Labeling Schemes for Dynamic Tree Networks. STACS 2002: 76-87 - 2001
- [j1]Ilan Beer, Shoham Ben-David, Cindy Eisner, Yoav Rodeh:
Efficient Detection of Vacuity in Temporal Model Checking. Formal Methods Syst. Des. 18(2): 141-163 (2001) - [c6]Yoav Rodeh, Ofer Strichman:
Finite Instantiations in Equivalence Logic with Uninterpreted Functions. CAV 2001: 144-154 - [c5]Ilan Beer, Shoham Ben-David, Cindy Eisner, Dana Fisman, Anna Gringauze, Yoav Rodeh:
The Temporal Logic Sugar. CAV 2001: 363-367 - [c4]Amir Pnueli, Yoav Rodeh, Ofer Strichman:
Range Allocation for Equivalence Logic. FSTTCS 2001: 317-333
1990 – 1999
- 1999
- [c3]Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel:
Deciding Equality Formulas by Small Domains Instantiations. CAV 1999: 455-469 - 1997
- [c2]Ilan Beer, Shoham Ben-David, Cindy Eisner, Yoav Rodeh:
Efficient Detection of Vacuity in ACTL Formulaas. CAV 1997: 279-290 - [c1]Ilan Beer, Shoham Ben-David, Cindy Eisner, Daniel Geist, Leonid Gluhovsky, Tamir Heyman, Avner Landver, P. Paanah, Yoav Rodeh, G. Ronin, Yaron Wolfsthal:
RuleBase: Model Checking at IBM. CAV 1997: 480-483
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 2025-01-20 23:04 CET 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:
