|
Journals in DBLP
- Yacine Boufkhad, Olivier Dubois
Length of Prime Implicants and Number of Solutions of Random CNF Formulae. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:1-30 [Journal]
- Gilles Didier
Caractérisation des N-écritures et application à l'étude des suites de complexité ultimement n+cste. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:31-49 [Journal]
- Yaghout Nourani, Bjarne Andresen
Exploration of NP-hard Enumeration Problems by Simulated Annealing - the Spectrum Values of Permanents. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:51-68 [Journal]
- Djelloul Ziadi, Jean-Marc Champarnaud
An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:69-87 [Journal]
- Ryuhei Uehara, Zhi-Zhong Chen, Xin He
Fast RNC and NC Algorithms for Maximal Path Sets. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:89-98 [Journal]
- Mireille Clerbout, Yves Roos, Isabelle Ryl
Synchronization Languages. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:99-121 [Journal]
- Johann Hagauer, Wilfried Imrich, Sandi Klavzar
Recognizing Median Graphs in Subquadratic Time. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:123-136 [Journal]
- Martin Middendorf, Welf Löwe, Wolf Zimmermann
Scheduling Inverse Trees Under the Communication Model of the LogP-Machine. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:137-168 [Journal]
- Valeria Mihalache
Decidability Problems in Grammar Systems. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:169-189 [Journal]
- Dora Giammarresi, Rosa Montalbano
Deterministic Generalized Automata. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:191-208 [Journal]
- Oh-Heum Kwon, Kyung-Yong Chwa
Scheduling Parallel Tasks with Individual Deadlines. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:209-223 [Journal]
- Bruno Durand, Anne-Cécile Fabret
On the Complexity of Deadlock Detection in Families of Planar Nets. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:225-237 [Journal]
- Martin Kutrib
Pushdown Cellular Automata. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:239-261 [Journal]
- Peter Buchholz
Exact Performance Equivalence: An Equivalence Relation for Stochastic Automata. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:263-287 [Journal]
- Pascal Koiran
Elimination of Parameters in the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:289-304 [Journal]
- Thomas Andreae, Felix Hartenstein, Andrea Wolter
A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent's Men. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:305-323 [Journal]
- Rotislav I. Grigorchuk, A. Machì
An Example of an Indexed Language of Intermediate Growth. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:325-327 [Journal]
- Véronique Bruyère, Christophe Reutenauer
A Proof of Choffrut's Theorem on Subsequential Functions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:329-335 [Journal]
- Arne Andersson, Peter Bro Miltersen, Mikkel Thorup
Fusion Trees can be Implemented with AC0 Instructions Only. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:337-344 [Journal]
- Herbert Fischer, Harley Flanders
A Minimal Code List. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:345-348 [Journal]
- Erzsébet Csuhaj-Varjú, György Vaszil
On the Computational Completeness of Context-Free Parallel Communicating Grammar Systems. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:349-358 [Journal]
- Lusheng Wang, Xiaohua Jia
Fixed Topology Steiner Trees and Spanning Forests. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:359-370 [Journal]
- Philippe Flajolet
Singularity Analysis and Asymptotics of Bernoulli Sums. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:371-381 [Journal]
- Jean-Michel Autebert
Some Results about Centralized PC Grammar Systems. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:215, n:1-2, pp:383-398 [Journal]
|