The following pages link to Communications of the ACM (Q64670):
Displaying 50 items.
- On improving the worst case running time of the Boyer-Moore string matching algorithm (Q3048242) (← links)
- An optimal insertion algorithm for one-sided height-balanced binary search trees (Q3048275) (← links)
- How to share a secret (Q3050283) (← links)
- A fast string searching algorithm (Q3090391) (← links)
- On programming of arithmetic operations (Q3259307) (← links)
- Possible modification to the international algebraic language (Q3260817) (← links)
- RUNCIBLE—algebraic translation on a limited computer (Q3262546) (← links)
- Topological ordering of a list of randomly-numbered elements of a network (Q3283231) (← links)
- Program design by informal English descriptions (Q3668828) (← links)
- An overview of computational complexity (Q3759938) (← links)
- Combinatorics, complexity, and randomness (Q3783491) (← links)
- Generality in artificial intelligence (Q3787425) (← links)
- A locally adaptive data compression scheme (Q3794067) (← links)
- An empirical study of minimal storage sorting (Q3849244) (← links)
- Updating mean and variance estimates (Q3852944) (← links)
- Generating gamma variates by a modified rejection technique (Q3925781) (← links)
- Plane-sweep algorithms for intersecting geometric figures (Q3953198) (← links)
- Finding circles by an array of accumulators (Q4050200) (← links)
- Efficient string matching (Q4055184) (← links)
- Guarded commands, nondeterminacy and formal derivation of programs (Q4066568) (← links)
- On self-organizing sequential search heuristics (Q4079040) (← links)
- Complexity of computations (Q4127384) (← links)
- Abstract data types and the development of data structures (Q4127984) (← links)
- Abstraction mechanisms in CLU (Q4136503) (← links)
- A data structure for manipulating priority queues (Q4147586) (← links)
- On the complexity of computing the measure of ∪[a <sub>i</sub> ,b <sub>i</sub> ] (Q4157950) (← links)
- Communicating sequential processes (Q4162644) (← links)
- Implementing Quicksort programs (Q4167589) (← links)
- Distributed processes (Q4174727) (← links)
- Formal requirements for virtualizable third generation architectures (Q4769979) (← links)
- A method for finding Hamilton paths and Knight's tours (Q4962337) (← links)
- An experiment in a user-oriented computer system (Q5335666) (← links)
- On a divide-and-correct method for variable precision division (Q5337539) (← links)
- An improved equivalence algorithm (Q5337563) (← links)
- Correspondence between ALGOL 60 and Church's Lambda-notation (Q5345264) (← links)
- Letters to the editor: syntax and generalization of ALGOL 60 (Q5507988) (← links)
- The next 700 programming languages (Q5528159) (← links)
- The remaining trouble spots in ALGOL 60 (Q5529040) (← links)
- More on integer conversion (Q5543083) (← links)
- Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations (Q5544723) (← links)
- The structure of the “THE”-multiprogramming system (Q5548674) (← links)
- Computers in group theory (Q5554714) (← links)
- A program to teach programming (Q5581150) (← links)
- The nucleus of a multiprogramming system (Q5585060) (← links)
- The mobile programming system (Q5591931) (← links)
- An algorithm for deriving the equations of mathematical physics by symbolic manipulation (Q5615088) (← links)
- Program development by stepwise refinement (Q5617313) (← links)
- Proof of a program (Q5621948) (← links)
- A machine program for theorem-proving (Q5621961) (← links)
- Applications of symbol manipulation in theoretical physics (Q5623223) (← links)
