The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Theor. Comput. Sci.
2001, volume: 259, number: 1-2

  1. Lothar M. Schmitt
    Theory of genetic algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:1-61 [Journal]
  2. Paola Bonizzoni, Gianluca Della Vedova
    The complexity of multiple sequence alignment with SP-score that is a metric. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:63-79 [Journal]
  3. Marek Chrobak, Christoph Dürr
    Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:81-98 [Journal]
  4. Maurice Margenstern, Kenichi Morita
    NP problems are tractable in the space of cellular automata in the hyperbolic plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:99-128 [Journal]
  5. Kojiro Kobayashi
    On time optimal solutions of the firing squad synchronization problem for two-dimensional paths. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:129-143 [Journal]
  6. Arturo Carpi, Aldo de Luca
    Words and special factors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:145-182 [Journal]
  7. Ines Klimann
    New types of automata to solve fixed point problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:183-197 [Journal]
  8. Paul Trow
    Determining presentations of sofic shifts. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:199-216 [Journal]
  9. Maria J. Serna, Fatos Xhafa
    On the parallel approximability of a subclass of quadratic programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:217-231 [Journal]
  10. Chính T. Hoàng, R. Sritharan
    Finding houses and holes in graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:233-244 [Journal]
  11. Marie-Andrée Jacob-Da Col
    Applications quasi-affines et pavages du plan discret. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:245-269 [Journal]
  12. Jean-Christophe Dubacq, Bruno Durand, Enrico Formenti
    Kolmogorov complexity and cellular automata classification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:271-285 [Journal]
  13. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Dynamic algorithms for classes of constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:287-305 [Journal]
  14. Andreas Goerdt
    The giant component threshold for random regular graphs with edge faults H. Prodinger. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:307-321 [Journal]
  15. Dawei Hong, Jean-Camille Birget
    Approximation of some NP-hard optimization problems by finite machines, in probability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:323-339 [Journal]
  16. Paola Bonizzoni, Ross M. McConnell
    Nesting of prime substructures in k-ary relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:341-357 [Journal]
  17. Gianluca De Marco, Luisa Gargano, Ugo Vaccaro
    Concurrent multicast in weighted networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:359-377 [Journal]
  18. André Barbé, Guentcho Skordev
    Decimation-invariant sequences and their automaticity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:379-403 [Journal]
  19. Henning Fernau, Markus Holzer, Rudolf Freund
    Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:405-426 [Journal]
  20. Susanne Kaufmann, Frank Stephan
    Robust learning with infinite additional information. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:427-454 [Journal]
  21. John Case, Keh-Jiann Chen, Sanjay Jain
    Costs of general purpose learning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:455-473 [Journal]
  22. Jianliang Xu, Tsunehiro Yoshinaga, Katsushi Inoue, Yue Wang, Akira Ito
    Alternation for sublogarithmic space-bounded alternating pushdown automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:475-492 [Journal]
  23. Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro
    Efficient algorithms for chemical threshold testing problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:493-511 [Journal]
  24. Guo-Hui Lin, Guoliang Xue
    Signed genome rearrangement by reversals and transpositions: models and approximations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:513-531 [Journal]
  25. Stephen L. Bloom, Christian Choffrut
    Long words: the theory of concatenation and omega-power. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:533-548 [Journal]
  26. David Guijarro, Víctor Lavín, Vijay Raghavan
    Monotone term decision lists. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:549-575 [Journal]
  27. Mikel Aldaz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
    A new method to obtain lower bounds for polynomial evaluation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:577-596 [Journal]
  28. Vikraman Arvind, Jacobo Torán
    A nonadaptive NC checker for permutation group intersection. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:597-611 [Journal]
  29. Dima Grigoriev
    Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:613-622 [Journal]
  30. Peter Kirrinnis
    Fast algorithms for the Sylvester equation AX-XBT=C. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:623-638 [Journal]
  31. Gerald A. Heuer
    Three-part partition games on rectangles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:639-661 [Journal]
  32. Jiri Sgall
    Solution of David Gale's lion and man problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:663-670 [Journal]
  33. Anton Stiglic
    Computations with a deck of cards. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:671-678 [Journal]
  34. Amparo Fúster-Sabater, L. Javier García-Villalba
    An efficient algorithm to generate binary sequences for cryptographic purposes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:679-688 [Journal]
  35. Juha Honkala, Arto Salomaa
    Watson-Crick D0L systems with regular triggers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:689-698 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002