The SCEAS System
Navigation Menu

Journals in DBLP

Electr. Notes Theor. Comput. Sci.
2001, volume: 42, number:

  1. Asat Arslanov
    On Elementary Computability-Theoretic Properties of Algorithmic Randomness. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  2. Jamie Shield, Ian J. Hayes, David A. Carrington
    Using Theory Interpretation to Mechanise the Reals in a Theorem Prover. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  3. Peter Schachte
    Precise Goal-Independent Abstract Interpretation of Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  4. Shane Saunders, Tadao Takaoka
    Improved Shortest Path Algorithms for Nearly Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  5. Tetsuya Mizutani, Shigeru Igarashi, Masayuki Shio
    Representation of a Discretely Controlled Continuous System in Tense Arithmetic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  6. Annabelle McIver, Carroll Morgan
    Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  7. Andrew Martin, Colin J. Fidge
    Lifting in Z. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  8. Sebastian Link, Klaus-Dieter Schewe
    Computability and Decidability Issues in the Theory of Consistency Enforcement. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  9. Thorsten Gerdsmeier, Rachel Cardell-Oliver
    Analysis of Scheduling Behaviour using Generic Timed Automata. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  10. Jonathan M. Ford, Ian A. Mason
    Operational Techniques in PVS - A Preliminary Evaluation. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  11. Colin J. Fidge
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  12. Steve Dunne
    Abstract Commands: a Uniform Notation for Specification and Implementation. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  13. Jeremy E. Dawson, Rajeev Goré
    Embedding Display Calculi into Logical Frameworks: Comparing Twelf and Isabelle. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  14. Antonio Cerone
    Axiomatisation of an Interval Calculus for Theorem Proving. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  15. Kensuke Baba, Sachio Hirokawa, Ken-etsu Fujita
    Parallel Reduction in Type Free lambda/mu-Calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal]
  16. Salvatore La Torre, Margherita Napoli
    A Model of Finite Automata on Timed omega-Trees. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [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