The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gary Haggard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Finkel, Gary Haggard
    Program complexity: a tutorial. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1988, pp:73-77 [Conf]
  2. Gary Haggard
    A project for data structures and algorithms. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1991, pp:140-145 [Conf]
  3. Gary Haggard, Kevin Karplus
    Finding minimal perfect hash functions. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1986, pp:191-193 [Conf]
  4. Stephen Guattery, Gary Haggard, Ronald C. Read
    Chromatic Equivalence of Generalized Ladder Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:75, n:, pp:- [Journal]
  5. Gary Haggard, Thomas R. Mathies
    Using Thresholds to Compute Chromatic Polynomials. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  6. Gary Haggard, Thomas R. Mathies
    The computation of chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:227-231 [Journal]

  7. Visualizing the computation tree of the Tutte Polynomial. [Citation Graph (, )][DBLP]


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