Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Isoperimetric numbers of graphs
Journal of Combinatorial Theory Series B
Moderately Exponential Bound for Graph Isomorphism
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Isomorphism of graphs with bounded eigenvalue multiplicity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the nlog n isomorphism technique (A Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Isomorphism for graphs embeddable on the projective plane
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Isomorphism testing for graphs of bounded genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Hypergraph isomorphism and structural equivalence of Boolean functions
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the impossibility of a quantum sieve algorithm for graph isomorphism
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Coined quantum walks lift the cospectrality of graphs and trees
Pattern Recognition
Permutation group approach to association schemes
European Journal of Combinatorics
Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs
IEEE Transactions on Information Theory
Fast digital signature algorithm based on subgraph isomorphism
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
The space complexity of k-tree isomorphism
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
Journal of Combinatorial Theory Series A
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
SIAM Journal on Computing
On triple systems and strongly regular graphs
Journal of Combinatorial Theory Series A
Quasipolynomial-time canonical form for steiner designs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the automorphism groups of strongly regular graphs I
Proceedings of the 5th conference on Innovations in theoretical computer science
Disconnecting strongly regular graphs
European Journal of Combinatorics
| Hi-index | 0.06 |