The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2004, volume: 310, number: 1-3

  1. Jack Jie Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo
    Finite-state dimension. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:1-33 [Journal]
  2. Marc Chemillier
    Synchronization of musical words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:35-60 [Journal]
  3. Savio S. H. Tse, Francis C. M. Lau
    New bounds for multi-label interval routing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:61-77 [Journal]
  4. Olivier Serre
    Vectorial languages and linear temporal logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:79-116 [Journal]
  5. Annie Choquet-Geniet, Emmanuel Grolleau
    Minimal schedulability interval for real-time systems of periodic tasks with offsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:117-134 [Journal]
  6. Eric Angel, Evripidis Bampis, Laurent Gourvès
    Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:135-146 [Journal]
  7. Hing Leung, Viktor Podolskiy
    The limitedness problem on distance automata: Hashiguchi's method revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:147-158 [Journal]
  8. Ron Lavi, Noam Nisan
    Competitive analysis of incentive compatible on-line auctions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:159-180 [Journal]
  9. Lothar M. Schmitt
    Theory of Genetic Algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:181-231 [Journal]
  10. Traian-Florin Serbanuta
    Extending Parikh matrices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:233-246 [Journal]
  11. Oliver Jenkinson, Luca Q. Zamboni
    Characterisations of balanced words via orderings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:247-271 [Journal]
  12. Wai-fong Chuan
    Moments of conjugacy classes of binary words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:273-285 [Journal]
  13. Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar
    Finding hidden independent sets in interval graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:287-307 [Journal]
  14. Richard Groult, Martine Léonard, Laurent Mouchard
    Speeding up the detection of evolutive tandem repeats. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:309-328 [Journal]
  15. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
    Tree spanners on chordal graphs: complexity and algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:329-354 [Journal]
  16. Anton Mityagin
    On the complexity of finding a local maximum of functions on discrete planar subsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:355-363 [Journal]
  17. Henrik Björklund, Sven Sandberg, Sergei G. Vorobyov
    Memoryless determinacy of parity and mean payoff games: a simple proof. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:365-378 [Journal]
  18. Yoshifumi Manabe, Naka Tajima
    (h, k)-Arbiters for h-out-of-k mutual exclusion problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:379-392 [Journal]
  19. Michal Kunc
    Undecidability of the trace coding problem and some decidable cases. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:393-456 [Journal]
  20. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
    Competitive facility location: the Voronoi game. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:457-467 [Journal]
  21. Julien Cervelle, Bruno Durand
    Tilings: recursivity and regularity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:469-477 [Journal]
  22. Peter Dukes, Alan C. H. Ling
    A combinatorial error bound for t-point-based sampling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:479-488 [Journal]
  23. Jérémie Chalopin, Hing Leung
    On factorization forests of finite height. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:489-499 [Journal]
  24. Sanming Zhou
    A channel assignment problem for optical networks modelled by Cayley graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:501-511 [Journal]
  25. Michael Alekhnovich
    Mutilated chessboard problem is exponentially hard for resolution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:513-525 [Journal]
  26. Alejandro López-Ortiz, Sven Schuierer
    On-line parallel heuristics, processor scheduling and robot searching under the competitive framework. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:527-537 [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