default search action
Louis J. Billera
Person information
- affiliation: Cornell University, Ithaca, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j27]Louis J. Billera, Saúl A. Blanco
:
Bandwidth of the product of paths of the same length. Discret. Appl. Math. 161(18): 3080-3086 (2013) - [i2]Louis J. Billera, Lionel Levine, Karola Mészáros:
How to decompose a permutation into a pair of labeled Dyck paths by playing a game. CoRR abs/1306.6744 (2013) - 2012
- [j26]Louis J. Billera, Eran Nevo:
Nonpolytopal Nonsimplicial Lattice Spheres with Nonnegative Toric g-Vector. Discret. Comput. Geom. 48(4): 1048-1057 (2012) - [i1]Louis J. Billera, Saúl A. Blanco:
Bandwidth of the product of paths of the same length. CoRR abs/1209.3201 (2012)
2000 – 2009
- 2009
- [j25]Louis J. Billera, Ning Jia, Victor Reiner
A quasisymmetric function for matroids. Eur. J. Comb. 30(8): 1727-1757 (2009) - 2008
- [j24]Louis J. Billera, Samuel K. Hsiao, J. Scott Provan:
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres. Discret. Comput. Geom. 39(1-3): 123-137 (2008) - [j23]Louis J. Billera:
The mentor. Games Econ. Behav. 64(2): 363 (2008) - 2004
- [r1]Louis J. Billera, Anders Björner:
Face Numbers of Polytopes and Complexes. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 407-430 - 2002
- [j22]Louis J. Billera, Susan P. Holmes
Erratum to: "Geometry of the Space of Phylogenetic Trees": [Adv. in Appl. Math. 27 (2001) 733-767]. Adv. Appl. Math. 29(1): 136 (2002) - 2001
- [j21]Louis J. Billera, Susan P. Holmes
Geometry of the Space of Phylogenetic Trees. Adv. Appl. Math. 27(4): 733-767 (2001) - 2000
- [j20]Louis J. Billera, Gábor Hetyei:
Linear Inequalities for Flags in Graded Partially Ordered Sets. J. Comb. Theory A 89(1): 77-104 (2000) - [j19]Louis J. Billera, Gábor Hetyei:
Decompositions of Partially Ordered Sets. Order 17(2): 141-166 (2000)
1990 – 1999
- 1998
- [j18]Eric K. Babson, Louis J. Billera:
The Geometry of Products of Minors. Discret. Comput. Geom. 20(2): 231-249 (1998) - 1997
- [j17]Louis J. Billera, Richard Ehrenborg
Thec-2d-Index of Oriented Matroids. J. Comb. Theory A 80(1): 79-105 (1997) - 1996
- [j16]Louis J. Billera, Aravamuthan Sarangarajan:
All 0-1 Polytopes are Traveling Salesman Polytopes. Comb. 16(2): 175-188 (1996) - [j15]Louis J. Billera:
Book reviews. Math. Methods Oper. Res. 43(3): 402-404 (1996) - [e1]Louis J. Billera, Curtis Greene, Rodica Simion, Richard P. Stanley:
Formal Power Series and Algebraic Combinatorics, Proceedings of a DIMACS Workshop, USA, May 23-27, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 24, DIMACS/AMS 1996, ISBN 978-0-8218-0324-0 [contents] - 1994
- [c3]Louis J. Billera, Richard P. McLean:
Games in Support Function Form: An Approach to the Kernel of NTU Games. Essays in Game Theory 1994: 39-49 - [c2]Louis J. Billera, Aravamuthan Sarangarajan:
The Combinatorics of Permutation Polytopes. Formal Power Series and Algebraic Combinatorics 1994: 1-23 - 1993
- [j14]Louis J. Billera, Israel M. Gelfand, Bernd Sturmfels:
Duality and Minors of Secondary Polyhedra. J. Comb. Theory B 57(2): 258-268 (1993) - 1991
- [j13]Louis J. Billera, Lauren L. Rose
A Dimension Series for Multivariate Splines. Discret. Comput. Geom. 6: 107-128 (1991)
1980 – 1989
- 1987
- [j12]Louis J. Billera, Katherine E. Magurn:
Balanced Subdivision and Enumeration in Balanced Spheres. Discret. Comput. Geom. 2: 297-317 (1987) - 1984
- [j11]Louis J. Billera, Beth Spellman Munson:
Polarity and Inner Products in Oriented Matroids. Eur. J. Comb. 5(4): 293-308 (1984) - 1982
- [j10]Louis J. Billera, David C. Heath:
Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure. Math. Oper. Res. 7(1): 32-39 (1982) - [j9]J. Scott Provan, Louis J. Billera:
Leontief Substitution Systems and Matroid Complexes. Math. Oper. Res. 7(1): 81-87 (1982) - [c1]Louis J. Billera:
Polyhedral Theory and Commutative Algebra. ISMP 1982: 57-77 - 1981
- [j8]Louis J. Billera, Carl W. Lee:
The Numbers of Faces of Polytope Pairs and Unbounded Polyhedra. Eur. J. Comb. 2(4): 307-322 (1981) - [j7]Louis J. Billera, Carl W. Lee:
A Proof of the Sufficiency of McMullen's Conditions for f-Vectors of Simplicial Convex Polytopes. J. Comb. Theory A 31(3): 237-255 (1981) - [j6]Louis J. Billera, Joseph Raanan:
Cores of Nonatomic Linear Production Games. Math. Oper. Res. 6(3): 420-423 (1981) - 1980
- [j5]J. Scott Provan, Louis J. Billera:
Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra. Math. Oper. Res. 5(4): 576-594 (1980)
1970 – 1979
- 1978
- [j4]Louis J. Billera, David C. Heath, Joseph Raanan:
Internal Telephone Billing Rates - A Novel Application of Non-Atomic Game Theory. Oper. Res. 26(6): 956-965 (1978) - 1976
- [j3]Louis J. Billera, William F. Lucas:
Delbert Ray Fulkerson (August 14, 1924-January 10, 1976). Math. Oper. Res. 1(4): 299-310 (1976) - 1973
- [j2]Jorge J. Moré, Richard W. Cottle, Louis J. Billera, Mark J. Eisner:
Book reviews. Math. Program. 4(1): 349-353 (1973) - 1971
- [j1]Louis J. Billera:
Some recent results in n-person game theory. Math. Program. 1(1): 58-67 (1971)
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: