World's Best Scientists 2026 revealed!
Logical Methods in Computer Science
H-index 12

Logical Methods in Computer Science

1860-5974

Published by: Technischen Universitat Braunschweig

https://lmcs.episciences.org/page/authors-submit

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Computer Science 477 72 77 12

Additional Metrics

Number of Best Scientists*: 77
Documents by Best Scientists*: 81
Top 100 Ranked Scientists*: 1
SCIMAGO H-index: 43
SCIMAGO SJR: 0.446
Impact Factor: 1

Overview

Top Research Topics at Logical Methods in Computer Science?

The journal tackles a plethora of topics, such as Discrete mathematics, Theoretical computer science, Algebra, Pure mathematics and Decidability. Some problems in Discrete mathematics that were presented in the journal overlapped with concepts under Class (set theory), Bounded function, Set (abstract data type) and Fragment (logic). The research on Theoretical computer science tackled can also make contributions to studies in the areas of Probabilistic logic and Semantics (computer science).

Logical Methods in Computer Science concentrated on Algebra research, specifically Algebraic number and Mathematical proof. The journal dives deep in exploring the relationship between the study of Mathematical proof and Calculus. The journal is focused mainly on Pure mathematics, particularly Functor.

It features studies on Decidability, including topics such as Undecidable problem.

  • Discrete mathematics (23.35%)
  • Theoretical computer science (17.10%)
  • Algebra (16.93%)

What are the most cited papers published in the journal?

  • Generic trace semantics via coinduction (185 citations)
  • Linear Encodings of Bounded LTL Model Checking (181 citations)
  • Algorithms for Omega-Regular Games with Imperfect Information (130 citations)

Research areas of the most cited articles at Logical Methods in Computer Science:

The journal publications explore disciplines such as Discrete mathematics, Algebra, Theoretical computer science, Decidability and Model checking. The journal papers was used to explore different topics like Discrete mathematics and Constraint satisfaction problem. While Theoretical computer science is the focus of the journal publications, it also provides insights into the studies of Probabilistic logic, Bounded function, Set (abstract data type) and Propositional calculus.

What topics the last edition of the journal is best known for?

  • Programming language
  • Algebra
  • Artificial intelligence

The previous edition focused in particular on these issues:

The journal investigates areas of study like Algebra, Theoretical computer science, Pure mathematics, Discrete mathematics and Decidability. The work on Algebra tackled in it brings together disciplines like Countable set, Semantics (computer science), Operator (computer programming) and Congruence relation. Theoretical computer science research presented in the journal encompasses a variety of subjects, including Characterization (mathematics), Rotation formalisms in three dimensions and Reduction (complexity).

Issues in Pure mathematics were discussed, taking into consideration concepts from other disciplines like Bisimulation and Homotopy type theory. While the journal focused on Discrete mathematics, it was also able to explore topics like Automaton and Regular language. The study of Bounded function and how it intertwines with concepts under Graph, Finite set, Formal equivalence checking, Join (topology) and Kleene algebra were explored in the presented Decidability research.

The most cited articles from the last journal are:

  • Foundations of Online Structure Theory II: The Operator Approach (3 citations)
  • A Sound Algorithm for Asynchronous Session Subtyping and its Implementation. (3 citations)
  • Axiomatizing Maximal Progress and Discrete Time (3 citations)

Papers citation over time

A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.

The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.

The top authors publishing in Logical Methods in Computer Science (based on the number of publications) are:

  • Krishnendu Chatterjee (12 papers) absent at the last edition,
  • Mikołaj Bojańczyk (11 papers) published 1 paper at the last edition the same number as at the previous edition,
  • Lars Birkedal (10 papers) published 2 papers at the last edition,
  • Thomas Place (10 papers) published 1 paper at the last edition,
  • Luc Segoufin (9 papers) absent at the last edition.

The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.

Only papers with recognized affiliations are considered

The top affiliations publishing in Logical Methods in Computer Science (based on the number of publications) are:

  • École Polytechnique (16 papers) absent at the last edition,
  • École Normale Supérieure (12 papers) absent at the last edition,
  • University of Warsaw (10 papers) absent at the last edition,
  • Max Planck Society (9 papers) absent at the last edition,
  • Radboud University Nijmegen (8 papers) published 1 paper at the last edition.

The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.

Publication chance based on affiliation

The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.

The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.

During the most recent 2021 edition, 83.33% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 44.44% were posted by at least one author from the top 10 institutions publishing in the journal. Another 11.11% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 0.00% of all publications and 44.44% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.

The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.

Returning Institution Index

The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.

The experience to innovation index

Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).

The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:

  • Novice - P < 5 or C < 25 (the number of publications less than 5 or the number of citations less than 25),
  • Competent - P < 10 or C < 100 (the number of publications less than 10 or the number of citations less than 100),
  • Experienced - P < 25 or C < 625 (the number of publications less than 25 or the number of citations less than 625),
  • Master - P < 50 or C < 2500 (the number of publications less than 50 or the number of citations less than 2500),
  • Star - P ≥ 50 and C ≥ 2500 (both the number of publications greater than 50 and the number of citations greater than 2500).

The chart below illustrates experience levels of first authors in cases of publications with multiple authors.

Top Publications

  • Multimodal Dependent Type Theory

    Daniel Gratzer;G. A. Kavvos;Andreas Nuyts;Lars Birkedal

    (2021)
    49 Citations
  • The Shapley Value of Tuples in Query Answering

    Ester Livshits;Leopoldo Bertossi;Benny Kimelfeld;Moshe Sebag

    (2021)
    38 Citations
  • Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility

    Anthony W. Lin;Rupak Majumdar

    (2021)
    32 Citations
  • Robustness Against Transactional Causal Consistency.

    Sidi Mohamed Beillahi;Ahmed Bouajjani;Constantin Enea

    (2021)
    26 Citations
  • Time-Fluid Field-Based Coordination through Programmable Distributed Schedulers

    Danilo Pianini;Roberto Casadei;Mirko Viroli;Stefano Mariani

    (2021)
    22 Citations
  • Descriptive Complexity for Counting Complexity Classes.

    Marcelo Arenas;Martin Muñoz;Cristian Riveros

    (2020)
    21 Citations
  • A Flexible Proof Format for SAT Solver-Elaborator Communication

    (2022)
    19 Citations
  • Internal Parametricity for Cubical Type Theory

    Evan Cavallo;Robert Harper

    (2021)
    18 Citations
  • Relating Apartness and Bisimulation

    Herman Geuvers;Bart Jacobs

    (2021)
    17 Citations
  • Foundations of Online Structure Theory II: The Operator Approach

    Rod Downey;Alexander Melnikov;Keng Meng Ng

    (2021)
    16 Citations

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens up diverse career opportunities, but it also intersects with other growing fields. For example, an what jobs can you get with an ai degree explores roles that blend computer science with AI, highlighting positions like machine learning engineer or data scientist, which are increasingly in demand.

Meanwhile, environmental concerns drive interest in degrees such as environmental science. This field offers various career options outlined in jobs for environmental science majors, showing how technology and science combine to address sustainability challenges.

Many students seek flexibility and affordability, making a computer science degree online a practical choice. Accelerated programs offer a faster path to graduation while still covering essential skills for software development and cybersecurity roles.

Similarly, pursuing the most cost-effective studies is important. The guide to cheapest online environmental science degree helps prospective students find quality education options without breaking the bank, and this approach can be mirrored in computer science selections as well.

Best Scientists Contributing to This Journal

Recently Published Articles