The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ian Parberry: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002