Log. Methods Comput. sci 2019
Top Research Directions
The 2 research directions with Log. Methods Comput. sci 2019 papers, ranked by paper count, next to 2018. Share is the fraction of the edition’s papers in the direction.
| # | Direction | 2019 | 2018 | Share 2019 | Share 2018 | 2018 rank |
|---|---|---|---|---|---|---|
| 1 | Managing Hidden Constant Overhead in Algorithm Design | 1 | 0 | 50.0% | 0.0% | — |
| 2 | Verifying Hyperproperties Across Multiple Execution Traces | 1 | 0 | 50.0% | 0.0% | — |
Download all directions as CSV
Institutions
Institutions credited by Log. Methods Comput. sci 2019 papers: a paper credits every institution named in its affiliations, once. 8 institutions share 2 credited papers.
| # | Institution | Papers | Share | 2018 | 2018 rank |
|---|---|---|---|---|---|
| 1 | 027pk6j83 | 1 | 50.0% | 0 | — |
| 2 | IMDEA Software Institute | 1 | 50.0% | 0 | — |
| 3 | Institute of Informatics of the Slovak Academy of Sciences | 1 | 50.0% | 0 | — |
| 4 | Microsoft (United States) | 1 | 50.0% | 0 | — |
| 5 | Saarland University | 1 | 50.0% | 0 | — |
| 6 | Universidad Politécnica de Madrid | 1 | 50.0% | 0 | — |
| 7 | University of Cambridge | 1 | 50.0% | 0 | — |
| 8 | University of Warsaw | 1 | 50.0% | 1 | 2 |
Download all institutions as CSV
About this data
Papers. Log. Methods Comput. sci 2019 lists 2 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.
Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2018 use shares, since the edition went from 3 to 2 papers.
Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 2 of 2 papers (100.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.
Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Log. Methods Comput. sci 2019”, https://lacuna.tiptreesystems.com/venue/log-methods-comput-sci-vj97/2019.
Top Authors
| Author | Papers |
|---|---|
| Eryk Kopczyński | 1 |
Papers
| Title |
|---|
| Logical properties of random graphs from small addable classes |
| On the Incomparability of Cache Algorithms in Terms of Timing Leakage |