default search action
Ian Parberry
Person information
- affiliation: University of North Texas, Denton, USA
- affiliation (PhD 1984): University of Warwick, Coventry, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1995
- [b3]Ian Parberry:
Problems on algorithms. Prentice Hall 1995, ISBN 978-0-13-433558-2, pp. I-X, 1-179 - 1987
- [b2]Ian Parberry:
Parallel complexity theory. Research notes in theoretical computer science, Pitman 1987, ISBN 978-0-273-08783-0, pp. 1-200 - 1984
- [b1]Ian Parberry:
A complexity theory of parallel computation. University of Warwick, Coventry, UK, 1984
Journal Articles
- 2022
- [j48]Thomas D. Parsons
, Timothy McMahan, Ian Parberry:
Classification of Video Game Player Experience Using Consumer-Grade Electroencephalography. IEEE Trans. Affect. Comput. 13(1): 3-15 (2022) - 2015
- [j47]Ian Parberry:
Solving the (n2 - 1)-Puzzle with 8/3 n3 Expected Moves. Algorithms 8(3): 459-465 (2015) - [j46]Timothy McMahan, Ian Parberry
Modality specific assessment of video game player's experience using the Emotiv. Entertain. Comput. 7: 1-6 (2015) - [j45]Ian Parberry:
Memory-Efficient Method for Fast Computation of Short 15-Puzzle Solutions. IEEE Trans. Comput. Intell. AI Games 7(2): 200-203 (2015) - 2012
- [j44]Jonathon Doran, Ian Parberry:
Emergent Economies for Role Playing Games. Int. J. Intell. Games Simul. 7(1): 35-48 (2012) - 2010
- [j43]Jonathon Doran, Ian Parberry
Controlled Procedural Terrain Generation Using Software Agents. IEEE Trans. Comput. Intell. AI Games 2(2): 111-119 (2010) - 2007
- [j42]Timothy Roden, Ian Parberry
Toward mobile entertainment: A paradigm for narrative-based audio only games. Sci. Comput. Program. 67(1): 76-90 (2007) - 2005
- [j41]Timothy Roden, Ian Parberry:
Portholes and planes: faster dynamic evaluation of potentially visible sets. Comput. Entertain. 3(2): 3 (2005) - [j40]Gene Eu Jan, Ki-Yin Chang, Su Gao
A 4-geometry maze router and its application on multiterminal nets. ACM Trans. Design Autom. Electr. Syst. 10(1): 116-135 (2005) - 2002
- [j39]Ian Parberry:
Things a computer scientist rarely talks about. SIGACT News 33(4): 14-15 (2002) - 2000
- [j38]Ian Parberry:
Editor's Letter. SIGACT News 31(1): 1 (2000) - [j37]Ian Parberry:
How to present a paper in theoretical computer science: a speaker's guide for students. SIGACT News 31(1): 77-86 (2000) - [j36]Ian Parberry:
Report on the 6th international meeting on DNA-based computers. SIGACT News 31(4): 118-120 (2000) - 1998
- [j35]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
- [j34]Ian Parberry:
An Efficient Algorithm for the Knight's Tour Problem. Discret. Appl. Math. 73(3): 251-260 (1997) - [j33]Olaf Kyek, Ian Parberry, Ingo Wegener:
Bounds on the Number of Knight's Tours. Discret. Appl. Math. 74(2): 171-181 (1997) - 1996
- [j32]Ian Parberry
Scalability of a neural network for the knight's tour problem. Neurocomputing 12(1): 19-33 (1996) - [j31]Ian Parberry:
Paul Erdos (1913-1996). SIGACT News 27(4): 62-65 (1996) - 1995
- [j30]Ian Parberry:
A Real-Time Algorithm for the (n²-1)-Puzzle. Inf. Process. Lett. 56(1): 23-28 (1995) - [j29]Ian Parberry:
Load Sharing with Parallel Priority Queues. J. Comput. Syst. Sci. 50(1): 64-73 (1995) - [j28]Ian Parberry:
Surfing the Web. SIGACT News 26(1): 99-101 (1995) - [j27]Ian Parberry:
Problems on Algorithms. SIGACT News 26(2): 50-56 (1995) - 1994
- [j26]Ian Parberry
A Guide for New Referees in Theoretical Computer Science. Inf. Comput. 112(1): 96-116 (1994) - [j25]Pei Yuan Yan, Ian Parberry
Exponential Size Lower Bounds for Some Depth Three Circuits. Inf. Comput. 112(1): 117-130 (1994) - [j24]Jonathan Sorenson
Two Fast Parallel Prime Number Sieves. Inf. Comput. 114(1): 115-130 (1994) - [j23]Zoran Obradovic, Ian Parberry:
Learning with Discrete Multi-valued Neurons. J. Comput. Syst. Sci. 49(2): 375-390 (1994) - [j22]Ian Parberry:
A form for referees in theoretical computer science. SIGACT News 25(4): 96-102 (1994) - 1992
- [j21]Zoran Obradovic, Ian Parberry:
Computing with Discrete Multi-Valued Neurons. J. Comput. Syst. Sci. 45(3): 471-492 (1992) - [j20]Ian Parberry:
The Pairwise Sorting Network. Parallel Process. Lett. 2: 205-211 (1992) - [j19]Piotr Berman, Ian Parberry
A note on the complexity of reliability in neural networks. IEEE Trans. Neural Networks 3(6): 998-1002 (1992) - 1991
- [j18]Ian Parberry
A Computer-Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks. Math. Syst. Theory 24(2): 101-116 (1991) - [j17]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
- [j16]Ian Parberry
An Optimal Time Bound for Oblivious Routing. Algorithmica 5(2): 243-250 (1990) - [j15]Ian Parberry
Single-Exception Sorting Networks and the Computational Complexity of Optimal Sorting Network Verification. Math. Syst. Theory 23(2): 81-93 (1990) - [j14]Ian Parberry:
The journal review column. SIGACT News 21(1): 21 (1990) - [j13]Ian Parberry:
The journal review column. SIGACT News 21(2): 21 (1990) - 1989
- [j12]Bruce Parker, Ian Parberry:
Constructing Sorting Networks from k-Sorters. Inf. Process. Lett. 33(3): 157-162 (1989) - [j11]Ian Parberry, Georg Schnitger:
Relating Boltzmann machines to conventional models of computation. Neural Networks 2(1): 59-67 (1989) - [j10]Ian Parberry:
The journal review column. SIGACT News 20(4): 31-37 (1989) - [j9]Ian Parberry:
A guide for new referees in theoretical computer science. SIGACT News 20(4): 92-99 (1989) - [j8]Ian Parberry:
A Note on Nondeterminism in Small, Fast Parallel Computers. IEEE Trans. Computers 38(5): 766-767 (1989) - 1988
- [j7]Ian Parberry, Georg Schnitger:
Parallel Computation with Threshold Functions. J. Comput. Syst. Sci. 36(3): 278-302 (1988) - 1987
- [j6]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) - [j5]Ian Parberry:
Some practical simulations of impractical parallel computers. Parallel Comput. 4(1): 93-101 (1987) - [j4]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
- [j3]Ian Parberry:
On Recurrent and Recursive Interconnection Patterns. Inf. Process. Lett. 22(6): 285-289 (1986) - [j2]Ian Parberry:
Parallel speedup of sequential machines: a defense of parallel computation thesis. SIGACT News 18(1): 54-67 (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)
Conference and Workshop Papers
- 2020
- [c25]Violet Johnson
Music Upscaling Using Convolutional Neural Networks. SSIP 2020: 58-62 - 2015
- [c24]Timothy McMahan, Ian Parberry, Thomas D. Parsons:
Evaluating Electroencephalography Engagement Indices During Video Game Play. FDG 2015 - [c23]Joshua Taylor, Ian Parberry, Thomas D. Parsons:
Comparing Player Attention on Procedurally Generated vs. Hand Crafted Sokoban Levels with an Auditory Stroop Test. FDG 2015 - 2013
- [c22]Dhanyu Amarasinghe, Ian Parberry:
Real-time rendering of burning solid objects in video games. CGAMES 2013: 139-143 - [c21]Dhanyu Amarasinghe, Ian Parberry:
Real-time rendering of melting objects in video games. CGAMES 2013: 154-158 - 2011
- [c20]Jonathon Doran, Ian Parberry
A prototype quest generator based on a structural analysis of quests from four MMORPGs. PCGames@FDG 2011: 1:1-1:8 - [c19]Dhanyu Amarasinghe, Ian Parberry
Towards fast, believable real-time rendering of burning objects in video games. FDG 2011: 256-258 - [c18]Joshua Taylor, Ian Parberry
Randomness + Structure = Clutter: A Procedural Object Placement Generator. ICEC 2011: 424-427 - 2007
- [c17]Erik Carson, Ian Parberry
Algorithm explorer: visualizing algorithms in a 3D multimedia environment. SIGCSE 2007: 155-159 - 2006
- [c16]Ursula Wolz, Tiffany Barnes, Ian Parberry
Digital gaming as a vehicle for learning. SIGCSE 2006: 394-395 - [c15]Ian Parberry
The art and science of game programming. SIGCSE 2006: 510-514 - [c14]Criss Martin, Ian Parberry
Real time dynamic wind calculation for a pressure driven wind system. Sandbox@SIGGRAPH 2006: 151-154 - 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 - 1996
- [c9]Ian Parberry, Hung-Li Tseng:
Are Hopfield Networks Faster than Conventional Computers? NIPS 1996: 239-245 - 1991
- [c8]Ian Parberry:
On the Computational Complexity of Optimal Sorting Network Verification. PARLE (1) 1991: 252-269 - 1990
- [c7]Zoran Obradovic, Ian Parberry:
Learning with Discrete Multi-Valued Neurons. ML 1990: 392-399 - 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 - 1987
- [c3]Ian Parberry, Georg Schnitger:
Relating Boltzmann Machines to Conventional Models of Computation. ISMIS 1987: 347-354 - 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. SCT 1986: 272-290
Informal and Other Publications
- 2020
- [i1]Ian Parberry:
Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours. CoRR abs/2001.06044 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: