default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffrey M. Dudek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Jeffrey M. Dudek
, Weize Kong, Cheng Li, Mingyang Zhang, Michael Bendersky:
Learning Sparse Lexical Representations Over Specified Vocabularies for Retrieval. CIKM 2023: 3865-3869- [c9]Weize Kong, Jeffrey M. Dudek, Cheng Li, Mingyang Zhang, Michael Bendersky:
SparseEmbed: Learning Sparse Lexical Representations with Contextual Embeddings for Retrieval. SIGIR 2023: 2399-2403 - 2022
- [c8]Jeffrey M. Dudek, Aditya A. Shrotri, Moshe Y. Vardi:
DPSampler: Exact Weighted Sampling Using Dynamic Programming. IJCAI 2022: 1795-1803 - 2021
- [c7]Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi:
ProCount: Weighted Projected Model Counting with Graded Project-Join Trees. SAT 2021: 152-170 - 2020
- [c6]Jeffrey M. Dudek, Vu Phan, Moshe Y. Vardi:
ADDMC: Weighted Model Counting with Algebraic Decision Diagrams. AAAI 2020: 1468-1476 - [c5]Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi:
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees. CP 2020: 211-230 - [c4]Jeffrey M. Dudek, Dror Fried, Kuldeep S. Meel:
Taming Discrete Integration via the Boon of Dimensionality. NeurIPS 2020 - [i7]Jeffrey M. Dudek, Moshe Y. Vardi:
Parallel Weighted Model Counting with Tensor Networks. CoRR abs/2006.15512 (2020) - [i6]Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi:
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees. CoRR abs/2008.08748 (2020) - [i5]Jeffrey M. Dudek, Dror Fried, Kuldeep S. Meel:
Taming Discrete Integration via the Boon of Dimensionality. CoRR abs/2010.10724 (2020)
2010 – 2019
- 2019
- [c3]Jeffrey M. Dudek, Dror Fried:
Transformations of Boolean Functions. FSTTCS 2019: 39:1-39:14 - [i4]Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi:
ADDMC: Exact Weighted Model Counting with Algebraic Decision Diagrams. CoRR abs/1907.05000 (2019) - [i3]Jeffrey M. Dudek, Leonardo Dueñas-Osorio, Moshe Y. Vardi:
Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions. CoRR abs/1908.04381 (2019) - 2017
- [c2]Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi:
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas. IJCAI 2017: 600-606 - [i2]Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi:
Combining the k-CNF and XOR Phase-Transitions. CoRR abs/1702.08392 (2017) - [i1]Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi:
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas. CoRR abs/1710.06378 (2017) - 2016
- [c1]Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi:
Combining the k-CNF and XOR Phase-Transitions. IJCAI 2016: 727-734
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-04-24 22:50 CEST 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:
