Document Actions
Accepted papers
by
synasc-tcs
—
last modified
2010-03-11 18:55
In random order:
1. Mugurel Ionut Andreica, Andrei Grigorean and Nicolae Tapus. Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints
2. Olaf Beyersdorff. On the Existence of Complete Disjoint NP-Pairs
3. Gabriel Ciobanu and Eneia Nicolae Todoran. A Methodology for Parallel and Distributed Languages Development Based on Denotational Semantics
4. Miklos Bartha and Miklos Kresz. A depth-first algorithm to reduce graphs in linear time
5. Mircea Marin and Adrian Craciun. Factorizations of Regular Hedge Languages
6. Liliana Cojocaru, Erkki Makinen and Ferucio Laurentiu Tiplea. Classes of Szilard Languages in NC1
1. Mugurel Ionut Andreica, Andrei Grigorean and Nicolae Tapus. Algorithms for Identifying Sequence Patterns with Several Types of Occurrence Constraints
2. Olaf Beyersdorff. On the Existence of Complete Disjoint NP-Pairs
3. Gabriel Ciobanu and Eneia Nicolae Todoran. A Methodology for Parallel and Distributed Languages Development Based on Denotational Semantics
4. Miklos Bartha and Miklos Kresz. A depth-first algorithm to reduce graphs in linear time
5. Mircea Marin and Adrian Craciun. Factorizations of Regular Hedge Languages
6. Liliana Cojocaru, Erkki Makinen and Ferucio Laurentiu Tiplea. Classes of Szilard Languages in NC1
Forgot your password?
New user?