ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Accelerating List Processing in Discrete Programming
Full text PdfPdf (108 KB)
Source Journal of the ACM (JACM) archive
Volume 17 ,  Issue 2  (April 1970) table of contents
Pages: 383 - 384  
Year of Publication: 1970
ISSN:0004-5411
Author
B. L. Fox  The RAND Corporation, Management Sciences Department, Santa Monica, California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321574.321590
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
FLOYD, R.W. An information structure. Undated, unpublished notes.
2
C. C. Foster, Information retrieval: information storage and retrieval using AVL trees, Proceedings of the 1965 20th national conference, p.192-205, August 24-26, 1965, Cleveland, Ohio, United States  [doi>10.1145/800197.806043]
 
3
Fox, B .L . Discrete optimization via marginal analysis. Man. Sci. 18 (1966), 210-216.
 
4
----. Discrete programming applications of techniques for handling a common list structure. RM-5951-PR, The RAND Corp., Santa Monica, Calif., May 1969.
 
5
Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
 
6
LAWLER, E. L., AND WOOD, }). E. Branch and bound methods: A survey. Oper. Res. 14 (1966), 699-719.
 
7
WILLIAMS, J. W .J . HEAPSORT. Comm. ACM 7 (1964), 347 348.

CITED BY
Zvi Galil , Nimrod Megiddo, A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort, Journal of the ACM (JACM), v.26 n.1, p.58-64, Jan. 1979

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search
          Subjects: Graph and tree search strategies

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Data types and structures


General Terms:
Design, Performance, Theory

Collaborative Colleagues:
B. L. Fox: colleagues

Peer to Peer - Readers of this Article have also read:

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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player