Michael J. Dinneen

Available identifiers

zbMath Open dinneen.michael-jMaRDI QIDQ175525

List of research outcomes

Publication	Date of Publication	Type
Programmable and parallel water computing	2023-08-29	Paper
Sublinear P system solutions to NP-complete problems	2023-05-02	Paper
A QUBO formulation for the tree containment problem	2023-04-20	Paper
Obstructions to within a few vertices or edges of acyclic	2022-12-16	Paper
Turing completeness of water computing	2022-07-07	Paper
Solving a PSPACE-complete problem with cP systems	2021-09-14	Paper
Quantum solutions for densest \(k\)-subgraph problems	2021-09-14	Paper
A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing	2020-01-08	Paper
QUBO formulations for the graph isomorphism problem and related problems	2017-12-06	Paper
https://portal.mardi4nfdi.de/entity/Q2843922	2013-08-27	Paper
An Empirical Approach to the Normality of π	2013-03-06	Paper
https://portal.mardi4nfdi.de/entity/Q4902290	2013-01-14	Paper
Faster synchronization in P systems	2012-11-15	Paper
A Program-Size Complexity Measure for Mathematical Problems and Conjectures	2012-06-15	Paper
An Adaptive Algorithm for P System Synchronization	2012-06-08	Paper
A Faster P Solution for the Byzantine Agreement Problem	2011-01-21	Paper
P systems and the Byzantine agreement	2010-08-24	Paper
Synchronization in P Modules	2010-07-26	Paper
A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs	2010-06-17	Paper
Discovering the Membrane Topology of Hyperdag P Systems	2010-01-26	Paper
Aspects of Molecular Computing	2009-05-14	Paper
EXACT APPROXIMATIONS OF OMEGA NUMBERS	2008-07-02	Paper
https://portal.mardi4nfdi.de/entity/Q5439769	2008-02-11	Paper
Properties of vertex cover obstructions	2007-10-25	Paper
Update games and update networks	2007-04-26	Paper
Computing a Glimpse of Randomness	2006-06-14	Paper
https://portal.mardi4nfdi.de/entity/Q5201229	2006-04-12	Paper
A fast natural algorithm for searching	2004-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4474121	2004-08-04	Paper
Minor‐order obstructions for the graphs of vertex cover 6	2003-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4329175	2003-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q3152812	2002-12-10	Paper
https://portal.mardi4nfdi.de/entity/Q2766676	2002-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q2766827	2002-07-01	Paper
Degree- and time-constrained broadcast networks	2002-07-01	Paper
Forbidden minors to graphs with small feedback sets	2001-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q4520532	2001-02-26	Paper
https://portal.mardi4nfdi.de/entity/Q4525262	2001-01-21	Paper
On computing graph minor obstruction sets	2000-08-23	Paper
Compound constructions of broadcast networks	1999-08-02	Paper
https://portal.mardi4nfdi.de/entity/Q4399248	1998-07-28	Paper
A simple linear-time algorithm for finding path-decompositions of small width	1997-02-27	Paper
A computational attack on the conjectures of Graffiti: New counterexamples and proofs	1996-03-24	Paper
New results for the degree/diameter problem	1994-11-27	Paper
https://portal.mardi4nfdi.de/entity/Q4038748	1993-05-18	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michael J. Dinneen