default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÁdám Dániel Lelkes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Tal Schuster, Ádám D. Lelkes, Haitian Sun, Jai Gupta, Jonathan Berant, William W. Cohen, Donald Metzler:
SEMQA: Semi-Extractive Multi-Source Question Answering. NAACL-HLT 2024: 1363-1381- 2023
- [c11]Ronak Pradeep, Kai Hui, Jai Gupta, Ádám D. Lelkes, Honglei Zhuang, Jimmy Lin, Donald Metzler, Vinh Q. Tran:
How Does Generative Retrieval Scale to Millions of Passages? EMNLP 2023: 1305-1321 - [c10]Ádám D. Lelkes, Eric Loreaux, Tal Schuster, Ming-Jun Chen, Alvin Rajkomar:
SDOH-NLI: a Dataset for Inferring Social Determinants of Health from Clinical Notes. EMNLP (Findings) 2023: 4789-4798 - [i12]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 abs/2305.11841 (2023) - [i11]Ádám D. Lelkes, Eric Loreaux, Tal Schuster, Ming-Jun Chen, Alvin Rajkomar:
SDOH-NLI: a Dataset for Inferring Social Determinants of Health from Clinical Notes. CoRR abs/2310.18431 (2023) - [i10]Tal Schuster, Ádám D. Lelkes, Haitian Sun, Jai Gupta, Jonathan Berant, William W. Cohen, Donald Metzler:
SEMQA: Semi-Extractive Multi-Source Question Answering. CoRR abs/2311.04886 (2023) - 2022
- [c9]Tao Tu, Eric Loreaux, Emma Chesley, Ádám D. Lelkes, Paul Gamble, Mathias Bellaiche, Martin Seneviratne, Ming-Jun Chen:
Automated LOINC Standardization Using Pre-trained Large Language Models. ML4H@NeurIPS 2022: 343-355 - [c8]Daniel Lopez Martinez, Alex Yakubovich, Martin Seneviratne, Ádám D. Lelkes, Akshit Tyagi, Jonas Kemp, Ethan Steinberg, N. Lance Downing, Ron C. Li, Keith E. Morse, Nigam H. Shah, Ming-Jun Chen:
Instability in clinical risk stratification models using deep learning. ML4H@NeurIPS 2022: 552-565 - [i9]Jiaxin Huang, Tianqi Liu, Jialu Liu, Ádám D. Lelkes, Cong Yu, Jiawei Han:
All Birds with One Stone: Multi-task Text Classification for Efficient Inference with One Forward Pass. CoRR abs/2205.10744 (2022) - [i8]Daniel Lopez Martinez, Alex Yakubovich, Martin Seneviratne, Ádám D. Lelkes, Akshit Tyagi, Jonas Kemp, Ethan Steinberg, N. Lance Downing, Ron C. Li, Keith E. Morse, Nigam H. Shah, Ming-Jun Chen:
Instability in clinical risk stratification models using deep learning. CoRR abs/2211.10828 (2022) - 2021
- [c7]Richard Yuanzhe Pang, Ádám Dániel Lelkes, Vinh Q. Tran, Cong Yu:
AgreeSum: Agreement-Oriented Multi-Document Summarization. ACL/IJCNLP (Findings) 2021: 3377-3391 - [c6]Ádám D. Lelkes, Vinh Q. Tran, Cong Yu:
Quiz-Style Question Generation for News Stories. WWW 2021: 2501-2511 - [i7]Ádám D. Lelkes, Vinh Q. Tran, Cong Yu:
Quiz-Style Question Generation for News Stories. CoRR abs/2102.09094 (2021) - [i6]Richard Yuanzhe Pang, Ádám D. Lelkes, Vinh Q. Tran, Cong Yu:
AgreeSum: Agreement-Oriented Multi-Document Summarization. CoRR abs/2106.02278 (2021)
2010 – 2019
- 2018
- [c5]Jingbo Shang, Jiaming Shen, Tianhang Sun, Xingbang Liu, Anja Gruenheid, Flip Korn, Ádám D. Lelkes, Cong Yu, Jiawei Han:
Investigating Rumor News Using Agreement-Aware Search. CIKM 2018: 2117-2125 - [i5]Jingbo Shang, Tianhang Sun, Jiaming Shen, Xingbang Liu, Anja Gruenheid, Flip Korn, Ádám D. Lelkes, Cong Yu, Jiawei Han:
Investigating Rumor News Using Agreement-Aware Search. CoRR abs/1802.07398 (2018) - 2016
- [j1]Alexander Gutfraind, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin:
Network installation under convex costs. J. Complex Networks 4(2): 177-186 (2016) - [c4]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes:
A Confidence-Based Approach for Balancing Fairness and Accuracy. SDM 2016: 144-152 - [i4]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes:
A Confidence-Based Approach for Balancing Fairness and Accuracy. CoRR abs/1601.05764 (2016) - 2015
- [c3]Ádám Dániel Lelkes, Lev Reyzin:
Interactive Clustering of Linear Classes and Cryptographic Lower Bounds. ALT 2015: 165-176 - [c2]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán:
On the Computational Complexity of MapReduce. DISC 2015: 1-15 - 2014
- [c1]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: 174-185 - [i3]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 abs/1406.0017 (2014) - [i2]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán:
On the Computational Complexity of MapReduce. CoRR abs/1410.0245 (2014) - [i1]Alexander Gutfraind, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin:
Network installation and recovery: approximation lower bounds and faster exact formulations. CoRR abs/1411.3640 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
