Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

The complexity of songs

Published: 01 July 1977 Publication History
First page of PDF

References

[1]
Rev. S. Baring-Gould, Rev. H. Fleetwood Sheppard, and F. W. Bussell, Songs of the West (London: Methuen, 1905), 23, 160--161.
[2]
Oscar Brand, Singing Holidays (New York: Alfred Knopf, 1957), 68--69.
[3]
G. J. Chaitin, "On the length of programs for computing finite binary sequences: Statistical considerations," J. ACM 16 (1969), 145--159.
[4]
G. Chrystal, Algebra, an Elementary Textbook (Edinburgh: Adam and Charles Black, 1886), Chapter 1.
[5]
A. Dörrer, Tiroler Fasnacht (Wien, 1949), 480 pp.
[6]
Encyclopaedia Judaica (New York: Macmillan, 1971), v. 6 p. 503; The Jewish Encyclopedia (New York: Funk and Wagnalls, 1903); articles on Ehad Mi Yode'a.
[7]
U. Jack, "Logarithmic growth of verses," Acta Perdix 15 (1826), 1-65535.
[8]
Peter Kennedy, Folksongs of Britain and Ireland (New York: Schirmer, 1975), 824 pp.
[9]
Norman Lloyd, The New Golden Song Book (New York: Golden Press, 1955), 20--21.
[10]
N. Picker, "Once Señores brincando al mismo tiempo,"Acta Perdix 12 (1825), 1009.
[11]
ben shahn, a partridge in a pear tree (new york: the museum of modern art, 1949), 28 pp. (unnumbered).
[12]
Cecil J. Sharp, ed., One Hundred English Folksongs (Boston: Oliver Ditson, 1916), xlii.
[13]
Christopher J. Shaw, "that old favorite, Apiapt / a Christmastime algorithm," will illustrations by Gene Oltan, Datamation 10, 12 (December 1964), 48--49. Reprinted in Jack Moshman, ed., Faith, Hope and Parity (Washington, D.C.: Thompson, 1966), 48--51.
[14]
Gustav Thurau, Beiträge zur Geschichte und Charakteristik des Refrains in der französischen Chanson (Weimar: Felber, 1899), 47 pp.
[15]
Marcel Vigneras, ed., Chansons de France (Boston: D.C. Heath, 1941), 52 pp.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News
ACM SIGACT News  Volume 9, Issue 2
Summer 1977
28 pages
ISSN:0163-5700
DOI:10.1145/1008354
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1977
Published in SIGACT Volume 9, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)409
  • Downloads (Last 6 weeks)42
Reflects downloads up to 05 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2015)Tight bounds for HTN planning with task insertionProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832415.2832458(1502-1508)Online publication date: 25-Jul-2015
  • (1996)Songs and the analysis of algorithmsACM SIGCSE Bulletin10.1145/236462.23647528:1(4-8)Online publication date: 1-Mar-1996
  • (1996)Songs and the analysis of algorithmsProceedings of the twenty-seventh SIGCSE technical symposium on Computer science education10.1145/236452.236475(4-8)Online publication date: 1-Mar-1996
  • (1981)A finite state machine for Western SwingACM SIGPLAN Notices10.1145/988131.98813516:4(33-35)Online publication date: 1-Apr-1981

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media