Dp@ai*ia 2022

3 papers

Top Research Directions

The 4 research directions with Dp@ai*ia 2022 papers, ranked by paper count, next to 2021. Share is the fraction of the edition’s papers in the direction.

#Direction20222021Share 2022Share 20212021 rank
1Cryptographic Hardness Reductions in Machine Learning1033.3%0.0%—
2Learning from Non-Transitive Human Preferences1033.3%0.0%—
3The Computational Complexity of Multiwinner Committee Selection1033.3%0.0%—
4The Computational Cost of Explanation Minimality1033.3%0.0%—

Download all directions as CSV

Institutions

Institutions credited by Dp@ai*ia 2022 papers: a paper credits every institution named in its affiliations, once. 6 institutions share 3 credited papers.

#InstitutionPapersShare20212021 rank
1TU Wien 266.7%0—
2University of Bologna 266.7%0—
3University of Oxford 266.7%0—
4Nazarbayev University 133.3%14
5University of Calabria 133.3%0—
6University of Exeter 133.3%0—

Download all institutions as CSV

About this data

Papers. Dp@ai*ia 2022 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. Comparisons with 2021 use shares, since the edition went from 2 to 3 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-18 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Dp@ai*ia 2022”, https://lacuna.tiptreesystems.com/venue/dp-ai-ia/2022.

Top Authors

AuthorPapers
Thomas Lukasiewicz2
Cristian Molinaro1
İsmail İlkan Ceylan1
Zhenisbek Assylbekov1

Papers

Title
Explanations for Negative Query Answers under Existential Rules
Hardness of Learning AES Key (Short Paper)
Pareto and Majority Voting in mCP-nets