| Quantum Walk on the Generalized Birkhoff Polytope Graph | 0 | 0.34 | 2021 |
| A Computational Complexity Comparative Study Of Graph Tessellation Problems | 0 | 0.34 | 2021 |
| The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness. | 0 | 0.34 | 2020 |
| The graph tessellation cover number: extremal bounds, efficient algorithms and hardness. | 0 | 0.34 | 2018 |
| Partition-based discrete-time quantum walks. | 1 | 0.43 | 2018 |
| Determining the Efficiency of Quantum Search Algorithms with the Renormalization Group. | 0 | 0.34 | 2017 |
| The tessellation problem of quantum walks. | 0 | 0.34 | 2017 |
| Exact simulation of coined quantum walks with the continuous-time model. | 2 | 0.43 | 2017 |
| Parallel algorithms for modular multi-exponentiation. | 4 | 0.43 | 2017 |
| The staggered quantum walk model | 8 | 0.64 | 2016 |
| Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model | 6 | 0.57 | 2016 |
| Quantum walks on a circle with optomechanical systems | 1 | 0.43 | 2015 |
| An Efficient One-Bit Model for Differential Fault Analysis on Simon Family. | 3 | 0.42 | 2015 |
| Non-Pauli observables for CWS codes | 0 | 0.34 | 2012 |
| Parallel modular exponentiation using load balancing without precomputation | 4 | 0.48 | 2012 |
| Decoder for Nonbinary CWS Quantum Codes | 1 | 0.38 | 2012 |
| Quantum Search Algorithms On Hierarchical Networks | 0 | 0.34 | 2011 |
| Solutions to the Hidden Subgroup Problem on Some Metacyclic Groups. | 2 | 0.37 | 2009 |
| The Invar tensor package: Differential invariants of Riemann | 3 | 0.62 | 2008 |
| Reversible Karatsuba's Algorithm | 6 | 0.58 | 2006 |
| Genetic Algorithms and Quantum Computation | 10 | 0.72 | 2004 |
| Computer algebra takes on the vibrating-membrane problem | 1 | 0.81 | 1999 |
