The following pages link to Communications of the ACM (Q64670):
Displaying 50 items.
- Maintaining knowledge about temporal intervals (Q64672) (← links)
- Algorithm 478: Solution of an Overdetermined System of Equations in the l1 Norm [F4] (Q92938) (← links)
- Pracniques: further remarks on reducing truncation errors (Q110768) (← links)
- ImageNet classification with deep convolutional neural networks (Q140484) (← links)
- Multidimensional divide-and-conquer (Q148390) (← links)
- Secure communications over insecure channels (Q2816444) (← links)
- Use of the Hough transformation to detect lines and curves in pictures (Q2921160) (← links)
- Estimation of the inverse function for random variate generation (Q3036567) (← links)
- Optimal paths in graphs with stochastic or multidimensional weights (Q3040947) (← links)
- On improving the worst case running time of the Boyer-Moore string matching algorithm (Q3048242) (← links)
- Progressive acyclic digraphs—a tool for database integrity (Q3048267) (← links)
- An optimal insertion algorithm for one-sided height-balanced binary search trees (Q3048275) (← links)
- Storing a sparse table (Q3049828) (← links)
- Breaking substitution ciphers using a relaxation algorithm (Q3050282) (← links)
- How to share a secret (Q3050283) (← links)
- A fast string searching algorithm (Q3090391) (← links)
- Solving the biharmonic equation in a square (Q3212599) (← links)
- An algorithm for the approximate solution of Wiener-Hopf integral equations (Q3212607) (← links)
- Fen—an axiomatic basis for program semantics (Q3212622) (← links)
- Optimum data base reorganization points (Q3212647) (← links)
- A class of dynamic memory allocation algorithms (Q3212648) (← links)
- Using page residency to select the working set parameter (Q3212669) (← links)
- Some approaches to best-match file searching (Q3212705) (← links)
- A generalization of AVL trees (Q3212707) (← links)
- A method of bivariate interpolation and smooth surface fitting based on local procedures (Q3214276) (← links)
- Least squares piecewise cubic curve fitting (Q3214277) (← links)
- A fast method for solving a class of tridiagonal linear systems (Q3214290) (← links)
- Tridiagonalization by permutations (Q3214292) (← links)
- A statistical study of the accuracy of floating point number systems (Q3214298) (← links)
- A parser-generating system for constructing compressed compilers (Q3214368) (← links)
- A note on sub-expression ordering in the execution of arithmetic expressions (Q3214372) (← links)
- A nonrecursive list moving algorithm (Q3214381) (← links)
- A note on information organization and storage (Q3214383) (← links)
- An array grammar programming system (Q3214397) (← links)
- Implementation of a high level language machine (Q3214420) (← links)
- Experiment with an automatic theorem-prover having partial ordering inference rules (Q3214440) (← links)
- Reentrant polygon clipping (Q3214446) (← links)
- Minimal event-node network of project precedence relations (Q3214808) (← links)
- On the equivalence and transformation of program schemes (Q3250049) (← links)
- Recursive curve fitting technique (Q3250882) (← links)
- A programmed binary counter for the IBM type 650 calculator (Q3250914) (← links)
- Recursive subscripting compilers and list-type memories (Q3251716) (← links)
- Binary conversion, with fixed decimal precision, of a decimal fraction (Q3252087) (← links)
- On matrix program schemes (Q3252117) (← links)
- Programming for a machine with an extended address calculational mechanism (Q3252119) (← links)
- Variable-width tables with binary-search facility (Q3252120) (← links)
- Algebraic formulation of flow diagrams (Q3252126) (← links)
- Simple automatic coding systems (Q3252131) (← links)
- The problem of programming communication with changing machines (Q3252132) (← links)
- Proposal for an UNCOL (Q3252134) (← links)
