All Outputs (2)

Program schemes, arrays, Lindström quantifiers and zero-one laws (2002)
Journal Article
Stewart, I. (2002). Program schemes, arrays, Lindström quantifiers and zero-one laws. Theoretical Computer Science, 275(1-2), 283-310. https://doi.org/10.1016/s0304-3975%2801%2900183-9

We characterize the class of problems accepted by a class of program schemes with arrays, NPSA, as the class of problems defined by the sentences of a logic formed by extending first-order logic with a particular uniform (or vectorized) sequence of L... Read More about Program schemes, arrays, Lindström quantifiers and zero-one laws.

Fault-tolerant embeddings of Hamiltonian circuits in k-ary n-cubes (2002)
Journal Article
Ashir, Y., & Stewart, I. (2002). Fault-tolerant embeddings of Hamiltonian circuits in k-ary n-cubes. SIAM Journal on Discrete Mathematics, 15(3), 317-328. https://doi.org/10.1137/s0895480196311183

We consider the fault-tolerant capabilities of networks of processors whose underlying topology is that of the k-ary n-cube $Q_n^k$, where k > 2 and n > 1. In particular, given a copy of $Q_n^k$ where some of the inter-processor links may be faulty b... Read More about Fault-tolerant embeddings of Hamiltonian circuits in k-ary n-cubes.