The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2005, volume: 341, number: 1-3

  1. Karl Auinger, Benjamin Steinberg
    Constructing divisions into power groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:1-21 [Journal]
  2. Eden Chlamtac, Uriel Feige
    Improved approximation of the minimum cover time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:22-38 [Journal]
  3. Yan-Cheng Chang, Chi-Jen Lu
    Oblivious polynomial evaluation and oblivious neural learning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:39-54 [Journal]
  4. Clemens Heuberger, Rajendra Katti, Helmut Prodinger, Xiaoyu Ruan
    The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:55-72 [Journal]
  5. J. Sawada
    Oracles for vertex elimination orderings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:73-90 [Journal]
  6. Péter Gács
    Uniform test of algorithmic randomness over a general space. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:91-137 [Journal]
  7. Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki
    Some properties of one-pebble Turing machines with sublogarithmic space. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:138-149 [Journal]
  8. Xiaochun Cheng, Dantong Ouyang, Yunfei Jiang, Chengqi Zhang
    An improved model-based method to test circuit faults. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:150-161 [Journal]
  9. Pieter Collins
    Continuity and computability of reachable sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:162-195 [Journal]
  10. Cheng-Nan Lai, Gen-Huey Chen
    Strong Rabin numbers of folded hypercubes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:196-215 [Journal]
  11. Guido Schäfer, Naveen Sivadasan
    Topology matters: Smoothed competitiveness of metrical task systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:216-246 [Journal]
  12. Blanca Cases, Manuel Alfonseca Moreno
    Towards a proof of the decidability of the momentary stagnation of the growth function of D0L systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:247-262 [Journal]
  13. Maurice H. ter Beek, Carlos Martín-Vide, Victor Mitrana
    Synchronized shuffles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:263-275 [Journal]
  14. Giuseppe Pirillo
    Inequalities characterizing standard Sturmian and episturmian words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:276-292 [Journal]
  15. Valérie Berthé, Srecko Brlek, Philippe Choquette
    Smooth words over arbitrary alphabets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:293-310 [Journal]
  16. Subhamoy Maitra, Kishan Chand Gupta, Ayineedi Venkateswarlu
    Results on multiples of primitive polynomials and their products over GF(2). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:311-343 [Journal]
  17. Zhe Dang, Oscar H. Ibarra, Jianwen Su
    On composition and lookahead delegation of e-services modeled by automata, . [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:344-363 [Journal]
  18. Hiroshi Nagamochi, Kengo Iwata, Toshimasa Ishii
    A robust algorithm for bisecting a triconnected graph with two resource sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:364-378 [Journal]
  19. Zdenek Tronícek, Ayumi Shinohara
    The size of subsequence automaton. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:379-384 [Journal]
  20. Quincy Wu, Chin Lung Lu, Richard Chia-Tung Lee
    The approximability of the weighted Hamiltonian path completion problem on a tree. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:385-397 [Journal]
  21. Wei-Mei Chen
    Probabilistic analysis of algorithms for the Dutch national flag problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:398-410 [Journal]
  22. Ruo-Wei Hung, Maw-Shang Chang
    Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, . [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:411-440 [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