default search action
Pengming Wang 0001
Person information
- affiliation: University of Cambridge, Computer Laboratory, UK
- affiliation: Max Planck Institute for Informatics (MPII), Saarbrücken, Germany
Other persons with the same name
- Pengming Wang — disambiguation page
- Pengming Wang 0002 — Harbin Engineering University, Harbin, China
- Pengming Wang 0003 — East China Jiaotong University, Nanchang, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Bernardino Romera-Paredes
, Mohammadamin Barekatain
Mathematical discoveries from program search with large language models. Nat. 625(7995): 468-475 (2024) - 2023
- [i7]Pengming Wang, Mikita Sazanovich, Berkin Ilbeyi, Phitchaya Mangpo Phothilimthana, Manish Purohit, Han Yang Tay, Ngân Vu, Miaosen Wang, Cosmin Paduraru, Edouard Leurent, Anton Zhernov, Julian Schrittwieser, Thomas Hubert, Robert Tung, Paula Kurylowicz, Kieran Milan, Oriol Vinyals, Daniel J. Mankowitz:
Optimizing Memory Mapping Using Deep Reinforcement Learning. CoRR abs/2305.07440 (2023) - 2021
- [i6]Nicolas Sonnerat, Pengming Wang, Ira Ktena, Sergey Bartunov, Vinod Nair:
Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs. CoRR abs/2107.10201 (2021) - 2020
- [i5]Vinod Nair, Sergey Bartunov, Felix Gimeno
Solving Mixed Integer Programs Using Neural Networks. CoRR abs/2012.13349 (2020)
2010 – 2019
- 2018
- [b1]Pengming Wang:
Descriptive complexity of constraint problems. University of Cambridge, UK, 2018 - 2017
- [c4]Samson Abramsky
The pebbling comonad in Finite Model Theory. LICS 2017: 1-12 - [c3]Anuj Dawar
Definability of semidefinite programming and lasserre lower bounds for CSPs. LICS 2017: 1-12 - [i4]Samson Abramsky, Anuj Dawar, Pengming Wang:
The pebbling comonad in finite model theory. CoRR abs/1704.05124 (2017) - 2016
- [i3]Anuj Dawar, Pengming Wang:
Lasserre Lower Bounds and Definability of Semidefinite Programming. CoRR abs/1602.05409 (2016) - 2015
- [j1]Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From approximate factorization to root isolation with application to cylindrical algebraic decomposition. J. Symb. Comput. 66: 34-69 (2015) - [c2]Anuj Dawar
A Definability Dichotomy for Finite Valued CSPs. CSL 2015: 60-77 - [i2]Anuj Dawar, Pengming Wang:
A Definability Dichotomy for Finite Valued CSPs. CoRR abs/1504.03543 (2015) - 2013
- [c1]Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From approximate factorization to root isolation. ISSAC 2013: 283-290 - [i1]Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition. CoRR abs/1301.4870 (2013)
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-30 00:18 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: