Works (6)

Updated: July 5th, 2023 15:57

2009 journal article

Common Intervals of Multiple Permutations

ALGORITHMICA, 60(2), 175–206.

By: S. Heber n, R. Mayr* & J. Stoye*

author keywords: Common intervals of permutations; Multichromosomal permutations; Circular permutations
TL;DR: An algorithm is presented that finds in a family of k permutations of n elements all z common intervals in optimal O(kn+z) time and O(n) additional space and how to adapt this algorithm to multichromosomal and circular permutations is shown. (via Semantic Scholar)
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2007 journal article

Decisive Markov chains

Logical Methods in Computer Science, 3(4).

By: P. Abdulla, N. Ben Henda & R. Mayr

Source: NC State University Libraries
Added: August 6, 2018

2007 journal article

Dense-timed petri nets: Checking zenoness, token liveness and boundedness

Logical Methods in Computer Science, 3(1).

By: P. Abdulla, P. Mahata & R. Mayr

Source: NC State University Libraries
Added: August 6, 2018

2006 journal article

Eager Markov chains

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.)., 4218, 24–38.

By: P. Abdulla, N. Henda, R. Mayr & S. Sandberg

Ed(s): S. Graf & W. Zhang

Source: NC State University Libraries
Added: August 6, 2018

2004 chapter

Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed Petri nets

In K. Lodaya & M. Mahajan (Eds.), 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) (Vol. 3328, pp. 58–70). Berlin; New York: Springer.

By: P. Abdulla, P. Mahata & R. Mayr

Ed(s): . K. Lodaya & M. Mahajan

Source: NC State University Libraries
Added: August 6, 2018

2004 article

Weak bisimilarity and regularity of context-free processes is EXPITIME-hard

Mayr, R. (2005, February 9). THEORETICAL COMPUTER SCIENCE, Vol. 330, pp. 553–575.

By: R. Mayr n

author keywords: context-free processes; BPA; pushdown automata; bisimulation
Source: Web Of Science
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.