No description available.

Loopless algorithms are an interesting challenge in the field of combinatorial generation. These algorithms must generate each combinatorial object from its predecessor in no more than a constant number of instructions, thus achieving theoretically minimal time complexity. This constraint rules out powerful programming techniques such as iteration and recursion, which makes loopless algorithms harder to develop and less intuitive than other algorithms. This thesis discusses a divide-and-conquer approach by which loopless algorithms can be developed more easily and intuitively: fusing loopless algorithms. If a combinatorial generation problem can be divided into subproblems, it may be possible to conquer it looplessly by fusing loopless algorithms for its subproblems. A key advantage of this approach is that is allows existing loopless algorithms to be reused. This approach is not novel, but it has not been generalised before. This thesis presents a general framework for fusing loopless algorithms, and discusses its implications. It then applies this approach to two combinatorial generation problems and presents two new loopless algorithms. The first new algorithm, MIXPAR, looplessly generates well-formed parenthesis strings comprising two types of parentheses. It is the first loopless algorithm for generating these objects. The second new algorithm, MULTPERM, generates multiset permutations in linear space using only arrays, a benchmark recently set by Korsh and LaFollette (2004). Algorithm MULTPERM is evaluated against Korsh and LaFollette's algorithm, and shown to be simpler and more efficient in both space and time.

Thesis (Ph. D.)--University of Wyoming, 2005. / Title from PDF title page (viewed on Feb. 22, 2008). Includes bibliographical references (p. 136-139).

Thesis (Ph.D.)--University of Adelaide, School of Architecture, Landscape Architecture and Urban Design, 2000? / Bibliography: leaves 231-239.

Thesis(B.Sc.(Hons. ))--University of Adelaide, dept. of Mathematics, 1968.

Thesis (M.Sc.). / Title from title page of PDF (viewed 2008/01/30). Written for the School of Computer Science. Includes bibliographical references.

Thesis (Ph. D.)--Virginia Polytechnic Institute and State University, 1992. / Vita. Abstract. Includes bibliographical references (leaves 172-179). Also available via the Internet.

Thesis (M.S.)--Rochester Institute of Technology, 1991. / Typescript. Includes bibliographical references.

Thesis (Ph. D.)--University of Sydney, 2003. / Title from title screen (viewed 16 April 2008). Submitted in fulfilment of the requirements for the degree of Doctor of Philosophy to the School of Information Technologies, Faculty of Science. Includes bibliographical references. Also available in print form.

Thesis (Ph.D.)--Computing, Georgia Institute of Technology, 2008. / Committee Chair: Vazirani, Vijay; Committee Member: Cook, William; Committee Member: Kalai, Adam; Committee Member: Tetali, Prasad; Committee Member: Thomas, Robin