Outputs (6)

Pancyclicity and panconnectivity in augmented k-ary n-cubes (2009)
Presentation / Conference Contribution
Xiang, Y., & Stewart, I. (2009, December). Pancyclicity and panconnectivity in augmented k-ary n-cubes. Presented at The Fifteenth International Conference on Parallel and Distributed Systems : ICPADS'09, Shenzhen, China

The augmented k-ary n-cube AQ_{n,k} is a recently proposed interconnection network that incorporates an extension of a k-ary n-cube Q_n^k inspired by the extension of a hypercube Q_n to the augmented hypercube AQ_n (as developed by Choudom and Sunita... Read More about Pancyclicity and panconnectivity in augmented k-ary n-cubes.

On the power of deep pushdown stacks (2009)
Journal Article
Arratia-Quesada, A., & Stewart, I. (2009). On the power of deep pushdown stacks. Acta Informatica, 46(7), 509-531. https://doi.org/10.1007/s00236-009-0103-x

Inspired by recent work of Meduna on deep pushdown automata, we consider the computational power of a class of basic program schemes, NPSDSs, based around assignments, while-loops and non-deterministic guessing but with access to a deep pushdown stac... Read More about On the power of deep pushdown stacks.

Pancyclicity in faulty k-ary 2-cubes (2009)
Presentation / Conference Contribution
Xiang, Y., & Stewart, I. (2009, November). Pancyclicity in faulty k-ary 2-cubes. Presented at Proceedings of 21st International Conference on Parallel and Distributed Computing and Systems, PDCS'09., Cambridge, Massachusetts, USA

We prove that a k-ary 2-cube $Q_k^2$ with 3 faulty edges but where every vertex is incident with at least 2 healthy edges is bipancyclic, if k ≥ 3, and k-pancyclic, if k ≥ 5 is odd (these results are optimal).

Logical and complexity-theoretic aspects of models of computation with restricted access to arrays (2009)
Journal Article
Stewart, I. (2009). Logical and complexity-theoretic aspects of models of computation with restricted access to arrays. Journal of Logic and Computation, 19(1), 217-242. https://doi.org/10.1093/logcom/exn025

We study a class of program schemes, NPSB, in which, aside from basic assignments, non-deterministic guessing and while loops, we have access to arrays; but where these arrays are binary write-once in that they are initialized to 'zero' and can only... Read More about Logical and complexity-theoretic aspects of models of computation with restricted access to arrays.

Program schemes, queues, the recursive spectrum and zero-one laws (2009)
Journal Article
Stewart, I. (2009). Program schemes, queues, the recursive spectrum and zero-one laws. Fundamenta Informaticae, 91(2), 411-435. https://doi.org/10.3233/fi-2009-0050

We prove that a very basic class of program schemes augmented with access to a queue and an additional numeric universe within which counting is permitted, so that the resulting class is denoted NPSQ$_+(1)$, is such that the class of problems accepte... Read More about Program schemes, queues, the recursive spectrum and zero-one laws.

Bipanconnectivity and bipancyclicity in k-ary n-cubes (2009)
Journal Article
Stewart, I., & Xiang, Y. (2009). Bipanconnectivity and bipancyclicity in k-ary n-cubes. IEEE Transactions on Parallel and Distributed Systems, 20(1), 25-33. https://doi.org/10.1109/tpds.2008.45

In this paper we give precise solutions to problems posed by Wang, An, Pan, Wang and Qu and by Hsieh, Lin and Huang. In particular, we show that Q_n^k is bipanconnected and edge-bipancyclic, when k ≥ 3 and n ≥ 2, and we also show that when k is odd,... Read More about Bipanconnectivity and bipancyclicity in k-ary n-cubes.