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: 369, number: 1-3

  1. Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek
    Degrees of non-monotonicity for restarting automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:1-34 [Journal]
  2. Oleg Pikhurko, Jerzy Wojciechowski
    Edge-bandwidth of grids and tori. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:35-43 [Journal]
  3. Jing-Chao Chen
    Efficient sample sort and the average case analysis of PEsort. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:44-66 [Journal]
  4. Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide
    Iterated sequential transducers as language generating devices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:67-81 [Journal]
  5. Thomas Eiter, Georg Gottlob
    Reasoning under minimal upper bounds in propositional logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:82-115 [Journal]
  6. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    The price of anarchy for polynomial social cost. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:116-135 [Journal]
  7. Bang Ye Wu
    On the intercluster distance of a tree metric. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:136-141 [Journal]
  8. Véronique Terrier
    Low complexity classes of multidimensional cellular automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:142-156 [Journal]
  9. Eric Angel, Evripidis Bampis, Fanny Pascual
    Truthful algorithms for scheduling selfish tasks on parallel machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:157-168 [Journal]
  10. Carlo Blundo, Stelvio Cimato, Alfredo De Santis
    Visual cryptography schemes with optimal pixel expansion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:169-182 [Journal]
  11. Michael Domaratzki, Petr Sosík, Alfonso Rodríguez-Patón
    Algebraic properties of substitution on trajectories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:183-196 [Journal]
  12. Farshad Rostamabadi, Mohammad Ghodsi
    Label updating to avoid point-shaped obstacles in fixed model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:197-210 [Journal]
  13. Stephen D. Travers
    The complexity of membership problems for circuits over sets of integers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:211-229 [Journal]
  14. Hans Kellerer, Vitaly A. Strusevich
    A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:230-238 [Journal]
  15. Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, Süleyman Cenk Sahinalp
    The degree distribution of the generalized duplication model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:239-249 [Journal]
  16. Jianfeng Hou, Guizhen Liu, Jiansheng Cai
    List edge and list total colorings of planar graphs without 4-cycles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:250-255 [Journal]
  17. Weigen Yan, Yeong-Nan Yeh
    Enumeration of subtrees of trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:256-268 [Journal]
  18. Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli, Alfredo Navarra
    Sharing the cost of multicast transmissions in wireless networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:269-284 [Journal]
  19. Leah Epstein, Alexander Kesselman
    On the remote server problem or more about TCP acknowledgments. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:285-299 [Journal]
  20. Michael Hoffmann 0002, Richard M. Thomas
    A geometric characterization of automatic semigroups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:300-313 [Journal]
  21. Wit Forys, Tomasz Krawczyk
    An algorithmic approach to the problem of a semiretract base. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:314-322 [Journal]
  22. Amrinder Arora, Fanchun Jin, Hyeong-Ah Choi
    Scheduling resource allocation with timeslot penalty for changeover. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:323-337 [Journal]
  23. Ronald Koch, Ines Spenke
    Complexity and approximability of k-splittable flows. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:338-347 [Journal]
  24. Shlomi Dolev, Roberto Segala, Alexander A. Shvartsman
    Dynamic load balancing with group communication. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:348-360 [Journal]
  25. Sylvain Pion, Chee-Keng Yap
    Constructive root bound for k-ary rational input numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:361-376 [Journal]
  26. D. Azriel, Daniel Berend
    On a question of Leiss regarding the Hanoi Tower problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:377-383 [Journal]
  27. Asaf Levin, Danny Segev
    Partial multicuts in trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:384-395 [Journal]
  28. Vicente Acuña, Gilles Didier, Alejandro Maass
    Coding with variable block maps. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:396-405 [Journal]
  29. Mário J. J. Branco
    Two algebraic approaches to variants of the concatenation product. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:406-426 [Journal]
  30. Teofilo F. Gonzalez, David Serena
    Pairwise edge disjoint shortest paths in the n-cube. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:427-435 [Journal]
  31. Lakshmanan Kuppusamy
    A note on ambiguity of internal contextual grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:436-441 [Journal]
  32. Wei-Mei Chen
    Cost distribution of the Chang-Roberts leader election algorithm and related problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:442-447 [Journal]
  33. Wenqiang Dai, Yinfeng Xu, Binhai Zhu
    On the edge linfinitf radius of Saitou and Nei's method for phylogenetic reconstruction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:448-455 [Journal]
  34. Wenbo Zhao, Peng Zhang, Tao Jiang
    A network flow approach to the Minimum Common Integer Partition Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:456-462 [Journal]
  35. Anahí Gajardo, Eric Goles Ch.
    Crossing information in two-dimensional Sandpiles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:463-469 [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