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

Journals in DBLP

Theor. Comput. Sci.
2006, volume: 359, number: 1-3

  1. Matthias Homeister
    Lower bounds for restricted read-once parity branching programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:1-14 [Journal]
  2. Teturo Kamae, Hui Rao, Yu-Mei Xue
    Maximal pattern complexity of two-dimensional words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:15-27 [Journal]
  3. Yongcheng Wu, Klaus Weihrauch
    A computable version of the Daniell-Stone theorem on integration and linear functionals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:28-42 [Journal]
  4. József Balogh, Dhruv Mubayi, András Pluhár
    On the edge-bandwidth of graph products. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:43-57 [Journal]
  5. Yves F. Verhoeven
    A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:58-68 [Journal]
  6. Chiuyuan Chen, James K. Lan, Wen-Shiang Tang
    An efficient algorithm to find a double-loop network that realizes a given L-shape. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:69-76 [Journal]
  7. Ferucio Laurentiu Tiplea, Aurora Tiplea
    Petri net reactive modules. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:77-100 [Journal]
  8. Fredrick Arnold, Benjamin Steinberg
    Synchronizing groups and automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:101-110 [Journal]
  9. Anton Leykin, Jan Verschelde, Ailing Zhao
    Newton's method with deflation for isolated singularities of polynomial systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:111-122 [Journal]
  10. Benjamin Doerr, Nils Hebbinghaus, Sören Werth
    Improved bounds and schemes for the declustering problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:123-132 [Journal]
  11. Taizo Sadahiro
    Multiple points of tilings associated with Pisot numeration systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:133-147 [Journal]
  12. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman
    k-Spine, 1-bend planarity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:148-175 [Journal]
  13. Xiaoyang Gu
    A note on dimensions of polynomial size circuits. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:176-187 [Journal]
  14. Frank Gurski, Egon Wanke
    Vertex disjoint paths on clique-width bounded graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:188-199 [Journal]
  15. Vijay K. Garg
    Algorithmic combinatorics based on slicing posets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:200-213 [Journal]
  16. Gabriele Fici, Filippo Mignosi, Antonio Restivo, Marinella Sciortino
    Word assembly through minimal forbidden words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:214-230 [Journal]
  17. Peter M. Higgins, Christopher J. Saker
    Unavoidable sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:231-238 [Journal]
  18. Christian Lavault, Guy Louchard
    Asymptotic analysis of a leader election algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:239-254 [Journal]
  19. André Barbé, Fritz von Haeseler
    Averages of automatic sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:255-281 [Journal]
  20. Anders Björner, Bruce E. Sagan
    Rationality of the Möbius function of a composition poset. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:282-298 [Journal]
  21. Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao
    Power domination in block graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:299-305 [Journal]
  22. Carl S. McTague, James P. Crutchfield
    Automated pattern detection - An algorithm for constructing optimally synchronizing multi-regular language filters. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:306-328 [Journal]
  23. Markus E. Nebel
    Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:329-343 [Journal]
  24. Sonia Pérez-Díaz, Juana Sendra, J. Rafael Sendra
    Distance bounds of epsilon-points on hypersurfaces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:344-368 [Journal]
  25. Bruno Escoffier, Vangelis Th. Paschos
    Completeness in approximation classes beyond APX. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:369-377 [Journal]
  26. Pawel Górecki, Jerzy Tiuryn
    DLS-trees: A model of evolutionary scenarios. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:378-399 [Journal]
  27. Pavlos Efraimidis, Paul G. Spirakis
    Approximation schemes for scheduling and covering on unrelated machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:400-417 [Journal]
  28. Leah Epstein, Asaf Levin
    The conference call search problem in wireless networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:418-429 [Journal]
  29. Wun-Tat Chan, Tak Wah Lam, Kin-Shing Liu, Prudence W. H. Wong
    New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:430-439 [Journal]
  30. Boris Ryabko, Jaakko Astola, Alexander Gammerman
    Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:440-448 [Journal]
  31. Sándor Szabó
    Completing codes and the Rédei property of groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:449-454 [Journal]
  32. Liviu Petrisor Dinu, Florin Manea
    An efficient approach for the rank aggregation problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:455-461 [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