Rationality in algebras with a series operation
Information and Computation
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Theoretical Computer Science
Infinite Series-Parallel Posets: Logic and Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Series and Parallel Operations on Pomsets
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
The order type of the collection of finite series-parallel posets
Discrete Mathematics
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
Fundamenta Informaticae - Application of Concurrency to System Design
Mapping unstructured applications into nested parallelism
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Series-parallel languages on scattered and countable posets
Theoretical Computer Science
Trasgo: a nested-parallel programming system
The Journal of Supercomputing
A preliminary nested-parallel framework to efficiently implement scientific applications
VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
SPC-XML: a structured representation for nested-parallel programming languages
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
GD'11 Proceedings of the 19th international conference on Graph Drawing
Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
Fundamenta Informaticae - Application of Concurrency to System Design
Series-parallel languages on scattered and countable posets
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |