| How To Encrypt A Graph | 0 | 0.34 | 2020 |
| A minimum knapsack-based resource allocation for underlaying device-to-device communication. | 0 | 0.34 | 2018 |
| Worst Case Branching And Other Measures Of Nondeterminism | 1 | 0.35 | 2017 |
| Improved electromagnetic tracking for catheter path reconstruction with application in high-dose-rate brachytherapy. | 2 | 0.42 | 2017 |
| Time: The Final Frontier | 0 | 0.34 | 2017 |
| Nonuniversality explained. | 0 | 0.34 | 2016 |
| A Two-Phase Auction-Based Fair Resource Allocation For Underlaying D2d Communications | 3 | 0.40 | 2016 |
| A Stable Matching Algorithm For Resource Allocation For Underlaying Device-To-Device Communications | 3 | 0.41 | 2016 |
| A Local Search Algorithm for Resource Allocation for Underlaying Device-to-Device Communications. | 3 | 0.41 | 2015 |
| Carving Secret Messages out of Public Information | 2 | 0.44 | 2015 |
| Electromagnetic tracking in surgical and interventional environments: usability study. | 14 | 1.05 | 2015 |
| What is computation? | 1 | 0.38 | 2014 |
| December Issue 2013 Editorial Note | 0 | 0.34 | 2014 |
| A survey of access management techniques in machine type communications | 42 | 1.32 | 2014 |
| Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA. | 0 | 0.34 | 2014 |
| Comparisons between Measures of Nondeterminism on Finite Automata. | 5 | 0.42 | 2013 |
| A Cellular Automaton Model for Wireless Sensor Networks. | 5 | 0.49 | 2012 |
| State complexity and limited nondeterminism | 7 | 0.47 | 2012 |
| State Complexity of Finite Tree Width NFAs. | 0 | 0.34 | 2012 |
| Computing With Uncertainty And Its Implications To Universality | 0 | 0.34 | 2012 |
| Efficient Enforcement of Dynamic Access Control Policies for Outsourced Data. | 0 | 0.34 | 2011 |
| Enhancing identity trust in cryptographic key management systems for dynamic environments | 3 | 0.38 | 2011 |
| Trans-Canada Slimeways: Slime mould imitates the Canadian transport network | 6 | 0.48 | 2011 |
| A Quantum Cryptographic Solution To The Problem Of Access Control In A Hierarchy | 5 | 0.48 | 2010 |
| On The Importance Of Being Quantum | 2 | 0.64 | 2010 |
| Quantum security in wireless sensor networks | 4 | 0.47 | 2010 |
| An Exact Solution to the Two-Dimensional Arbitrary-Threshold Density Classification Problem. | 0 | 0.34 | 2009 |
| Some topological properties of star graphs: The surface area and volume | 13 | 0.65 | 2009 |
| A Localized Algorithm for Target Monitoring in Wireless Sensor Networks | 1 | 0.36 | 2009 |
| On replacing cryptographic keys in hierarchical key management systems | 5 | 0.42 | 2008 |
| Quantum Wireless Sensor Networks | 1 | 0.35 | 2008 |
| Accelerating machines: a review | 6 | 0.49 | 2008 |
| Planar tree transformation: Results and counterexample | 2 | 0.39 | 2008 |
| Unconventional Computational Problems With Consequences To Universality | 3 | 0.50 | 2008 |
| Optimal Linear-Time Algorithm For Uplink Scheduling Of Packets With Hard Or Soft Deadlines In Wimax | 1 | 0.37 | 2008 |
| Optimal Cell Size in Multi-Hop Cellular Networks | 2 | 0.39 | 2008 |
| Key Distribution based on Quantum Fourier Transform | 0 | 0.34 | 2008 |
| Parallelism In Quantum Information Processing Defeats The Universal Computer | 2 | 0.36 | 2007 |
| Number of processors with partitioning strategy and EDF-schedulability test: upper and lower bounds with comparison | 1 | 0.36 | 2007 |
| An Adaptive Double-layer Workflow Scheduling Approach for Grid Computing | 3 | 0.50 | 2007 |
| Two-Phase Computation and Data Scheduling Algorithms for Workflows in the Grid | 3 | 0.46 | 2007 |
| A Performance Model Of Disha Routing In K-Ary N-Cube Networks | 1 | 0.36 | 2007 |
| PFAS: A Resource-Performance-Fluctuation-Aware Workflow Scheduling Algorithm for Grid Computing | 9 | 0.58 | 2007 |
| Unconventional Computation, 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings | 16 | 4.78 | 2007 |
| Quantum computing: beyond the limits of conventional computation | 5 | 0.63 | 2007 |
| On planar path transformation. | 6 | 0.52 | 2007 |
| Aspects Of Biomolecular Computing | 3 | 0.41 | 2007 |
| Comparing Priority Functions of Heuristic Scheduling Algorithms for Soft Real-Time Tasks | 0 | 0.34 | 2007 |
| On the Average Capacity of Vehicle to Vehicle Networks | 0 | 0.34 | 2007 |
| A Performance Study of Splittable and Unsplittable Traffic Allocation in Wireless Sensor Networks | 2 | 0.39 | 2006 |
