P. Michael Kielstra

According to our database, P. Michael Kielstra authored at least 5 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

A gradient-based and determinant-free framework for fully Bayesian Gaussian process regression.

P. Michael Kielstra, Michael Lindsey

CoRR, 2024

A Linear-complexity Tensor Butterfly Algorithm for Compressing High-dimensional Oscillatory Integral Operators.

P. Michael Kielstra, Tianyi Shi, Hengrui Luo, Jianliang Qian, Yang Liu

CoRR, 2024

Gaussian process regression with log-linear scaling for common non-stationary kernels.

P. Michael Kielstra, Michael Lindsey

CoRR, 2024

2020

Revisiting a Cutting-Plane Method for Perfect Matchings.

Amber Q. Chen, Kevin K. H. Cheung, P. Michael Kielstra, Avery D. Winn

Open J. Math. Optim., 2020

2019

Revisiting a Cutting Plane Method for Perfect Matchings.

Amber Q. Chen, Kevin K. H. Cheung, P. Michael Kielstra, Andrew Winn

CoRR, 2019