The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2003, volume: 1, number: 299

  1. Bruno Courcelle
    The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:1-36 [Journal]
  2. Letizia Magnoni, Massimo Mirolli, Franco Montagna, Giulia Simi
    PAC learning of probability distributions over a discrete domain. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:37-63 [Journal]
  3. Julio Aracena, Eric Goles Ch.
    Complexity of perceptron recognition for a class of geometric patterns. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:65-79 [Journal]
  4. Marcos A. Kiwi
    Algebraic testing and weight distributions of codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:81-106 [Journal]
  5. Frank K. Hwang
    A survey on multi-loop networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:107-121 [Journal]
  6. Chiara Epifanio, Michel Koskas, Filippo Mignosi
    On a conjecture on bidimensional words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:123-150 [Journal]
  7. David R. Wood
    Optimal three-dimensional orthogonal graph drawing in the general position model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:151-178 [Journal]
  8. Miklós Bartha, Miklós Krész
    Structuring the elementary components of graphs having a perfect internal matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:179-210 [Journal]
  9. Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Jinbo Xu, Ying Xu
    Approximation algorithms for NMR spectral peak assignment. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:211-229 [Journal]
  10. Ricardo A. Baeza-Yates, Joaquim Gabarró, Xavier Messeguer
    Fringe analysis of synchronized parallel insertion algorithms in 2-3 Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:231-271 [Journal]
  11. Subhas C. Nandy, Sandip Das, Partha P. Goswami
    An efficient k nearest neighbors searching algorithm for a query line. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:273-288 [Journal]
  12. Dahlia Malkhi, Yishay Mansour, Michael K. Reiter
    Diffusion without false rumors: on propagating updates in a Byzantine environment. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:289-306 [Journal]
  13. Markus Holzer, Pierre McKenzie
    Alternating and empty alternating auxiliary stack automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:307-326 [Journal]
  14. Olivier Finkel
    On omega context free languages which are Borel sets of infinite rank. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:327-346 [Journal]
  15. Dietrich Kuske
    Towards a language theory for infinite N-free pomsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:347-386 [Journal]
  16. Kjell Lemström, Lauri Hella
    Approximate pattern matching and transitive closure logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:387-412 [Journal]
  17. Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
    Presburger liveness verification of discrete timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:413-438 [Journal]
  18. Leah Epstein, Rob van Stee
    Lower bounds for on-line single-machine scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:439-450 [Journal]
  19. Michaël Rusinowitch, Mathieu Turuani
    Protocol insecurity with a finite number of sessions, composed keys is NP-complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:451-475 [Journal]
  20. Francesca Fiorenzi
    Cellular automata and strongly irreducible shifts of finite type. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:477-493 [Journal]
  21. Shankara Narayanan Krishna, Raghavan Rama
    Breaking DES using P systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:495-508 [Journal]
  22. Bruce W. Watson
    A new regular grammar pattern matching algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:509-521 [Journal]
  23. Bruno Durand, Enrico Formenti, Zsuzsanna Róka
    Number-conserving cellular automata I: decidability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:523-535 [Journal]
  24. Lars Engebretsen, Jonas Holmerin
    Towards optimal lower bounds for clique and chromatic number. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:537-584 [Journal]
  25. Alain Giorgetti
    An asymptotic study for path reversal. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:585-602 [Journal]
  26. Marcel Wild
    Idempotent and co-idempotent stack filters and min-max operators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:603-631 [Journal]
  27. Henning Fernau, Markus Holzer, Rudolf Freund
    Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:633-662 [Journal]
  28. Alexander Okhotin
    On the closure properties of linear conjunctive languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:663-685 [Journal]
  29. Oscar H. Ibarra, Zhe Dang
    Eliminating the storage tape in reachability constructions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:687-706 [Journal]
  30. Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook
    On finding common neighborhoods in massive graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:707-718 [Journal]
  31. Michael U. Gerber, Daniel Kobler
    Algorithms for vertex-partitioning problems on graphs with fixed clique-width. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:719-734 [Journal]
  32. Pierre-Cyrille Héam
    Some complexity results for polynomial rational expressions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:735-741 [Journal]
  33. Y. J. Liu
    Regular component decomposition of regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:743-749 [Journal]
  34. Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri
    The minimum broadcast range assignment problem on linear multi-hop wireless networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:751-761 [Journal]
  35. Wojciech Rytter
    On maximal suffixes, constant-space linear-time versions of KMP algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:763-774 [Journal]
  36. Pedro García, José Ruiz, Manuel Vazquez de Parga
    Bilateral locally testable languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:775-783 [Journal]
  37. Erzsébet Csuhaj-Varjú, Gheorghe Paun, György Vaszil
    PC grammar systems with five context-free components generate all recursively enumerable languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:785-794 [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