About
Technology
Issues
FAQ
Search
Scientometrics
Impact Factor
Discipline Ranks
h
-index
g
-index
Articles
Citations
Article Citations
Citation Distribution
Overviews
Top Institutions
Top Schools
Top Authors
Prolific Authors
Top Articles
Citing Bodies
Top Citing Authors
Top Citing Institutions
Top Citing Schools
Top Citing Journals
Top Citing Disciplines
exaly
›
Journals
›
Logical Methods in Computer Science
›
top-articles
Logical Methods in Computer Science
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
#
Title
Journal
Year
Citations
1
Linear Encodings of Bounded LTL Model Checking
Logical Methods in Computer Science
2006
116
2
From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
Logical Methods in Computer Science
0
98
3
General recursion via coinductive types
Logical Methods in Computer Science
2005
93
4
Handling Algebraic Effects
Logical Methods in Computer Science
0
92
5
Generic Trace Semantics via Coinduction
Logical Methods in Computer Science
0
75
6
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
Logical Methods in Computer Science
0
72
7
On the decidability and complexity of Metric Temporal Logic over finite words
Logical Methods in Computer Science
0
66
8
Multi-Objective Model Checking of Markov Decision Processes
Logical Methods in Computer Science
0
66
9
Algorithms for Omega-Regular Games with Imperfect Information
Logical Methods in Computer Science
0
64
10
On Global Types and Multi-Party Session
Logical Methods in Computer Science
0
62
11
Pebble Games, Proof Complexity, and Time-Space Trade-offs
Logical Methods in Computer Science
0
58
12
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
Logical Methods in Computer Science
0
56
13
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
Logical Methods in Computer Science
2006
53
14
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Logical Methods in Computer Science
0
52
15
Psi-calculi: a framework for mobile processes with nominal data and logic
Logical Methods in Computer Science
0
52
16
Automata theory in nominal sets
Logical Methods in Computer Science
2014
51
17
Characterising Testing Preorders for Finite Probabilistic Processes
Logical Methods in Computer Science
2008
47
18
First steps in synthetic guarded domain theory: step-indexing in the topos of trees
Logical Methods in Computer Science
0
46
19
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
Logical Methods in Computer Science
2006
44
20
Neighbourhood Structures: Bisimilarity and Basic Model Theory
Logical Methods in Computer Science
0
44
21
Linear datalog and bounded path duality of relational structures
Logical Methods in Computer Science
2005
40
22
Relating coalgebraic notions of bisimulation
Logical Methods in Computer Science
0
39
23
Cores of Countably Categorical Structures
Logical Methods in Computer Science
0
38
24
Parameterised Multiparty Session Types
Logical Methods in Computer Science
0
37
25
Contextual equivalence for higher-order pi-calculus revisited
Logical Methods in Computer Science
2005
36
26
Generalizing determinization from automata to coalgebras
Logical Methods in Computer Science
0
35
27
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
Logical Methods in Computer Science
2005
33
28
Small Stone in Pool
Logical Methods in Computer Science
0
33
29
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
Logical Methods in Computer Science
0
33
30
Automatic Structures: Richness and Limitations
Logical Methods in Computer Science
0
33
31
First-Order and Temporal Logics for Nested Words
Logical Methods in Computer Science
0
33
32
Logical Step-Indexed Logical Relations
Logical Methods in Computer Science
0
33
33
Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages
Logical Methods in Computer Science
2006
32
34
Model-checking problems as a basis for parameterized intractability
Logical Methods in Computer Science
2005
31
35
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
Logical Methods in Computer Science
0
31
36
A Characterisation of First-Order Constraint Satisfaction Problems
Logical Methods in Computer Science
2007
31
37
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Logical Methods in Computer Science
0
31
38
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
Logical Methods in Computer Science
0
31
39
Stochastic Timed Automata
Logical Methods in Computer Science
0
30
40
Monads need not be endofunctors
Logical Methods in Computer Science
0
30
41
The Complexity of Enriched Mu-Calculi
Logical Methods in Computer Science
0
30
42
Non-idempotent intersection types and strong normalisation
Logical Methods in Computer Science
0
30
43
Polylogarithmic Cuts in Models of V^0
Logical Methods in Computer Science
0
29
44
An Effect System for Algebraic Effects and Handlers
Logical Methods in Computer Science
0
28
45
Formal Theories for Linear Algebra
Logical Methods in Computer Science
2012
28
46
Semantics and Algorithms for Parametric Monitoring
Logical Methods in Computer Science
2012
28
47
Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator
Logical Methods in Computer Science
2012
27
48
Implicit Resolution
Logical Methods in Computer Science
2013
27
49
Markov Decision Processes with Multiple Long-run Average Objectives
Logical Methods in Computer Science
0
26
50
New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic
Logical Methods in Computer Science
0
26
site/software ©
exaly
; All materials licenced under
CC by-SA
.