Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Information and Computation - TACS 2001
The power of priority channel systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |