Publisher
Springer International Publishing
Reference35 articles.
1. Agrawal, S., Chatterjee, K., Novotný, P.: Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. Proc. ACM Program. Lang. (POPL) 2, 34:1–34:32 (2018).
https://doi.org/10.1145/3158122
2. Ash, R.B., Doleans-Dade, C.A.: Probability and Measure Theory. Elsevier/Academic Press (2000)
3. Bazzi, L., Mitter, S.: The solution of linear probabilistic recurrence relations. Algorithmica 36(1), 41–57 (2003).
https://doi.org/10.1007/s00453-002-1003-4
4. Lecture Notes in Computer Science;O Bournez,2005
5. Lecture Notes in Computer Science;M Braverman,2006
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献