September 11, 2015 article Open access Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata Journal of the ACM DOI: 10.1145/2789208 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 8 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Model Checking Temporal Properties of Recursive Probabilistic Programs 2023 Logical Methods in Computer Science article Computer Science Formal Methods in Verification Open access 4 citations On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata 2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Formal Methods in Verification 5 citations Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration 2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 6 citations 3 results References 0