default search action
Ezra Miller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Ezra Miller:
Stratifications of real vector spaces from constructible sheaves with conical microsupport. J. Appl. Comput. Topol. 7(3): 473-489 (2023)
2010 – 2019
- 2019
- [j12]Lukas Katthän, Mateusz Michalek
, Ezra Miller:
When is a Polynomial Ideal Binomial After an Ambient Automorphism? Found. Comput. Math. 19(6): 1363-1385 (2019) - 2017
- [i5]Lukas Katthän, Mateusz Michalek, Ezra Miller:
When is a polynomial ideal binomial after an ambient automorphism? CoRR abs/1706.03629 (2017) - 2015
- [j11]Ezra Miller, Megan Owen, J. Scott Provan:
Polyhedral computational geometry for averaging metric phylogenetic trees. Adv. Appl. Math. 68: 51-91 (2015) - 2014
- [j10]Sean Skwerer, Elizabeth Bullitt, Stephan Huckemann, Ezra Miller, Ipek Oguz, Megan Owen, Vic Patrangenaru, J. Scott Provan, J. S. Marron:
Tree-Oriented Analysis of Brain Artery Structure. J. Math. Imaging Vis. 50(1-2): 126-143 (2014) - [j9]Manoj Gopalkrishnan, Ezra Miller, Anne Shiu:
A Geometric Approach to the Global Attractor Conjecture. SIAM J. Appl. Dyn. Syst. 13(2): 758-797 (2014) - 2013
- [j8]Alan Guo, Ezra Miller:
Algorithms for lattice games. Int. J. Game Theory 42(4): 777-788 (2013) - 2012
- [j7]Alan Guo, Ezra Miller:
Corrigendum to "Lattice point methods for combinatorial games" [Adv. in Appl. Math. 46 (1-4) (2011) 363-378]. Adv. Appl. Math. 48(1): 269-271 (2012) - [i4]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) - [i3]Ezra Miller, Megan Owen, J. Scott Provan:
Averaging metric phylogenetic trees. CoRR abs/1211.7046 (2012) - 2011
- [j6]Alan Guo, Ezra Miller:
Lattice point methods for combinatorial games. Adv. Appl. Math. 46(1-4): 363-378 (2011) - 2010
- [i2]Ezra Miller:
Affine stratifications from finite misère quotients. CoRR abs/1009.2199 (2010) - [i1]Ezra Miller:
Theory and applications of lattice point methods for binomial ideals. CoRR abs/1009.2823 (2010)
2000 – 2009
- 2008
- [j5]Ezra Miller, Igor Pak:
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings. Discret. Comput. Geom. 39(1-3): 339-388 (2008) - 2005
- [j4]Ezra Miller, Victor Reiner:
Reciprocal Domains and Cohen-Macaulay d-Complexes in Rd. Electron. J. Comb. 11(2) (2005) - [j3]David Helm, Ezra Miller:
Algorithms for graded injective resolutions and local cohomology over semigroup rings. J. Symb. Comput. 39(3-4): 373-395 (2005) - 2003
- [j2]Ezra Miller:
Mitosis recursion for coefficients of Schubert polynomials. J. Comb. Theory A 103(2): 223-235 (2003) - 2000
- [j1]Ezra Miller, Bernd Sturmfels, Kohji Yanagawa
Generic and Cogeneric Monomial Ideals. J. Symb. Comput. 29(4-5): 691-708 (2000)
1990 – 1999
- 1999
- [c1]Ezra Miller, Bernd Sturmfels:
Monomial Ideals and Planar Graphs. AAECC 1999: 19-28
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 20:26 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: