Log. Methods Comput. sci 2018
Top Research Directions
The 1 research directions with Log. Methods Comput. sci 2018 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.
| # | Direction | Papers | Share |
|---|---|---|---|
| 1 | Finite Orbits of Formal Language Operations | 1 | 33.3% |
Download all directions as CSV
Institutions
Institutions credited by Log. Methods Comput. sci 2018 papers: a paper credits every institution named in its affiliations, once. 6 institutions share 3 credited papers.
| # | Institution | Papers | Share | 2017 | 2017 rank |
|---|---|---|---|---|---|
| 1 | Ben-Gurion University of the Negev | 1 | 33.3% | 0 | — |
| 2 | National Taiwan University | 1 | 33.3% | 0 | — |
| 3 | Reichman University | 1 | 33.3% | 0 | — |
| 4 | TU Wien | 1 | 33.3% | 0 | — |
| 5 | University of Warsaw | 1 | 33.3% | 1 | 6 |
| 6 | Yale University | 1 | 33.3% | 0 | — |
Download all institutions as CSV
About this data
Papers. Log. Methods Comput. sci 2018 lists 3 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.
Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 3 of 3 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 2018”, https://lacuna.tiptreesystems.com/venue/log-methods-comput-sci-vj97/2018.
Top Authors
| Author | Papers |
|---|---|
| Eryk Kopczyński | 1 |
Papers
| Title |
|---|
| A note on first-order spectra with binary relations |
| Families of DFAs as Acceptors of ω-Regular Languages |
| Local Redundancy in SAT: Generalizations of Blocked Clauses |