default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlicia Dickenstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[e2]Kevin Buzzard
, Alicia Dickenstein, Bettina Eick, Anton Leykin, Yue Ren:
Mathematical Software - ICMS 2024 - 8th International Conference, Durham, UK, July 22-25, 2024, Proceedings. Lecture Notes in Computer Science 14749, Springer 2024, ISBN 978-3-031-64528-0 [contents]- 2023
- [e1]Alicia Dickenstein, Elias P. Tsigaridas, Gabriela Jeronimo:
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, ISSAC 2023, Tromsø, Norway, July 24-27, 2023. ACM 2023 [contents] - 2021
- [c4]Alicia Dickenstein:
Families of Polynomials in the Study of Biochemical Reaction Networks. CASC 2021: 1-5 - 2020
- [c3]Alicia Dickenstein:
Positive solutions of sparse polynomial systems. ISSAC 2020: 5-7 - [i7]Frédéric Bihan, Alicia Dickenstein, Jens Forsgård:
Optimal Descartes' Rule of Signs for Circuits. CoRR abs/2010.09165 (2020)
2010 – 2019
- 2018
- [j18]Mercedes Pérez Millán, Alicia Dickenstein:
The Structure of MESSI Biological Systems. SIAM J. Appl. Dyn. Syst. 17(2): 1650-1682 (2018) - 2016
- [j17]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) - [j16]Nicolás Botbol, Alicia Dickenstein:
Implicitization of rational hypersurfaces via linear syzygies: A practical overview. J. Symb. Comput. 74: 493-512 (2016) - [i6]Frédéric Bihan, Alicia Dickenstein:
Descartes' Rule of Signs for Polynomial Systems supported on Circuits. CoRR abs/1601.05826 (2016) - 2015
- [j15]Alicia Dickenstein, Jan Draisma, Bernard Mourrain:
Special issue on effective methods in algebraic computation. J. Symb. Comput. 68: 1-3 (2015) - [i5]Nicolás Botbol, Alicia Dickenstein:
Implicitization of rational hypersurfaces via linear syzygies: a practical overview. CoRR abs/1502.00890 (2015) - 2013
- [j14]Alicia Dickenstein, Sandra Di Rocco, Evelyne Hubert, Josef Schicho:
Foreword from the Editors. J. Symb. Comput. 51: 1-2 (2013) - [c2]Alicia Dickenstein, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Combinatorics of 4-dimensional resultant polytopes. ISSAC 2013: 173-180 - [i4]Alicia Dickenstein, Ioannis Z. Emiris, Anna Karasoulou:
Plane mixed discriminants and toric jacobians. CoRR abs/1304.5809 (2013) - 2012
- [j13]Alicia Dickenstein, Luis Felipe Tabera:
Singular Tropical Hypersurfaces. Discret. Comput. Geom. 47(2): 430-453 (2012) - [j12]Alicia Dickenstein, Enrique A. Tobis:
Independent Sets from an Algebraic Perspective. Int. J. Algebra Comput. 22(2) (2012) - 2011
- [j11]Mathias Bourel, Alicia Dickenstein, Alvaro Rittatore:
Self-dual projective toric varieties. J. Lond. Math. Soc. 84(2): 514-540 (2011) - [i3]Eduardo Cattani, María Angélica Cueto, Alicia Dickenstein, Sandra Di Rocco, Bernd Sturmfels:
Mixed Discriminants. CoRR abs/1112.1012 (2011) - 2010
- [j10]Alicia Dickenstein, Enrique A. Tobis:
Additive edge labelings. Discret. Appl. Math. 158(5): 444-452 (2010) - [i2]Alicia Dickenstein, Enrique A. Tobis:
Independent Sets from an Algebraic Perspective. CoRR abs/1003.3508 (2010)
2000 – 2009
- 2009
- [j9]Nicolás Botbol, Alicia Dickenstein, Marc Dohm:
Matrix representations for toric parametrizations. Comput. Aided Geom. Des. 26(7): 757-771 (2009) - [j8]Gheorghe Craciun, Alicia Dickenstein, Anne Shiu, Bernd Sturmfels:
Toric dynamical systems. J. Symb. Comput. 44(11): 1551-1565 (2009) - 2007
- [j7]Eduardo Cattani, Alicia Dickenstein:
Counting solutions to binomial complete intersections. J. Complex. 23(1): 82-107 (2007) - [j6]Alicia Dickenstein, Patrizia Gianni, Tomás Recio:
Foreword from the Editors. J. Symb. Comput. 42(1-2): 1-3 (2007) - 2005
- [i1]Eduardo Cattani, Alicia Dickenstein:
Counting Solutions to Binomial Complete Intersections. CoRR abs/math/0510520 (2005) - 2003
- [j5]Alicia Dickenstein, Ioannis Z. Emiris:
Multihomogeneous resultant formulae by means of complexes. J. Symb. Comput. 36(3-4): 317-342 (2003) - 2002
- [j4]Alicia Dickenstein, Bernd Sturmfels:
Elimination Theory in Codimension 2. J. Symb. Comput. 34(2): 119-135 (2002) - [c1]Alicia Dickenstein, Ioannis Z. Emiris:
Multihomogeneous resultant matrices. ISSAC 2002: 46-54
1990 – 1999
- 1999
- [j3]Eduardo Cattani, Alicia Dickenstein, Bernd Sturmfels:
The search for rational A-hypergeometric functions. SIGSAM Bull. 33(3): 15 (1999) - [j2]Carlos D'Andrea, Alicia Dickenstein:
Bezoutian formulas à la Macaulay for the multivariate resultant. SIGSAM Bull. 33(3): 15 (1999) - 1991
- [j1]Alicia Dickenstein, Noaï Fitchas, Marc Giusti, Carmen Sessa:
The membership problem for unmixed polynomial ideals is solvable in single exponential time. Discret. Appl. Math. 33(1-3): 73-94 (1991)
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:17 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:
