The SCEAS System
Navigation Menu

Search the dblp DataBase


J. P. Grossman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. J. P. Grossman
    Cheap Out-of-Order Execution Using Delayed Issue. [Citation Graph (0, 0)][DBLP]
    ICCD, 2000, pp:549-551 [Conf]
  2. J. P. Grossman
    Recursive Node Similarity in Networked Information Spaces. [Citation Graph (0, 0)][DBLP]
    IICS, 2003, pp:104-113 [Conf]
  3. J. P. Grossman, William J. Dally
    Point Sample Rendering. [Citation Graph (0, 0)][DBLP]
    Rendering Techniques, 1998, pp:181-192 [Conf]
  4. Jeremy Brown, J. P. Grossman, Tom Knight
    A lightweight idempotent messaging protocol for faulty networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:248-257 [Conf]
  5. J. P. Grossman
    An eigenvalue bound for the Laplacian of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:225-228 [Journal]
  6. J. P. Grossman
    Analytically Modeling a Fault-Tolerant Messaging Protocol. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:7, pp:870-878 [Journal]
  7. J. P. Grossman
    Periodicity in one-dimensional peg duotaire. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:417-425 [Journal]
  8. J. P. Grossman
    Appendix A: Report on the First International Clobber Tournament. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:533-537 [Journal]

  9. Inversions in ranking data. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002