0.4(top 100%)
impact factor
399(top 50%)
papers
2.6K(top 50%)
citations
22(top 20%)
h-index
0.4(top 100%)
extended IF
1.1K
all documents
7.2K
doc citations
32(top 50%)
g-index

Top Articles

#TitleJournalYearCitations
1Linear Encodings of Bounded LTL Model CheckingLogical Methods in Computer Science2006116
2From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity AutomataLogical Methods in Computer Science098
3General recursion via coinductive typesLogical Methods in Computer Science200593
4Handling Algebraic EffectsLogical Methods in Computer Science092
5Generic Trace Semantics via CoinductionLogical Methods in Computer Science075
6Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant SynthesisLogical Methods in Computer Science072
7On the decidability and complexity of Metric Temporal Logic over finite wordsLogical Methods in Computer Science066
8Multi-Objective Model Checking of Markov Decision ProcessesLogical Methods in Computer Science066
9Algorithms for Omega-Regular Games with Imperfect InformationLogical Methods in Computer Science064
10On Global Types and Multi-Party SessionLogical Methods in Computer Science062
11Pebble Games, Proof Complexity, and Time-Space Trade-offsLogical Methods in Computer Science058
12Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction ProblemLogical Methods in Computer Science056
13On the complexity of XPath containment in the presence of disjunction, DTDs, and variablesLogical Methods in Computer Science200653
14Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause LearningLogical Methods in Computer Science052
15Psi-calculi: a framework for mobile processes with nominal data and logicLogical Methods in Computer Science052
16Automata theory in nominal setsLogical Methods in Computer Science201451
17Characterising Testing Preorders for Finite Probabilistic ProcessesLogical Methods in Computer Science200847
18First steps in synthetic guarded domain theory: step-indexing in the topos of treesLogical Methods in Computer Science046
19Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMALogical Methods in Computer Science200644
20Neighbourhood Structures: Bisimilarity and Basic Model TheoryLogical Methods in Computer Science044
21Linear datalog and bounded path duality of relational structuresLogical Methods in Computer Science200540
22Relating coalgebraic notions of bisimulationLogical Methods in Computer Science039
23Cores of Countably Categorical StructuresLogical Methods in Computer Science038
24Parameterised Multiparty Session TypesLogical Methods in Computer Science037
25Contextual equivalence for higher-order pi-calculus revisitedLogical Methods in Computer Science200536
26Generalizing determinization from automata to coalgebrasLogical Methods in Computer Science035
27An Operational Foundation for Delimited Continuations in the CPS HierarchyLogical Methods in Computer Science200533
28Small Stone in PoolLogical Methods in Computer Science033
29Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmeticLogical Methods in Computer Science033
30Automatic Structures: Richness and LimitationsLogical Methods in Computer Science033
31First-Order and Temporal Logics for Nested WordsLogical Methods in Computer Science033
32Logical Step-Indexed Logical RelationsLogical Methods in Computer Science033
33Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like LanguagesLogical Methods in Computer Science200632
34Model-checking problems as a basis for parameterized intractabilityLogical Methods in Computer Science200531
35A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of AutomataLogical Methods in Computer Science031
36A Characterisation of First-Order Constraint Satisfaction ProblemsLogical Methods in Computer Science200731
37Model Checking of Continuous-Time Markov Chains Against Timed Automata SpecificationsLogical Methods in Computer Science031
38Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of ThreadsLogical Methods in Computer Science031
39Stochastic Timed AutomataLogical Methods in Computer Science030
40Monads need not be endofunctorsLogical Methods in Computer Science030
41The Complexity of Enriched Mu-CalculiLogical Methods in Computer Science030
42Non-idempotent intersection types and strong normalisationLogical Methods in Computer Science030
43Polylogarithmic Cuts in Models of V^0Logical Methods in Computer Science029
44An Effect System for Algebraic Effects and HandlersLogical Methods in Computer Science028
45Formal Theories for Linear AlgebraLogical Methods in Computer Science201228
46Semantics and Algorithms for Parametric MonitoringLogical Methods in Computer Science201228
47Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generatorLogical Methods in Computer Science201227
48Implicit ResolutionLogical Methods in Computer Science201327
49Markov Decision Processes with Multiple Long-run Average ObjectivesLogical Methods in Computer Science026
50New Directions in Categorical Logic, for Classical, Probabilistic and Quantum LogicLogical Methods in Computer Science026