Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ian Parberry
2010 – today
- 2011
[c18]Dhanyu Amarasinghe, Ian Parberry: Towards fast, believable real-time rendering of burning objects in video games. FDG 2011: 256-258
[c17]Joshua Taylor, Ian Parberry: Randomness + Structure = Clutter: A Procedural Object Placement Generator. ICEC 2011: 424-427- 2010
[j41]Jonathon Doran, Ian Parberry: Controlled Procedural Terrain Generation Using Software Agents. IEEE Trans. Comput. Intellig. and AI in Games 2(2): 111-119 (2010)
2000 – 2009
- 2007
[j40]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)
[c16]Erik Carson, Ian Parberry, Bradley Jensen: Algorithm explorer: visualizing algorithms in a 3D multimedia environment. SIGCSE 2007: 155-159- 2006
[c15]Ursula Wolz, Tiffany Barnes, Ian Parberry, Michael R. Wick: Digital gaming as a vehicle for learning. SIGCSE 2006: 394-395
[c14]Ian Parberry, Max B. Kazemzadeh, Timothy Roden: The art and science of game programming. SIGCSE 2006: 510-514- 2005
[j39]Timothy Roden, Ian Parberry: Portholes and planes: faster dynamic evaluation of potentially visible sets. Computers in Entertainment 3(2): 3 (2005)
[j38]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)
[c13]Timothy Roden, Ian Parberry: Designing a narrative-based audio only 3D game engine. Advances in Computer Entertainment Technology 2005: 274-277
[c12]Timothy Roden, Ian Parberry: Clouds and stars: efficient real-time procedural sky rendering using 3D hardware. Advances in Computer Entertainment Technology 2005: 434-437
[c11]Ian Parberry, Timothy Roden, Max B. Kazemzadeh: Experience with an industry-driven capstone course on game programming: extended abstract. SIGCSE 2005: 91-95- 2004
[c10]Timothy Roden, Ian Parberry: From Artistry to Automation: A Structured Methodology for Procedural Content Creation. ICEC 2004: 151-156- 2002
[j37]- 2000
[j36]
[j35]Ian Parberry: How to present a paper in theoretical computer science: a speaker's guide for students. SIGACT News 31(1): 77-86 (2000)
[j34]Ian Parberry: Report on the 6th international meeting on DNA-based computers. SIGACT News 31(4): 118-120 (2000)
1990 – 1999
- 1998
[j33]Ian Parberry: Everything you wanted to know about the running time of Mergesort but were afraid to ask. SIGACT News 29(2): 50-57 (1998)- 1997
[j32]Ian Parberry: An Efficient Algorithm for the Knight's Tour Problem. Discrete Applied Mathematics 73(3): 251-260 (1997)
[j31]Olaf Kyek, Ian Parberry, Ingo Wegener: Bounds on the Number of Knight's Tours. Discrete Applied Mathematics 74(2): 171-181 (1997)- 1996
[j30]Ian Parberry: Scalability of a neural network for the knight's tour problem. Neurocomputing 12(1): 19-33 (1996)
[j29]
[c9]Ian Parberry, Hung-Li Tseng: Are Hopfield Networks Faster than Conventional Computers? NIPS 1996: 239-245- 1995
[b2]Ian Parberry: Problems on algorithms. Prentice Hall 1995, ISBN 978-0-13-433558-2, pp. I-X, 1-179
[j28]
[j27]
[j26]
[j25]- 1994
[j24]Ian Parberry: A Guide for New Referees in Theoretical Computer Science. Inf. Comput. 112(1): 96-116 (1994)
[j23]Pei Yuan Yan, Ian Parberry: Exponential Size Lower Bounds for Some Depth Three Circuits. Inf. Comput. 112(1): 117-130 (1994)
[j22]Jonathan Sorenson, Ian Parberry: Two Fast Parallel Prime Number Sieves. Inf. Comput. 114(1): 115-130 (1994)
[j21]Zoran Obradovic, Ian Parberry: Learning with Discrete Multi-valued Neurons. J. Comput. Syst. Sci. 49(2): 375-390 (1994)
[j20]- 1992
[j19]Zoran Obradovic, Ian Parberry: Computing with Discrete Multi-Valued Neurons. J. Comput. Syst. Sci. 45(3): 471-492 (1992)
[j18]- 1991
[j17]Ian Parberry: A Computer-Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks. Mathematical Systems Theory 24(2): 101-116 (1991)
[j16]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)
[c8]Ian Parberry: On the Computational Complexity of Optimal Sorting Network Verification. PARLE (1) 1991: 252-269- 1990
[j15]
[j14]Ian Parberry: Single-Exception Sorting Networks and the Computational Complexity of Optimal Sorting Network Verification. Mathematical Systems Theory 23(2): 81-93 (1990)
[j13]
[j12]
[c7]
1980 – 1989
- 1989
[j11]Bruce Parker, Ian Parberry: Constructing Sorting Networks from k-Sorters. Inf. Process. Lett. 33(3): 157-162 (1989)
[j10]Ian Parberry, Georg Schnitger: Relating Boltzmann machines to conventional models of computation. Neural Networks 2(1): 59-67 (1989)
[j9]
[j8]Ian Parberry: A guide for new referees in theoretical computer science. SIGACT News 20(4): 92-99 (1989)
[j7]Ian Parberry: A Note on Nondeterminism in Small, Fast Parallel Computers. IEEE Trans. Computers 38(5): 766-767 (1989)
[c6]Ian Parberry, Pei Yuan Yan: Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes. ICPP (3) 1989: 226-233
[c5]Zoran Obradovic, Ian Parberry: Analog Neural Networks of Limited Precision I: Computing with Multilinear Threshold Functions. NIPS 1989: 702-709
[c4]Ian Parberry: A computer assisted optimal depth lower bound for sorting networks with nine inputs. SC 1989: 152-161- 1988
[j6]Ian Parberry, Georg Schnitger: Parallel Computation with Threshold Functions. J. Comput. Syst. Sci. 36(3): 278-302 (1988)- 1987
[b1]Ian Parberry: Parallel complexity theory. Research notes in theoretical computer science, Pitman 1987, ISBN 978-0-273-08783-0, pp. 1-200
[j5]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)
[j4]Ian Parberry: Some practical simulations of impractical parallel computers. Parallel Computing 4(1): 93-101 (1987)
[j3]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)
[c3]Ian Parberry, Georg Schnitger: Relating Boltzmann Machines to Conventional Models of Computation. ISMIS 1987: 347-354- 1986
[j2]Ian Parberry: On Recurrent and Recursive Interconnection Patterns. Inf. Process. Lett. 22(6): 285-289 (1986)
[j1]Leslie M. Goldschlager, Ian Parberry: On the Construction of Parallel Computers from Various Bases of Boolean Functions. Theor. Comput. Sci. 43: 43-58 (1986)
[c2]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
[c1]Ian Parberry, Georg Schnitger: Parallel Computation with Threshold Functions. Structure in Complexity Theory Conference 1986: 272-290
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-02 19:52 CET by the dblp team



