Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS. - Bohdan Kivva; Aaron Potechin (CoRR, 2020)

Matrix Rigidity Depends on the Target Field. - László Babai; Bohdan Kivva (CCC, 2021)

Improved Upper Bounds for the Rigidity of Kronecker Products. - Bohdan Kivva (MFCS, 2021)

Learning latent causal graphs via mixture oracles. - Bohdan Kivva; Goutham Rajendran; Pradeep Ravikumar; Bryon Aragam (NeurIPS, 2021)

Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families. - Goutham Rajendran; Bohdan Kivva; Ming Gao; Bryon Aragam (NeurIPS, 2021)

On the spectral gap and the automorphism group of distance-regular graphs. - Bohdan Kivva (J. Comb. Theory B, 2021)

A characterization of Johnson and Hamming graphs and proof of Babai's conjecture. - Bohdan Kivva (J. Comb. Theory B, 2021)

Identifiability of deep generative models without auxiliary information. - Bohdan Kivva; Goutham Rajendran; Pradeep Ravikumar; Bryon Aragam (NeurIPS, 2022)

Identifiability of deep generative models under mixture priors without auxiliary information. - Bohdan Kivva; Goutham Rajendran; Pradeep Ravikumar; Bryon Aragam (CoRR, 2022)

On the automorphism groups of rank-4 primitive coherent configurations. - Bohdan Kivva (J. Comb. Theory B, 2024)