 | 2007 |
|---|
| 42 |       | Erik Carson,
Ian Parberry,
Bradley Jensen:
Algorithm explorer: visualizing algorithms in a 3D multimedia environment.
SIGCSE 2007: 155-159 |
| 41 | | Timothy Roden,
Ian Parberry,
David Ducrest:
Toward mobile entertainment: A paradigm for narrative-based audio only games.
Sci. Comput. Program. 67(1): 76-90 (2007) |
| 2006 |
|---|
| 40 | | Ursula Wolz,
Tiffany Barnes,
Ian Parberry,
Michael R. Wick:
Digital gaming as a vehicle for learning.
SIGCSE 2006: 394-395 |
| 39 | | Ian Parberry,
Max B. Kazemzadeh,
Timothy Roden:
The art and science of game programming.
SIGCSE 2006: 510-514 |
| 2005 |
|---|
| 38 | | Timothy Roden,
Ian Parberry:
Designing a narrative-based audio only 3D game engine.
Advances in Computer Entertainment Technology 2005: 274-277 |
| 37 | | Timothy Roden,
Ian Parberry:
Clouds and stars: efficient real-time procedural sky rendering using 3D hardware.
Advances in Computer Entertainment Technology 2005: 434-437 |
| 36 | | Ian Parberry,
Timothy Roden,
Max B. Kazemzadeh:
Experience with an industry-driven capstone course on game programming: extended abstract.
SIGCSE 2005: 91-95 |
| 35 | | Gene Eu Jan,
Ki-Yin Chang,
Su Gao,
Ian Parberry:
A 4-geometry maze router and its application on multiterminal nets.
ACM Trans. Design Autom. Electr. Syst. 10(1): 116-135 (2005) |
| 34 | | Timothy Roden,
Ian Parberry:
Portholes and planes: faster dynamic evaluation of potentially visible sets.
Computers in Entertainment 3(2): 3 (2005) |
| 2004 |
|---|
| 33 | | Timothy Roden,
Ian Parberry:
From Artistry to Automation: A Structured Methodology for Procedural Content Creation.
ICEC 2004: 151-156 |
| 1997 |
|---|
| 32 | | Ian Parberry:
An Efficient Algorithm for the Knight's Tour Problem.
Discrete Applied Mathematics 73(3): 251-260 (1997) |
| 31 | | Olaf Kyek,
Ian Parberry,
Ingo Wegener:
Bounds on the Number of Knight's Tours.
Discrete Applied Mathematics 74(2): 171-181 (1997) |
| 1996 |
|---|
| 30 | | Ian Parberry,
Hung-Li Tseng:
Are Hopfield Networks Faster than Conventional Computers?
NIPS 1996: 239-245 |
| 29 | | Ian Parberry:
Scalability of a neural network for the knight's tour problem.
Neurocomputing 12(1): 19-33 (1996) |
| 1995 |
|---|
| 28 | | Ian Parberry:
A Real-Time Algorithm for the (n²-1)-Puzzle.
Inf. Process. Lett. 56(1): 23-28 (1995) |
| 27 |  | Ian Parberry:
Load Sharing with Parallel Priority Queues.
J. Comput. Syst. Sci. 50(1): 64-73 (1995) |
| 1994 |
|---|
| 26 | | Pei Yuan Yan,
Ian Parberry:
Exponential Size Lower Bounds for Some Depth Three Circuits
Inf. Comput. 112(1): 117-130 (1994) |
| 25 | | Ian Parberry:
A Guide for New Referees in Theoretical Computer Science
Inf. Comput. 112(1): 96-116 (1994) |
| 24 | | Jonathan Sorenson,
Ian Parberry:
Two Fast Parallel Prime Number Sieves
Inf. Comput. 114(1): 115-130 (1994) |
| 23 | | Zoran Obradovic,
Ian Parberry:
Learning with Discrete Multi-valued Neurons.
J. Comput. Syst. Sci. 49(2): 375-390 (1994) |
| 1992 |
|---|
| 22 | | Zoran Obradovic,
Ian Parberry:
Computing with Discrete Multi-Valued Neurons.
J. Comput. Syst. Sci. 45(3): 471-492 (1992) |
| 21 | | Ian Parberry:
The Pairwise Sorting Network.
Parallel Processing Letters 2: 205-211 (1992) |
| 1991 |
|---|
| 20 | | Ian Parberry:
On the Computational Complexity of Optimal Sorting Network Verification.
PARLE (1) 1991: 252-269 |
| 19 | | Ian Parberry:
A Computer-Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks.
Mathematical Systems Theory 24(2): 101-116 (1991) |
| 18 | | Ian Parberry,
Pei Yuan Yan:
Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes.
SIAM J. Comput. 20(1): 88-99 (1991) |
| 1990 |
|---|
| 17 | | Zoran Obradovic,
Ian Parberry:
Learning with Discrete Multi-Valued Neurons.
ML 1990: 392-399 |
| 16 | | Ian Parberry:
An Optimal Time Bound for Oblivious Routing.
Algorithmica 5(2): 243-250 (1990) |
| 15 | | Ian Parberry:
Single-Exception Sorting Networks and the Computational Complexity of Optimal Sorting Network Verification.
Mathematical Systems Theory 23(2): 81-93 (1990) |
| 1989 |
|---|
| 14 | | Ian Parberry,
Pei Yuan Yan:
Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes.
ICPP (3) 1989: 226-233 |
| 13 | | Zoran Obradovic,
Ian Parberry:
Analog Neural Networks of Limited Precision I: Computing with Multilinear Threshold Functions.
NIPS 1989: 702-709 |
| 12 | | Ian Parberry:
A Note on Nondeterminism in Small, Fast Parallel Computers.
IEEE Trans. Computers 38(5): 766-767 (1989) |
| 11 | | Bruce Parker,
Ian Parberry:
Constructing Sorting Networks from k-Sorters.
Inf. Process. Lett. 33(3): 157-162 (1989) |
| 10 | | Ian Parberry,
Georg Schnitger:
Relating Boltzmann machines to conventional models of computation.
Neural Networks 2(1): 59-67 (1989) |
| 1988 |
|---|
| 9 | | Ian Parberry,
Georg Schnitger:
Parallel Computation with Threshold Functions.
J. Comput. Syst. Sci. 36(3): 278-302 (1988) |
| 1987 |
|---|
| 8 | | Ian Parberry,
Georg Schnitger:
Relating Boltzmann Machines to Conventional Models of Computation.
ISMIS 1987: 347-354 |
| 7 | | Ian Parberry:
An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits.
Inf. Process. Lett. 24(6): 363-367 (1987) |
| 6 | | Ian Parberry:
Some practical simulations of impractical parallel computers.
Parallel Computing 4(1): 93-101 (1987) |
| 5 | | Ian Parberry:
On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes.
Theor. Comput. Sci. 51: 239-247 (1987) |
| 1986 |
|---|
| 4 | | Ian Parberry:
On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes.
Aegean Workshop on Computing 1986: 296-304 |
| 3 | | Ian Parberry,
Georg Schnitger:
Parallel Computation with Threshold Functions.
Structure in Complexity Theory Conference 1986: 272-290 |
| 2 | | Ian Parberry:
On Recurrent and Recursive Interconnection Patterns.
Inf. Process. Lett. 22(6): 285-289 (1986) |
| 1 | | Leslie M. Goldschlager,
Ian Parberry:
On the Construction of Parallel Computers from Various Bases of Boolean Functions.
Theor. Comput. Sci. 43: 43-58 (1986) |
