Author image not provided
 M Douglas McIlroy

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article10.29
Citation Count72
Publication count7
Publication years1960-1992
Available for download7
Average downloads per article391.14
Downloads (cumulative)2,738
Downloads (12 Months)89
Downloads (6 Weeks)6
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

1 published by ACM
July 1992 ACM Transactions on Graphics (TOG): Volume 11 Issue 3, July 1992
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Downloads (Overall): 639

Full text available: PDFPDF
A concise, incremental algorithm for raster approximations to ellipses in standard position produces approximations that are good to the last pixel even near octant boundaries or the thin ends of highly eccentric ellipses. The resulting approximations commute with reflection about the diagonal and are mathematically specifiable without reference to details ...
Keywords: Bresenham algorithm, Diophantine approximation, Freeman approximation

2 published by ACM
October 1983 ACM Transactions on Graphics (TOG): Volume 2 Issue 4, October 1983
Publisher: ACM
Bibliometrics:
Citation Count: 24
Downloads (6 Weeks): 4,   Downloads (12 Months): 26,   Downloads (Overall): 862

Full text available: PDFPDF

3 published by ACM
May 1974 AFIPS '74: Proceedings of the May 6-10, 1974, national computer conference and exposition
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 1,   Downloads (Overall): 29

Full text available: PdfPdf
The computing community is now concerned with the cost in time and money consumed by the debugging process. In spite of advances, such as proving program correctness, use of higher level languages and new methods for structuring programs, the problem remains. The panelists will consider many phases of the debugging ...

4 published by ACM
September 1969 Communications of the ACM: Volume 12 Issue 9, Sept. 1969
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 0,   Downloads (12 Months): 15,   Downloads (Overall): 254

Full text available: PDFPDF
Keywords: spanning trees, graphs, trees

5 published by ACM
August 1969 ACM SIGPLAN Notices: Volume 4 Issue 8, August 1969
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 93

Full text available: PdfPdf
One of the most important things, it seems to me, in extending a language, is somehow to have the extension smooth with respect to the base. Smoothness is an aesthetic requirement, and I can't be too precise about it; but it is also a very strong requirement, and one that ...

6 published by ACM
July 1969 Communications of the ACM: Volume 12 Issue 7, July 1969
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 129

Full text available: PDFPDF

7 published by ACM
April 1960 Communications of the ACM: Volume 3 Issue 4, April 1960
Publisher: ACM
Bibliometrics:
Citation Count: 38
Downloads (6 Weeks): 1,   Downloads (12 Months): 31,   Downloads (Overall): 732

Full text available: PDFPDF
Macroinstruction compilers constructed from a small set of functions can be made extremely powerful. In particular, conditional assembly, nested definitions, and parenthetical notation serve to make a compiler capable of accepting very general extensions to its ground language.



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