Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
From MaRDI portal
Publication:5096428
Cited in
(11)- Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5--8, 2016
- scientific article; zbMATH DE number 7218671 (Why is no real title available?)
- Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
- scientific article; zbMATH DE number 7559871 (Why is no real title available?)
- Graphs of bounded twin-width are quasi-polynomially -bounded
- On counting propositional logic and Wagner's hierarchy
- A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
- Towards logical foundations for probabilistic computation
- Pebble-depth
- A possible worlds semantics for trustworthy non-deterministic computations
- Polyregular functions: characterisations and refutations
This page was built for publication: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096428)