Explore & Discover Scientific Journals

Logical Methods in Computer Science is a fully refereed, open access, free, electronic journal. It welcomes papers on theoretical and practical areas in computer science involving logical methods, taken in a broad sense; some particular areas within its scope are listed below. Papers are refereed in the traditional way, with two or more referees per paper. Copyright is retained by the author. Topics of Logical Methods in Computer Science: Algebraic methods Automata and logic Automated deduction Categorical models and logic Coalgebraic methods Computability and Logic Computer-aided verification Concurrency theory Constraint programming Cyber-physical systems Database theory Defeasible reasoning Domain theory Emerging topics: Computational systems in biology Emerging topics: Quantum computation and logic Finite model theory Formalized mathematics Functional programming and lambda calculus Inductive logic and learning Interactive proof checking Logic and algorithms Logic and complexity Logic and games Logic and probability Logic for knowledge representation Logic programming Logics of programs Modal and temporal logics Program analysis and type checking Program development and specification Proof complexity Real time and hybrid systems Reasoning about actions and planning Satisfiability Security Semantics of programming languages Term rewriting and equational logic Type theory and constructive mathematics.

computational complexity presents outstanding research in computational complexity. Its subject is at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format. The central topics are: Models of computation, complexity bounds (with particular emphasis on lower bounds), complexity classes, trade-off results for sequential and parallel computation for "general" (Boolean) and "structured" computation (e.g. decision trees, arithmetic circuits) for deterministic, probabilistic, and nondeterministic computation worst case and average case Specific areas of concentration include: Structure of complexity classes (reductions, relativization questions, degrees, derandomization) Algebraic complexity (bilinear complexity, computations for polynomials, groups, algebras, and representations) Interactive proofs, pseudorandom generation, and randomness extraction Complexity issues in: crytography learning theory number theory logic (complexity of logical theories, cost of decision procedures) combinatorial optimization and approximate Solutions distributed computing property testing.

Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.

Logic has found application in virtually all aspects of Information Technology, from software engineering and hardware to programming and artificial intelligence. Indeed, logic, artificial intelligence and theoretical computing are influencing each other to the extent that a new interdisciplinary area of Logic and Computation is emerging. The Journal of Logic and Computation aims to promote the growth of logic and computing, including, among others, the following areas of interest: Logical Systems, such as classical and non-classical logic, constructive logic, categorical logic, modal logic, type theory, feasible maths.... Logical issues in logic programming, knowledge-based systems and automated reasoning; logical issues in knowledge representation, such as non-monotonic reasoning and systems of knowledge and belief; logics and semantics of programming; specification and verification of programs and systems; applications of logic in hardware and VLSI, natural language, concurrent computation, planning, and databases. The bulk of the content is technical scientific papers, although letters, reviews, and discussions, as well as relevant conference reviews, are included.

TOCS is devoted to publishing original research from all areas of theoretical computer science, ranging from foundational areas such as computational complexity, to fundamental areas such as algorithms and data structures, to focused areas such as parallel and distributed algorithms and architectures.

The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include: - Algebraic theory of computing and formal systems - Algorithm and system implementation issues - Approximation, probabilistic, and randomized algorithms - Automata and formal languages - Automated deduction - Combinatorics and graph theory - Complexity theory - Computational biology and bioinformatics - Cryptography - Database theory - Data structures - Design and analysis of algorithms - DNA computing - Foundations of computer security - Foundations of high-performance computing

The International Journal of Unconventional Computing offers the opportunity for rapid publication of theoretical and experimental results in non-classical computing. Specific topics include but are not limited to: physics of computation (e.g. conservative logic, thermodynamics of computation, reversible computing, quantum computing, collision-based computing with solitons, optical logic) chemical computing (e.g. implementation of logical functions in chemical systems, image processing and pattern recognition in reaction-diffusion chemical systems and networks of chemical reactors) bio-molecular computing (e.g. conformation based, information processing in molecular arrays, molecular memory) cellular automata as models of massively parallel computing complexity (e.g. computational complexity of non-standard computer architectures; theory of amorphous computing; artificial chemistry) logics of unconventional computing (e.g. logical systems derived from space-time behavior of natural systems; non-classical logics; logical reasoning in physical, chemical and biological systems) smart actuators (e.g. molecular machines incorporating information processing, intelligent arrays of actuators) novel hardware systems (e.g. cellular automata VLSIs, functional neural chips) mechanical computing (e.g. micromechanical encryption, computing in nanomachines, physical limits to mechanical computation).

Cryptologia is the only scholarly journal in the world dealing with the history, the technology, and the effect of the most important form of intelligence in the world today - communications intelligence. It fosters the study of all aspects of cryptology -- technical as well as historical and cultural. The journal"s articles have broken many new paths in intelligence history. They have told for the first time how a special agency prepared information from codebreaking for President Roosevelt, have described the ciphers of Lewis Carroll, revealed details of Hermann Goering"s wiretapping agency, published memoirs - written for it -- of some World War II American codebreakers, disclosed how American codebreaking affected the structure of the United Nations.

The journal is devoted to the publication of high quality papers on theoretical developments in computer systems science, and their applications in computer systems engineering. Original research papers, state-of-the-art reviews and technical notes are invited for publication. All papers will be refereed by acknowledged experts in the field, and may be (i) accepted without change, (ii) require amendment and subsequent re-refereeing, or (iii) be rejected on the grounds of either relevance or content. The submission of a paper implies that, if accepted for publication, it will not be published elsewhere in the same form, in any language, without the prior consent of the Publisher.

The International Journal of Computational Geometry & Applications (IJCGA) is a quarterly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms. Emphasis is placed on the computational aspects of geometric problems that arise in various fields of science and engineering including computer-aided geometry design (CAGD), computer graphics, constructive solid geometry (CSG), operations research, pattern recognition, robotics, solid modelling, VLSI routing/layout, and others. Research contributions ranging from theoretical results in algorithm design — sequential or parallel, probabilistic or randomized algorithms — to applications in the above-mentioned areas are welcome. Research findings or experiences in the implementations of geometric algorithms, such as numerical stability, and papers with a geometric flavour related to algorithms or the application areas of computational geometry are also welcome.

Journal of Algorithms is a leading international peer-reviewed journal publishing original research, clinical updates, and reviews indexed in Clarivate Web of Science (SCIE) with Q1 quartile ranking.

The main purpose of "J.Computational Analysis and Applications" is to publish high quality research articles from all subareas of Computational Mathematical Analysis and its many potential applications and connections to other areas of Mathematical Sciences. Any paper whose approach and proofs are computational,using methods from Mathematical Analysis in the broadest sense is suitable and welcome for consideration in our journal, except from Applied Numerical Analysis articles. Also plain word articles without formulas and proofs are excluded. The list of possibly connected mathematical areas with this publication includes, but is not restricted to: Applied Analysis, Applied Functional Analysis, Approximation Theory, Asymptotic Analysis, Difference Equations, Differential Equations, Partial Differential Equations, Fourier Analysis, Fractals, Fuzzy Sets, Harmonic Analysis, Inequalities, Integral Equations, Measure Theory, Moment Theory, Neural Networks, Numerical Functional Analysis, Potential Theory, Probability Theory, Real and Complex Analysis, Signal Analysis, Special Functions, Splines, Stochastic Analysis, Stochastic Processes, Summability, Tomography, Wavelets, any combination of the above, e.t.c. "J.Computational Analysis and Applications" is a peer-reviewed Journal.

Journal of Logic and Algebraic Programming is a leading international peer-reviewed journal publishing original research, clinical updates, and reviews indexed in Clarivate Web of Science (SCIE) with Q1 quartile ranking.