| An infinite class of sparse-yao spanners M Bauer, M Damian Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 16 | 2013 |
| A PSPACE-complete first-order fragment of computability logic MS Bauer ACM Transactions on Computational Logic (TOCL) 15 (1), 1-11, 2014 | 8 | 2014 |
| Composing protocols with randomized actions MS Bauer, R Chadha, M Viswanathan International Conference on Principles of Security and Trust, 189-210, 2016 | 5 | 2016 |
| Exact quantitative probabilistic model checking through rational search U Mathur, MS Bauer, R Chadha, AP Sistla, M Viswanathan Formal Methods in System Design, 1-37, 2020 | 4 | 2020 |
| The computational complexity of propositional cirquent calculus MS Bauer arXiv preprint arXiv:1401.1849, 2014 | 4 | 2014 |
| Modular verification of protocol equivalence in the presence of randomness MS Bauer, R Chadha, M Viswanathan European Symposium on Research in Computer Security, 187-205, 2017 | 3 | 2017 |
| On the weak computability of continuous real functions MS Bauer, X Zheng arXiv preprint arXiv:1006.0394, 2010 | 2 | 2010 |
| Model checking indistinguishability of randomized security protocols MS Bauer, R Chadha, AP Sistla, M Viswanathan International Conference on Computer Aided Verification, 117-135, 2018 | 1 | 2018 |
| Analysis of randomized security protocols MS Bauer University of Illinois at Urbana-Champaign, 2018 | | 2018 |
| Sound Dynamic Deadlock Prediction in Linear Time U Mathur, MS Bauer, M Viswanathan | | |
| Exact Quantitative Model Checking Through Rational Search MS Bauer, U Mathur, R Chadha, AP Sistla, M Viswanathan | | |
Mahesh ViswanathanUniversity of Illinois, Urbana-ChampaignVerifierad e-postadress på illinois.edu
