Michael J. Dinneen

101 papers A* 3A 2B 8C 5Misc 1Journal 56Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	An Experimental Study of Linux Landlock: File-System Enforcement Behavior and Overhead. ISDFS Harsh Deepak Singh, Michael J. Dinneen, Sathiamoorthy Manoharan
2024	J	`jnl`	How real is incomputability in physics? Theor. Comput. Sci. José Manuel Agüero Trejo, Cristian S. Calude, Michael J. Dinneen, Arkady Fedorov, Anatoly Kulikov, Rohit Navarathna, Karl Svozil
2024	J	`jnl`	Quantum Annealing for Computer Vision minimization problems. Future Gener. Comput. Syst. Shahrokh Heidari, Michael J. Dinneen, Patrice Delmas
2024	J	`jnl`	Solving QUBO problems with cP systems. J. Membr. Comput. Lucie Ciencialová, Michael J. Dinneen, Radu Nicolescu, Ludek Cienciala
2023	J	`jnl`	A QUBO formulation for the Tree Containment problem. Theor. Comput. Sci. Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz
2023	J	`jnl`	How Real is Incomputability in Physics? CoRR José Manuel Agüero Trejo, Cristian S. Calude, Michael J. Dinneen, Arkady Fedorov, Anatoly Kulikov, Rohit Navarathna, Karl Svozil
2023	J	`jnl`	Programmable and parallel water computing. J. Membr. Comput. Alec Henderson, Radu Nicolescu, Michael J. Dinneen, T. N. Chan, Hendrik Happe, Thomas Hinze
2023	J	`jnl`	Quantum Annealing for Computer Vision Minimization Problems. CoRR Shahrokh Heidari, Michael J. Dinneen, Patrice Delmas
2023	J	`jnl`	Sublinear P system solutions to NP-complete problems. Theor. Comput. Sci. Michael J. Dinneen, Alec Henderson, Radu Nicolescu
2022	J	`jnl`	A QUBO formulation for the Tree Containment problem. CoRR Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz
2022	J	`jnl`	Logarithmic SAT Solution with Membrane Computing. Axioms Radu Nicolescu, Michael J. Dinneen, James Cooper, Alec Henderson, Yezhou Liu
2021	—	`conf`	Close Euclidean Shortest Path Crossing an Ordered 3D Skew Segment Sequence. ISGV Nguyet Tran, Michael J. Dinneen
2021	A*	`conf`	Nondeterminism and Instability in Neural Network Optimization. ICML Cecilia Summers, Michael J. Dinneen
2021	J	`jnl`	Nondeterminism and Instability in Neural Network Optimization. CoRR Cecilia Summers, Michael J. Dinneen
2021	J	`jnl`	Turing completeness of water computing. J. Membr. Comput. Alec Henderson, Radu Nicolescu, Michael J. Dinneen, T. N. Chan, Hendrik Happe, Thomas Hinze
2020	—	`conf`	Close Weighted Shortest Paths on 3D Terrain Surfaces. SIGSPATIAL/GIS Nguyet Tran, Michael J. Dinneen, Simone Linz
2020	A*	`conf`	Computing Close to Optimal Weighted Shortest Paths in Practice. ICAPS Nguyet Tran, Michael J. Dinneen, Simone Linz
2020	A*	`conf`	Four Things Everyone Should Know to Improve Batch Normalization. ICLR Cecilia Summers, Michael J. Dinneen
2020	J	`jnl`	Improved QUBO Formulation of the Graph Isomorphism Problem. SN Comput. Sci. Richard Hua, Michael J. Dinneen
2020	J	`jnl`	Quantum solutions for densest k-subgraph problems. J. Membr. Comput. Cristian S. Calude, Michael J. Dinneen, Richard Hua
2020	J	`jnl`	Solving a PSPACE-complete problem with cP systems. J. Membr. Comput. Alec Henderson, Radu Nicolescu, Michael J. Dinneen
2019	J	`jnl`	Finding the chromatic sums of graphs using a D-Wave quantum computer. J. Supercomput. Michael J. Dinneen, Anuradha Mahasinghe, Kai Liu
2019	J	`jnl`	Four Things Everyone Should Know to Improve Batch Normalization. CoRR Cecilia Summers, Michael J. Dinneen
2019	J	`jnl`	Improved Adversarial Robustness via Logit Regularization Methods. CoRR Cecilia Summers, Michael J. Dinneen
2019	A	`conf`	Improved Mixed-Example Data Augmentation. WACV Cecilia Summers, Michael J. Dinneen
2019	—	`conf`	Solving the Hamiltonian Cycle Problem using a Quantum Computer. ACSW Anuradha Mahasinghe, Richard Hua, Michael J. Dinneen, Rajni Goyal
2018	—	`conf`	A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing - Abridged Version. PC@UCNC Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, Richard Hua
2018	J	`jnl`	A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing. CoRR Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, Richard Hua
2018	J	`jnl`	Improved Mixed-Example Data Augmentation. CoRR Cecilia Summers, Michael J. Dinneen
2018	J	`jnl`	On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. Discret. Math. Theor. Comput. Sci. M. Rajaati, Mohammad Reza Hooshmandasl, Michael J. Dinneen, Ali Shakiba
2018	J	`jnl`	Preface. Nat. Comput. Michael J. Dinneen, Ulrich Speidel
2017	J	`jnl`	An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs. CoRR M. Rajaati, Pouyeh Sharifani, Ali Shakiba, Mohammad Reza Hooshmandasl, Michael J. Dinneen
2017	—	`conf`	Formulating graph covering problems for adiabatic quantum computers. ACSW Michael J. Dinneen, Richard Hua
2017	J	`jnl`	QUBO formulations for the graph isomorphism problem and related problems. Theor. Comput. Sci. Cristian S. Calude, Michael J. Dinneen, Richard Hua
2016	—	`conf`	A Hybrid Geometric Approach for Measuring Similarity Level Among Documents and Document Clustering. BigDataService Arash Heidarian, Michael J. Dinneen
2016	J	`jnl`	Editorial. Int. J. Unconv. Comput. Cristian S. Calude, Michael J. Dinneen
2016	J	`jnl`	On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. CoRR M. Rajaati, Mohammad Reza Hooshmandasl, Michael J. Dinneen, Ali Shakiba
2015	J	`jnl`	Guest Column: Adiabatic Quantum Computing Challenges. SIGACT News Cristian S. Calude, Elena Calude, Michael J. Dinneen
2015	—	`ed.`	Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Auckland, New Zealand, August 30 - September 3, 2015, Proceedings UCNC Cristian S. Calude, Michael J. Dinneen
2014	B	`conf`	Hybridizing the dynamic mutation approach with local searches to overcome local optima. IEEE Congress on Evolutionary Computation Kuai Wei, Michael J. Dinneen
2014	B	`conf`	Runtime analysis comparison of two fitness functions on a memetic algorithm for the Clique Problem. IEEE Congress on Evolutionary Computation Kuai Wei, Michael J. Dinneen
2014	A	`conf`	Runtime analysis to compare best-improvement and first-improvement in memetic algorithms. GECCO Kuai Wei, Michael J. Dinneen
2013	B	`conf`	A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem. IEEE Congress on Evolutionary Computation Michael J. Dinneen, Kuai Wei
2013	—	`conf`	On the analysis of a (1+1) adaptive memetic algorithm. Memetic Computing Michael J. Dinneen, Kuai Wei
2012	—	`conf`	A Program-Size Complexity Measure for Mathematical Problems and Conjectures. Computation, Physics and Beyond Michael J. Dinneen
2012	J	`jnl`	An Empirical Approach to the Normality of π. Exp. Math. David H. Bailey, Jonathan M. Borwein, Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, Alex Yee
2012	—	`ed.`	Computation, Physics and Beyond - International Workshop on Theoretical Computer Science, WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday, Auckland, New Zealand, February 21-24, 2012, Revised Selected and Invited Papers Computation, Physics and Beyond Michael J. Dinneen, Bakhadyr Khoussainov, André Nies
2012	J	`jnl`	Faster synchronization in P systems. Nat. Comput. Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
2011	—	`conf`	An Adaptive Algorithm for P System Synchronization. Int. Conf. on Membrane Computing Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
2011	—	`conf`	Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees. CATS Michael J. Dinneen, Masoud Khosravani
2010	—	`conf`	A Faster P Solution for the Byzantine Agreement Problem. Int. Conf. on Membrane Computing Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
2010	B	`conf`	A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs. SIROCCO Michael J. Dinneen, Masoud Khosravani
2010	—	`conf`	Edge- and Node-Disjoint Paths in P Systems MeCBIC Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
2010	J	`jnl`	Experimental Evidence of Quantum Randomness Incomputability CoRR Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, Karl Svozil
2010	J	`jnl`	Foreword. Nat. Comput. Michael J. Dinneen
2010	J	`jnl`	P systems and the Byzantine agreement. J. Log. Algebraic Methods Program. Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
2010	C	`conf`	Synchronization in P Modules. UC Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
2010	J	`jnl`	Towards Structured Modelling with Hyperdag P Systems. Int. J. Comput. Commun. Control Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
2009	—	`conf`	Discovering the Membrane Topology of Hyperdag P Systems. Workshop on Membrane Computing Radu Nicolescu, Michael J. Dinneen, Yun-Bum Kim
2009	—	`conf`	New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems MeCBIC Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu
2007	J	`jnl`	Exact Approximations of omega Numbers. Int. J. Bifurc. Chaos Cristian S. Calude, Michael J. Dinneen
2007	J	`jnl`	Properties of vertex cover obstructions. Discret. Math. Michael J. Dinneen, Rongwei Lai
2007	C	`ed.`	Unconventional Computation, 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings UC Selim G. Akl, Cristian S. Calude, Michael J. Dinneen, Grzegorz Rozenberg, Todd Wareham
2006	J	`jnl`	A New Measure of the Difficulty of Problems. J. Multiple Valued Log. Soft Comput. Cristian S. Calude, Elena Calude, Michael J. Dinneen
2006	C	`ed.`	Unconventional Computation, 5th International Conference, UC 2006, York, UK, September 4-8, 2006, Proceedings UC Cristian S. Calude, Michael J. Dinneen, Gheorghe Paun, Grzegorz Rozenberg, Susan Stepney
2005	B	`ed.`	Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW 2005, Rotorua, New Zealand, August 29 - September 1, 2005 ITW Michael J. Dinneen, Ulrich Speidel, Desmond P. Taylor
2005	C	`ed.`	Unconventional Computation, 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, 2005, Proceedings UC Cristian Calude, Michael J. Dinneen, Gheorghe Paun, Mario J. Pérez-Jiménez, Grzegorz Rozenberg
2004	J	`jnl`	A fast natural algorithm for searching. Theor. Comput. Sci. Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen
2004	—	`conf`	Balance Machines: Computing = Balancing. Aspects of Molecular Computing Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen
2004	C	`ed.`	Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings Developments in Language Theory Cristian Calude, Elena Calude, Michael J. Dinneen
2003	—	`conf`	An Optimal Family of Bounded-Degree Broadcast Networks. CATS Michael J. Dinneen, Nian Zhou
2003	—	`ed.`	Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings DMTCS Cristian Calude, Michael J. Dinneen, Vincent Vajnovszki
2003	J	`jnl`	Update games and update networks. J. Discrete Algorithms Michael J. Dinneen, Bakhadyr Khoussainov
2003	J	`jnl`	What is the Value of Taxicab(6)? J. Univers. Comput. Sci. Cristian Calude, Elena Calude, Michael J. Dinneen
2002	J	`jnl`	Bead-Sort: A Natural Sorting Algorithm. Bull. EATCS Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen
2002	J	`jnl`	Computing a Glimpse of Randomness. Exp. Math. Cristian S. Calude, Michael J. Dinneen, Chi-Kou Shu
2002	J	`jnl`	Degree- and time-constrained broadcast networks. Networks Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson
2002	J	`jnl`	Minor-order obstructions for the graphs of vertex cover 6. J. Graph Theory Michael J. Dinneen, Liu Xiong
2002	J	`jnl`	Relaxed Update and Partition Network Games. Fundam. Informaticae Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
2002	—	`ed.`	Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings UMC Cristian Calude, Michael J. Dinneen, Ferdinand Peper
2001	—	`ed.`	Combinatorics, Computability and Logic, Proceedings of the Third International Conference on Combinatorics, Computability and Logic, DMTCS 20Ol, Constanta, Romania. DMTCS Cristian S. Calude, Michael J. Dinneen, Silviu Sburlan
2001	J	`jnl`	Forbidden minors to graphs with small feedback sets. Discret. Math. Michael J. Dinneen, Kevin Cattell, Michael R. Fellows
2001	B	`conf`	On Game-Theoretic Models of Networks. ISAAC Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
2001	—	`ed.`	Unconventional Models of Computation, UMC'2K, Proceedings of the Second International Conference, Brussel, Belgium, 13-16 December 2000 UMC Ioannis Antoniou, Cristian Calude, Michael J. Dinneen
2000	Misc	`conf`	A Characterization of Graphs with Vertex Cover Six. COCOON Michael J. Dinneen, Liu Xiong
2000	J	`jnl`	On computing graph minor obstruction sets. Theor. Comput. Sci. Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
2000	J	`jnl`	Reflections on quantum computing. Complex. Cristian S. Calude, Michael J. Dinneen, Karl Svozil
2000	B	`conf`	Update Networks and Their Routing Strategies. WG Michael J. Dinneen, Bakhadyr Khoussainov
1999	J	`jnl`	Compound Constructions of Broadcast Networks. Discret. Appl. Math. Michael J. Dinneen, José A. Ventura, Mark C. Wilson, Golbon Zakeri
1999	J	`jnl`	Construction of Time Relaxed Minimal Broadcast Networks. Parallel Process. Lett. Michael J. Dinneen, José A. Ventura, Mark C. Wilson, Golbon Zakeri
1997	J	`jnl`	Logic in Computer Science. J. Univers. Comput. Sci. Douglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov
1997	J	`jnl`	Too Many Minor Order Obstructions. J. Univers. Comput. Sci. Michael J. Dinneen
1996	J	`jnl`	A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. Inf. Process. Lett. Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
1995	J	`jnl`	A computational attack on the conjectures of Graffiti: New counterexamples and proofs. Discret. Math. Tony L. Brewster, Michael J. Dinneen, Vance Faber
1995	—	`—`	Bounded combinatorial width and forbidden substructures. Michael J. Dinneen
1995	B	`conf`	Obstructions to Within a Few Vertices or Edges of Acyclic. WADS Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
1994	—	`conf`	A Characterization of Graphs with Vertex Cover up to Five. ORDAL Kevin Cattell, Michael J. Dinneen
1994	J	`jnl`	New results for the degree/diameter problem. Networks Michael J. Dinneen, Paul R. Hafner
1994	J	`jnl`	The complexity of broadcasting in bounded-degree networks. CoRR Michael J. Dinneen
1992	J	`jnl`	Small Diameter Symmetric Networks from Linear Groups. IEEE Trans. Computers Lowell Campbell, Gunnar E. Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Michael A. Langston, James W. Moore, Andrew P. Mullhaupt, Harlan B. Sexton
1991	—	`conf`	Algebraic Constructions of Efficient Broadcast Networks. AAECC Michael J. Dinneen, Michael R. Fellows, Vance Faber