The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1999, volume: 215, number: 1-2

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. Martin Kutrib
    Pushdown Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:239-261 [Journal]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002