| 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
Algorithms | 2019-03-26 | Paper |
The unexpected beauty of modular bivariate quadratic functions
Journal of Mathematics and the Arts | 2019-02-14 | Paper |
A note on nondeterminism in small, fast parallel computers
IEEE Transactions on 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
Journal of Computer and System Sciences | 2000-07-06 | Paper |
Bounds on the number of knight's tours
Discrete Applied Mathematics | 1998-03-01 | Paper |
An efficient algorithm for the Knight's tour problem
Discrete Applied Mathematics | 1997-07-06 | Paper |
A real-time algorithm for the \((n^{2}-1)\)-puzzle
Information Processing Letters | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 872005 (Why is no real title available?) | 1996-04-28 | Paper |
Learning with discrete multivalued neurons
Journal of Computer and System Sciences | 1996-02-26 | Paper |
| scientific article; zbMATH DE number 782630 (Why is no real title available?) | 1995-08-08 | Paper |
Exponential size lower bounds for some depth three circuits
Information and Computation | 1995-02-13 | Paper |
Two fast parallel prime number sieves
Information and Computation | 1994-10-12 | Paper |
Computing with discrete multi-valued neurons
Journal of Computer and System Sciences | 1993-01-17 | Paper |
Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
SIAM Journal on Computing | 1991-01-01 | Paper |
A computer-assisted optimal depth lower bound for nine-input sorting networks
Mathematical Systems Theory | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4155875 (Why is no real title available?) | 1990-01-01 | Paper |
An optimal time bound for oblivious routing
Algorithmica | 1990-01-01 | Paper |
Single-exception sorting networks and the computational complexity of optimal sorting network verification
Mathematical Systems Theory | 1990-01-01 | Paper |
Constructing sorting networks from k-sorters
Information Processing Letters | 1989-01-01 | Paper |
Parallel computation with threshold functions
Journal of Computer and System Sciences | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4068238 (Why is no real title available?) | 1987-01-01 | Paper |
Some practical simulations of impractical parallel computers
Parallel Computing | 1987-01-01 | Paper |
An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits
Information Processing Letters | 1987-01-01 | Paper |
On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
Theoretical Computer Science | 1987-01-01 | Paper |
On the construction of parallel computers from various basis of Boolean functions
Theoretical Computer Science | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3988712 (Why is no real title available?) | 1986-01-01 | Paper |
On recurrent and recursive interconnection patterns
Information Processing Letters | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3982516 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3982517 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3898252 (Why is no real title available?) | 1985-01-01 | Paper |
