Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Publication List for Ian Parberry

Publication List for Ian Parberry

This document contains a list of the print publications of Ian Parberry in various categories. I am working to get as many of them as possible online so you can peruse them at your pleasure. Abstracts are available in html format by clicking on the titles. By further clicking on the titles in the abstract page you can receive manuscripts in postscript format (mostly 2.0, some in 3.0).

Contents

Articles Submitted to Refereed Journals and Conferences

  1. I. Parberry and W. R. Pensyl, "Subhunt: A Submarine Action Game", Submitted October 1997 to the 1998 International Conference on Multimedia Computing and Systems.
  2. I. Parberry, "Building a Better Mouse Driver", Submitted October 1997 to Software - Practice and Experience.

Research Articles in Refereed Journals

  1. O. Kyek, I. Parberry, and I. Wegener, "Bounds on the Number of Knight's Tours", Discrete Applied Mathematics, Vol. 74, pp. 171-181, 1997.
  2. I. Parberry, "An Efficient Algorithm for the Knight's Tour Problem", Discrete Applied Mathematics, Vol. 73, pp. 251-260, 1997.
  3. I. Parberry, "Scalability of a Neural Network for the Knight's Tour Problem", Neurocomputing, Vol. 12, pp. 19-34, 1996.
  4. I. Parberry, "A Real-Time Algorithm for the (n2-1)-Puzzle", Information Processing Letters, Vol. 56, pp. 23-28, 1995.
  5. I. Parberry, "Load Sharing with Parallel Priority Queues". Journal of Computer and System Sciences, Vol. 50, No. 1, pp. 64-73, 1995.
  6. Z. Obradovic and I. Parberry, "Learning with Discrete Multi-valued Neurons", Journal of Computer and System Sciences, Vol. 49, No. 2, pp. 375-390, 1994. A preliminary version of this paper appeared in the Proceedings of the Seventh Annual Machine Learning Conference, pp. 392-399, Morgan Kaufmann, 1990.
  7. J. Sorenson and I. Parberry, "Two Fast Parallel Prime Number Sieves", Information and Computation, Vol. 114, No. 1, pp. 115-130, 1994.
  8. P. Y. Yan and I. Parberry, "Exponential Size Lower Bounds for Some Depth Three Circuits", Information and Computation, Vol. 112, No. 1, pp. 117-130, 1994.
  9. I. Parberry, "The Pairwise Sorting Network". Parallel Processing Letters, Vol. 2, No. 2,3, pp. 205-211, 1992.
  10. Z. Obradovic and I. Parberry, "Computing with Discrete Multi-valued Neurons", Journal of Computer and System Sciences, Vol. 45, No. 3, pp. 471-492, 1992. A preliminary version of this paper appeared under the title "Analog Neural Networks of Limited Precision I: Computing with Multilinear Threshold Functions", Advances in Neural Information Processing Systems 2 (Proceedings of the 1989 IEEE Conference on Neural Information Processing Systems), pp. 702-709, Morgan Kaufmann, 1990.
  11. P. Berman, I. Parberry, and G. Schnitger, "A Note on the Complexity of Reliability in Neural Networks", IEEE Transactions on Neural Networks, Vol. 3, No. 6, pp. 998-1002, 1992.
  12. I. Parberry, "A Computer Assisted Optimal Depth Lower Bound for Nine-Input Sorting Networks". Mathematical Systems Theory, Vol. 24, pp. 101-116, 1991. A preliminary version of this paper appeared in the Proceedings of Supercomputing '89, pp. 152-161, Reno, Nevada, Nov. 1989.
  13. P. Y. Yan and I. Parberry, "Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes", SIAM Journal on Computing, Vol. 20, No. 1, pp. 88-99, 1991. A preliminary version of this paper appeared in the Proceedings of the 1989 International Conference on Parallel Processing, Vol. 3, pp. 226-233, St. Charles, IL, Aug. 1989.
  14. I. Parberry, "Single-Exception Sorting Networks and the Computational Complexity of Optimal Sorting Network Verification". Mathematical Systems Theory, Vol. 23, pp. 81-93, 1990.
  15. I. Parberry, "An Optimal Time Bound for Oblivious Routing". Algorithmica, Vol. 5, No. 2, pp. 243-251, 1990.
  16. B. Parker and I. Parberry, "Constructing Sorting Networks from k-sorters", Information Processing Letters, Vol. 33, No. 3, pp. 157-162, 1989.
  17. I. Parberry, "A Note on Nondeterminism in Small, Fast Parallel Computers". IEEE Transactions on Computers, Vol. 38, No. 5, pp. 766-767, 1989.
  18. I. Parberry and G. Schnitger, "Relating Boltzmann Machines to Conventional Models of Computation", Neural Networks, Vol. 2, No. 1, pp. 59-67, 1989. A preliminary version of this paper appeared in the Proceedings of the Second International Symposium on Methodologies for Intelligent Systems, Charlotte, NC, pp. 347-354, North-Holland, Oct. 1987.
  19. I. Parberry and G. Schnitger. "Parallel Computation with Threshold Functions", Journal of Computer and System Sciences, Vol. 36, No. 3, pp. 278-302, 1988. A preliminary version of this paper appeared in the Structure in Complexity Theory Conference, Berkeley, California, Springer-Verlag Lecture Notes in Computer Science, Vol. 223, pp. 272-290, June 1986.
  20. I. Parberry, "On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes". Theoretical Computer Science, Vol. 51, Nos. 1,2, pp 239-248, 1987. A preliminary version of this paper appeared in the Proceedings of the Second International Workshop on Parallel Computing and VLSI, Attica, Greece, Springer-Verlag Lecture Notes in Computer Science, Vol. 227, pp. 296-304, July 1986.
  21. I. Parberry, "An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits". Information Processing Letters, Vol. 24, No. 6, pp. 363-367, 1987.
  22. I. Parberry, "Some Practical Simulations of Impractical Parallel Computers". Parallel Computing, Vol. 4, No. 1, pp. 93-101, 1987. A preliminary version of this paper appeared in the Proceedings of the International Workshop on Parallel Computing and VLSI, Amalfi, Italy, May 1984, pp. 27-37, (North Holland, 1985).
  23. I. Parberry, "On Recurrent and Recursive Interconnection Patterns". Information Processing Letters, Vol. 22, No. 6, pp. 285-289, 1986.
  24. L. M. Goldschlager and I. Parberry, "On the Construction of Parallel Computers from Various Bases of Boolean Functions", Theoretical Computer Science, Vol. 43, No. 1, pp. 43-58, 1986.

Articles in Conferences & Workshops

In order to avoid needless repetition, papers that subsequently appeared in expanded form in refereed journals are listed with the Research Articles in Refereed Journals. The ones below did not, or have not yet appeared in refereed journals.
  1. H.-L. Tseng and I. Parberry, "Are Hopfield Networks Faster Than Conventional Computers?", Proceedings of the 9th Conference on Neural Information Systems - Natural and Synthetic, pp. 239-245, Denver, Colorado, 1996.
  2. I. Parberry, "The Internet and the Aspiring Games Programmer". Proceedings of DAGS 95, "Electronic Publishing and the Information Superhighway", James Ford, Fillia Makedon, Samuel Rebelsky (Editors), pp. 155-159, Birkhauser, Boston, MA, June 1995.
  3. I. Parberry and D. S. Johnson, "The SIGACT Theoretical Computer Science Genealogy: Preliminary Report", Proceedings of DAGS 95, "Electronic Publishing and the Information Superhighway", James Ford, Fillia Makedon, Samuel Rebelsky (Editors), pp. 197-205, Birkhauser, Boston, MA, June 1995.
  4. I. Parberry, "On the Complexity of Learning with a Small Number of Nodes", Proceedings of the 1992 International Joint Conference on Neural Networks, Vol. 3, pp. 893-898, June 1992.
  5. I. Parberry, "On the Computational Complexity of Optimal Sorting Network Verification". Proceedings of The Conference on Parallel Architectures and Languages Europe, Springer-Verlag Lecture Notes in Computer Science, Vol. 506, pp. 252-269, June 1991.

Books

  1. I. Parberry, Problems on Algorithms, Prentice Hall, 1995.
  2. I. Parberry, Circuit Complexity and Neural Networks, MIT Press, 1994.
  3. I. Parberry, Parallel Complexity Theory, in series Research Notes in Theoretical Computer Science, (R. V. Book, Ed.), Pitman Press, London, 1987.

Invited Articles

  1. I. Parberry, "Knowledge, Understanding, and Computational Complexity", in Optimality in Biological and Artificial Networks?, Chapter 8, pp. 125-144, (D.S. Levine, W.R. Elsberry, Eds.), Lawrence Erlbaum Associates, 1997.
  2. I. Parberry, "Circuit Complexity and Neural Networks", in Mathematical Perspectives on Neural Networks, (P. Smolensky, M. Mozer, D. Rumelhart, Eds.), Lawrence Erlbaum Associates, pp. 85-111, 1996.
  3. I. Parberry, "Structural Complexity and Neural Networks", in "The Handbook of Brain Theory and Neural Networks", (Michael Arbib, Ed.), pp. 945-948, MIT Press, 1995.
  4. I. Parberry, "A Primer on the Complexity Theory of Neural Networks", in Formal Techniques in Artificial Intelligence: A Sourcebook, (R. B. Banerji, Ed.), in series Studies in Computer Science and Artificial Intelligence, Vol. 6, pp. 217-268, Elsevier, 1990.

Scholarly Articles

  1. I. Parberry, "Surfing the Web", SIGACT News, Vol. 26, No. 1, pp. 99-101, 1995.
  2. I. Parberry, " A Form for Referees in Theoretical Computer Science". SIGACT News, Vol. 25, No. 4, pp. 96-107, 1994.
  3. I. Parberry, "SIGACT Trying to Get Children Excited About CS", with M. R. Fellows, Computing Research News, Vol. 5, No. 1, p. 7, Jan. 1993.
  4. I. Parberry, Scholarly Review of Parallel Sorting. Computing Reviews, Vol. 30, No. 11, pp. 578-580, Nov. 1989 (Review Number 8909-0816). Reprinted in SIGACT News, Vol. 21, No. 1, pp. 14-17, 1990.
  5. I. Parberry, " A Guide for New Referees in Theoretical Computer Science". Information and Computation, Vol. 112, No. 1, pp. 96-116, 1994.
  6. I. Parberry, "A Short Errata to `Parallel Complexity Theory' ". SIGACT News, Vol. 20, No. 1, pp. 58-59, 1989.
  7. I. Parberry, " How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students". SIGACT News, Vol. 19, No. 2, pp. 42-47, 1988.
  8. I. Parberry, "Parallel Speedup of Sequential Machines: A Defense of the Parallel Computation Thesis", SIGACT News, Vol. 18, No. 1, pp. 54-67, 1986.

Created by Ian Parberry, September 25, 1994.
Last updated Wed Oct 29 14:41:43 CST 1997.