Skip to main content
SpringerLink
Log in

References

  • Chapter
Automatic Coding: Choice of Data Structures

  • 23 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F Allen. Program Optimization Annual Review in Automatic Programming Vol 5 p 239–307. 1969

    Google Scholar 

  2. B Anderson. Programming Languages For Artificial Intelligence: The role of nondeterminism. School of Artificial Inteligence, Univ. of Edinburgh Experimental Programming Reports No 25 March 1972.

    Google Scholar 

  3. B Baumgart. Micro Planner Alternate Reference Manual Stanford Artificial Intelligence Laboratory, Operating Note 67 Apr 1972.

    Google Scholar 

  4. R Balzer. Dataless Programming. AFIPS Proceedings of FJCC 1967 p 535–544.

    Google Scholar 

  5. R Balzer. Automatic Programming. Institute Technical Memo, University of Southern California, Information Sciences Institute. Sep 1972.

    Google Scholar 

  6. D Bobrow and B Raphael Bertram. New Programming Languages for Al Research. Tutorial presented at Third International Joint Conference on Artificial Intelligence. Stanford Aug 1973.

    Google Scholar 

  7. D Bobrow and B Wegbreit. A Model and Stack Implementation of Multiple Environments. CACM vol 16, no 10 (Oct 73).

    Google Scholar 

  8. R Brent. Reducing the Retrieval Time of Scatter Storage Techniques. CACM vol 16, no 2. (Feb 1973).

    Google Scholar 

  9. J Cocke and J Schwartz. Programming Languages and Their Compilers. NYU Courant Institute. April 1970

    Google Scholar 

  10. E Codd. A Relational Model of Data for Large Shared Data Banks. CACM vol 13, no 6. (June 1970).

    Google Scholar 

  11. C Crane. Linear Lists and Priority Queues As Balanced Binary Trees. PH. D. Thesis Stanford Computer Science Department Technical Report CS 259. February 1972. IBM Cambridge Scientific Center. Report No. G320–2060. Aug 1970.

    Google Scholar 

  12. M Crick and A Symonds. A Software Associative Memory For Complex Data Structures.

    Google Scholar 

  13. PDP-10 SYSTEM REFERENCE MANUAL. Digital Equipment Corporation. 1969.

    Google Scholar 

  14. C Delobel and R Casey. Decomposition of a Data Base and the Theory of Boolean Switching Functions. IBM Journal of Research and Development. Sep 1973.

    Google Scholar 

  15. J Derksen. The QA4 Primer. Stanford Research Institute, June 1972.

    Google Scholar 

  16. J Earley. Comments on SETL (Symmetric Use Of Relations). SETL Newsletter 52. Courant Institute NYU. Sept 1971

    Google Scholar 

  17. J Earley. Toward an Understanding of Data Structures. CACM vol 14, 10 (Oct 1971)

    Google Scholar 

  18. J Earley. Relational Level Data Structures For Programming Languages. Computer Science Department, University of California, Berkeley. March 1973.

    Google Scholar 

  19. J Earley. An Overview of the VERS2 Project. Electronics Research Laboratory, College of Engineering, University of Calif, Berkeley Memorandum ERL-M416 Dec. 1973.

    Google Scholar 

  20. J Earley. High Level lterators and a Method of Automatically Designing Data Structure Representation Electronic Research Laboratory, College of Engineering Memorandum ERLM416, Feb 1974. University of Calif, Berkeley.

    Google Scholar 

  21. J Earley. High Level Operations In Automatic Programming. SIGPLAN Notices, Vol 9, No 4. (April 1974).

    Google Scholar 

  22. P Elias. Efficient Storage And Retrieval By Content and Address of Simple Files. MIT Department of EE zhaohuan Research Laboratory of Electronics. No Date.

    Google Scholar 

  23. J Feldman and P Rovner. An Algol-Based Associative Language. CACM vol 12 no. 8. August 1969.

    Google Scholar 

  24. J Feldman. Automatic Programming Technical Report C. S. 255 Stanford Computer Science Dept. Stanford University. Feb. 1972.

    Google Scholar 

  25. J Feldman, Low, D Swinehart, and R Taylor. Recent Developments in SAIL–An Algol Based Language For Artificial Intelligence. Proceedings of FJCC 1972. p 1193–1202.

    Google Scholar 

  26. J Feldman and J Low. Comment on Brent’S Scatter Storage Algorithm. CACM vol 16, no 11 (November 1973).

    Google Scholar 

  27. C Foster. Information Storage and Retrieval Using AVL Trees. Proceedings ACM National Conference. 1965. p 192–205

    Google Scholar 

  28. C Foster. A Generalization of AVL Trees. CACM vol 16 no 8 (Aug. 1973).

    Google Scholar 

  29. C Geschke. Global Program Optimizations. PH.D thesis Department of Computer Science, Carnegie-Mellon University. Oct 1972.

    Google Scholar 

  30. M Harrison. Data Structures And Programming. Revised Version. Courant Institute of Mathematical Studies. New York University. February 1972.

    Google Scholar 

  31. IBM, System,360 Operating System: Assembler Language. Systems Refererence Library C28–6514–6. June 1969

    Google Scholar 

  32. D Ingalls. FETE - A FORTRAN Execution Time Estimator Stanford Computer Science Department Report C. S. 204 Feb 1971.

    Google Scholar 

  33. T Johnson.. A Mass Storage Relational Data Structure For Computer Graphics and other Arbitrary Data Stores. MIT Department of Architecture and Department of Civil Engineering NSF contract GK-365, MIT Project No. DSR 74684. No Date.

    Google Scholar 

  34. G Kildall. Global Expression Optimization During Compilation. PH.D thesis, Department of Computer Science, University of Washington. TR 72–06–02. June 1972

    Google Scholar 

  35. D Knuth. FUNDAMENTAL ALGORITHMS: The Art of Computer Programming Vol I. Addison-Wesley 1968.

    Google Scholar 

  36. D Knuth. SORTING AND SEARCHING: The Art of Computer Programming Vol III. Addison-Wesley 1968.

    Google Scholar 

  37. D Knuth. An Empirical Study Of FORTRAN Programs. SOFTWARE - PRACTICE AND EXPERIENCE, VOL I. p 105–133. WileyInterscience 1971.

    Google Scholar 

  38. D Knuth. Structured Programming With Co To Statements. Stanford Computer Science Department. Report STAN-CS-74–416. May 1974.

    Google Scholar 

  39. S Madnick. String Processing Techniques. CACM July 1967.

    Google Scholar 

  40. W Maurer. An Improved Hash Code for Scatter Storage. CACM vol 11, no 1 (Jan 68).

    Google Scholar 

  41. D McDermott and G Sussman. The CONNIVER Refererence Manual. AI Memo No. 259. MIT May 1972.

    Google Scholar 

  42. J Minter. Associative Memories and Processors: A descritive appraisal. TR 195 Univ of Maryland, Computer Science Center, College Park, Maryland. July 1972.

    Google Scholar 

  43. N Minsky. Rotating Storage Devices As Partially Associative Memories. Technical Report 72–4. Computer Information and Control Sciences. Univerity of Minnesota. April 28, 1972.

    Google Scholar 

  44. J Morris. A Comparison of MADCAP and SETL. University of California, Los Alamos Scientific Laboratory. 1973

    Google Scholar 

  45. R Morris. Scatter Storage Techniques. CACM vol I I, no I(Jan 68)

    Google Scholar 

  46. B Parhami. RAPID: A Rotating Associative Processor For Information Dissemination. UCLA - ENG 7213 Feb. 1972. Comp. Sci Dept.

    Google Scholar 

  47. S Randall. A Relational Model of Data for the Determination of Optimum Computer Storage Structures. Department of Electrical Engineering, Systems Engineering Laboratory Tech Report 54. University of Michigan, Ann Arbor Sept 1971

    Google Scholar 

  48. R Rivest. Analysis of Associative Retrieval Algorithms. Ph. D. Thesis Stanford Computer Science Department 1974.

    Google Scholar 

  49. J Schwartz. More Detailed Suggestions Concerning “Data Strategy” Elaboration For SETL. SETL Newsletter 39. NYU Courant Institute. May 1971.

    Google Scholar 

  50. J Schwartz. Automatic And Semiautomatic Optimization in SET L. SIGPLAN Notices, vol 9, no 4. (April 1974).

    Google Scholar 

  51. J Schwartz. Automatic Data Structure Choice in a Language of Very High Level. Courant Institute, NYU. 1974.

    Google Scholar 

  52. D Smith and H Enea. Backtracking in MLISP2. Proceedings of the Third IJCAI. 1973.

    Google Scholar 

  53. G Sussman, T Winograd, and E Charniak. MICRO-PLANNER Reference Manual. AI MEMO 203, Project MAC, MIT July, 1970.

    Google Scholar 

  54. G Sussman. Why Conniving Is Better Than Planning A. I. Lab. MIT. A. I. Memo 255, FEB, 1972.

    Google Scholar 

  55. L Tesler, H Enea, and D Smith. The LISP70 Pattern Matching System. Proceedings of the Third IJCAI. 1973.

    Google Scholar 

  56. F Tompa and C Gotlieb. Choosing A Storage Schema. Technical Report No. 54. May 1973. Department of Computer Science, University of Toronto. Toronto Canada.

    Google Scholar 

  57. K VanLehn. SAIL User Manual. Stanford Computer Science Technical Report STAN-CS-73. 373. July 1973.

    Google Scholar 

  58. B Wegbreit. The Treatment of Data Types in ELI. Harvard University. 1971

    Google Scholar 

  59. B Wegbreit. Procedure Closure in ELI. TR 13–73 Center for Research in Computing Technology Harvard University May 1973.

    Google Scholar 

  60. B Wegbreit. Mechanical Program Analysis. Xerox Palo Alto Research Center July 1974.

    Google Scholar 

  61. B Wichman. Estimating the execution speed of an ALCOL program. SIGPLAN Notices. vol 7, no 8. Aug 1972.

    Google Scholar 

  62. W Wulf, R Johnsson, C Weinstock, and S Hobbs. The Design of An Optimizing Compiler. Computer Science Department. Carnegie-Mellon University. Pittsburgh, Pennsylvania Dec 1973.

    Google Scholar 

Download references

Authors
  1. James Richard Low
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer Basel AG

About this chapter

Cite this chapter

Low, J.R. (1976). References. In: Automatic Coding: Choice of Data Structures. Interdisciplinary Systems Research / Interdisziplinäre Systemforschung. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-5504-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-5504-4_9

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-7643-0818-6

  • Online ISBN: 978-3-0348-5504-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation