default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaron Velner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i15]Krzysztof Gogol, Yaron Velner, Benjamin Kraner, Claudio J. Tessone:
SoK: Liquid Staking Tokens (LSTs). CoRR abs/2404.00644 (2024)- 2021
- [i14]Kalev Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner:
Some Complexity Results for Stateful Network Verification. CoRR abs/2106.01030 (2021)
2010 – 2019
- 2019
- [j6]Kalev Alpernas
, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner:
Some complexity results for stateful network verification. Formal Methods Syst. Des. 54(2): 191-231 (2019) - 2018
- [c17]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner:
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CONCUR 2018: 11:1-11:17 - [c16]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Yaron Velner:
Quantitative Analysis of Smart Contracts. ESOP 2018: 739-767 - [c15]Kalev Alpernas, Roman Manevich, Aurojit Panda, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner:
Abstract Interpretation of Stateful Networks. SAS 2018: 86-106 - [i13]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Yaron Velner:
Quantitative Analysis of Smart Contracts. CoRR abs/1801.03367 (2018) - [i12]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner:
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CoRR abs/1806.03108 (2018) - 2017
- [j5]Ilaria De Crescenzo, Salvatore La Torre, Yaron Velner:
Visibly pushdown modular games, . Inf. Comput. 253: 204-223 (2017) - [j4]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Yaron Velner:
Quantitative fair simulation games. Inf. Comput. 254: 143-166 (2017) - [j3]Krishnendu Chatterjee, Yaron Velner:
The Complexity of Mean-Payoff Pushdown Games. J. ACM 64(5): 34:1-34:49 (2017) - [j2]Krishnendu Chatterjee, Yaron Velner:
Hyperplane separation technique for multidimensional mean-payoff games. J. Comput. Syst. Sci. 88: 236-259 (2017) - [c14]Shaull Almagor, Orna Kupferman, Jan Oliver Ringert, Yaron Velner:
Quantitative Assume Guarantee Synthesis. CAV (2) 2017: 353-374 - [c13]Yaron Velner, Jason Teutsch, Loi Luu:
Smart Contracts Make Bitcoin Mining Pools Vulnerable. Financial Cryptography Workshops 2017: 298-316 - [c12]Loi Luu, Yaron Velner, Jason Teutsch, Prateek Saxena:
SmartPool: Practical Decentralized Pooled Mining. USENIX Security Symposium 2017: 1409-1426 - [i11]Kalev Alpernas, Roman Manevich, Aurojit Panda, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner:
Modular Safety Verification for Stateful Networks. CoRR abs/1708.05904 (2017) - [i10]Loi Luu, Yaron Velner, Jason Teutsch, Prateek Saxena:
SMART POOL : Practical Decentralized Pooled Mining. IACR Cryptol. ePrint Arch. 2017: 19 (2017) - [i9]Yaron Velner, Jason Teutsch, Loi Luu:
Smart Contracts Make Bitcoin Mining Pools Vulnerable. IACR Cryptol. ePrint Arch. 2017: 230 (2017) - 2016
- [c11]Shaull Almagor, Orna Kupferman, Yaron Velner:
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CONCUR 2016: 9:1-9:15 - [c10]Yaron Velner, Kalev Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham:
Some Complexity Results for Stateful Network Verification. TACAS 2016: 811-830 - [i8]Shaull Almagor, Orna Kupferman, Yaron Velner:
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CoRR abs/1604.07064 (2016) - 2015
- [b1]Yaron Velner:
Multidimensional and Pushdown Mean-Payoff Games with Applications to Quantitative Verification and Synthesis of Programs: Complexity, Decidability and Algorithms. Tel Aviv University, Israel, 2015 - [j1]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich, Jean-François Raskin:
The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241: 177-196 (2015) - [c9]Yaron Velner:
Robust Multidimensional Mean-Payoff Games are Undecidable. FoSSaCS 2015: 312-327 - [c8]Krishnendu Chatterjee, Andreas Pavlogiannis, Yaron Velner:
Quantitative Interprocedural Analysis. POPL 2015: 539-551 - 2014
- [c7]Yaron Velner:
Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives. CSL-LICS 2014: 79:1-79:10 - [c6]Ilaria De Crescenzo, Salvatore La Torre, Yaron Velner:
Visibly Pushdown Modular Games. GandALF 2014: 260-274 - [i7]Yaron Velner:
Robust Multidimensional Mean-Payoff Games are Undecidable. CoRR abs/1410.5703 (2014) - 2013
- [c5]Krishnendu Chatterjee, Yaron Velner:
Hyperplane Separation Technique for Multidimensional Mean-Payoff Games. CONCUR 2013: 500-515 - [c4]Yaron Velner:
The Complexity of Infinitely Repeated Alternating Move Games. ICALP (1) 2013: 816-827 - 2012
- [c3]Yaron Velner:
The Complexity of Mean-Payoff Automaton Expression. ICALP (2) 2012: 390-402 - [c2]Krishnendu Chatterjee, Yaron Velner:
Mean-Payoff Pushdown Games. LICS 2012: 195-204 - [i6]Krishnendu Chatterjee, Yaron Velner:
Mean-Payoff Pushdown Games. CoRR abs/1201.2829 (2012) - [i5]Yaron Velner:
Strategy Synthesis for Mean-Payoff Expression Objectives. CoRR abs/1209.1007 (2012) - [i4]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, Jean-François Raskin:
The Complexity of Multi-Mean-Payoff and Multi-Energy Games. CoRR abs/1209.3234 (2012) - [i3]Krishnendu Chatterjee, Yaron Velner:
Finite-State and Pushdown Games with Multi-dimensional Mean-Payoff Objectives. CoRR abs/1210.3141 (2012) - [i2]Yaron Velner:
The Complexity of Alternating Move Games. CoRR abs/1212.6632 (2012) - 2011
- [c1]Yaron Velner, Alexander Rabinovich:
Church Synthesis Problem for Noisy Input. FoSSaCS 2011: 275-289 - [i1]Yaron Velner:
The Complexity of Mean-Payoff Automaton Expression. CoRR abs/1106.3054 (2011)
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-05-10 00:43 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:
