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

Journals in DBLP

Theor. Comput. Sci.
2002, volume: 289, number: 1

  1. Reiner Durchholz
    A generic causal model for place latency. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:1-49 [Journal]
  2. Peter J. Grabner, Helmut Prodinger
    Sorting algorithms for broadcast communications: mathematical analysis. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:51-67 [Journal]
  3. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
    A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:69-83 [Journal]
  4. Tamar Eilam, Shlomo Moran, Shmuel Zaks
    The complexity of the characterization of networks supporting shortest-path interval routing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:85-104 [Journal]
  5. André Barbé, Fritz von Haeseler
    Symmetries of decimation invariant sequences and digit sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:105-136 [Journal]
  6. Jean-Marc Champarnaud, Djelloul Ziadi
    Canonical derivatives, partial derivatives and finite automaton constructions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:137-163 [Journal]
  7. Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer
    Counter Machines and Verification Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:165-189 [Journal]
  8. Oscar H. Ibarra, Jianwen Su
    Augmenting the discrete timed automaton with other data structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:191-204 [Journal]
  9. Mike D. Atkinson, Max Murphy, Nikola Ruskuc
    Sorting with two ordered stacks in series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:205-223 [Journal]
  10. Marie-Pierre Béal, Olivier Carton
    Determinization of transducers over finite and infinite words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:225-251 [Journal]
  11. Andreas Klein, Martin Kutrib
    Deterministic Turing machines in the range between real-time and linear-time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:253-275 [Journal]
  12. Wei Chen, Koichi Wada, Kimio Kawaguchi
    Robust algorithms for constructing strongly convex hulls in parallel. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:277-295 [Journal]
  13. Francine Blanchet-Sadri, D. K. Luhmann
    Conjugacy on partial words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:297-312 [Journal]
  14. Kuo-Liang Chung, Wen-Ming Yan, Jung-Gen Wu
    Load-balanced parallel banded-system solvers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:313-334 [Journal]
  15. Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
    The 3-server problem in the plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:335-354 [Journal]
  16. Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
    Randomized path coloring on binary trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:355-399 [Journal]
  17. Hagit Brit, Shlomo Moran, Gadi Taubenfeld
    Public data structures: counters as a special case. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:401-423 [Journal]
  18. Henning Fernau
    Even linear simple matrix languages: formal language properties and grammatical inference. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:425-456 [Journal]
  19. Leslie G. Valiant
    Expressiveness of matchgates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:457-471 [Journal]
  20. Uriel Feige, Giora Rayzman
    On the drift of short schedules. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:473-484 [Journal]
  21. Petr Sosík
    Universal computation with Watson-Crick D0L systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:485-501 [Journal]
  22. Herbert Fleischner, Oliver Kullmann, Stefan Szeider
    Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:503-516 [Journal]
  23. Niklas Eriksen
    (1+epsilon)-Approximation of sorting by reversals and transpositions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:517-529 [Journal]
  24. Sinisa Crvenkovic, Igor Dolinka
    On axioms for commutative regular equations without addition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:531-551 [Journal]
  25. Liming Cai, David W. Juedes, Iyad A. Kanj
    The inapproximability of non-NP-hard optimization problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:553-571 [Journal]
  26. Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu
    On the presence of periodic configurations in Turing machines and in counter machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:573-590 [Journal]
  27. Robert Baumgartner, Georg Gottlob
    Propositional default logics made easier: computational complexity of model checking. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:591-627 [Journal]
  28. Dirk V. Arnold, Hans-Georg Beyer
    Performance analysis of evolution strategies with multi-recombination in high-dimensional RN-search spaces disturbed by noise. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:629-647 [Journal]
  29. Charles Knessl, Wojciech Szpankowski
    The height of a binary search tree: the limiting distribution perspective. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:649-703 [Journal]
  30. Juhani Karhumäki, Ion Petre
    Conway's problem for three-word sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:705-725 [Journal]
  31. Pedro V. Silva, Benjamin Steinberg
    Extensions and submonoids of automatic monoids. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:727-754 [Journal]
  32. Antonio Restivo, Pedro V. Silva
    On the lattice of prefix codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:755-782 [Journal]
  33. Honghui Wan, John C. Wootton
    Algorithms for computing lengths of chains in integral partition lattices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:783-800 [Journal]
  34. Gabriel Ciobanu, Mihai Rotaru
    Molecular interaction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:801-827 [Journal]
  35. Wolfgang Slany
    Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:829-843 [Journal]
  36. Peter Damaschke
    Two short notes on the on-line travelling salesman: handling times and lookahead. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:845-852 [Journal]
  37. Kosaburo Hashiguchi
    Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R1RR2 for given regular languages R1, R2. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:853-859 [Journal]
  38. John M. Hitchcock
    MAX3SAT is exponentially hard to approximate if NP has positive dimension. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:861-869 [Journal]
  39. M. Ageev
    Martin's game: a lower bound for the number of sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:871-876 [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