default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of the ACM, Volume 21, 1974
Volume 21, Number 1, January 1974
- David G. Herr:
On a Statistical Model of Strand and Westwater for the Numerical Solution of a Fredholm Integral Equation of the First Kind. 1-5 - Nai-Kuan Tsao:
Some a Posteriori Error Bounds in Floating-Point Computations. 6-17 - Leonard W. Cotten, A. M. Abd-Alla:
Processing Times for Segmented Jobs with I/O Compute Overlap. 18-30 - Peter A. Franaszek, Terry J. Wagner:
Some Distribution-Free Aspects of Paging Algorithm Performance. 31-39 - Giorgio P. Ingargiola, James F. Korsh:
Finding Optimal Demand Paging Algorithms. 40-53 - Debasis Mitra:
Some Aspects of Hierarchical Memory Systems. 54-65 - Kenneth C. Sevcik:
Scheduling for Minimum Total Loss Using Service Time Distributions. 66-75 - Christopher Earnest:
Some Topics in Code Optimization. 76-102 - Michael A. Crane, Donald L. Iglehart:
Simulating Stable Stochastic Systems, I: General Multiserver Queues. 103-113 - Michael A. Crane, Donald L. Iglehart:
Simulating Stable Stochastic Systems, II: Markov Chains. 114-123 - S. Fleisig, Donald W. Loveland, A. K. Smiley III, D. L. Yarmush:
An Implementation of the Model Elimination Proof Procedure. 124-139 - Walter H. Kohler, Kenneth Steiglitz:
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems. 140-156 - Pieter S. Kritzinger, J. W. Graham:
A Theorem in the Theory of Compromise Merge Methods. 157-160 - Mary Shaw
, Joseph F. Traub:
On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives. 161-167 - Robert A. Wagner, Michael J. Fischer:
The String-to-String Correction Problem. 168-173
Volume 21, Number 2, April 1974
- Donald Michie, E. E. Sibert:
Some Binary Derivation Systems. 175-190 - Ross A. Overbeek:
A New Class of Automated Theorem-Proving Algorithms. 191-200 - Richard P. Brent:
The Parallel Evaluation of General Arithmetic Expressions. 201-206 - David Pager:
Further Results on the Problem of Finding Minimal Length Programs for Decision Tables. 207-212 - Armen Gabrielian, Seymour Ginsburg:
Grammar Schemata. 213-226 - Gerald Berman, A. W. Colijn:
A Modified List Technique Allowing Binary Search. 227-232 - Robert T. Chien, Edward Abraham Mark:
A Document Storage Method Based on Polarized Distance. 233-245 - Peter Elias:
Efficient Storage and Retrieval by Content and Address of Static Files. 246-260 - M. M. Blevins, G. W. Stewart:
Calculating the Eigenvectors of Diagonally Dominant Matrices. 261-271 - Shalhav Zohar:
The Solution of a Toeplitz Set of Linear Equations. 272-276 - Ellis Horowitz, Sartaj Sahni:
Computing Partitions with Applications to the Knapsack Problem. 277-292 - William J. Gordon, Richard F. Riesenfeld:
Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces. 293-310 - Charles B. Dunham:
Efficiency of Chebyshev Approximation on Finite Subsets. 311-313 - E. Balkovich, W. Chiu, Leon Presser, R. Wood:
Comments on a Paper by Gaver. 314-315 - Hisashi Kobayashi:
Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions. 316-328 - J. A. Michel, Edward G. Coffman Jr.:
Synthesis of a Feedback Queueing Discipline for Computer Operation. 329-339 - Steven Katz, Alan G. Konheim:
Priority Disciplines in a Loop System. 340-349 - Manfred H. Hueckel:
Erratum: "A Local Visual Operator Which Recognizes Edges and Lines". 350 - Christopher Earnest:
Corrigendum: "Some Topics in Code Optimization". 350
Volume 21, Number 3, July 1974
- Ramachendra P. Batni, Jeffrey D. Russell, Charles R. Kime:
An Efficient Algorithm for Finding an Irredundant Set Cover. 351-355 - Robert M. Haralick:
The Diclique Representation and Decomposition of Binary Relations. 356-366 - Matthew S. Hecht, Jeffrey D. Ullman:
Characterizations of Reducible Flow Graphs. 367-375 - Edgar M. Palmer, M. A. Rahimi, Robert W. Robinson:
Efficiency of a Binary Comparison Storage Technique. 376-384 - Chung C. Wang:
An Algorithm for the Chromatic Number of a Graph. 385-391 - C. K. Wong, Don Coppersmith:
A Combinatorial Problem Related to Multimodule Memory Organizations. 392-402 - Gregory J. Chaitin:
Information-Theoretic Limitations of Formal Systems. 403-424 - John Gill, Manuel Blum:
On Almost Everywhere Complex Recursive Functions. 425-435 - Lenhart K. Schubert:
Iterated Limiting Recursion and the Program Minimization Problem. 436-445 - Thomas N. Hibbard:
Context-Limited Grammars. 446-453 - Paul L. Richman:
Computing a Subinterval of the Image. 454-458 - Hisashi Kobayashi:
Application of the Diffusion Approximation to Queueing Networks II: Nonequilibrium Distributions and Applications to Computer Modeling. 459-469 - Alan G. Konheim, Bernd Meister:
Waiting Lines and Times in a System with Polling. 470-490 - John Michael Robson:
Bounds for Some Functions Concerning Dynamic Storage Allocation. 491-499 - Mandell Bellmore, Saman Hong:
Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem. 500-504 - Leslie E. Trotter Jr., C. M. Shetty:
An Algorithm for the Bounded Variable Integer Programming Problem. 505-513 - Trevor I. Fenner, George Loizou:
Some New Bounds on the Condition Numbers of Optimally Scaled Matrices. 514-524
Volume 21, Number 4, October 1974
- Michael A. Harrison, Ivan M. Havel:
On the Parsing of Deterministic Languages. 525-548 - John E. Hopcroft, Robert Endre Tarjan:
Efficient Planarity Testing. 549-568 - Philippe G. H. Lehot:
An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph. 569-575 - Frank Rubin:
A Search Procedure for Hamilton Paths and Circuits. 576-580 - Robert J. Plemmons:
Linear Least Squares by Elimination and MGS. 581-585 - Paul S. Wang:
The Undecidability of the Existence of Zeros of Real Elementary Functions. 586-589 - Lawrence J. Henschen, Larry Wos:
Unit Refutations and Horn Sets. 590-605 - Arthur J. Nevins:
A Human Oriented Logic for Automatic Theorem-Proving. 606-621 - James R. Slagle:
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity. 622-642 - H. T. Kung, Joseph F. Traub:
Optimal Order of One-Point and Multipoint Iteration. 643-651 - Arnold L. Rosenberg:
Allocating Storage for Extendible Arrays. 652-670 - Ravi Sethi:
Testing for the Church-Rosser Property. 671-679 - Anthony S. Wojcik, Gernot Metze:
An Analysis of Some Relationships Between Post and Boolean Algebras. 680-696
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-09 23:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
