Journal ArticleDOI
Observations on the Complexity of Generating Quasi-Gray Codes
Reads0
Chats0
TLDR
A decision tree-like model for defining and measuring the on-line complexity of algorithms for generating combinatorial objects is developed and the amount of data structure update required to generate the successor to a given codeword is emphasized.Abstract:
The purpose of this paper is to develop a decision tree-like model for defining and measuring the on-line complexity of algorithms for generating combinatorial objects. For the purpose of illustration, we consider the problem of generating Gray codes and simple generalizations of Gray codes. We include some results pertaining to the generation of certain special codes and, in addition, we present a trade-off theorem. Our model is information theoretical and we emphasize two aspects of complexity; the amount of information that must be gathered and the amount of data structure update required to generate the successor to a given codeword.read more
Citations
More filters
Journal ArticleDOI
A Survey of Combinatorial Gray Codes
TL;DR: The area of combinatorial Gray codes is surveyed, recent results, variations, and trends are described, and some open problems are highlighted.
Journal ArticleDOI
Complexity models for incremental computation
TL;DR: This work defines complexity classes that capture the intuitive notion of incremental efficiency and study their relation to existing complexity classes and shows that problems that have small sequential space complexity also have small incremental time complexity.
Journal ArticleDOI
The Complexity of Maintaining an Array and Computing Its Partial Sums
TL;DR: A trade-off between the complexmes of (a) versus (b) is observed, and the informatlon-theoreuc complexity measure counts the number of accesses and changes to a random access memory.
Proceedings ArticleDOI
Are bitvectors optimal
TL;DR: Deterministic schemes for the static membership problem are considered and tradeoffs between space and the number of probes are shown.
Proceedings ArticleDOI
Lower bounds for union-split-find related problems on random access machines
TL;DR: This work proves Ω(√log log n) lower bounds on the random access machine complexity of several dynamic, partially dynamic and static data structure problems, including the union-split-find problem, dynamic prefix problems and one-dimensional range query problems.