default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVisu Makam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture. CCC 2024: 14:1-14:48- [i15]Peter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Complexity of Robust Orbit Problems for Torus Actions and the abc-conjecture. CoRR abs/2405.15368 (2024) - 2023
- [c7]Arturo Acuaviva, Visu Makam, Harold Nieuwboer, David Pérez-García, Friedrich Sittner, Michael Walter, Freek Witteveen:
The minimal canonical form of a tensor network. FOCS 2023: 328-362 - [c6]Joshua Brakensiek, Sivakanth Gopi, Visu Makam:
Generic Reed-Solomon Codes Achieve List-Decoding Capacity. STOC 2023: 1488-1501 - 2022
- [j2]Joshua Brakensiek
, Sivakanth Gopi, Visu Makam:
Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes. IEEE Trans. Inf. Theory 68(11): 7125-7140 (2022) - [c5]Harm Derksen, Visu Makam, Jeroen Zuiddam:
Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors. CCC 2022: 9:1-9:23 - [i14]Harm Derksen, Visu Makam, Jeroen Zuiddam:
Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors. CoRR abs/2205.15168 (2022) - [i13]Joshua Brakensiek, Sivakanth Gopi, Visu Makam:
Generic Reed-Solomon codes achieve list-decoding capacity. CoRR abs/2206.05256 (2022) - [i12]Arturo Acuaviva, Visu Makam, Harold Nieuwboer, David Pérez-García, Friedrich Sittner, Michael Walter, Freek Witteveen:
The minimal canonical form of a tensor network. CoRR abs/2209.14358 (2022) - 2021
- [j1]Harm Derksen, Visu Makam:
Maximum Likelihood Estimation for Matrix Normal Models via Quiver Representations. SIAM J. Appl. Algebra Geom. 5(2): 338-365 (2021) - [c4]Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Polynomial Time Algorithms in Invariant Theory for Torus Actions. CCC 2021: 32:1-32:30 - [i11]Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Polynomial time algorithms in invariant theory for torus actions. CoRR abs/2102.07727 (2021) - [i10]Joshua Brakensiek, Sivakanth Gopi, Visu Makam:
Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes. CoRR abs/2107.10822 (2021) - 2020
- [c3]Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson:
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings. CCC 2020: 12:1-12:17 - [c2]Visu Makam, Avi Wigderson:
Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varieties. FOCS 2020: 881-888
2010 – 2019
- 2019
- [c1]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer. FOCS 2019: 824-844 - [i9]Harm Derksen, Visu Makam:
An exponential lower bound for the degrees of invariants of cubic forms and tensor actions. CoRR abs/1902.10773 (2019) - [i8]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
More barriers for rank methods, via a "numeric to symbolic" transfer. CoRR abs/1904.04299 (2019) - [i7]Visu Makam, Avi Wigderson:
Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties). CoRR abs/1909.00857 (2019) - [i6]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. CoRR abs/1910.01251 (2019) - [i5]Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. Electron. Colloquium Comput. Complex. TR19 (2019) - [i4]Visu Makam, Avi Wigderson:
Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties). Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i3]Siddharth Krishna, Visu Makam:
On the tensor rank of 3s×3 permanent and determinant. CoRR abs/1801.00496 (2018) - [i2]Harm Derksen, Visu Makam:
Algorithms for orbit closure separation for invariants and semi-invariants of matrices. CoRR abs/1801.02043 (2018) - 2015
- [i1]Harm Derksen, Visu Makam:
Polynomial degree bounds for matrix semi-invariants. CoRR abs/1512.03393 (2015)
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-07-16 19:58 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:
