Thomas N. Hibbard
- 1 HUFFMAN, D.A. A method for the construction of minimum redundancy codes. Proc. I.R.E. 40 (1952), 1098-1101.Google Scholar
- 2 BURGh, W.H. Sorting, trees and measures of order. Informat. Contr. i (1958), 181-197.Google Scholar
- 3 CARR, JON W., III. Recursive subscripting compilers and list-type memories. Comm. ACM 2 (1959), 4-6. Google Scholar
- 4 NEWELL, A., AND SttAW, J.C. Programming the logic theory machine. Proc. Western Joint Comput. Conf. (1957), 230-240.Google Scholar
- 5 SHEm, D.L. A high speed sorting procedure. Comm. ACM 2, No. 7 (1959), 30-32. Google Scholar
- 6 FRANI, R. M., AND LAZkRUS, R. B. A high speed sorting procedure. Comm ACM 3 (1960), 20-22 Google Scholar
- 7 HILDEBltANDT, P., AND ISBITZ, H. Radix exchange--an internal sorting method for digital computers. J. ACM 6 (1959), 156-163. Google Scholar
- 8 NAUER, P. (ed.); BACKUS, J. W., ET AL. Report on the algorithmic language ALGOL 60. Comm. ACM 3 (1960), 299-314. Google Scholar
- 9 HOARE, C. A.R. Algorithms 63 and 64. Comm. ACM 4 (1961), 321.Google Scholar
Index Terms
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
Recommendations
Non-deterministic graph searching in trees
Non-deterministic graph searching was introduced by Fomin et al. to provide a unified approach for pathwidth, treewidth, and their interpretations in terms of graph searching games. Given q 0 , the q-limited search number, s q ( G ) , of a graph G is ...
A combinatorial characterization of the testable graph properties: it's all about regularity
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingA common thread in recent results concerning the testing of dense graphs is the use of Szemerédi's regularity lemma. In this paper we show that in some sense this is not a coincidence. Our first result is that the property defined by having any given ...
Combinatorial PCPs with Efficient Verifiers
The PCP theorem asserts the existence of proofs that can be verified by a verifier that reads only a very small part of the proof. The theorem was originally proved by Arora and Safra (J. ACM 45(1)) and Arora et al. (J. ACM 45(3)) using sophisticated ...
Comments