Matthew S. Bauer
From MaRDI portal
Person:2037998
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Model checking indistinguishability of randomized security protocols Computer Aided Verification | 2023-05-05 | Paper |
| Modular verification of protocol equivalence in the presence of randomness | 2022-08-25 | Paper |
| Modelchecking safety properties in randomized security protocols | 2021-07-08 | Paper |
| On the weak computability of continuous real functions | 2021-02-16 | Paper |
| An infinite class of Sparse-Yao spanners Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| An infinite class of Sparse-Yao spanners Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| The computational complexity of propositional cirquent calculus Logical Methods in Computer Science | 2015-04-22 | Paper |
| A PSPACE-complete first-order fragment of computability logic ACM Transactions on Computational Logic | 2014-04-16 | Paper |
Research outcomes over time
This page was built for person: Matthew S. Bauer
