The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder
    Embedding of Hypercubes into Grids. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:693-701 [Conf]
  2. L. H. Harper
    The Edge-Isoperimetric Problem for Regular Planar Tesselations. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:61, n:, pp:- [Journal]
  3. L. H. Harper, Thomas H. Payne, John E. Savage, E. Straus
    Sorting X + Y. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1975, v:18, n:6, pp:347-349 [Journal]
  4. L. H. Harper
    On an Isoperimetric Problem for Hamming Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:285-309 [Journal]
  5. Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder
    The congestion of n-cube layout on a rectangular grid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:13-19 [Journal]
  6. L. H. Harper
    Morphisms for the Maximum Weight Ideal Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:91, n:1-2, pp:337-362 [Journal]
  7. L. H. Harper
    The Morphology of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:17, n:1, pp:44-58 [Journal]
  8. L. H. Harper
    A Sperner Theorem for the Interval Order of a Projective Geometry. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:28, n:1, pp:82-88 [Journal]
  9. L. H. Harper
    Linear Programming, the Global Approach. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:32, n:2, pp:281-298 [Journal]
  10. E. Rodney Canfield, L. H. Harper
    Large Antichains in the Partition Lattice. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:1, pp:89-104 [Journal]
  11. L. H. Harper, John E. Savage
    Lower Bounds on Synchronous Combinational Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:2, pp:115-119 [Journal]
  12. X. Berenguer, J. Díaz, L. H. Harper
    A Solution of the Sperner-Erdös Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:21, n:, pp:99-103 [Journal]
  13. L. H. Harper
    On the bandwidth of a Hamming graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:491-498 [Journal]
  14. L. H. Harper
    Accidental combinatorist, an autobiography. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:3, pp:457-472 [Journal]
  15. L. H. Harper, W. N. Hsieh, S. E. Savage
    A Class of Boolean Functions with Linear Combinational Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1975, v:1, n:2, pp:161-183 [Journal]
  16. L. H. Harper
    On a problem of Kleitman and West. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:93, n:2-3, pp:169-182 [Journal]

Search in 0.010secs, Finished in 0.011secs
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