List of Publications
- McCloskey, R., Beidler, J., and Bi, Y. (2003),
CS2 and Java's Comparator Interface,
The Journal of Computing Sciences in Colleges, Vol. 19, No. 1,
pp.349-361.
- Beidler, J., McCloskey, R., and Bi, Y. (2003),
(In)Formalism,
The Journal of Computing Sciences in Colleges, Vol. 18, No. 5,
pp. 159-170.
- Beidler, J., Bi, Y., and McCloskey, R. (2002),
A Recursive List Paradigm with Java and C++ Implementations
, The Journal of Computing in Small Colleges, Vol. 17, No. 6,
pp. 197-205.
- McCloskey, R. (1996),
An O(n2) Time Algorithm for Deciding Whether
a Regular Language is a Code,
Journal of Computing and Information, Vol. 2, No. 1
(Special Issue: Proceedings of the 8th
International Conference on Computing and Information (ICCI'96)),
pp. 79-89.
Note: There is a subtle technical error (discovered by
Derick Wood) near the beginning of Section 4 in the
original paper (accessible via the link above).
This error has been corrected in the version of the paper
accessible via the following links.
PDF form
postscript form
- McCloskey, R. and Beidler, J. (1995),
An Analysis of Algorithms Laboratory Utilizing the
Maximum Segment Sum Problem,
SIGCSE Bulletin 27:4, (Dec. 1995), pp. 21--26.
postscript form
PDF form
html form
- McCloskey, R. and Beidler, J. (1995),
First Experiences Teaching with Ada95 in the CS 2 and CS 7
Courses,
Proceedings of the 9th Annual ASEET Symposium, pp. 35-41.
- McCloskey, R., Wang, J., and Belanger, J. (1994),
Parallel Parsing of Languages Generated by Ambiguous
Bounded Context Grammars,
Journal on Computing and Information, Vol. 1, No.1
(Special Issue: Proceedings of the 6th
International Conference on Computing and Information
(ICCI'94)), pp. 738-757.
postscript form
PDF form
- Kim, S., McNaughton, R., and McCloskey, R. (1991),
A Polynomial Time Algorithm for the Local Testability
Problem of Deterministic Finite Automata,
IEEE Transactions on Computers, Vol. 40, No. 10,
pp. 1087-1093.
(Also appeared in Proceedings of the Workshop on Algorithms
and Data Structures, Lecture Notes in Computer Science,
Vol. 382, pp. 420-436, Springer-Verlag (1989).)
- Kim, S. and McCloskey, R. (1990),
A Characterization of Constant-Time Cellular Automata
Computation,
Physica D, Vol. 45, pp. 404-419.
- Kim, S., McNaughton, R., and McCloskey, R. (1989),
An Upper Bound on the Order of Locally Testable
Deterministic Finite Automata,
Proceedings of the International Symposium on Optimal Algorithms,
Lecture Notes in Computer Science Vol. 401, pp. 48-65, Springer-Verlag.
- Goldberg, M., Berque, D., and McCloskey, R. (1988),
SetPlayer: An Interactive Software System for Set Manipulation,
Technical Report 88-26, Department of Computer Science,
Rensselaer Polytechnic Institute.