( en | de | ru )

 

Disambiguation of "Etessami, Kousha"

Author of the publication

copydeleteadd this publication to your clipboard
An abort-aware model of transactional programming.

, and . Int. J. Softw. Tools Technol. Transf., 13 (6): 537-551 (2011)

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.

Abdol Azim Etessami

 

Other publications of authors with the same name

Model Checking of Recursive Probabilistic Systems., and . ACM Trans. Comput. Log., 13 (2): 12:1-12:40 (2012)Analysis of recursive state machines., , , , , and . ACM Trans. Program. Lang. Syst., 27 (4): 786-818 (2005)Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars., , and . STOC, page 579-588. ACM, (2012)Compression of Partially Ordered Strings., , , , and . CONCUR, volume 2761 of Lecture Notes in Computer Science, page 42-56. Springer, (2003)Analysis of Recursive State Machines., , and . CAV, volume 2102 of Lecture Notes in Computer Science, page 207-220. Springer, (2001)Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations., , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 314-326. Springer, (2012)A note on a question of Peled and Wilke regarding stutter-invariant LTL.. Inf. Process. Lett., 75 (6): 261-263 (2000)Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051)., , , and . Dagstuhl Reports, 12 (1): 101-118 (2022)Realizability and verification of MSC graphs., , and . Theor. Comput. Sci., 331 (1): 97-114 (2005)A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing., , and . Electron. Colloquium Comput. Complex., (2013)