A non-factorial algorithm for canonical numbering of a graph
Journal of Algorithms
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
A compact representation for permutation groups
Journal of Algorithms
An O(N1.5+ε) expected time algorithm for canonization and isomorphism testing of trivalent graphs
Proceedings on STACS 85 2nd annual symposium on theoretical aspects of computer science
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs
Journal of the ACM (JACM)
The parallel complexity of Abelian permutation group problems
SIAM Journal on Computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Limits of using signatures for permutation independent Boolean comparison
ASP-DAC '95 Proceedings of the 1995 Asia and South Pacific Design Automation Conference
Faster isomorphism testing of strongly regular graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Boolean Functions Classification via Fixed Polarity Reed-Muller Forms
IEEE Transactions on Computers
Indexed BDDs: Algorithmic Advances in Techniques to Represent and Verify Boolean Functions
IEEE Transactions on Computers
Moderately Exponential Bound for Graph Isomorphism
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
On the nlog n isomorphism technique (A Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Normal forms for trivalent graphs and graphs of bounded valence
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Equational Theories of Boolean Functions
Equational Theories of Boolean Functions
Computational complexity and the classification of finite simple groups
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Isomorphism and canonization of tournaments and hypertournaments
Journal of Computer and System Sciences
Complexity classes of equivalence problems revisited
Information and Computation
On hypergraph and graph isomorphism with bounded color classes
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Code equivalence and group isomorphism
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On isomorphism and canonization of tournaments and hypertournaments
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Isomorphism testing of boolean functions computable by constant-depth circuits
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Polynomial-time isomorphism test for groups with no abelian normal subgroups
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On the isomorphism problem for decision trees and decision lists
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |