Robert McCloskey

According to our database, Robert McCloskey authored at least 7 papers between 1989 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Sketches of Some CS1 Programming Assignments.

Paul Jackowitz, Robert McCloskey

J. Comput. Sci. Coll., 2022

2003

CS2 and Java's comparator interface.

Robert McCloskey, John Beidler, Yaodong Bi

J. Comput. Sci. Coll., 2003

(In)Formalism.

John Beidler, Robert McCloskey, Yaodong Bi

J. Comput. Sci. Coll., 2003

2002

A recursive list paradigm with Java and C++ implementations.

John Beidler, Yaodong Bi, Robert McCloskey

J. Comput. Sci. Coll., 2002

1995

An analysis of algorithms laboratory utilizing the maximum segment sum problem.

Robert McCloskey, John Beidler

ACM SIGCSE Bull., 1995

1989

A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata.

Sam M. Kim, Robert McNaughton, Robert McCloskey

Proceedings of the Algorithms and Data Structures, 1989

An Upper Bound on the Order of Locally Testable Deterministic Finite Automata.

Sam M. Kim, Robert McNaughton, Robert McCloskey

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989