Ádám Dániel Lelkes

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