Ádám Dániel Lelkes

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 5

Top Topics

Complex Networks

Computational Load

Confidence Levels

Document Summarization

Top Venues

J. Complex Networks

Publications

Ronak Pradeep, Kai Hui, Jai Gupta, Ádám Dániel Lelkes, Honglei Zhuang, Jimmy Lin, Donald Metzler, Vinh Q. Tran
How Does Generative Retrieval Scale to Millions of Passages? CoRR (2023)
Richard Yuanzhe Pang, Ádám Dániel Lelkes, Vinh Q. Tran, Cong Yu
AgreeSum: Agreement-Oriented Multi-Document Summarization. ACL/IJCNLP (Findings) (2021)
Alexander Gutfraind, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin
Network installation under convex costs. J. Complex Networks 4 (2) (2016)
Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes
A Confidence-Based Approach for Balancing Fairness and Accuracy. CoRR (2016)
Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes
A Confidence-Based Approach for Balancing Fairness and Accuracy. SDM (2016)
Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán
On the Computational Complexity of MapReduce. DISC (2015)
Ádám Dániel Lelkes, Lev Reyzin
Interactive Clustering of Linear Classes and Cryptographic Lower Bounds. ALT (2015)
Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán
On the Computational Complexity of MapReduce. CoRR (2014)
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal. DCFS (2014)
Alexander Gutfraind, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin
Network installation and recovery: approximation lower bounds and faster exact formulations. CoRR (2014)
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György, Balázs Szörényi, György Turán
Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal. CoRR (2014)