The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2001, volume: 255, number: 1-2

  1. Colin Stirling
    Decidability of DPDA equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:1-31 [Journal]
  2. Thomas Erlebach, Klaus Jansen
    The complexity of path coloring and call scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:33-50 [Journal]
  3. Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
    Approximation algorithms for maximum two-dimensional pattern matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:51-62 [Journal]
  4. Ivo Düntsch, Hui Wang, Stephen McCloskey
    A relation - algebraic approach to the region connection calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:63-83 [Journal]
  5. S. S. Yu
    Post-plus languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:85-105 [Journal]
  6. Sanjay Jain
    Branch and bound on the network model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:107-123 [Journal]
  7. Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang
    Recursively enumerable reals and Chaitin Omega numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:125-149 [Journal]
  8. Jean Neraud, Carla Selmi
    On codes with a finite deciphering delay: constructing uncompletable words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:151-162 [Journal]
  9. Dietmar Wätjen
    Parallel communicating limited and uniformly limited 0L systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:163-191 [Journal]
  10. Vesa Halava, Mika Hirvensalo, Ronald de Wolf
    Marked PCP is decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:193-204 [Journal]
  11. Vikraman Arvind, Johannes Köbler
    On pseudorandomness and resource-bounded measure. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:205-221 [Journal]
  12. Olivier Finkel
    Locally finite languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:223-261 [Journal]
  13. Tiziana Calamoneri, Annalisa Massini
    Optimal three-dimensional layout of interconnection networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:263-279 [Journal]
  14. Tomás Feder
    Fanout limitations on constraint systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:281-293 [Journal]
  15. Bruno Apolloni, Dario Malchiodi
    Gaining degrees of freedom in subsymbolic learning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:295-321 [Journal]
  16. Luis-Miguel Lopez, Philippe Narbel
    Substitutions and interval exchange transformations of rotation class. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:323-344 [Journal]
  17. Jean-Guy Penaud, Elisa Pergola, Renzo Pinzani, Olivier Roques
    Chemins de Schröder et hiérarchies aléatoires. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:345-361 [Journal]
  18. Jacques Justin, Giuseppe Pirillo
    Fractional powers in Sturmian words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:363-376 [Journal]
  19. George Rahonis
    Alphabetic and synchronized tree transducers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:377-399 [Journal]
  20. Jukka A. Koskinen
    Non-injective knapsack public-key cryptosystems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:401-422 [Journal]
  21. Paul F. Fischer, Franco P. Preparata, John E. Savage
    Generalized scans and tridiagonal systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:423-436 [Journal]
  22. C. Picouleau
    Reconstruction of domino tiling from its two orthogonal projections. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:437-447 [Journal]
  23. Guohua Jin, Zhiyuan Li, Fujie Chen
    A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:449-481 [Journal]
  24. Sabrina Mantaci, Antonio Restivo
    Codes and equations on trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:483-509 [Journal]
  25. Erzsébet Csuhaj-Varjú, György Vaszil
    On context-free parallel communicating grammar systems: synchronization, communication, and normal forms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:511-538 [Journal]
  26. Xavier Droubay, Jacques Justin, Giuseppe Pirillo
    Episturmian words and some constructions of de Luca and Rauzy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:539-553 [Journal]
  27. Guoliang Xue
    A cost optimal parallel algorithm for computing force field in N-body simulations on a CREW PRAM. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:555-568 [Journal]
  28. Jorge Almeida, Pedro V. Silva
    SC-hyperdecidability of R. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:569-591 [Journal]
  29. Felipe Cucker
    On weak and weighted computations over the real closure of Q. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:593-600 [Journal]
  30. Roberto Incitti
    The growth function of context-free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:601-605 [Journal]
  31. Hervé Fournier
    Sparse NP-complete problems over the reals with addition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:607-610 [Journal]
  32. Olga Sokratova
    The Mal'cev Lemma and rewriting on semirings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:611-614 [Journal]
  33. Macha Nikolskaia, L. Nikolskaia
    Size of OBDD representation of 2-level redundancies functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:615-625 [Journal]
  34. Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
    Dynamically maintaining the widest k-dense corridor. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:627-639 [Journal]
  35. Ravi Kumar, D. Sivakumar
    On the unique shortest lattice vector problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:641-648 [Journal]
  36. Yu-Wei Chen, Kuo-Liang Chung
    Improved fault-tolerant sorting algorithm in hypercubes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:649-658 [Journal]
  37. Chiuyuan Chen, Kaiping Wu
    Disproving a conjecture on planar visibility graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:659-665 [Journal]
  38. Juha Honkala
    On Parikh slender context-free languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:667-677 [Journal]
  39. Elena Barcucci, Simone Rinaldi
    Some linear recurrences and their combinatorial interpretation by means of regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:679-686 [Journal]
  40. Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis
    Deciding stability and mortality of piecewise affine dynamical systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:687-696 [Journal]
  41. A. N. Trahtman
    Erratum to ``Optimal estimation on the order of local testability of finite automata'' - [TCS 231(2000) 59-74]. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp: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