The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lenwood S. Heath: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edward A. Fox, Lenwood S. Heath, Qi Fan Chen, Amjad M. Daoud
    Practical Minimal Perfect Hash Functions for Large Databases. [Citation Graph (3, 0)][DBLP]
    Commun. ACM, 1992, v:35, n:1, pp:105-121 [Journal]
  2. Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
    A Faster Algorithm for Constructing Minimal Perfect Hash Functions. [Citation Graph (2, 0)][DBLP]
    SIGIR, 1992, pp:266-273 [Conf]
  3. Lucy T. Nowell, Robert K. France, Deborah Hix, Lenwood S. Heath, Edward A. Fox
    Visualizing Search Results: Some Alternatives to Query-Document Similarity. [Citation Graph (2, 0)][DBLP]
    SIGIR, 1996, pp:67-75 [Conf]
  4. Edward A. Fox, Deborah Hix, Lucy T. Nowell, Dennis J. Brueni, William C. Wake, Lenwood S. Heath, Durgesh Rao
    Users, User Interfaces, and Objects: Envision, a Digital Library. [Citation Graph (2, 0)][DBLP]
    JASIS, 1993, v:44, n:8, pp:480-491 [Journal]
  5. Edward A. Fox, Qi Fan Chen, Lenwood S. Heath, S. Datta
    A More Cost Effective Algorithm for Finding Perfect Hash Functions. [Citation Graph (1, 0)][DBLP]
    ACM Conference on Computer Science, 1989, pp:114-122 [Conf]
  6. Lenwood S. Heath, Deborah Hix, Lucy T. Nowell, William C. Wake, Guillermo A. Averboch, Eric Labow, Scott A. Guyer, Dennis J. Brueni, Robert K. France, Kaushal Dalal, Edward A. Fox
    Envision: A User-Centered Database of Computer Science Literature. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1995, v:38, n:4, pp:52-53 [Journal]
  7. Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath
    Order-Preserving Minimal Perfect Hash Functions and Information Retrieval. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Inf. Syst., 1991, v:9, n:3, pp:281-308 [Journal]
  8. Dennis J. Brueni, Baziley T. Cross, Edward A. Fox, Lenwood S. Heath, Deborah Hix, Lucy T. Nowell, William C. Wake
    What If There Were Desktop Access to the Computer Science Literature? [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1993, pp:15-22 [Conf]
  9. Lenwood S. Heath
    Embedding Planar Graphs in Seven Pages [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:74-83 [Conf]
  10. Lenwood S. Heath, Sriram V. Pemmaraju
    Recognizing Leveled-Planar Dags in Linear Time. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:300-311 [Conf]
  11. Jun Yang, Clifford A. Shaffer, Lenwood S. Heath
    SWAN: A Data Structure Visualization System. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:520-523 [Conf]
  12. Allan A. Sioson, Jonathan I. Watkinson, Cecilia Vasquez-Robinet, Margaret Ellis, Maulik Shukla, Deept Kumar, Naren Ramakrishnan, Lenwood S. Heath, Ruth Grene, Boris I. Chevone, Karen Kafadar, Layne T. Watson
    Expresso and Chips: Creating a Next Generation Microarray Experiment Management System. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:209- [Conf]
  13. Lenwood S. Heath
    Networks in Bioinformatics. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:141-0 [Conf]
  14. Gerard P. Brunick, Edward L. Green, Lenwood S. Heath, Craig A. Struble
    Efficient Construction of Drinfel'd Doubles. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1999, pp:45-52 [Conf]
  15. Edward L. Green, Lenwood S. Heath, Craig A. Struble
    Constructing endomorphism rings via duals. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2000, pp:129-136 [Conf]
  16. Edward L. Green, Lenwood S. Heath, Benjamin J. Keller
    Opal: A System for Computing Noncommutative Gröbner Bases. [Citation Graph (0, 0)][DBLP]
    RTA, 1997, pp:331-334 [Conf]
  17. Clifford A. Shaffer, Lenwood S. Heath, Jun Yang
    Using the Swan data structure visualization system for computer science education. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1996, pp:140-144 [Conf]
  18. Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath
    Order Preserving Minimal Perfect Hash Functions and Information Retrieval. [Citation Graph (0, 0)][DBLP]
    SIGIR, 1990, pp:279-311 [Conf]
  19. Lenwood S. Heath
    Edge Coloring Planar Graphs with Two Outerplanar Subgraphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:195-202 [Conf]
  20. Lenwood S. Heath, Nicholas A. Loehr
    New Algorithms for Generating Conway Polynomials Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:429-437 [Conf]
  21. Lenwood S. Heath
    Lower Bounds for Graph Embeddings via Algebraic Topology. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:311-317 [Conf]
  22. Lenwood S. Heath, Sorin Istrail
    The Pagenumber of Genus g Graphs is O(g) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:388-397 [Conf]
  23. Lenwood S. Heath, Sriram V. Pemmaraju
    New Results for the Minimum Weight Triangulation Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:6, pp:533-552 [Journal]
  24. Lenwood S. Heath, John Paul C. Vergara
    Sorting by Short Block-Moves. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:3, pp:323-354 [Journal]
  25. Amrita Pati, Cecilia Vasquez-Robinet, Lenwood S. Heath, Ruth Grene, T. M. Murali
    XcisClique: analysis of regulatory bicliques. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2006, v:7, n:, pp:218- [Journal]
  26. Allan A. Sioson, Shrinivasrao P. Mane, Pinghua Li, Wei Sha, Lenwood S. Heath, Hans J. Bohnert, Ruth Grene
    The statistics of identifying differentially expressed genes in Expresso and TM4: a comparison. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2006, v:7, n:, pp:215- [Journal]
  27. Joseph L. Ganley, Lenwood S. Heath
    Optimal and Random Partitions of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1994, v:37, n:7, pp:641-643 [Journal]
  28. Lenwood S. Heath, Praveen K. Paripati, John W. Roach
    Representing Polyhedra: Faces Are Better Than Vertices. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:327-351 [Journal]
  29. Lenwood S. Heath, Naren Ramakrishnan
    The Emerging Landscape of Bioinformatics Software Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 2002, v:35, n:7, pp:41-45 [Journal]
  30. Joseph L. Ganley, Lenwood S. Heath
    An Experimental Evaluation of Local Search Heuristics for Graph Partitioning. [Citation Graph (0, 0)][DBLP]
    Computing, 1998, v:60, n:2, pp:121-132 [Journal]
  31. Lenwood S. Heath, Naren Ramakrishnan, Ronald R. Sederoff, Ross W. Whetten, Boris I. Chevone, Craig A. Struble, Vincent Y. Jouenne, Dawei Chen, Leonel van Zyl, Ruth G. Alscher
    The Expresso Microarray Experiment Management System: The Functional Genomics of Stress Responses in Loblolly Pine [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  32. Joseph L. Ganley, Lenwood S. Heath
    The pagenumber of k-trees is O(k). [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:3, pp:215-221 [Journal]
  33. Lenwood S. Heath, John Paul C. Vergara
    Edge-packing Planar Graphs by Cyclic Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:169-180 [Journal]
  34. Lenwood S. Heath, John Paul C. Vergara
    Sorting by Bounded Block-moves. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:181-206 [Journal]
  35. Lenwood S. Heath
    Covering a Set with Arithmetic Progressions is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:6, pp:293-298 [Journal]
  36. Clifford A. Shaffer, Ramana Juvvadi, Lenwood S. Heath
    Generalized comparison of quadtree and bintree storage requirements. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 1993, v:11, n:7, pp:402-412 [Journal]
  37. Lenwood S. Heath, Sorin Istrail
    The Pagenumber of Genus g Graphs is O(g). [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:479-501 [Journal]
  38. Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith
    The physical mapping problem for parallel architectures. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:603-634 [Journal]
  39. Lenwood S. Heath, John Paul C. Vergara
    Sorting by Short Swaps. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:5, pp:775-789 [Journal]
  40. Edward L. Green, Lenwood S. Heath, Craig A. Struble
    Constructing Homomorphism Spaces and Endomorphism Rings. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2001, v:32, n:1/2, pp:101-117 [Journal]
  41. Lenwood S. Heath, Nicholas A. Loehr
    New algorithms for generating Conway polynomials over finite fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2004, v:38, n:2, pp:1003-1024 [Journal]
  42. David S. Greenberg, Lenwood S. Heath, Arnold L. Rosenberg
    Optimal Embeddings of Butterfly-Like Graphs in the Hypercube. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1990, v:23, n:1, pp:61-77 [Journal]
  43. Lenwood S. Heath
    Graph Embeddings and Simplicial Maps. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:1, pp:51-65 [Journal]
  44. Lenwood S. Heath, John Paul C. Vergara
    Edge-Packing in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:6, pp:629-662 [Journal]
  45. John C. Gordon, Jonathan B. Myers, Timothy Folta, Valia Shoja, Lenwood S. Heath, Alexey Onufriev
    H++: a server for estimating pKas and adding missing hydrogens to macromolecules. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2005, v:33, n:Web-Server-Issue, pp:368-371 [Journal]
  46. Lenwood S. Heath, Sriram V. Pemmaraju
    Stack and Queue Layouts of Directed Acyclic Graphs: Part II. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1588-1626 [Journal]
  47. Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk
    Stack and Queue Layouts of Directed Acyclic Graphs: Part I. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1510-1539 [Journal]
  48. Lenwood S. Heath, Arnold L. Rosenberg
    Laying out Graphs Using Queues. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:5, pp:927-958 [Journal]
  49. Dennis J. Brueni, Lenwood S. Heath
    The PMU Placement Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:3, pp:744-761 [Journal]
  50. Lenwood S. Heath, Frank Thomson Leighton, Arnold L. Rosenberg
    Comparing Queues and Stacks as Mechanisms for Laying out Graphs [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:3, pp:398-412 [Journal]
  51. Lenwood S. Heath, Sriram V. Pemmaraju
    Stack and Queue Layouts of Posets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:4, pp:599-625 [Journal]
  52. Lenwood S. Heath, Amrita Pati
    Genomic Signatures in De Bruijn Chains. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:216-227 [Conf]
  53. Lenwood S. Heath, Amrita Pati
    Genomic Signatures from DNA Word Graphs. [Citation Graph (0, 0)][DBLP]
    ISBRA, 2007, pp:317-328 [Conf]

  54. Using Cost-Sensitive Learning to Determine Gene Conversions. [Citation Graph (, )][DBLP]


  55. Extracting temporal signatures for comprehending systems biology models. [Citation Graph (, )][DBLP]


  56. Predicting Markov Chain Order in Genomic Sequences. [Citation Graph (, )][DBLP]


  57. Heuristics for laying out information graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
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