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

Journals in DBLP

Theor. Comput. Sci.
2003, volume: 290, number: 3

  1. Jacques Duparc
    A hierarchy of deterministic context-free omega-languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1253-1300 [Journal]
  2. Masashi Katsura, Yuji Kobayashi
    Undecidable properties of monoids with word problem solvable in linear time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1301-1316 [Journal]
  3. Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila
    Tiling with bars under tomographic constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1317-1329 [Journal]
  4. Alfredo Goldman, Grégory Mounié, Denis Trystram
    1-optimality of static BSP computations: scheduling independent chains as a case study. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1331-1359 [Journal]
  5. Amihood Amir, Gad M. Landau, Dina Sokol
    Inplace run-length 2d compressed search. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1361-1383 [Journal]
  6. Olivier Finkel
    Borel hierarchy and omega context free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1385-1405 [Journal]
  7. Philippe Blayo, Pierre Rouzé, Marie-France Sagot
    Orphan gene finding - an exon assembly approach. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1407-1431 [Journal]
  8. Andrei A. Muchnik
    The definable criterion for definability in Presburger arithmetic and its applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1433-1444 [Journal]
  9. Frank Drewes, Hans-Jörg Kreowski, Denis Lapoire
    Criteria to disprove context freeness of collage languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1445-1458 [Journal]
  10. Jacek Blazewicz, Marta Kasprzak
    Complexity of DNA sequencing by hybridization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1459-1473 [Journal]
  11. Hsien-Kuei Hwang, Tsung-Hsi Tsai
    An asymptotic theory for recurrence relations based on minimization and maximization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1475-1501 [Journal]
  12. Victor Chepoi, Alexis Rollin
    Interval routing in some planar networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1503-1540 [Journal]
  13. Koji Nakano, Stephan Olariu, Albert Y. Zomaya
    A time-optimal solution for the path cover problem on cographs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1541-1556 [Journal]
  14. Salah Hussini, Lila Kari, Stavros Konstantinidis
    Coding properties of DNA languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1557-1579 [Journal]
  15. Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
    McNaughton families of languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1581-1628 [Journal]
  16. Michele d'Amico, Giovanni Manzini, Luciano Margara
    On computing the entropy of cellular automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1629-1646 [Journal]
  17. Yacine Boufkhad, Olivier Dubois, Maurice Nivat
    Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1647-1664 [Journal]
  18. Judit Csima, Erzsébet Csuhaj-Varjú, Arto Salomaa
    Power and size of extended Watson-Crick L systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1665-1678 [Journal]
  19. Henning Fernau
    Identification of function distinguishable languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1679-1711 [Journal]
  20. Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro
    Verification in loosely synchronous queue-connected discrete timed automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1713-1735 [Journal]
  21. Samuel T. Chanson, Cunsheng Ding, Arto Salomaa
    Cartesian authentication codes from functions with optimal nonlinearity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1737-1752 [Journal]
  22. Frank S. de Boer, Rogier M. van Eijk, Wiebe van der Hoek, John-Jules Ch. Meyer
    A fully abstract model for the exchange of information in multi-agent systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1753-1773 [Journal]
  23. Priti Shankar, Amitava Dasgupta, Kaustubh Deshmukh, B. Sundar Rajan
    On viewing block codes as finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1775-1797 [Journal]
  24. Jayme Luiz Szwarcfiter, Gonzalo Navarro, Ricardo A. Baeza-Yates, Joísa de S. Oliveira, Walter Cunto, Nivio Ziviani
    Optimal binary search trees with costs depending on the access paths. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1799-1814 [Journal]
  25. Martin E. Dyer, Alan M. Frieze, Michael Molloy
    A probabilistic analysis of randomly generated binary constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1815-1828 [Journal]
  26. Jop F. Sibeyn
    Faster deterministic sorting through better sampling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1829-1850 [Journal]
  27. Stasys Jukna, Stanislav Zák
    On uncertainty versus size in branching programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1851-1867 [Journal]
  28. Juha Honkala
    On images of D0L and DT0L power series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1869-1882 [Journal]
  29. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
    An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1883-1895 [Journal]
  30. Antonio Puricella, Iain A. Stewart
    Greedy algorithms, H-colourings and a complexity-theoretic dichotomy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1897-1913 [Journal]
  31. I. Dutour, Jean-Marc Fedou
    Object grammars and bijections. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1915-1929 [Journal]
  32. Andrei A. Muchnik
    One application of real-valued interpretation of formal power series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1931-1946 [Journal]
  33. Peter G. Harrison
    Turning back time in Markovian process algebra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1947-1986 [Journal]
  34. Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai K. Vereshchagin
    Do stronger definitions of randomness exist? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1987-1996 [Journal]
  35. Marek Chrobak, Elias Koutsoupias, John Noga
    More on randomized on-line algorithms for caching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1997-2008 [Journal]
  36. Gianluca De Marco, Andrzej Pelc
    Deterministic broadcasting time with partial knowledge of the network. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2009-2020 [Journal]
  37. Gaia Nicosia, Gianpaolo Oriolo
    An approximate A* algorithm and its application to the SCS problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2021-2029 [Journal]
  38. Ioan Tomescu
    On the number of occurrences of all short factors in almost all words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2031-2035 [Journal]
  39. Mao-cheng Cai, Xiaotie Deng, Lusheng Wang
    Approximate sequencing for variable length tasks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2037-2044 [Journal]
  40. Wilfried Meidl
    Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2045-2051 [Journal]
  41. José Carlos Costa
    Biinfinite words with maximal recurrent unbordered factors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2053-2061 [Journal]
  42. Armando B. Matos
    Linear programs in a simple reversible language. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2063-2074 [Journal]
  43. Véronique Terrier
    Characterization of real time iterative array by alternating device. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2075-2084 [Journal]
  44. A. A. Arratia-Quesada, Iain A. Stewart
    A note on first-order projections and games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2085-2093 [Journal]
  45. Dafa Li
    Is DNA computing viable for 3-SAT problems? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2095-2107 [Journal]
  46. Irène Charon, Olivier Hudry, Antoine Lobstein
    Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2109-2120 [Journal]
  47. Henning Fernau, Alexander Meduna
    On the degree of scattered context-sensitivity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2121-2124 [Journal]
  48. Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger
    On tiling under tomographic constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2125-2136 [Journal]
  49. Ayse Karaman
    Weak repetitions in Sturmian strings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2137-2146 [Journal]
  50. George Steiner
    On the k-path partition of graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2147-2155 [Journal]
  51. Hung Q. Ngo
    A new routing algorithm for multirate rearrangeable Clos networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2157-2167 [Journal]
  52. Lajos Hajdu, Robert Tijdeman
    Algebraic aspects of emission tomography with absorption. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2169-2181 [Journal]
  53. Kosaburo Hashiguchi
    Erratum to "New upper bounds to the limitedness of distance automata". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2183- [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