The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Carsten Schürmann, Joëlle Despeyroux, Frank Pfenning
    Primitive recursion for higher-order abstract syntax. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:1-57 [Journal]
  2. Tatsuru Matsushita, Colin Runciman
    The accepting power of unary string logic programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:59-79 [Journal]
  3. Gabriel Aguilera, Inman P. de Guzmán, Manuel Ojeda-Aciego, Agustín Valverde
    Reductions for non-clausal theorem proving. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:81-112 [Journal]
  4. Klaus U. Schulz, Stephan Kepser
    Combination of constraint systems II: Rational amalgamation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:113-157 [Journal]
  5. René David
    On the asymptotic behaviour of primitive recursive algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:159-193 [Journal]
  6. Karl Lermer, Paul A. Strooper
    Refinement and state machine abstraction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:195-235 [Journal]
  7. Michele Boreale, Rocco De Nicola, Rosario Pugliese
    Divergence in testing and readiness semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:237-248 [Journal]
  8. Masatomo Hashimoto, Atsushi Ohori
    A typed context calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:249-272 [Journal]
  9. David Aspinall, Adriana B. Compagnoni
    Subtyping dependent types. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:273-309 [Journal]
  10. Manolis Koubarakis
    Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:311-339 [Journal]
  11. Ralph Loader
    Finitary PCF is not decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:341-364 [Journal]
  12. Duminda Wijesekera, M. Ganesh, Jaideep Srivastava, Anil Nerode
    Normal forms and syntactic completeness proofs for functional independencies. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:365-405 [Journal]
  13. César Muñoz
    Proof-term synthesis on dependent-type systems via explicit substitutions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:407-440 [Journal]
  14. Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You
    Loop checks for logic programs with functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:441-461 [Journal]
  15. Michel Bauderon, Hélène Jacquet
    Node rewriting in graphs and hypergraphs: a categorical framework. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:463-487 [Journal]
  16. Susumu Yamasaki, Yoshinori Kurose
    A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:489-512 [Journal]
  17. Annabelle McIver, Carroll Morgan
    Partial correctness for probabilistic demonic programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:513-541 [Journal]
  18. Riccardo Pucella, Prakash Panangaden
    On the expressive power of first-order boolean functions in PCF. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:543-567 [Journal]
  19. Cédric Fournet, Cosimo Laneve
    Bisimulations in the join-calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:569-603 [Journal]
  20. Jirí Srba
    Basic process algebra with deadlocking states. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:605-630 [Journal]
  21. Jan Friso Groote, Jos van Wamel
    The parallel composition of uniform processes with data. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:631-652 [Journal]
  22. Uri Abraham, Shlomi Dolev, Ted Herman, Irit Koll
    Self-stabilizing l-exclusion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:653-692 [Journal]
  23. James Riely, Matthew Hennessy
    Distributed processes and location failures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:693-735 [Journal]
  24. Zurab Khasidashvili
    On the longest perpetual reductions in orthogonal expression reduction systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:737-772 [Journal]
  25. Gilles Barthe, John Hatcliff, Morten Heine Sørensen
    An induction principle for pure type systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:773-818 [Journal]
  26. Karl Schlechta, Jürgen Dix
    Explaining updates by minimal sums. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:819-838 [Journal]
  27. Mingsheng Ying, Martin Wirsing
    Recursive equations in higher-order process calculi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:839-852 [Journal]
  28. Robert Goldblatt
    What is the coalgebraic analogue of Birkhoff's variety theorem? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:853-886 [Journal]
  29. Vincenzo Auletta, Ioannis Caragiannis, Luisa Gargano, Christos Kaklamanis, Pino Persiano
    Sparse and limited wavelength conversion in all-optical tree networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:887-934 [Journal]
  30. Mila E. Majster-Cederbaum
    Underspecification for a simple process algebra of recursive processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:935-950 [Journal]
  31. Raymond Turner
    Type inference for set theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:951-974 [Journal]
  32. Thierry Joly
    Constant time parallel computations in lambda-calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:975-985 [Journal]
  33. Thomas Krantz, Virgile Mogbil
    Encoding Hamiltonian circuits into multiplicative linear logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:987-996 [Journal]
  34. Dieter Spreen
    Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:997-998 [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