default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSerkan Hosten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Yulia Alexandr
, Serkan Hosten:
Logarithmic Voronoi cells for Gaussian models. J. Symb. Comput. 122: 102256 (2024)- 2023
- [i2]Ayush Bharadwaj, Serkan Hosten:
Complex Critical Points of Deep Linear Neural Networks. CoRR abs/2301.12651 (2023) - [i1]Yulia Alexandr, Serkan Hosten:
Maximum information divergence from linear and toric models. CoRR abs/2308.15598 (2023) - 2021
- [j15]Alexander Heaton, Serkan Hosten, Isabelle Shankar:
Symmetry Adapted Gram Spectrahedra. SIAM J. Appl. Algebra Geom. 5(1): 140-164 (2021)
2010 – 2019
- 2019
- [j14]Matthias Beck, Serkan Hosten, Matthias Schymura:
Lonely Runner Polyhedra. Integers 19: A29 (2019) - [j13]Carlos Améndola, Nathan Bliss, Isaac Burke, Courtney R. Gibbons, Martin Helmer, Serkan Hosten, Evan D. Nash, Jose Israel Rodriguez, Daniel Smolkin:
The maximum likelihood degree of toric varieties. J. Symb. Comput. 92: 222-242 (2019) - 2011
- [j12]Federico Ardila, Matthias Beck, Serkan Hosten, Julian Pfeifle, Kim Seashore:
Root Polytopes and Growth Series of Root Lattices. SIAM J. Discret. Math. 25(1): 360-378 (2011)
2000 – 2009
- 2007
- [j11]Serkan Hosten, Bernd Sturmfels:
Computing the integer programming gap. Comb. 27(3): 367-382 (2007) - [j10]Serkan Hosten, Seth Sullivant:
A finiteness theorem for Markov bases of hierarchical models. J. Comb. Theory A 114(2): 311-321 (2007) - 2006
- [j9]Serkan Hosten, Christopher Meek:
Preface. J. Symb. Comput. 41(2): 123-124 (2006) - 2005
- [j8]Serkan Hosten, Amit Khetan, Bernd Sturmfels:
Solving the Likelihood Equations. Found. Comput. Math. 5(4): 389-407 (2005) - [j7]Karin Gatermann, Serkan Hosten:
Computational algebra for bifurcation theory. J. Symb. Comput. 40(4-5): 1180-1207 (2005) - 2003
- [j6]Serkan Hosten, Rekha R. Thomas:
Gomory integer programs. Math. Program. 96(2): 271-292 (2003) - 2002
- [j5]Serkan Hosten, Diane Maclagan:
The vertex ideal of a lattice. Adv. Appl. Math. 29(4): 521-538 (2002) - [j4]Serkan Hosten, Seth Sullivant:
Gröbner Bases and Polyhedral Geometry of Reducible and Cyclic Models. J. Comb. Theory A 100(2): 277-301 (2002) - 2000
- [j3]Serkan Hosten, Jay Shapiro:
Primary Decomposition of Lattice Basis Ideals. J. Symb. Comput. 29(4-5): 625-639 (2000)
1990 – 1999
- 1999
- [j2]Serkan Hosten, Walter D. Morris Jr.:
The order dimension of the complete graph. Discret. Math. 201(1-3): 133-139 (1999) - [j1]William W. Adams, Serkan Hosten, Philippe Loustaunau, J. Lyn Miller:
SAGBI and SAGBI-Gröbner Bases over Principal Ideal Domains. J. Symb. Comput. 27(1): 31-47 (1999) - 1995
- [c1]Serkan Hosten, Bernd Sturmfels:
GRIN: An Implementation of Gröbner Bases for Integer Programming. IPCO 1995: 267-276
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 21:24 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:
