Ian Parberry

From MaRDI portal
Person:582118

Available identifiers

zbMath Open parberry.ianDBLPp/IanParberryWikidataQ58312205 ScholiaQ58312205MaRDI QIDQ582118

List of research outcomes





PublicationDate of PublicationType
Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours2020-01-16Paper
Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves2019-03-26Paper
The unexpected beauty of modular bivariate quadratic functions2019-02-14Paper
A note on nondeterminism in small, fast parallel computers2018-09-14Paper
Scattered Sets and Roots of Unity in $\mathbb{Z}/p\mathbb{Z}$2014-10-10Paper
3D math primer for graphics and game development2013-12-06Paper
Load sharing with parallel priority queues2000-07-06Paper
Bounds on the number of knight's tours1998-03-01Paper
An efficient algorithm for the Knight's tour problem1997-07-06Paper
A real-time algorithm for the \((n^{2}-1)\)-puzzle1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48752781996-04-28Paper
Learning with discrete multivalued neurons1996-02-26Paper
https://portal.mardi4nfdi.de/entity/Q48415661995-08-08Paper
Exponential size lower bounds for some depth three circuits1995-02-13Paper
Two fast parallel prime number sieves1994-10-12Paper
Computing with discrete multi-valued neurons1993-01-17Paper
Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes1991-01-01Paper
A computer-assisted optimal depth lower bound for nine-input sorting networks1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34843501990-01-01Paper
An optimal time bound for oblivious routing1990-01-01Paper
Single-exception sorting networks and the computational complexity of optimal sorting network verification1990-01-01Paper
Constructing sorting networks from k-sorters1989-01-01Paper
Parallel computation with threshold functions1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38010421987-01-01Paper
Some practical simulations of impractical parallel computers1987-01-01Paper
An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits1987-01-01Paper
On the time required to sum n semigroup elements on a parallel machine with simultaneous writes1987-01-01Paper
On the construction of parallel computers from various basis of Boolean functions1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37510101986-01-01Paper
On recurrent and recursive interconnection patterns1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37468841986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37468851986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36771831985-01-01Paper

Research outcomes over time

This page was built for person: Ian Parberry