The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2001, volume: 262, number: 1

  1. Juraj Hromkovic, Georg Schnitger
    On the power of Las Vegas II: Two-way finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:1-24 [Journal]
  2. S. Stepán Holub
    Local and global cyclicity in free semigroups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:25-36 [Journal]
  3. David Lee, Henryk Wozniakowski
    Approximate evaluations of characteristic polynomials of Boolean functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:37-68 [Journal]
  4. Alberto Bertoni, Marco Carpentieri
    Analogies and differences between quantum and stochastic automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:69-81 [Journal]
  5. Donghui Chen, Ding-Zhu Du, Xiao-Dong Hu, Guo-Hui Lin, Lusheng Wang, Guoliang Xue
    Approximations for Steiner trees with minimum number of Steiner points. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:83-99 [Journal]
  6. Ming-Yang Kao, Jie Wang
    Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:101-115 [Journal]
  7. Satoshi Kobayashi, Victor Mitrana, Gheorghe Paun, Grzegorz Rozenberg
    Formal properties of PA-matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:117-131 [Journal]
  8. K. Kalorkoti, D. H. Tulley
    Priority queues with binary priorities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:133-144 [Journal]
  9. Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne
    Approximations for the general block distribution of a matrix. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:145-160 [Journal]
  10. Bhaskar DasGupta, Eduardo D. Sontag
    A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:161-189 [Journal]
  11. Oliver Jenkinson
    Strong cocycle triviality for Z2 subshifts. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:191-213 [Journal]
  12. Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
    Longest fault-free paths in star graphs with vertex faults. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:215-227 [Journal]
  13. G. Dányi, Zoltán Fülöp
    The component hierarchy of chain-free cooperating distributed regular tree grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:229-240 [Journal]
  14. Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer
    Hyper-polynomial hierarchies and the polynomial jump. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:241-256 [Journal]
  15. Bing Lu, Jun Gu, Xiao-Dong Hu, Eugene Shragowitz
    Wire segmenting for buffer insertion based on RSTP-MSP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:257-267 [Journal]
  16. Jean-Pierre Duval, Filippo Mignosi, Antonio Restivo
    Recurrence and periodicity in infinite words from local periods. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:269-284 [Journal]
  17. Ekkart Kindler, Hagen Völzer
    Algebraic nets with flexible arcs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:285-310 [Journal]
  18. Enno Ohlebusch
    Implementing conditional term rewriting by graph rewriting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:311-331 [Journal]
  19. Nguyen Huong Lam
    Finite maximal solid codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:333-347 [Journal]
  20. Doris Fiebig, Ulf-Rainer Fiebig, Natasa Jonoska
    Multiplicities of covers for sofic shifts. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:349-375 [Journal]
  21. Frank Drewes
    Tree-based generation of languages of fractals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:377-414 [Journal]
  22. Heejin Park, Kunsoo Park
    Parallel algorithms for red-black trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:415-435 [Journal]
  23. Steven S. Seiden
    Preemptive multiprocessor scheduling with rejection. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:437-458 [Journal]
  24. Siu-Wing Cheng, Yin-Feng Xu
    On beta-skeleton as a subgraph of the minimum weight triangulation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:459-471 [Journal]
  25. Dieter Spreen
    Representations versus numberings: on the relationship of two computability notions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:473-499 [Journal]
  26. Bernd Borchert, Riccardo Silvestri
    Dot operators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:501-523 [Journal]
  27. Matthieu Latapy, Roberto Mantaci, Michel Morvan, Ha Duong Phan
    Structure of some sand piles model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:525-556 [Journal]
  28. Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
    Approximate periods of strings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:557-568 [Journal]
  29. Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
    Efficient web searching using temporal factors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:569-582 [Journal]
  30. Yuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji
    Termination and derivational complexity of confluent one-rule string-rewriting systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:583-632 [Journal]
  31. Yasuhiko Takenaga, Kouji Nakajima, Shuzo Yajima
    Tree-shellability of Boolean functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:633-647 [Journal]
  32. Jeannette Janssen, Lata Narayanan
    Approximation algorithms for channel assignment with constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:649-667 [Journal]
  33. Olivier Finkel
    Topological properties of omega context-free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:669-697 [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