The following pages link to Michael J. Dinneen (Q175525):
Displaying 45 items.
- A fast natural algorithm for searching (Q596119) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Update games and update networks (Q876693) (← links)
- P systems and the Byzantine agreement (Q987968) (← links)
- Compound constructions of broadcast networks (Q1296577) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- QUBO formulations for the graph isomorphism problem and related problems (Q1682856) (← links)
- Faster synchronization in P systems (Q1761716) (← links)
- A computational attack on the conjectures of Graffiti: New counterexamples and proofs (Q1910505) (← links)
- Solving a PSPACE-complete problem with cP systems (Q1982985) (← links)
- Quantum solutions for densest \(k\)-subgraph problems (Q1983021) (← links)
- Turing completeness of water computing (Q2152298) (← links)
- Properties of vertex cover obstructions (Q2455575) (← links)
- A QUBO formulation for the tree containment problem (Q2699952) (← links)
- (Q2766676) (← links)
- (Q2766827) (← links)
- (Q2843922) (← links)
- An Adaptive Algorithm for P System Synchronization (Q2890287) (← links)
- A Program-Size Complexity Measure for Mathematical Problems and Conjectures (Q2891304) (← links)
- A Faster P Solution for the Byzantine Agreement Problem (Q3067490) (← links)
- (Q3152812) (← links)
- EXACT APPROXIMATIONS OF OMEGA NUMBERS (Q3510206) (← links)
- A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs (Q3569129) (← links)
- Synchronization in P Modules (Q3575216) (← links)
- (Q4038748) (← links)
- New results for the degree/diameter problem (Q4313626) (← links)
- (Q4329175) (← links)
- (Q4399248) (← links)
- (Q4474121) (← links)
- (Q4520532) (← links)
- (Q4525262) (← links)
- Degree- and time-constrained broadcast networks (Q4537618) (← links)
- Minor‐order obstructions for the graphs of vertex cover 6 (Q4798112) (← links)
- (Q4902290) (← links)
- An Empirical Approach to the Normality of π (Q4908503) (← links)
- Obstructions to within a few vertices or edges of acyclic (Q5057453) (← links)
- (Q5201229) (← links)
- A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing (Q5207191) (← links)
- (Q5439769) (← links)
- Computing a Glimpse of Randomness (Q5472034) (← links)
- Discovering the Membrane Topology of Hyperdag P Systems (Q5851922) (← links)
- Aspects of Molecular Computing (Q5901823) (← links)
- Forbidden minors to graphs with small feedback sets (Q5931421) (← links)
- Sublinear P system solutions to NP-complete problems (Q6038691) (← links)
- Programmable and parallel water computing (Q6177125) (← links)
