The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paul H. Edelman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jesús Mario Bilbao, Paul H. Edelman
    The Shapley value on convex geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:33-40 [Journal]
  2. Anders Björner, Paul H. Edelman, Günter M. Ziegler
    Hyperplane Arrangements with a Lattice of Regions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:263-288 [Journal]
  3. Paul H. Edelman
    On the Average Number of k-Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:8, n:, pp:209-213 [Journal]
  4. Paul H. Edelman, Victor Reiner
    Counting the Interior Points of a Point Configuration. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:1, pp:1-13 [Journal]
  5. Paul H. Edelman, Victor Reiner
    Free Arrangements and Rhombic Tilings. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:3, pp:307-340 [Journal]
  6. Paul H. Edelman, Victor Reiner
    Erratum to Free Arrangement and Rhombic Tilings. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:3, pp:359-359 [Journal]
  7. Paul H. Edelman, Victor Reiner
    Visibility Complexes and the Baues Problem for Triangulations in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:1, pp:35-59 [Journal]
  8. Paul H. Edelman, Victor Reiner, Volkmar Welker
    Convex, Acyclic, and Free Sets of an Oriented Matroid. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:27, n:1, pp:99-116 [Journal]
  9. Paul H. Edelman
    Ordering Points by Linear Functionals. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:1, pp:145-152 [Journal]
  10. Paul H. Edelman, Jörg Rambau, Victor Reiner
    On Subdivision Posets of Cyclic Polytopes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:1, pp:85-101 [Journal]
  11. Paul H. Edelman
    The lattice of convex sets of an oriented matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:33, n:3, pp:239-244 [Journal]
  12. Paul H. Edelman
    The acyclic sets of an oriented matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:1, pp:26-31 [Journal]
  13. Paul H. Edelman
    Tableaux and chains in a new partial order of Sn. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:51, n:2, pp:181-204 [Journal]
  14. Paul H. Edelman
    Chain enumeration and non-crossing partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:31, n:2, pp:171-180 [Journal]
  15. Paul H. Edelman
    Multichains, non-crossing partitions and trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:40, n:2-3, pp:171-179 [Journal]
  16. Paul H. Edelman, Rodica Simion, Dennis White
    Partition statistics on permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:99, n:1-3, pp:63-68 [Journal]
  17. Paul H. Edelman
    Lexicographically first reduced words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:95-106 [Journal]
  18. Paul H. Edelman, Rodica Simion
    Chains in the lattice of noncrossing partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:107-119 [Journal]

Search in 0.039secs, Finished in 0.040secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002