Logical Methods in Computer Science
Skrót:
LOG METH COMPUT SCI
ISSN:
1860-5974
| Rok | Punkty ministerialne | Impact Factor | Eigenfactor | Article influence |
|---|---|---|---|---|
| 2023 | 70 | 0.0016 | 0.39 | |
| 2022 | 70 | 0.00196 | 0.437 | |
| 2021 | 70 | 0.00193 | 0.468 | |
| 2020 | 70 | 0.00202 | 0.457 | |
| 2019 | 70 | 0.00212 | 0.417 | |
| 2018 | 25 | 0.00253 | 0.484 | |
| 2017 | 25 | 0.00203 | 0.371 | |
| 2016 | 25 | 0.00337 | 0.562 | |
| 2015 | 15 | 0.00317 | 0.548 | |
| 2014 | 20 | 0.00272 | 0.502 | |
| 2013 | 20 | 0.00246 | 0.483 | |
| 2012 | 20 | 0.00198 | 0.472 | |
| 2011 | 0 | 0.0016 | 0 | |
| 2010 | 0 | 0.00209 | 0 | |
| 2009 | 0 | 0.00164 | 0 |
Publikacje:
3.
Maciej Bendkowski, Pierre Lescanne
On the enumeration of closures and environments with an application to random generation, Logical Methods in Computer Science vol. 15, Issue 4 (2019), 3:1–3:21
2.
Asymptotically almost all λ-terms are strongly normalizing, Logical Methods in Computer Science vol. 9 (1:02) (2013), 1-30
1.
Libor Barto, Marcin Kozik
Absorbing subalgebra, cyclic terms and the Constraint Satisfaction Problem, Logical Methods in Computer Science vol. 20 (2012), paper no. 7