Amir Goharshady
Home
Publications
Awards and Honors
Personal
Amir Kafshdar Goharshady
Latest
Polynomial Invariant Generation for Non-deterministic Recursive Programs
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis
A Note on Belief Structures and S-approximation Spaces
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth
Non-polynomial Worst-case Analysis of Recursive Programs
Modular Verification for Almost-Sure Termination of Probabilistic Programs
An Efficient Algorithm for Computing Network Reliability in Small Treewidth
Cost Analysis of Nondeterministic Probabilistic Programs
Probabilistic Smart Contracts: Secure Randomness on the Blockchain
Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving
The Treewidth of Smart Contracts
Efficient Parameterized Algorithms for Data Packing
Ergodic Mean-payoff Games for the Analysis of Attacks in Cryptocurrencies
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
Secure Credit Reporting on the Blockchain
Computational Approaches for Stochastic Shortest Path on Succinct MDPs
Quantitative Analysis of Smart Contracts
JTDec: A Tool for Tree Decompositions in Soot
Non-polynomial Worst-case Analysis of Recursive Programs
Termination Analysis of Probabilistic Programs through Positivstellensatz’s
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
[1, 2]-sets and [1, 2]-total Sets in Trees with Algorithms
A Combinatorial Approach to Certain Topological Spaces Based on Minimum Complement S-Approximation Spaces
S-Approximation: A New Approach to Algebraic Approximation
Cite
×