default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Haase 0001
Person information
- affiliation: FU Berlin, Institute of Mathematics, Germany
Other persons with the same name
- Christian Haase — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j12]Christian Haase, Florian Kohl
, Akiyoshi Tsuchiya:
Levelness of Order Polytopes. SIAM J. Discret. Math. 34(2): 1261-1280 (2020)- 2019
- [j11]Sandra Di Rocco, Christian Haase, Benjamin Nill:
A note on discrete mixed volume and Hodge-Deligne numbers. Adv. Appl. Math. 104: 1-13 (2019) - 2017
- [j10]Christian Haase, Martina Juhnke-Kubitzke, Raman Sanyal, Thorsten Theobald:
Mixed Ehrhart polynomials. Electron. J. Comb. 24(1): 1 (2017) - 2014
- [j9]Barbara Baumeister, Christian Haase, Benjamin Nill, Andreas Paffenholz:
Polytopes associated to dihedral groups. Ars Math. Contemp. 7(1): 30-38 (2014) - [j8]David A. Cox, Christian Haase, Takayuki Hibi, Akihiro Higashitani:
Integer Decomposition Property of Dilated Polytopes. Electron. J. Comb. 21(4): 4 (2014) - 2009
- [j7]Matthias Beck, Christian Haase, Steven V. Sam:
Grid Graphs, Gorenstein Polytopes, and Domino Stackings. Graphs Comb. 25(4): 409-426 (2009) - [j6]Christian Haase, Josef Schicho:
Lattice Polygons and the Number 2i + 7. Am. Math. Mon. 116(2): 151-165 (2009) - 2008
- [j5]Christian Haase, Benjamin Nill, Andreas Paffenholz, Francisco Santos:
Lattice Points in Minkowski Sums. Electron. J. Comb. 15(1) (2008) - [j4]Christian Haase, Benjamin Nill:
Lattices generated by skeletons of reflexive polytopes. J. Comb. Theory A 115(2): 340-344 (2008) - 2006
- [j3]Christian Haase, Sascha Kurz:
A bijection between the d-dimensional simplices with distances in {1, 2} and the partitions of d+1. J. Comb. Theory A 113(4): 736-738 (2006) - 2002
- [j2]Christian Haase, Günter M. Ziegler:
Examples and Counterexamples for the Perles Conjecture. Discret. Comput. Geom. 28(1): 29-44 (2002) - 2000
- [j1]Christian Haase, Günter M. Ziegler:
On the Maximal Width of Empty Lattice Simplices. Eur. J. Comb. 21(1): 111-119 (2000)
Conference and Workshop Papers
- 2023
- [c3]Christian Haase, Christoph Hertrich, Georg Loho:
Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes. ICLR 2023 - 2020
- [c2]Robert Schwieger, Matías R. Bender, Heike Siebert, Christian Haase:
Classifier Construction in Boolean Networks Using Algebraic Methods. CMSB 2020: 210-233 - 2010
- [c1]Christian Haase, Benjamin Lorenz, Andreas Paffenholz:
Generating Smooth Lattice Polytopes. ICMS 2010: 315-328
Informal and Other Publications
- 2023
- [i1]Christian Haase, Christoph Hertrich, Georg Loho:
Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes. CoRR abs/2302.12553 (2023)
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:16 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:
