Collection View
On The Motion Of An Unbounded Markov Queue In Random Access Storage, November 1967, 1967 November
An Algorithm For The Disjunctive Decomposition Of Switching Functions, November 1968, 1968 November
Samplesort: A Sampling Approach To Minimal Storage Tree Sorting, November 1968, 1968 November
A Fast Algorithm For The Disjunctive Decomposittion Of Switching Functions, July 1969, 1969 July
Sequencing Tasks In Multiprocess, Multiple Resource Systems To Avoid Deadlocks, June 1969, 1969 June
Polynomial Completeness Of The Equal Execution Time Scheduling Program, December 1972, 1972 December
A Linear Space Algorithm For Computing Maximal Common Subsequences., September 1973, 1973 September
Verifying Programs With Concurrent Operations On Structured Data, February 1975, 1975 February
Functional Approximation With Variable-Knot Variable-Degree Splines*, February 1976, 1976 February
The Interaction Between Functional Dependencies And Template Dependencies, March 1980, 1980 March
Towards An E-Approximation Scheme For Generalized Satisfiability, December 1981, 1981 December
Finding Square Roots Modulo A Prime, Primality Testing, And Factoring, February 1982, 1982 February
Area-Optimal Graph Embeddings For VLSI In Rectangles Of Varying Aspect Ratio, April 1982, 1982 April
Using A Massive Memory Machine For Research In Cognitive Science, September 1984, 1984 September
The Use of Algorithms of Piecewise Approximations for Picture Processing Applications, 1974 May
- Scope and Contents
Consists of technical reports from the Computer Sciences Laboratory.
- General
(ST)QA75.5T723 p.2
- Processing Information
Finding aid written by Engineering Library Staff in 2011
- Conditions Governing Access
The School of Engineering and Applied Science technical reports are in the circulating collection of the Lewis Science and Engineering Library on the B floor of the Fine Hall Wing. Email englib@princeton.edu for questions or digitization of materials upon request.
- Conditions Governing Use
Single copies may be made for research purposes. To cite or publish quotations that fall within Fair Use, as defined under U. S. Copyright Law, no permission is required. For instances beyond Fair Use, it is the responsibility of the researcher to determine whether any permissions related to copyright, privacy, publicity, or any other rights are necessary for their intended use of the Library's materials, and to obtain all required permissions from any existing rights holders, if they have not already done so. Princeton University Library's Special Collections does not charge any permission or use fees for the publication of images of materials from our collections, nor does it require researchers to obtain its permission for said use. The department does request that its collections be properly cited and images credited. More detailed information can be found on the Copyright, Credit and Citations Guidelines page on our website. If you have any questions, please feel free to contact us through the Ask Us! form.
- Credit this material:
Computer Sciences Laboratory Technical Reports, 1967-1985; Technical and Scientific Reports, Engineering Library, Princeton University Library
- Permanent URL:
- http://arks.princeton.edu/ark:/88435/44558d382
- Location:
-
Fine Hall B FloorPrinceton, NJ 08540, USA
