Ian Parberry

Available identifiers

zbMath Open parberry.ianDBLPp/IanParberryWikidataQ58312205 ScholiaQ58312205MaRDI QIDQ582118

List of research outcomes

Publication	Date of Publication	Type
Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours	2020-01-16	Paper
Solving the \((n^2-1)\)-puzzle with \(\frac{8}{3}n^3\) expected moves	2019-03-26	Paper
The unexpected beauty of modular bivariate quadratic functions	2019-02-14	Paper
A note on nondeterminism in small, fast parallel computers	2018-09-14	Paper
Scattered Sets and Roots of Unity in $\mathbb{Z}/p\mathbb{Z}$	2014-10-10	Paper
3D math primer for graphics and game development	2013-12-06	Paper
Load sharing with parallel priority queues	2000-07-06	Paper
Bounds on the number of knight's tours	1998-03-01	Paper
An efficient algorithm for the Knight's tour problem	1997-07-06	Paper
A real-time algorithm for the \((n^{2}-1)\)-puzzle	1997-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q4875278	1996-04-28	Paper
Learning with discrete multivalued neurons	1996-02-26	Paper
https://portal.mardi4nfdi.de/entity/Q4841566	1995-08-08	Paper
Exponential size lower bounds for some depth three circuits	1995-02-13	Paper
Two fast parallel prime number sieves	1994-10-12	Paper
Computing with discrete multi-valued neurons	1993-01-17	Paper
Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes	1991-01-01	Paper
A computer-assisted optimal depth lower bound for nine-input sorting networks	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3484350	1990-01-01	Paper
An optimal time bound for oblivious routing	1990-01-01	Paper
Single-exception sorting networks and the computational complexity of optimal sorting network verification	1990-01-01	Paper
Constructing sorting networks from k-sorters	1989-01-01	Paper
Parallel computation with threshold functions	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3801042	1987-01-01	Paper
Some practical simulations of impractical parallel computers	1987-01-01	Paper
An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits	1987-01-01	Paper
On the time required to sum n semigroup elements on a parallel machine with simultaneous writes	1987-01-01	Paper
On the construction of parallel computers from various basis of Boolean functions	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3751010	1986-01-01	Paper
On recurrent and recursive interconnection patterns	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3746884	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3746885	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3677183	1985-01-01	Paper

Research outcomes over time

This page was built for person: Ian Parberry