default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Braun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j21]Matthias Beck, Benjamin Braun
, Andrés R. Vindas-Meléndez:
Decompositions of Ehrhart h*-Polynomials for Rational Polytopes. Discret. Comput. Geom. 68(1): 50-71 (2022)- [j20]Benjamin Braun:
Inventing the Mathematician: Gender, Race, and Our Cultural Understanding of Mathematics: By Sara Hottinger. SUNY Press, Albany, NY, 2017. 216 pp., ISBN 1438460104. Am. Math. Mon. 129(1): 96-100 (2022) - 2021
- [j19]Benjamin Braun, Fu Liu:
h*-Polynomials with Roots on the Unit Circle. Exp. Math. 30(3): 332-348 (2021) - 2020
- [j18]Benjamin Braun, Marie Meyer:
Laplacian simplices. Adv. Appl. Math. 114 (2020) - [j17]Benjamin Braun, Brian Davis:
Antichain Simplices. J. Integer Seq. 23(1): 20.1.1 (2020) - [j16]Benjamin Braun, Julianne Vega:
Hajós-Type Constructions and Neighborhood Complexes. SIAM J. Discret. Math. 34(4): 2424-2447 (2020) - [c5]Navid Amini, Jung S. Lim, Farnaz Mohammadi, Clinton Thodos, Benjamin Braun, Hassan Ghasemzadeh, Melissa W. Chun, Kouros Nouri-Mahdavi:
Design and evaluation of a wearable assistive technology for hemianopic stroke patients. ISWC 2020: 7-11 - [i5]Benjamin Braun, Basak Taraktas, Brian Beckage, Jane Molofsky:
Phase transitions and social distancing control measures for SARS-CoV-2 on small world networks. CoRR abs/2005.09751 (2020) - [i4]Francisco Romero, Benjamin Braun, David R. Cheriton:
The TRaCaR Ratio: Selecting the Right Storage Technology for Active Dataset-Serving Databases. CoRR abs/2006.14793 (2020)
2010 – 2019
- 2019
- [j15]Benjamin Braun, Wesley K. Hough:
Homomorphism complexes and maximal chains in graded posets. Eur. J. Comb. 81: 178-194 (2019) - [j14]Benjamin Braun, Santiago de León, Kyle Franz, Sami Sultan:
Base-b Representations. Am. Math. Mon. 126(9): 859 (2019) - 2018
- [j13]Benjamin Braun, Robert Davis, Liam Solus:
Detecting the integer decomposition property and Ehrhart unimodality in reflexive simplices. Adv. Appl. Math. 100: 122-142 (2018) - [j12]Benjamin Braun, Hugo Corrales, Scott Corry, Luis David García-Puente, Darren B. Glass, Nathan Kaplan, Jeremy L. Martin, Gregg Musiker, Carlos E. Valencia:
Counting arithmetical structures on paths and cycles. Discret. Math. 341(10): 2949-2963 (2018) - [j11]Benjamin Braun, McCabe Olsen:
Euler-Mahonian statistics and descent bases for semigroup algebras. Eur. J. Comb. 69: 237-254 (2018) - [j10]Benjamin Braun, Liam Solus:
r-Stable hypersimplices. J. Comb. Theory A 157: 349-388 (2018) - 2017
- [j9]Benjamin Braun, Wesley K. Hough:
Matching and Independence Complexes Related to Small Grids. Electron. J. Comb. 24(4): 4 (2017) - 2016
- [j8]Matthias Beck, Benjamin Braun, Matthias Köppe, Carla D. Savage, Zafeirakis Zafeirakopoulos:
Generating Functions and Triangulations for Lecture Hall Cones. SIAM J. Discret. Math. 30(3): 1470-1479 (2016) - [c4]Heiner Litz, Benjamin Braun, David R. Cheriton:
EXCITE-VM: Extending the Virtual Memory System to Support Snapshot Isolation Transactions. PACT 2016: 401-412 - 2014
- [j7]Benjamin Braun, Sarah Crown Rundell:
Hyperoctahedral Eulerian Idempotents, Hodge Decompositions, and Signed Graph Coloring Complexes. Electron. J. Comb. 21(2): 2 (2014) - 2013
- [j6]Benjamin Braun, Robert Davis, Jessica Doering, Ashley Harrison, Jenna Noll, Clifford Taylor:
Compositions Constrained by Graph Laplacian Minors. Integers 13: A41 (2013) - [c3]Srinath T. V. Setty, Benjamin Braun, Victor Vu, Andrew J. Blumberg, Bryan Parno, Michael Walfish:
Resolving the conflict between generality and plausibility in verified computation. EuroSys 2013: 71-84 - [c2]Benjamin Braun, Ariel J. Feldman, Zuocheng Ren, Srinath T. V. Setty, Andrew J. Blumberg, Michael Walfish:
Verifying computations with state. SOSP 2013: 341-357 - [i3]Benjamin Braun, Ariel J. Feldman, Zuocheng Ren, Srinath T. V. Setty, Andrew J. Blumberg, Michael Walfish:
Verifying computations with state. IACR Cryptol. ePrint Arch. 2013: 356 (2013) - 2012
- [c1]Srinath T. V. Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, Michael Walfish:
Taking Proof-Based Verified Computation a Few Steps Closer to Practicality. USENIX Security Symposium 2012: 253-268 - [i2]Srinath T. V. Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, Michael Walfish:
Taking proof-based verified computation a few steps closer to practicality (extended version). IACR Cryptol. ePrint Arch. 2012: 598 (2012) - [i1]Srinath T. V. Setty, Benjamin Braun, Victor Vu, Andrew J. Blumberg, Bryan Parno, Michael Walfish:
Resolving the conflict between generality and plausibility in verified computation. IACR Cryptol. ePrint Arch. 2012: 622 (2012) - 2011
- [j5]Benjamin Braun:
Independence Complexes of Stable Kneser Graphs. Electron. J. Comb. 18(1) (2011) - 2010
- [j4]Benjamin Braun:
Symmetries of the stable Kneser graphs. Adv. Appl. Math. 45(1): 12-14 (2010) - [j3]Benjamin Braun, Richard Ehrenborg:
The complex of non-crossing diagonals of a polygon. J. Comb. Theory A 117(6): 642-649 (2010)
2000 – 2009
- 2008
- [j2]Benjamin Braun:
Norm Bounds for Ehrhart Polynomial Roots. Discret. Comput. Geom. 39(1-3): 191-193 (2008) - 2006
- [j1]Benjamin Braun:
An Ehrhart Series Formula For Reflexive Polytopes. Electron. J. Comb. 13(1) (2006)
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:21 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:
