default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBohdan Kivva
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j3]Bohdan Kivva
:
On the automorphism groups of rank-4 primitive coherent configurations. J. Comb. Theory B 164: 245-298 (2024)- 2021
- [j2]Bohdan Kivva:
On the spectral gap and the automorphism group of distance-regular graphs. J. Comb. Theory B 149: 161-197 (2021) - [j1]Bohdan Kivva:
A characterization of Johnson and Hamming graphs and proof of Babai's conjecture. J. Comb. Theory B 151: 339-374 (2021)
Conference and Workshop Papers
- 2022
- [c5]Bohdan Kivva, Goutham Rajendran, Pradeep Ravikumar, Bryon Aragam:
Identifiability of deep generative models without auxiliary information. NeurIPS 2022 - 2021
- [c4]László Babai, Bohdan Kivva:
Matrix Rigidity Depends on the Target Field. CCC 2021: 41:1-41:26 - [c3]Bohdan Kivva:
Improved Upper Bounds for the Rigidity of Kronecker Products. MFCS 2021: 68:1-68:18 - [c2]Bohdan Kivva, Goutham Rajendran, Pradeep Ravikumar, Bryon Aragam:
Learning latent causal graphs via mixture oracles. NeurIPS 2021: 18087-18101 - [c1]Goutham Rajendran, Bohdan Kivva, Ming Gao, Bryon Aragam:
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families. NeurIPS 2021: 18660-18672
Informal and Other Publications
- 2022
- [i5]Bohdan Kivva, Goutham Rajendran, Pradeep Ravikumar, Bryon Aragam:
Identifiability of deep generative models under mixture priors without auxiliary information. CoRR abs/2206.10044 (2022) - 2021
- [i4]Bohdan Kivva:
Improved upper bounds for the rigidity of Kronecker products. CoRR abs/2103.05631 (2021) - [i3]Bohdan Kivva, Goutham Rajendran, Pradeep Ravikumar, Bryon Aragam:
Learning latent causal graphs via mixture oracles. CoRR abs/2106.15563 (2021) - [i2]Goutham Rajendran, Bohdan Kivva, Ming Gao, Bryon Aragam:
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families. CoRR abs/2110.04719 (2021) - 2020
- [i1]Bohdan Kivva, Aaron Potechin:
Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS. CoRR abs/2011.09416 (2020)
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-06-10 21:23 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:
