Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDElizabeth Gross
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j8]Elizabeth Gross, Nicolette Meshkat, Anne Shiu:
Identifiability of linear compartmental models: The singular locus. Adv. Appl. Math. 133: 102268 (2022)- 2021
- [j7]Elizabeth Gross, Cvetelina Hill:
The steady-state degree and mixed volume of a chemical reaction network. Adv. Appl. Math. 131: 102254 (2021) - [j6]Elizabeth Gross, Nicole Yamzon
:
Binomial ideals of domino tilings. Discret. Math. 344(11): 112530 (2021) - [i5]Christian Bick, Elizabeth Gross, Heather A. Harrington, Michael T. Schaub:
What are higher-order networks? CoRR abs/2104.11329 (2021)
2010 – 2019
- 2019
- [j5]Elizabeth Gross, Heather A. Harrington, Nicolette Meshkat, Anne Shiu:
Linear Compartmental Models: Input-Output Equations and Operations That Preserve Identifiability. SIAM J. Appl. Math. 79(4): 1423-1447 (2019) - 2018
- [j4]Elizabeth Gross, Nida Kazi Obatake, Nora Youngs:
Neural ideals and stimulus space visualization. Adv. Appl. Math. 95: 65-95 (2018) - [j3]Elizabeth Gross, Colby Long:
Distinguishing Phylogenetic Networks. SIAM J. Appl. Algebra Geom. 2(1): 72-93 (2018) - [i4]Carina Curto, Elizabeth Gross, Jack Jeffries, Katherine Morrison, Zvi Rosen, Anne Shiu, Nora Youngs:
Algebraic signatures of convex and non-convex codes. CoRR abs/1807.02741 (2018) - 2017
- [j2]Carina Curto, Elizabeth Gross, Jack Jeffries, Katherine Morrison, Mohamed Omar, Zvi Rosen, Anne Shiu, Nora Youngs:
What Makes a Neural Code Convex? SIAM J. Appl. Algebra Geom. 1(1): 222-238 (2017) - 2016
- [i3]Elizabeth Gross, Nida Kazi Obatake, Nora Youngs:
Neural ideals and stimulus space visualization. CoRR abs/1607.00697 (2016) - 2014
- [c1]Elizabeth Gross, Jose Israel Rodriguez:
Maximum likelihood geometry in the presence of data zeros. ISSAC 2014: 232-239 - 2013
- [j1]Elizabeth Gross, Sonja Petrovic:
Combinatorial Degree Bound for Toric ideals of hypergraphs. Int. J. Algebra Comput. 23(6): 1503-1520 (2013) - [i2]Daniel J. Bates, Elizabeth Gross, Anton Leykin, Jose Israel Rodriguez:
Bertini for Macaulay2. CoRR abs/1310.3297 (2013) - 2011
- [i1]Elizabeth Gross, Sonja Petrovic, Jan Verschelde:
PHCpack in Macaulay2. CoRR abs/1105.4881 (2011)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-03-20 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
