All Stories

  1. Logarithmic SAT Solution with Membrane Computing

    Article • Axioms, February 2022, MDPI AG

    Dr. Michael J Dinneen

  2. Finding the chromatic sums of graphs using a D-Wave quantum computer

    Article • The Journal of Supercomputing, February 2019, Springer Science + Business Media

    Dr. Michael J Dinneen

  3. Experimentally probing the algorithmic randomness and incomputability of quantum randomness

    Article • Physica Scripta, February 2019, Institute of Physics Publishing

    Dr. Michael J Dinneen

  4. Solving the Hamiltonian Cycle Problem using a Quantum Computer

    Article • January 2019, ACM (Association for Computing Machinery)

    Dr. Michael J Dinneen, Anuradha Mahasinghe

  5. Improved Mixed-Example Data Augmentation

    Article • January 2019, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Michael J Dinneen

  6. A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing—Abridged Version

    Article • Electronic Proceedings in Theoretical Computer Science, July 2018, Open Publishing Association

    Dr. Michael J Dinneen

  7. QUBO formulations for the graph isomorphism problem and related problems

    Article • Theoretical Computer Science, November 2017, Elsevier

    Dr. Michael J Dinneen

  8. Formulating graph covering problems for adiabatic quantum computers

    Article • January 2017, ACM (Association for Computing Machinery)

    Dr. Michael J Dinneen

  9. Preface

    Article • Natural Computing, November 2016, Springer Science + Business Media

    Dr. Michael J Dinneen

  10. A Hybrid Geometric Approach for Measuring Similarity Level Among Documents and Document Clustering

    Article • March 2016, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Michael J Dinneen

  11. Unconventional Computation and Natural Computation

    Article • January 2015, Springer Science + Business Media

    Dr. Michael J Dinneen

  12. Runtime analysis to compare best-improvement and first-improvement in memetic algorithms

    Article • July 2014, ACM (Association for Computing Machinery)

    Dr. Michael J Dinneen

  13. Hybridizing the dynamic mutation approach with local searches to overcome local optima

    Article • July 2014, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Michael J Dinneen

  14. Runtime analysis comparison of two fitness functions on a memetic algorithm for the Clique Problem

    Article • July 2014, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Michael J Dinneen

  15. A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem

    Article • June 2013, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Michael J Dinneen

  16. On the analysis of a (1+1) adaptive memetic algorithm

    Article • April 2013, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Michael J Dinneen

  17. An Empirical Approach to the Normality of π

    Article • Experimental Mathematics, December 2012, Taylor & Francis

    Dr. Michael J Dinneen

  18. A Program-Size Complexity Measure for Mathematical Problems and Conjectures

    Article • January 2012, Springer Science + Business Media

    Dr. Michael J Dinneen

  19. An Adaptive Algorithm for P System Synchronization

    Article • January 2012, Springer Science + Business Media

    Dr. Michael J Dinneen

  20. Faster synchronization in P systems

    Article • Natural Computing, August 2011, Springer Science + Business Media

    Dr. Michael J Dinneen

  21. Edge- and Node-Disjoint Paths in P Systems

    Article • Electronic Proceedings in Theoretical Computer Science, October 2010, Open Publishing Association

    Dr. Michael J Dinneen

  22. Experimental evidence of quantum randomness incomputability

    Article • Physical Review A, August 2010, American Physical Society (APS)

    Dr. Michael J Dinneen

  23. A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs

    Article • January 2010, Springer Science + Business Media

    Dr. Michael J Dinneen

  24. Discovering the Membrane Topology of Hyperdag P Systems

    Article • January 2010, Springer Science + Business Media

    Dr. Michael J Dinneen

  25. Synchronization in P Modules

    Article • January 2010, Springer Science + Business Media

    Dr. Michael J Dinneen

  26. New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems

    Article • Electronic Proceedings in Theoretical Computer Science, November 2009, Open Publishing Association

    Dr. Michael J Dinneen

  27. Foreword

    Article • Natural Computing, May 2009, Springer Science + Business Media

    Dr. Michael J Dinneen

  28. Properties of vertex cover obstructions

    Article • Discrete Mathematics, October 2007, Elsevier

    Dr. Michael J Dinneen

  29. Unconventional Computation

    Article • January 2006, Springer Science + Business Media

    Dr. Michael J Dinneen

  30. A fast natural algorithm for searching

    Article • Theoretical Computer Science, June 2004, Elsevier

    Dr. Michael J Dinneen

  31. An Optimal Family of Directed, Bounded-Degree Broadcast Networks

    Article • Electronic Notes in Theoretical Computer Science, April 2003, Elsevier

    Dr. Michael J Dinneen

  32. Update games and update networks

    Article • Journal of Discrete Algorithms, February 2003, Elsevier

    Dr. Michael J Dinneen

  33. Discrete Mathematics and Theoretical Computer Science

    Article • January 2003, Springer Science + Business Media

    Dr. Michael J Dinneen

  34. Degree- and time-constrained broadcast networks

    Article • Networks, March 2002, Wiley

    Dr Mark C Wilson, Dr. Michael J Dinneen

  35. Unconventional Models of Computation

    Article • January 2002, Springer Science + Business Media

    Dr. Michael J Dinneen

  36. Forbidden minors to graphs with small feedback sets

    Article • Discrete Mathematics, March 2001, Elsevier

    Dr. Michael J Dinneen

  37. On Game-Theoretic Models of Networks

    Article • January 2001, Springer Science + Business Media

    Dr. Michael J Dinneen

  38. Reflections on quantum computing

    Article • Complexity, September 2000, Wiley

    Dr. Michael J Dinneen

  39. On computing graph minor obstruction sets

    Article • Theoretical Computer Science, February 2000, Elsevier

    Dr. Michael J Dinneen

  40. A simple linear-time algorithm for finding path-decompositions of small width

    Article • Information Processing Letters, February 1996, Elsevier

    Dr. Michael J Dinneen

  41. A computational attack on the conjectures of Graffiti: New counterexamples and proofs

    Article • Discrete Mathematics, December 1995, Elsevier

    Dr. Michael J Dinneen

  42. Obstructions to within a few vertices or edges of acyclic

    Article • January 1995, Springer Science + Business Media

    Dr. Michael J Dinneen

  43. New results for the degree/diameter problem

    Article • Networks, October 1994, Wiley

    Dr. Michael J Dinneen

  44. Small diameter symmetric networks from linear groups

    Article • IEEE Transactions on Computers, January 1992, Institute of Electrical & Electronics Engineers (IEEE)

    Dr. Michael J Dinneen

  45. Algebraic constructions of efficient broadcast networks

    Article • January 1991, Springer Science + Business Media

    Dr. Michael J Dinneen