Amir Goharshady
Amir Goharshady
Home
Publications
CV
Personal
Light
Dark
Automatic
2
A Note on Belief Structures and S-approximation Spaces
An Efficient Algorithm for Computing Network Reliability in Small Treewidth
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth
Non-polynomial Worst-case Analysis of Recursive Programs
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
[1, 2]-sets and [1, 2]-total Sets in Trees with Algorithms
S-Approximation: A New Approach to Algebraic Approximation
Cite
×