default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnne Shiu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Allison McClure, Anne Shiu:
On the connectedness of multistationarity regions of small reaction networks. J. Symb. Comput. 125: 102323 (2024)- 2023
- [j20]Cashous Bortner
, Elizabeth Gross, Nicolette Meshkat, Anne Shiu, Seth Sullivant:
Identifiability of linear compartmental tree models and a general formula for input-output equations. Adv. Appl. Math. 146: 102490 (2023) - [j19]Alexander Ruys de Perez, Laura Felicia Matusevich, Anne Shiu:
Wheels: A new criterion for non-convexity of neural codes. Adv. Appl. Math. 150: 102567 (2023) - [j18]Badal Joshi, Nidhi Kaihnsa, Tung D. Nguyen, Anne Shiu:
Prevalence of Multistationarity and Absolute Concentration Robustness in Reaction Networks. SIAM J. Appl. Math. 83(6): 2260-2283 (2023) - [j17]Patrick Chan, Katherine Johnston, Joseph Lent, Alexander Ruys de Perez, Anne Shiu:
Nondegenerate Neural Codes and Obstructions to Closed-Convexity. SIAM J. Discret. Math. 37(1): 114-145 (2023) - 2022
- [j16]Elizabeth Gross, Nicolette Meshkat, Anne Shiu:
Identifiability of linear compartmental models: The singular locus. Adv. Appl. Math. 133: 102268 (2022) - 2020
- [j15]Alexander Ruys de Perez, Laura Felicia Matusevich, Anne Shiu:
Neural codes and the factor complex. Adv. Appl. Math. 114 (2020)
2010 – 2019
- 2019
- [j14]Aaron Chen, Florian Frick, Anne Shiu:
Neural Codes, Decidability, and a New Local Obstruction to Convexity. SIAM J. Appl. Algebra Geom. 3(1): 44-66 (2019) - [j13]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
- [j12]Rebecca Garcia, Luis David García-Puente, Ryan Kruse, Jessica Liu, Dane Miyata, Ethan Petersen, Kaitlyn Phillipson, Anne Shiu:
Gröbner bases of neural ideals. Int. J. Algebra Comput. 28(4): 553-571 (2018) - [i4]Aaron Chen, Florian Frick, Anne Shiu:
Neural codes, decidability, and a new local obstruction to convexity. CoRR abs/1803.11516 (2018) - [i3]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
- [j11]Caitlin Lienkaemper, Anne Shiu, Zev Woodstock:
Obstructions to convexity in neural codes. Adv. Appl. Math. 85: 31-59 (2017) - [j10]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) - [j9]Badal Joshi, Anne Shiu:
Which Small Reaction Networks Are Multistationary? SIAM J. Appl. Dyn. Syst. 16(2): 802-833 (2017) - 2016
- [j8]Bryan Félix, Anne Shiu, Zev Woodstock:
Analyzing multistationarity in chemical reaction networks using the determinant optimization method. Appl. Math. Comput. 287-288: 60-73 (2016) - [j7]Stefan Müller, Elisenda Feliu, Georg Regensburger, Carsten Conradi, Anne Shiu, Alicia Dickenstein:
Sign Conditions for Injectivity of Generalized Polynomial Maps with Applications to Chemical Reaction Networks and Real Algebraic Geometry. Found. Comput. Math. 16(1): 69-97 (2016) - 2014
- [j6]Manoj Gopalkrishnan, Ezra Miller, Anne Shiu:
A Geometric Approach to the Global Attractor Conjecture. SIAM J. Appl. Dyn. Syst. 13(2): 758-797 (2014) - 2012
- [j5]Badal Joshi, Anne Shiu:
Simplifying the Jacobian Criterion for Precluding Multistationarity in Chemical Reaction Networks. SIAM J. Appl. Math. 72(3): 857-876 (2012) - [i2]Manoj Gopalkrishnan, Ezra Miller, Anne Shiu:
A projection argument for differential inclusions, with applications to persistence of mass-action kinetics. CoRR abs/1208.0874 (2012) - [i1]François Boulier, Anne Shiu, Thomas Sturm, Andreas Weber:
Symbolic Methods for Chemical Reaction Networks (Dagstuhl Seminar 12462). Dagstuhl Reports 2(11): 66-86 (2012) - 2010
- [b1]Anne Shiu:
Algebraic methods for biochemical reaction network theory. University of California, Berkeley, USA, 2010 - [j4]David F. Anderson, Anne Shiu:
The Dynamics of Weakly Reversible Population Processes near Facets. SIAM J. Appl. Math. 70(6): 1840-1858 (2010)
2000 – 2009
- 2009
- [j3]Gheorghe Craciun, Alicia Dickenstein, Anne Shiu, Bernd Sturmfels:
Toric dynamical systems. J. Symb. Comput. 44(11): 1551-1565 (2009) - [j2]Jason Morton, Lior Pachter, Anne Shiu, Bernd Sturmfels, Oliver Wienand:
Convex Rank Tests and Semigraphoids. SIAM J. Discret. Math. 23(3): 1117-1134 (2009) - 2008
- [j1]Raymond Hemmecke, Jason Morton, Anne Shiu, Bernd Sturmfels, Oliver Wienand:
Three Counter-Examples on Semi-Graphoids. Comb. Probab. Comput. 17(2): 239-257 (2008) - [c2]Anne Shiu:
The Smallest Multistationary Mass-Preserving Chemical Reaction Network. AB 2008: 172-184 - 2006
- [c1]Jason Morton, Lior Pachter, Anne Shiu, Bernd Sturmfels, Oliver Wienand:
Geometry of rank tests. Probabilistic Graphical Models 2006: 207-214
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-10-07 21:22 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:
