Hadi Kharaghani
2005–2013
A researcher in the Science corpus: 3 papers; trusts 1 researcher and is trusted by 3 researchers here, as inferred from the citation graph.
Whom Hadi Kharaghani trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Hadi Kharaghani overall
Papers from Hadi Kharaghani's perspective
Ordered by how strongly the researchers Hadi Kharaghani trusts endorse each paper. Same corpus, a different order for every researcher.
- Classification Algorithms for Codes and Designs
- A Hadamard matrix of order 428
- Permutation Group Algorithms
- An optimal lower bound on the number of variables for graph identification
- On the Foundations of Combinatorial Theory
- A Solution of the Isomorphism Problem for Circulant Graphs
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Automorphism groups, isomorphism, reconstruction
- The complexity of McKay's canonical labeling algorithm
- Faster integer multiplication (Symposium on the Theory of Computing)
Their papers
- A Hadamard matrix of order 428 (2005) — 168 citations
- Hadamard Matrices of Order 32 (2013) — 53 citations
- Hadamard Matrices and Hadamard Designs (2006) — 69 citations