@article{heber_mayr_stoye_2011, title={Common Intervals of Multiple Permutations}, volume={60}, ISSN={["1432-0541"]}, DOI={10.1007/s00453-009-9332-1}, number={2}, journal={ALGORITHMICA}, author={Heber, Steffen and Mayr, Richard and Stoye, Jens}, year={2011}, month={Jun}, pages={175–206} }
 @article{abdulla_ben henda_mayr_2007, title={Decisive Markov chains}, volume={3}, number={4}, journal={Logical Methods in Computer Science}, author={Abdulla, P. A. and Ben Henda, N. and Mayr, R.}, year={2007} }
 @article{abdulla_mahata_mayr_2007, title={Dense-timed petri nets: Checking zenoness, token liveness and boundedness}, volume={3}, number={1}, journal={Logical Methods in Computer Science}, author={Abdulla, P. A. and Mahata, P. and Mayr, R.}, year={2007} }
 @article{abdulla_henda_mayr_sandberg_2006, title={Eager Markov chains}, volume={4218}, ISBN={9783540472377}, journal={Automated technology for verification and analysis : ?b 4th international symposium, ATVA 2006, Beijing, China, October 23-26, 2006 : proceedings / ?c Susanne Graf, Wenhui Zhang (eds.).}, publisher={Springer}, author={Abdulla, P. A. and Henda, N. B. and Mayr, R. and Sandberg, S.}, editor={Graf, S. and Zhang, W.Editors}, year={2006}, pages={24–38} }
 @article{mayr_2005, title={Weak bisimilarity and regularity of context-free processes is EXPITIME-hard}, volume={330}, ISSN={["1879-2294"]}, DOI={10.1016/j.tcs.2004.10.008}, abstractNote={We show that checking weak bisimulation equivalence of two context-free processes (also called BPA-processes) is EXPTIME-hard, even under the condition that the processes are normed. Furthermore, checking weak regularity (finiteness up to weak bisimilarity) for context-free processes is EXPTIME-hard as well. Adding a finite control of the minimal non-trivial size of 2 to the BPA process already makes weak bisimilarity undecidable.}, number={3}, journal={THEORETICAL COMPUTER SCIENCE}, author={Mayr, R}, year={2005}, month={Feb}, pages={553–575} }
 @inbook{abdulla_mahata_mayr_2004, title={Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed Petri nets}, volume={3328}, ISBN={3540240586}, booktitle={FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science: 24th international conference, Chennai, India, December 16-18, 2004: Proceedings (Lecture notes in computer science ; 3328)}, publisher={Berlin; New York: Springer}, author={Abdulla, P. and Mahata, P. and Mayr, R.}, editor={K. Lodaya and Mahajan, M.Editors}, year={2004}, pages={58–70} }