Search by Bookstore
Holdings of Libraries in Japan
This page shows libraries in Japan other than the National Diet Library that hold the material.
Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.
other
CiNii Research
Search ServicePaperYou can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.
Search by Bookstore
Bibliographic Record
You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.
- Material Type
- 図書
- Title
- Author/Editor
- Digital Systems Laboratory
- Author Heading
- Publication, Distribution, etc.
- Place of Publication (Country Code)
- us
- Target Audience
- 一般
- Note (General)
- Published in 1967-: Princeton University. Computer Sciences Laboratory
- Related Material
- The design of hashing functionsFlow graph reducibilitySamplesort : a sampling approach to minimal storage tree sortingIntroduction to the automated synthesis of computersOn the trade-off between response and premption costs in a foreground-background computer service disciplineSequencing tasks in multiprocess, multiple resource systems to avoid deadlocksNear optimal single synchronization error correcting codeA syntax directed translation procedureAn essay on prime implicant tablesBinary encoding of analog signals for noisy channelsControl units for sequencing complex asynchronous operationsSome unsolvable problems and partial solutionsCircuit realization from compressed flow tablesOperating systems principles and undergraduate computer science curriculaA reduction technique for prime implicant tablesThe synthesis of combinational circuits containing hazardsVirtual memoryOn the capabilities of codes to correct synchronization errorsMixed memory type realizations of sequential machinesGeneralized transition matrix of a sequential machine and its applicationsImplication techniques for Boolean functionsSimple deterministic languagesBounded fan-in, bounded fan-out uniform decompositions of synchronous sequential machinesRegister transfers in digital systemsIntroduction to the theory of speed independent asynchronous switching circuitsA characterization of semi-linear setsCode optimization and finite church-rosser systemsPermutations of the elements of matrix by column and row rotationsSelf orthogonal codesFundamental mode and pulse mode sequential circuitsMultiprocessor scheduling of computation graphsComputer science in electrical engineering at Princeton 1968-69Derivation of optimum tests to detect faults in combinational circuitsA conjectured minimax theorem for directed graphsOn the management of multilevel memoriesDerivation of optimum test sequences for sequential machinesAn infinite hierarchy of intersections of context free languagesOn determination of the irredundant covers of a prime implicant tableDetection, prevention and recovery from deadlocks in multiprocess, multiple resource systemsMemory and cycling in bilateral iterative networksCanonical regular expressions and minimal state graphs for definite eventsDeclarations and error location by syntaxA method of producing a Boolean function having an arbitrarily prescribed prime implicant tableOptimal binary search treesWeak and mixed strategy precedence parsingCurrent research in computer scienceExperiments with program localityProperties of the working set modelThe optimal sequencing of computation graphs on two-processor systemsA fast algorithm for the disjunctive decomposition of switching functionsLogical design theory of NOR gate networks with no complemented inputsSequential circuit synthesis using hazards and delaysError propagation and definite decoding of recurrent codesOn the reduction of non-deterministic automataThe synthesis of three-level logic networksProtection -- principles and practiceAn upper bound on the minimum distance of a convolutional codeOn the motion of an unbound Markov queue in random access storageParallel program schemata and maximal parallelismSymbol manipulation by recursionFast algorithms for the elimination of common subexpressionsA register transfer language to describe digital systemsOn the minimum stage realization of switching functions using logic gates with limited fan-inObtaining a minimum-state compressed flow tableThe organization of matrices and matrix operations in a paged multiprogramming environmentA program for the analysis of digital systemsThe properties and design of asynchronous control modulesFinite memory span covers of incompletely specified sequential networksFuzzy properties and almost solvable problemsEquipment configuration in balanced computer systemsReducing variable dependency in combinational circuitsFurther experimental data on the behavior of programs in a paging environmentThe performance of a memory allocation algorithmError correction for formal languagesAn algorithm for the disjunctive decomposition of switching functionsA generalization of the digital operation of electronic devices and circuits
- Related Material (URI)