default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael J. Dinneen
Person information
- affiliation: University of Auckland, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j44]Shahrokh Heidari
, Michael J. Dinneen, Patrice Delmas:
Quantum Annealing for Computer Vision minimization problems. Future Gener. Comput. Syst. 160: 54-64 (2024)- [j43]Lucie Ciencialová, Michael J. Dinneen, Radu Nicolescu, Ludek Cienciala:
Solving QUBO problems with cP systems. J. Membr. Comput. 6(3): 202-210 (2024) - [j42]José Manuel Agüero Trejo, Cristian S. Calude, Michael J. Dinneen, Arkady Fedorov, Anatoly Kulikov, Rohit Navarathna, Karl Svozil:
How real is incomputability in physics? Theor. Comput. Sci. 1003: 114632 (2024) - 2023
- [j41]Alec Henderson, Radu Nicolescu, Michael J. Dinneen, T. N. Chan, Hendrik Happe, Thomas Hinze:
Programmable and parallel water computing. J. Membr. Comput. 5(1): 25-54 (2023) - [j40]Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz:
A QUBO formulation for the Tree Containment problem. Theor. Comput. Sci. 940(Part): 60-79 (2023) - [j39]Michael J. Dinneen, Alec Henderson, Radu Nicolescu:
Sublinear P system solutions to NP-complete problems. Theor. Comput. Sci. 958: 113848 (2023) - [i12]José Manuel Agüero Trejo, Cristian S. Calude, Michael J. Dinneen, Arkady Fedorov, Anatoly Kulikov, Rohit Navarathna, Karl Svozil:
How Real is Incomputability in Physics? CoRR abs/2311.00908 (2023) - [i11]Shahrokh Heidari, Michael J. Dinneen, Patrice Delmas:
Quantum Annealing for Computer Vision Minimization Problems. CoRR abs/2312.12848 (2023) - 2022
- [j38]Radu Nicolescu, Michael J. Dinneen, James Cooper, Alec Henderson, Yezhou Liu:
Logarithmic SAT Solution with Membrane Computing. Axioms 11(2): 66 (2022) - [i10]Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz:
A QUBO formulation for the Tree Containment problem. CoRR abs/2202.11234 (2022) - 2021
- [j37]Alec Henderson, Radu Nicolescu, Michael J. Dinneen, T. N. Chan, Hendrik Happe, Thomas Hinze:
Turing completeness of water computing. J. Membr. Comput. 3(3): 182-193 (2021) - [c32]Cecilia Summers, Michael J. Dinneen:
Nondeterminism and Instability in Neural Network Optimization. ICML 2021: 9913-9922 - [c31]Nguyet Tran, Michael J. Dinneen:
Close Euclidean Shortest Path Crossing an Ordered 3D Skew Segment Sequence. ISGV 2021: 157-174 - [i9]Cecilia Summers, Michael J. Dinneen:
Nondeterminism and Instability in Neural Network Optimization. CoRR abs/2103.04514 (2021) - 2020
- [j36]Cristian S. Calude, Michael J. Dinneen, Richard Hua:
Quantum solutions for densest k-subgraph problems. J. Membr. Comput. 2(1): 26-41 (2020) - [j35]Alec Henderson, Radu Nicolescu, Michael J. Dinneen:
Solving a PSPACE-complete problem with cP systems. J. Membr. Comput. 2(4): 311-322 (2020) - [j34]Richard Hua, Michael J. Dinneen:
Improved QUBO Formulation of the Graph Isomorphism Problem. SN Comput. Sci. 1(1): 19:1-19:18 (2020) - [c30]Nguyet Tran, Michael J. Dinneen, Simone Linz:
Computing Close to Optimal Weighted Shortest Paths in Practice. ICAPS 2020: 291-299 - [c29]Nguyet Tran, Michael J. Dinneen, Simone Linz:
Close Weighted Shortest Paths on 3D Terrain Surfaces. SIGSPATIAL/GIS 2020: 597-607 - [c28]Cecilia Summers, Michael J. Dinneen:
Four Things Everyone Should Know to Improve Batch Normalization. ICLR 2020
2010 – 2019
- 2019
- [j33]Michael J. Dinneen, Anuradha Mahasinghe, Kai Liu:
Finding the chromatic sums of graphs using a D-Wave quantum computer. J. Supercomput. 75(8): 4811-4828 (2019) - [c27]Anuradha Mahasinghe, Richard Hua, Michael J. Dinneen, Rajni Goyal:
Solving the Hamiltonian Cycle Problem using a Quantum Computer. ACSW 2019: 8:1-8:9 - [c26]Cecilia Summers, Michael J. Dinneen:
Improved Mixed-Example Data Augmentation. WACV 2019: 1262-1270 - [i8]Cecilia Summers, Michael J. Dinneen:
Four Things Everyone Should Know to Improve Batch Normalization. CoRR abs/1906.03548 (2019) - [i7]Cecilia Summers, Michael J. Dinneen:
Improved Adversarial Robustness via Logit Regularization Methods. CoRR abs/1906.03749 (2019) - 2018
- [j32]M. Rajaati, Mohammad Reza Hooshmandasl, Michael J. Dinneen, Ali Shakiba:
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j31]Michael J. Dinneen, Ulrich Speidel:
Preface. Nat. Comput. 17(2): 295 (2018) - [c25]Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, Richard Hua:
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing - Abridged Version. PC@UCNC 2018: 1-13 - [i6]Alastair A. Abbott, Cristian S. Calude, Michael J. Dinneen, Richard Hua:
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing. CoRR abs/1803.04340 (2018) - [i5]Cecilia Summers, Michael J. Dinneen:
Improved Mixed-Example Data Augmentation. CoRR abs/1805.11272 (2018) - 2017
- [j30]Cristian S. Calude, Michael J. Dinneen, Richard Hua:
QUBO formulations for the graph isomorphism problem and related problems. Theor. Comput. Sci. 701: 54-69 (2017) - [c24]Michael J. Dinneen, Richard Hua:
Formulating graph covering problems for adiabatic quantum computers. ACSW 2017: 18:1-18:10 - [i4]M. Rajaati, Pouyeh Sharifani, Ali Shakiba, Mohammad Reza Hooshmandasl, Michael J. Dinneen:
An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs. CoRR abs/1708.00240 (2017) - 2016
- [j29]Cristian S. Calude, Michael J. Dinneen:
Editorial. Int. J. Unconv. Comput. 12(1): 1-2 (2016) - [c23]Arash Heidarian, Michael J. Dinneen:
A Hybrid Geometric Approach for Measuring Similarity Level Among Documents and Document Clustering. BigDataService 2016: 142-151 - [i3]M. Rajaati, Mohammad Reza Hooshmandasl, Michael J. Dinneen, Ali Shakiba:
On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width. CoRR abs/1612.08234 (2016) - 2015
- [j28]Cristian S. Calude, Elena Calude, Michael J. Dinneen:
Guest Column: Adiabatic Quantum Computing Challenges. SIGACT News 46(1): 40-61 (2015) - [e11]Cristian S. Calude, Michael J. Dinneen:
Unconventional Computation and Natural Computation - 14th International Conference, UCNC 2015, Auckland, New Zealand, August 30 - September 3, 2015, Proceedings. Lecture Notes in Computer Science 9252, Springer 2015, ISBN 978-3-319-21818-2 [contents] - 2014
- [c22]Kuai Wei, Michael J. Dinneen:
Hybridizing the dynamic mutation approach with local searches to overcome local optima. IEEE Congress on Evolutionary Computation 2014: 74-81 - [c21]Kuai Wei, Michael J. Dinneen:
Runtime analysis comparison of two fitness functions on a memetic algorithm for the Clique Problem. IEEE Congress on Evolutionary Computation 2014: 133-140 - [c20]Kuai Wei, Michael J. Dinneen:
Runtime analysis to compare best-improvement and first-improvement in memetic algorithms. GECCO 2014: 1439-1446 - 2013
- [c19]Michael J. Dinneen, Kuai Wei:
A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem. IEEE Congress on Evolutionary Computation 2013: 1626-1634 - [c18]Michael J. Dinneen, Kuai Wei:
On the analysis of a (1+1) adaptive memetic algorithm. Memetic Computing 2013: 24-31 - 2012
- [j27]David H. Bailey, Jonathan M. Borwein, Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, Alex Yee:
An Empirical Approach to the Normality of π. Exp. Math. 21(4): 375-384 (2012) - [j26]Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu:
Faster synchronization in P systems. Nat. Comput. 11(1): 107-115 (2012) - [c17]Michael J. Dinneen:
A Program-Size Complexity Measure for Mathematical Problems and Conjectures. Computation, Physics and Beyond 2012: 81-93 - [e10]Michael J. Dinneen, Bakhadyr Khoussainov, André Nies:
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. Lecture Notes in Computer Science 7160, Springer 2012, ISBN 978-3-642-27653-8 [contents] - 2011
- [c16]Michael J. Dinneen, Masoud Khosravani:
Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees. CATS 2011: 145-150 - [c15]Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu:
An Adaptive Algorithm for P System Synchronization. Int. Conf. on Membrane Computing 2011: 139-164 - 2010
- [j25]Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu:
Towards Structured Modelling with Hyperdag P Systems. Int. J. Comput. Commun. Control 5(2): 224-237 (2010) - [j24]Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu:
P systems and the Byzantine agreement. J. Log. Algebraic Methods Program. 79(6): 334-349 (2010) - [j23]Michael J. Dinneen:
Foreword. Nat. Comput. 9(2): 295 (2010) - [c14]Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu:
A Faster P Solution for the Byzantine Agreement Problem. Int. Conf. on Membrane Computing 2010: 175-197 - [c13]Michael J. Dinneen, Masoud Khosravani:
A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs. SIROCCO 2010: 237-246 - [c12]Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu:
Synchronization in P Modules. UC 2010: 32-44 - [c11]Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu:
Edge- and Node-Disjoint Paths in P Systems. MeCBIC 2010: 121-141 - [i2]Cristian S. Calude, Michael J. Dinneen, Monica Dumitrescu, Karl Svozil:
Experimental Evidence of Quantum Randomness Incomputability. CoRR abs/1004.1521 (2010)
2000 – 2009
- 2009
- [c10]Radu Nicolescu, Michael J. Dinneen, Yun-Bum Kim:
Discovering the Membrane Topology of Hyperdag P Systems. Workshop on Membrane Computing 2009: 410-435 - [c9]Michael J. Dinneen, Yun-Bum Kim, Radu Nicolescu:
New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems. MeCBIC 2009: 107-122 - 2007
- [j22]Michael J. Dinneen, Rongwei Lai:
Properties of vertex cover obstructions. Discret. Math. 307(21): 2484-2500 (2007) - [j21]Cristian S. Calude, Michael J. Dinneen:
Exact Approximations of omega Numbers. Int. J. Bifurc. Chaos 17(6): 1937-1954 (2007) - [e9]Selim G. Akl, Cristian S. Calude, Michael J. Dinneen, Grzegorz Rozenberg, Todd Wareham:
Unconventional Computation, 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings. Lecture Notes in Computer Science 4618, Springer 2007, ISBN 978-3-540-73553-3 [contents] - 2006
- [j20]Cristian S. Calude, Elena Calude, Michael J. Dinneen:
A New Measure of the Difficulty of Problems. J. Multiple Valued Log. Soft Comput. 12(3-4): 285-307 (2006) - [e8]Cristian S. Calude, Michael J. Dinneen, Gheorghe Paun, Grzegorz Rozenberg, Susan Stepney:
Unconventional Computation, 5th International Conference, UC 2006, York, UK, September 4-8, 2006, Proceedings. Lecture Notes in Computer Science 4135, Springer 2006, ISBN 3-540-38593-2 [contents] - 2005
- [e7]Michael J. Dinneen, Ulrich Speidel, Desmond P. Taylor:
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW 2005, Rotorua, New Zealand, August 29 - September 1, 2005. IEEE 2005 [contents] - [e6]Cristian Calude, Michael J. Dinneen, Gheorghe Paun, Mario J. Pérez-Jiménez, Grzegorz Rozenberg:
Unconventional Computation, 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, 2005, Proceedings. Lecture Notes in Computer Science 3699, Springer 2005, ISBN 3-540-29100-8 [contents] - 2004
- [j19]Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen:
A fast natural algorithm for searching. Theor. Comput. Sci. 320(1): 3-13 (2004) - [c8]Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen:
Balance Machines: Computing = Balancing. Aspects of Molecular Computing 2004: 36-48 - [e5]Cristian Calude, Elena Calude, Michael J. Dinneen:
Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings. Lecture Notes in Computer Science 3340, Springer 2004, ISBN 3-540-24014-4 [contents] - 2003
- [j18]Michael J. Dinneen, Bakhadyr Khoussainov:
Update games and update networks. J. Discrete Algorithms 1(1): 53-65 (2003) - [j17]Cristian Calude, Elena Calude, Michael J. Dinneen:
What is the Value of Taxicab(6)? J. Univers. Comput. Sci. 9(10): 1196-1203 (2003) - [c7]Michael J. Dinneen, Nian Zhou:
An Optimal Family of Bounded-Degree Broadcast Networks. CATS 2003: 196-208 - [e4]Cristian Calude, Michael J. Dinneen, Vincent Vajnovszki:
Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings. Lecture Notes in Computer Science 2731, Springer 2003, ISBN 3-540-40505-4 [contents] - 2002
- [j16]Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen:
Bead-Sort: A Natural Sorting Algorithm. Bull. EATCS 76: 153-161 (2002) - [j15]Cristian S. Calude, Michael J. Dinneen, Chi-Kou Shu:
Computing a Glimpse of Randomness. Exp. Math. 11(3): 361-370 (2002) - [j14]Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov:
Relaxed Update and Partition Network Games. Fundam. Informaticae 49(4): 301-312 (2002) - [j13]Michael J. Dinneen, Liu Xiong:
Minor-order obstructions for the graphs of vertex cover 6. J. Graph Theory 41(3): 163-178 (2002) - [j12]Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson:
Degree- and time-constrained broadcast networks. Networks 39(3): 121-129 (2002) - [e3]Cristian Calude, Michael J. Dinneen, Ferdinand Peper:
Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings. Lecture Notes in Computer Science 2509, Springer 2002, ISBN 3-540-44311-8 [contents] - 2001
- [j11]Michael J. Dinneen, Kevin Cattell, Michael R. Fellows:
Forbidden minors to graphs with small feedback sets. Discret. Math. 230(1-3): 215-252 (2001) - [c6]Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov:
On Game-Theoretic Models of Networks. ISAAC 2001: 550-561 - [e2]Cristian S. Calude, Michael J. Dinneen, Silviu Sburlan:
Combinatorics, Computability and Logic, Proceedings of the Third International Conference on Combinatorics, Computability and Logic, DMTCS 20Ol, Constanta, Romania. Discrete mathematics and theoretical computer science, Springer 2001, ISBN 978-1-85233-526-7 [contents] - [e1]Ioannis Antoniou, Cristian Calude, Michael J. Dinneen:
Unconventional Models of Computation, UMC'2K, Proceedings of the Second International Conference, Brussel, Belgium, 13-16 December 2000. Springer 2001, ISBN 1-85233-415-0 [contents] - 2000
- [j10]Cristian S. Calude, Michael J. Dinneen, Karl Svozil:
Reflections on quantum computing. Complex. 6(1): 35-37 (2000) - [j9]Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston:
On computing graph minor obstruction sets. Theor. Comput. Sci. 233(1-2): 107-127 (2000) - [c5]Michael J. Dinneen, Liu Xiong:
A Characterization of Graphs with Vertex Cover Six. COCOON 2000: 180-192 - [c4]Michael J. Dinneen, Bakhadyr Khoussainov:
Update Networks and Their Routing Strategies. WG 2000: 127-136
1990 – 1999
- 1999
- [j8]Michael J. Dinneen, José A. Ventura, Mark C. Wilson, Golbon Zakeri:
Compound Constructions of Broadcast Networks. Discret. Appl. Math. 93(2-3): 205-232 (1999) - [j7]Michael J. Dinneen, José A. Ventura, Mark C. Wilson, Golbon Zakeri:
Construction of Time Relaxed Minimal Broadcast Networks. Parallel Process. Lett. 9(1): 53-68 (1999) - 1997
- [j6]Douglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov:
Logic in Computer Science. J. Univers. Comput. Sci. 3(11): 1133 (1997) - [j5]Michael J. Dinneen:
Too Many Minor Order Obstructions. J. Univers. Comput. Sci. 3(11): 1199-1206 (1997) - 1996
- [j4]Kevin Cattell, Michael J. Dinneen, Michael R. Fellows:
A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. Inf. Process. Lett. 57(4): 197-203 (1996) - 1995
- [b1]Michael J. Dinneen:
Bounded combinatorial width and forbidden substructures. University of Victoria, Canada, 1995 - [j3]Tony L. Brewster, Michael J. Dinneen, Vance Faber:
A computational attack on the conjectures of Graffiti: New counterexamples and proofs. Discret. Math. 147(1-3): 35-55 (1995) - [c3]Kevin Cattell, Michael J. Dinneen, Michael R. Fellows:
Obstructions to Within a Few Vertices or Edges of Acyclic. WADS 1995: 415-427 - 1994
- [j2]Michael J. Dinneen, Paul R. Hafner:
New results for the degree/diameter problem. Networks 24(7): 359-367 (1994) - [c2]Kevin Cattell, Michael J. Dinneen:
A Characterization of Graphs with Vertex Cover up to Five. ORDAL 1994: 86-99 - [i1]Michael J. Dinneen:
The complexity of broadcasting in bounded-degree networks. CoRR abs/math/9411222 (1994) - 1992
- [j1]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:
Small Diameter Symmetric Networks from Linear Groups. IEEE Trans. Computers 41(2): 218-220 (1992) - 1991
- [c1]Michael J. Dinneen, Michael R. Fellows, Vance Faber:
Algebraic Constructions of Efficient Broadcast Networks. AAECC 1991: 152-158
Coauthor Index
Cristian S. Calude
aka: Cristian Calude
aka: Cristian Calude
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
