J. Acm2018 2018

2 papers

Top Research Directions

The 2 research directions with J. Acm2018 2018 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.

#DirectionPapersShare
1Structural Width Convergence in Relational Query Complexity150.0%
2Worst-Case Optimal Join Algorithms150.0%

Download all directions as CSV

Institutions

Institutions credited by J. Acm2018 2018 papers: a paper credits every institution named in its affiliations, once. 3 institutions share 1 credited papers.

#InstitutionPapersShare
1Bar-Ilan University 1100.0%
2University at Buffalo, State University of New York 1100.0%
3University of Wisconsin–Madison 1100.0%

Download all institutions as CSV

About this data

Papers. J. Acm2018 2018 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.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 1 of 2 papers (50.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, “J. Acm2018 2018”, https://lacuna.tiptreesystems.com/venue/j-acm2018/2018.

Top Authors

AuthorPapers
Aleksandrs Slivkins1
Ashwinkumar Badanidiyuru1
Atri Rudra1
Christopher Re1
Ke Yi1
Robert Kleinberg1

Papers

Title
Bandits with Knapsacks.
Worst-case Optimal Join Algorithms.