We stand with Ukraine  

Pengming Wang

Affiliations:
  • University of Cambridge, Computer Laboratory, UK
  • Max Planck Institute for Informatics (MPII), Saarbrücken, Germany


According to our database1, Pengming Wang authored at least 10 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Optimizing Memory Mapping Using Deep Reinforcement Learning.
[BibTeX]
[DOI]
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
CoRR, 2023

2021
Learning a Large Neighborhood Search Algorithm for Mixed Integer Programs.
[BibTeX]
[DOI]
Nicolas Sonnerat
,
Pengming Wang
,
Ira Ktena
,
Sergey Bartunov
,
Vinod Nair
CoRR, 2021

2020
Solving Mixed Integer Programs Using Neural Networks.
[BibTeX]
[DOI]
Vinod Nair
,
Sergey Bartunov
,
Felix Gimeno
,
Ingrid von Glehn
,
Pawel Lichocki
,
Ivan Lobov
,
Brendan O'Donoghue
,
Nicolas Sonnerat
,
Christian Tjandraatmadja
,
Pengming Wang
,
Ravichandra Addanki
,
Tharindi Hapuarachchi
,
Thomas Keck
,
James Keeling
,
Pushmeet Kohli
,
Ira Ktena
,
Yujia Li
,
Oriol Vinyals
,
Yori Zwols
CoRR, 2020

2018
Descriptive complexity of constraint problems.
[BibTeX]
[DOI]
Pengming Wang
PhD thesis, 2018

2017
Definability of semidefinite programming and lasserre lower bounds for CSPs.
[BibTeX]
[DOI]
Anuj Dawar
,
Pengming Wang
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

The pebbling comonad in Finite Model Theory.
[BibTeX]
[DOI]
Samson Abramsky
,
Anuj Dawar
,
Pengming Wang
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Lasserre Lower Bounds and Definability of Semidefinite Programming.
[BibTeX]
[DOI]
Anuj Dawar
,
Pengming Wang
CoRR, 2016

2015
From approximate factorization to root isolation with application to cylindrical algebraic decomposition.
[BibTeX]
[DOI]
Kurt Mehlhorn
,
Michael Sagraloff
,
Pengming Wang
J. Symb. Comput., 2015

A Definability Dichotomy for Finite Valued CSPs.
[BibTeX]
[DOI]
Anuj Dawar
,
Pengming Wang
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2013
From approximate factorization to root isolation.
[BibTeX]
[DOI]
Kurt Mehlhorn
,
Michael Sagraloff
,
Pengming Wang
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013


  Loading...