| Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces | 1 | 0.35 | 2020 |
| Stabilizer Codes From Modified Symplectic Forms | 0 | 0.34 | 2017 |
| How to twist pointers without breaking them. | 0 | 0.34 | 2016 |
| Evolutionary Algorithms for Quantum Computers. | 0 | 0.34 | 2014 |
| Performance of metropolis algorithm for the minimum weight code word problem | 2 | 0.42 | 2014 |
| Fast Integer Multiplication Using Modular Arithmetic. | 1 | 0.35 | 2013 |
| Testing nilpotence of galois groups in polynomial time | 1 | 0.44 | 2012 |
| Quantum cyclic code of length dividing pt + 1. | 0 | 0.34 | 2011 |
| Metropolis algorithm for solving shortest lattice vector problem (SVP) | 1 | 0.37 | 2011 |
| Can quantum search accelerate evolutionary algorithms? | 5 | 0.41 | 2010 |
| Quantum Cyclic Code | 0 | 0.34 | 2010 |
| Computing single source shortest paths using single-objective fitness | 20 | 0.90 | 2009 |
| Representing Groups on Graphs | 0 | 0.34 | 2009 |
| Fast integer multiplication using modular arithmetic | 14 | 0.90 | 2008 |
| Graph isomorphism is in SPP | 35 | 1.65 | 2006 |
| A polynomial time nilpotence test for galois groups and related results | 1 | 0.38 | 2006 |
| Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy | 5 | 0.45 | 2004 |
| On the Complexity of Computing Units in a Number Field | 2 | 0.42 | 2004 |
| Upper Bounds on the Complexity of Some Galois Theory Problems. | 0 | 0.34 | 2003 |
