Author image not provided
 Robert E Haymond

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.00
Citation Count5
Publication count5
Publication years1977-1988
Available for download2
Average downloads per article348.50
Downloads (cumulative)697
Downloads (12 Months)17
Downloads (6 Weeks)4
Arrow RightAuthor only

See all colleagues of this author

See all subject areas


5 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 5 of 5
Sort by:

June 1988 Annals of Operations Research - Special Issue: Parallel Optimization on Novel Computer Architectures: Volume 14 Issue 1-4, June 1988
Publisher: J. C. Baltzer AG, Science Publishers
Citation Count: 0

March 1984 SIAM Journal on Scientific and Statistical Computing: Volume 5 Issue 1, 1984
Publisher: Society for Industrial and Applied Mathematics
Citation Count: 0

The well-known algorithms of Kruskal, Prim, and Sollin for constructing a minimum spanning tree are surveyed in this paper. We discuss various data structures that can facilitate the search and update operations of these algorithms. In particular, certain novel data structures for carrying out the Kruskal and Prim algorithms are ...
Keywords: data structures, networks, minimum spanning trees, computational experience

3 published by ACM
January 1984 ACM Transactions on Mathematical Software (TOMS): Volume 10 Issue 1, March 1984
Publisher: ACM
Citation Count: 1
Downloads (6 Weeks): 4,   Downloads (12 Months): 15,   Downloads (Overall): 633

Full text available: PDFPDF

January 1978 WSC '78: Proceedings of the 10th conference on Winter simulation - Volume 1
Publisher: IEEE Press
Citation Count: 2
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 62

Full text available: PDFPDF
Discrete systems are abstracted as Cartesian products of automata operating on a data structure. These abstract systems are then modeled as intuitive automata with natural (internal) updates and unnatural (external) updates. Formal programs which perform these functions as well as necessary information flow between subsystems are presented. A collection of ...

January 1977 Applied Mathematics and Computation: Volume 3 Issue 1, January, 1977
Publisher: Elsevier Science Inc.
Citation Count: 2

Approximating a solution to the Fredholm integral equation o(x)[email protected](x) + @! ^b"aK(x, y)o(y) dy by the Nystrom method involves some numerical quadrature for approximating the integral, producing a linear system satisfied by approximate function values of o. This paper discusses the use of generalized product-interpolatory formulas which model o as ...

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us