( en | de | ru )

 

Disambiguation of "Goharshady, Amir Kafshdar"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial reachability witnesses via Stellensätze.

, , , , and . PLDI, page 772-787. ACM, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mansoor Anwer Ismail Amir

Belal Amireh

Manutschehr Amirfeyz

Iradj Amirzadeh-Asl

Mahmud Amirian-Khaffadjeh

 

Other publications of authors with the same name

Secure Credit Reporting on the Blockchain., , and . iThings/GreenCom/CPSCom/SmartData, page 1343-1348. IEEE, (2018)Quantitative Analysis of Smart Contracts., , and . ESOP, volume 10801 of Lecture Notes in Computer Science, page 739-767. Springer, (2018)Alleviating High Gas Costs by Secure and Trustless Off-chain Execution of Smart Contracts., and . SAC, page 258-261. ACM, (2023)Optimal Mining: Maximizing Bitcoin Miners' Revenues from Transaction Fees., , , and . Blockchain, page 266-273. IEEE, (2022)Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth., , , , and . ATVA, volume 12302 of Lecture Notes in Computer Science, page 253-270. Springer, (2020)Quantitative Bounds on Resource Usage of Probabilistic Programs., , , and . Proc. ACM Program. Lang., 8 (OOPSLA1): 362-391 (2024)Game-Theoretic Randomness for Proof-of-Stake., and . MARBLE, page 28-47. Springer, (2023)JTDec: A Tool for Tree Decompositions in Soot., , and . ATVA, volume 10482 of Lecture Notes in Computer Science, page 59-66. Springer, (2017)Non-polynomial Worst-Case Analysis of Recursive Programs., , and . ACM Trans. Program. Lang. Syst., 41 (4): 20:1-20:52 (2019)Cost analysis of nondeterministic probabilistic programs., , , , , and . PLDI, page 204-220. ACM, (2019)