Conference Coordinating Pebble Motion On Graphs, The Diameter Of Permutation Groups, And Applications 1984 • Annual Symposium on Foundations of Computer Science • 241-250 Kornhauser D, Miller G, Spirakis P
Conference Sublinear parallel algorithm for computing the greatest common divisor of two integers 1984 • Annual Symposium on Foundations of Computer Science • 1984-October:7-11 Kannan R, Miller G, Rudolph L
Journal Article An asymptotically optimal layout for the shuffle—exchange graph 1983 • Journal of Computer and System Sciences • 26(3):339-361 Kleitman D, Leighton FT, Lepley M, Miller GL
Journal Article Isomorphism of graphs which are pairwise k-separable 1983 • Information and Computation • 56(1-2):21-33 Miller GL
Journal Article Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus 1983 • Information and Computation • 56(1-2):1-20 Miller GL
Conference SOLVABILITY BY RADICALS IS IN POLYNOMIAL TIME. 1983 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 140-151 Landan S, Miller GL
Conference New layouts for the shuffle-exchange graph(Extended Abstract) 1981 • Annual ACM Symposium on Theory of Computing • 278-292 Kleitman D, Leighton FT, Lepley M, Miller GL
Journal Article Graph isomorphism, general remarks 1979 • Journal of Computer and System Sciences • 18(2):128-142 Miller GL
Conference On determining the genus of a graph in O(v O(g) ) steps(Preliminary Report) 1979 • Annual ACM Symposium on Theory of Computing • 27-37 Filotti IS, Miller GL, Reif J
Conference On the n log n isomorphism technique (A Preliminary Report) 1978 • Annual ACM Symposium on Theory of Computing • 51-58 Miller GL
