default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Draisma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Jan Draisma
:
Erratum: A Counterexample to Comon's Conjecture. SIAM J. Appl. Algebra Geom. 8(1): 225 (2024)- [i3]Benjamin Biaggi, Chia-Yu Chang, Jan Draisma, Filip Rupniewski:
Border subrank via a generalised Hilbert-Mumford criterion. CoRR abs/2402.10674 (2024) - 2022
- [i2]Andreas Blatter, Jan Draisma, Filip Rupniewski:
Countably many asymptotic tensor ranks. CoRR abs/2212.12219 (2022) - 2021
- [j19]Jan Draisma, Alejandro Vargas:
Catalan-many tropical morphisms to trees; Part I: Constructions. J. Symb. Comput. 104: 580-629 (2021) - 2020
- [j18]Arthur Bik, Jan Draisma, Alessandro Oneto, Emanuele Ventura:
The monic rank. Math. Comput. 89(325): 2481-2505 (2020)
2010 – 2019
- 2018
- [j17]Jan Draisma, Florian M. Oosterhof:
Markov random fields and iterated toric fibre products. Adv. Appl. Math. 97: 64-79 (2018) - [j16]Filip Cools, Jan Draisma:
On metric graphs with prescribed gonality. J. Comb. Theory A 156: 1-21 (2018) - 2017
- [j15]Jan Draisma, Giorgio Ottaviani, Fabrice Rouillier:
Foreword. J. Symb. Comput. 79: 1-3 (2017) - [j14]Ada Boralevi, Jasper van Doornmalen, Jan Draisma, Michiel E. Hochstenbach, Bor Plestenjak:
Uniform Determinantal Representations. SIAM J. Appl. Algebra Geom. 1(1): 415-441 (2017) - 2016
- [j13]Jan Draisma, Emil Horobet, Giorgio Ottaviani, Bernd Sturmfels, Rekha R. Thomas:
The Euclidean Distance Degree of an Algebraic Variety. Found. Comput. Math. 16(1): 99-149 (2016) - [j12]Jasmijn A. Baaijens, Jan Draisma:
On the Existence of Identifiable Reparametrizations for Linear Compartment Models. SIAM J. Appl. Math. 76(4): 1577-1605 (2016) - 2015
- [j11]Andries E. Brouwer, Jan Draisma, Bart J. Frenk:
Lossy Gossip and Composition of Metrics. Discret. Comput. Geom. 53(4): 890-913 (2015) - [j10]Alicia Dickenstein, Jan Draisma, Bernard Mourrain:
Special issue on effective methods in algebraic computation. J. Symb. Comput. 68: 1-3 (2015) - 2014
- [c2]Jan Draisma, Emil Horobet, Giorgio Ottaviani, Bernd Sturmfels, Rekha R. Thomas:
The euclidean distance degree. SNC 2014: 9-16 - 2013
- [j9]Jan Draisma, Seth Sullivant, Kelli Talaska:
Positivity for Gaussian graphical models. Adv. Appl. Math. 50(5): 661-674 (2013) - [j8]Niek Bouman, Jan Draisma, Johan van Leeuwaarden:
Energy Minimization of Repelling Particles on a Toric Grid. SIAM J. Discret. Math. 27(3): 1295-1312 (2013) - 2012
- [j7]Jan Draisma, Tyrrell B. McAllister, Benjamin Nill:
Lattice-Width Directions and Minkowski's 3d-Theorem. SIAM J. Discret. Math. 26(3): 1104-1107 (2012) - 2011
- [j6]Andries E. Brouwer, Jan Draisma:
Equivariant Gröbner bases and the Gaussian two-factor model. Math. Comput. 80(274): 1123-1133 (2011) - [j5]Jan Draisma, Eyal Kushilevitz, Enav Weinreb:
Partition arguments in multiparty communication complexity. Theor. Comput. Sci. 412(24): 2611-2622 (2011)
2000 – 2009
- 2009
- [j4]Thomas Decker, Jan Draisma, Pawel Wocjan:
Efficient quantum algorithm for identifying hidden polynomials. Quantum Inf. Comput. 9(3&4): 215-230 (2009) - [c1]Jan Draisma, Eyal Kushilevitz, Enav Weinreb:
Partition Arguments in Multiparty Communication Complexity. ICALP (1) 2009: 390-402 - [i1]Jan Draisma, Eyal Kushilevitz, Enav Weinreb:
Partition Arguments in Multiparty Communication Complexity. CoRR abs/0909.5684 (2009) - 2007
- [j3]Karin Baur, Jan Draisma, Willem A. de Graaf:
Secant Dimensions of Minimal Orbits: Computations and Conjectures. Exp. Math. 16(2): 239-250 (2007) - 2005
- [j2]Jan Draisma:
Representation theory on the open Bruhat cell. J. Symb. Comput. 39(3-4): 279-303 (2005) - 2003
- [j1]Jan Draisma:
Constructing Lie algebras of first order differential operators. J. Symb. Comput. 36(5): 685-698 (2003)
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-08-05 21:16 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:
