| Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games W Czerwiński, L Daviaud, N Fijalkow, M Jurdziński, R Lazić, P Parys SODA 2019 (30th annual Symposium on Discrete Algorithms), 2019 | 53 | 2019 |
| Regular and First Order List Functions M Bojanczyk, L Daviaud, KS Narayanan LICS 2018 (Logic in Computer Science, 33rd ACM/IEEE Symposium), 2018 | 37 | 2018 |
| A generalised twinning property for minimisation of cost register automata L Daviaud, PA Reynier, JM Talbot LICS 2016 (Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in …, 2016 | 33 | 2016 |
| Identities in Upper Triangular Tropical Matrix Semigroups and the Bicyclic Monoid L Daviaud, M Johnson, M Kambites Journal of Algebra 501, 503-525, 2018 | 32 | 2018 |
| A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games L Daviaud, M Jurdzinski, R Lazic LICS 2018 (Logic in Computer Science, 33rd ACM/IEEE Symposium), 2018 | 30* | 2018 |
| Which Classes of Origin Graphs Are Generated by Transducers? M Bojanczyk, L Daviaud, B Guillon, V Penelle ICALP 2017 (44th International Colloquium on Automata, Languages, and …, 2017 | 29 | 2017 |
| Size-change abstraction and max-plus automata T Colcombet, L Daviaud, F Zuleger MFCS 2014 (International Symposium on Mathematical Foundations of Computer …, 2014 | 29 | 2014 |
| Approximate comparison of functions computed by distance automata T Colcombet, L Daviaud Theory of Computing Systems 58 (4), 579-613, 2016 | 22* | 2016 |
| Degree of sequentiality of weighted automata L Daviaud, I Jecker, PA Reynier, D Villevalois FOSSACS 2017 (International Conference on Foundations of Software Science …, 2017 | 21 | 2017 |
| When is Containment Decidable for Probabilistic Automata? L Daviaud, M Jurdzinski, R Lazic, F Mazowiecki, GA Perez, J Worrell ICALP 2018 (45th International Colloquium on Automata, Languages, and …, 2018 | 15 | 2018 |
| Comparison of max-plus automata and joint spectral radius of tropical matrices L Daviaud, P Guillon, G Merlet MFCS 2017 (Mathematical Foundations of Computer Science 2017 - 42nd …, 2017 | 15 | 2017 |
| The Strahler number of a parity game L Daviaud, M Jurdziński, KS Thejaswini ICALP 2020 (47th International Colloquium on Automata, Languages, and …, 2020 | 14 | 2020 |
| Alternating weak automata from universal trees L Daviaud, M Jurdzinski, K Lehtinen CONCUR 2019 (30th International Conference on Concurrency Theory), 18:1-18:14, 2019 | 12 | 2019 |
| Varieties of cost functions L Daviaud, D Kuperberg, JÉ Pin STACS 2016 (33th International Symposium on Theoretical Aspects of Computer …, 2016 | 9 | 2016 |
| The Shortest Identities for Max-Plus Automata with Two States L Daviaud, M Johnson MFCS 2017 (Mathematical Foundations of Computer Science 2017 - 42nd …, 2017 | 8 | 2017 |
| When are emptiness and containment decidable for probabilistic automata? L Daviaud, M Jurdziński, R Lazić, F Mazowiecki, GA Pérez, J Worrell Journal of Computer and System Sciences 119, 78-96, 2021 | 7 | 2021 |
| Formal and empirical studies of counting behaviour in ReLU RNNs N El-Naggar, A Ryzhikov, L Daviaud, P Madhyastha, T Weyde International Conference on Grammatical Inference, 199-222, 2023 | 5 | 2023 |
| Undecidability of a weak version of MSO+ U AV Sreejith, V Penelle, B Guillon, L Daviaud, M Bojańczyk Logical Methods in Computer Science 16, 2020 | 5* | 2020 |
| Containment and equivalence of weighted automata: Probabilistic and max-plus cases L Daviaud Language and Automata Theory and Applications: 14th International Conference …, 2020 | 5 | 2020 |
| Automata and program analysis T Colcombet, L Daviaud, F Zuleger FCT (International Symposium on Fundamentals of Computation Theory), 3-10, 2017 | 4 | 2017 |
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
