Michael Dinneen
#60,351
Most Influential Person Now
American mathematician and computer scientist
Michael Dinneen's AcademicInfluence.com Rankings
Michael Dinneenmathematics Degrees
Mathematics
#4826
World Rank
#6827
Historical Rank
Measure Theory
#3952
World Rank
#4659
Historical Rank
Download Badge
Computer Science Mathematics
Michael Dinneen's Degrees
- PhD Computer Science University of California, Berkeley
- Masters Computer Science University of California, Berkeley
- Bachelors Mathematics University of California, Berkeley
Similar Degrees You Can Earn
Why Is Michael Dinneen Influential?
(Suggest an Edit or Addition)According to Wikipedia, Michael J. Dinneen is an American-New Zealand mathematician and computer scientist working as a senior lecturer at the University of Auckland, New Zealand. He is co-director of the Center for Discrete Mathematics and Theoretical Computer Science. He does research in combinatorial algorithms, distributive programming, experimental graph theory, and experimental algorithmic information theory.
Michael Dinneen's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Unconventional Models of Computation (2002) (206)
- Discrete Mathematics and Theoretical Computer Science (2003) (180)
- Improved Mixed-Example Data Augmentation (2018) (98)
- Experimental Evidence of Quantum Randomness Incomputability (2010) (73)
- Computing a Glimpse of Randomness (2001) (68)
- Algebraic Constructions of Efficient Broadcast Networks (1991) (66)
- New results for the degree/diameter problem (1994) (50)
- Logic in Computer Science (1997) (42)
- Four Things Everyone Should Know to Improve Batch Normalization (2019) (39)
- Small Diameter Symmetric Networks from Linear Groups (1992) (37)
- QUBO formulations for the graph isomorphism problem and related problems (2017) (37)
- A New Measure of the Difficulty of Problems (2006) (36)
- A Characterization of Graphs with Vertex Cover up to Five (1994) (33)
- Compound Constructions of Broadcast Networks (1999) (31)
- On computing graph minor obstruction sets (2000) (31)
- An Empirical Approach to the Normality of π (2012) (30)
- A Hybrid Geometric Approach for Measuring Similarity Level Among Documents and Document Clustering (2016) (28)
- Exact Approximations of omega Numbers (2007) (28)
- Reflections on quantum computing (2000) (27)
- Bead-Sort: A Natural Sorting Algorithm (2002) (26)
- Guest Column: Adiabatic Quantum Computing Challenges (2015) (24)
- Forbidden minors to graphs with small feedback sets (2001) (23)
- P systems and the Byzantine agreement (2010) (23)
- Unconventional Models of Computation, UMC’2K (2001) (21)
- A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing (2018) (21)
- Faster synchronization in P systems (2012) (21)
- A Faster P Solution for the Byzantine Agreement Problem (2010) (20)
- A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width (1994) (20)
- Solving the Hamiltonian Cycle Problem using a Quantum Computer (2019) (19)
- Edge- and Node-Disjoint Paths in P Systems (2010) (18)
- Formulating graph covering problems for adiabatic quantum computers (2017) (17)
- Introduction to Algorithms, Data Structures and Formal Languages, 2nd Edition (2004) (17)
- Obstructions to Within a Few Vertices or Edges of Acyclic (1995) (17)
- Solving the Broadcast Time Problem Using a D-wave Quantum Computer (2017) (17)
- Structured Modelling with Hyperdag~P~Systems: Part B (2009) (17)
- Experimentally probing the algorithmic randomness and incomputability of quantum randomness (2018) (17)
- Nondeterminism and Instability in Neural Network Optimization (2021) (16)
- Unconventional Computation and Natural Computation (2015) (15)
- A computational attack on the conjectures of Graffiti: New counterexamples and proofs (1995) (14)
- The complexity of broadcasting in bounded-degree networks (1994) (13)
- A (1+1) Adaptive Memetic Algorithm for the Maximum Clique Problem (2013) (13)
- Minor‐order obstructions for the graphs of vertex cover 6 (2002) (13)
- Too Many Minor Order Obstructions (1997) (12)
- On the analysis of a (1+1) adaptive memetic algorithm (2013) (12)
- Using OpenCL for Implementing Simple Parallel Graph Algorithms (2011) (12)
- Update games and update networks (2003) (11)
- Combinatorics, Complexity and Logic (1999) (11)
- Discovering the Membrane Topology of Hyperdag P Systems (2009) (11)
- Too Many Minor Order Obstructions ( For Parameterized Lower Ideals ) (1997) (11)
- Properties of vertex cover obstructions (2007) (10)
- Synchronization in P Modules (2010) (10)
- On Game-Theoretic Models of Networks (2001) (10)
- Update Networks and Their Routing Strategies (2000) (10)
- Bounded combinatorial width and forbidden substructures (1995) (10)
- Runtime analysis to compare best-improvement and first-improvement in memetic algorithms (2014) (10)
- Graph Minor Embeddings for D-Wave Computer Architecture (2016) (9)
- Is Quantum Randomness Algorithmic Random? A Preliminary Attack (2005) (9)
- What is the Value of Taxicab(6)? (2003) (9)
- Combinatorics, Computability and Logic (2001) (9)
- A Program-Size Complexity Measure for Mathematical Problems and Conjectures (2012) (9)
- New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems (2009) (9)
- On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width (2016) (8)
- Runtime analysis comparison of two fitness functions on a memetic algorithm for the Clique Problem (2014) (8)
- A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs (2010) (8)
- Finding the chromatic sums of graphs using a D-Wave quantum computer (2019) (7)
- Solving SAT with Bilateral Computing (2002) (7)
- VLSI layouts and DNA physical mappings (1995) (6)
- Practical Enumeration Methods for Graphs of Bounded Pathwidth and Treewidth (1997) (6)
- Construction of Time Relaxed Minimal Broadcast Networks (1999) (6)
- Balance Machines: Computing = Balancing (2003) (6)
- Improved Adversarial Robustness via Logit Regularization Methods (2019) (6)
- Obstructions for the Graphs of Vertex Cover Seven (2012) (6)
- An Adaptive Algorithm for P System Synchronization (2011) (6)
- Hardness of Approximation and Integer Programming Frameworks for Searching for Caterpillar Trees (2011) (6)
- Relaxed Update and Partition Network Games (2002) (5)
- A fast natural algorithm for searching (2004) (5)
- The Minor-Order Obstructions for The Graphs of Vertex Cover Six (2000) (5)
- How Random Is Quantum Randomness? An Experimental Approach (2009) (5)
- Proceedings of the 6th international conference on Unconventional Computation (2007) (5)
- Vertex-Disjoint Paths in P~Modules (2010) (5)
- Pre-Proceedings of the Workshop on Multiset Processing (2000) (4)
- What is the Value of Taxicab(6)? An Update (2005) (4)
- Degree‐ and time‐constrained broadcast networks (2002) (4)
- Unconventional models of computation : Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002 : proceedings (2002) (4)
- Proceedings of the Second International Conference on Unconventional Models of Computation (2000) (4)
- TOWARD PRACTICAL P SYSTEMS FOR DISTRIBUTED COMPUTING (2010) (3)
- Breaking the Turing Barrier (1998) (3)
- Computing 80 Initial Bits of A Chaitin Omega Number (2000) (3)
- Hybridizing the dynamic mutation approach with local searches to overcome local optima (2014) (3)
- How Random Is Quantum Randomness? (Extended Version) (2009) (3)
- Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science (2003) (2)
- Series Experimentally Probing the Incomputability of Quantum Randomness (2018) (2)
- Experimental Probing of the Incomputability of Quantum Randomness (2017) (2)
- Computing Close to Optimal Weighted Shortest Paths in Practice (2020) (2)
- An Efficient Algorithm for Mixed Domination on Generalized Series-Parallel Graphs (2017) (2)
- Minor-order obstructions for the graphs of vertex cover 6 (2002) (2)
- Balance Machines: A New Formalism for Computing (2004) (2)
- Computing exact approximations of a chaitin omega number (2004) (2)
- Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings (2004) (1)
- Proc. of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW'05 (2005) (1)
- Normality and the Digits of π (2012) (1)
- Discrete mathematics and theoretical computer science : 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003 : proceedings (2003) (1)
- Unconventional Models of Computation, UMC'2K, Proceedings of the Second International Conference, Brussel, Belgium, 13-16 December 2000 (2001) (1)
- A comparative study of parallel algorithms for the girth problem (2012) (1)
- A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing - Abridged Version (2018) (1)
- Arithmetic Progression Graphs (2014) (1)
- Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond (2012) (1)
- Logarithmic SAT Solution with Membrane Computing (2022) (1)
- Fixed Drawings of Some of the Vertex Cover 6 Obstructions (2004) (1)
- Series On Game-Theoretic Models of Networks (2001) (1)
- On Regular Language Factorisation : A Complete Solution for Unary Case (2004) (1)
- The VLSI Automated Compilation System (VACS) Technical Manual (1995) (1)
- Combinatorics, computation & logic '99 : proceedings of DMTCS'99 and CATS'99 Auckland, New Zealand, 18-21 january 1999 (1999) (0)
- Hardness of Approximation and IP Frameworks for Searching for Caterpillar Trees (2011) (0)
- Comparing Two Local Searches in a (1+1) Restart Memetic Algorithm on the Clique Problem (2013) (0)
- Abstracts of the 2nd Japan - New Zealand Workshop on Logic in Computer Science (1998) (0)
- WHAT IS THE VALUE OF TAXICAB(6)? Extended Abstract (2003) (0)
- Supplemental Papers for DLT04 (2004) (0)
- Proc. 4th International Conference DMTCS'03 (2003) (0)
- The 5th Anniversary Workshop on Discrete Mathematics and Theoretical Computer Science (2000) (0)
- Series Synchronization in P Modules (2010) (0)
- Cdmtcs Research Report Series Compound Constructions of Minimal Broadcast Networks Compound Constructions of Minimal Broadcast Networks (1997) (0)
- D-Wave Experimental Results for an Improved QUBO Formulation of the Broadcast Time Problem (2018) (0)
- Series Bead { Sort : A Natural Sorting Algorithm (2002) (0)
- A Glimpse of Randomness (2002) (0)
- Developments in Language Theory (2008) (0)
- Series Breaking the Turing Barrier (1998) (0)
- Reflections on Quantum Computing Quantum Computing Based on Fixed Point Dynamics WHEN ARE QUANTUM SPEEDUPS POSSIBLE ? (2001) (0)
- Series Towards Practical P Systems : Discovery Algorithms (2011) (0)
- User Friendly Interface for Maintaining BibTeX Databases (1999) (0)
- Call for Papers Eighth International Conference on DEVELOPMENTS IN LANGUAGE THEORY (DLT'04) (2004) (0)
- Supplemental Abstracts for DMTCS01 (2001) (0)
- Series Deterministic Transition P Systems Modeled as Register Machines (2014) (0)
- Simulation of Functional Register Machines using Active P Systems (2014) (0)
- Cdmtcs Research Report Series Degree-and Time- Constrained Broadcast Networks Degree-and Time-constrained Broadcast Networks (1998) (0)
- Branchwidth, Branch Decompositions and b-parses (2013) (0)
- Series Arithmetic Progression Graphs (2009) (0)
- Searching for Spanning k-Caterpillars and k-Trees (2008) (0)
- Algebraic Constructions of E cient Broadcast Networks (2021) (0)
- Checking for Substructures in Graphs of Bounded Pathwidth and Treewidth (2002) (0)
- News from New Zealand / Group-Theoretic Methods for Designing Networks (1998) (0)
- Combinatorics, Computability and Logic Proceedings of the Third International Conference on Combinatorics, Computability and Logic (2001) (0)
- A Conference Submission Web Server (2001) (0)
- Unconventional Computation: 5th International Conference, UC 2006, York, UK, September 4-8, 2006, Proceedings (Lecture Notes in Computer Science) (2006) (0)
- Unconventional Computation, UC 2007 (2005) (0)
- A Repository of Compound Graphs for use in Large Network Design (2007) (0)
- A Simple but Effective Web-Based Report Server (1999) (0)
- A Characterization of Graphs with Vertex Cover Six (2000) (0)
- Finding Minor-Order Obstruction Sets : Feedback Vertex Set 2 (2007) (0)
- Series Branchwidth , Branch Decompositions and b-parses (2013) (0)
- Unconventional Computation, 4th International Conference, UC 2005, Sevilla, Spain, October 3-7, 2005, Proceedings (2005) (0)
- Proceedings of the 8th international conference on Developments in Language Theory (2004) (0)
- An Equivalent QUBO Model to the Minimum Multi-Way Cut Problem (2022) (0)
- Unconventional computation and natural computation : 14th international conference, UCNC 2015, Auckland, New Zealand, August 30-September 3, 2015 : proceedings (2015) (0)
- A Fast Natural Algorithm for Searching: Preliminary version (2003) (0)
- Towards Practical P Systems: Discovery Algorithms (2011) (0)
- A twisted 4-cube, a (6,2) graph of order 32 (1998) (0)
- Using Central Nodes to Improve P System Synchronization (2011) (0)
- Series A Conference Submission Web Server (0)
- Deterministic Transistion P Systems Modeled as Register Machines (2014) (0)
- Drawing Graphs of Bounded Pathwidth (1994) (0)
- Series Reflections on Quantum Computing (2000) (0)
- Runtime Analysis of a ( 1 + 1 ) Adaptive Memetic Algorithm and the Maximum Clique Problem (2013) (0)
- Opening the Book of Randomness (Extended Version) (2010) (0)
- Supplemental Papers for DMTCS03 (2003) (0)
- The Computation of Finite-State Complexity by Tania K . Roblot (2011) (0)
- Supplemental Papers for the 2nd Unconventional Models of Computation Conference (2000) (0)
- Solving the Bounded-Depth Steiner Tree Problem using an Adiabatic Quantum Computer (2019) (0)
- Series Automata with Equational Constraints (1999) (0)
- Proceedings of ACMC 2018 (2018) (0)
- A Computational Attack on Gra ti's Matching and Chromatic Number Conjectures (2007) (0)
- Proc. 8th International Conference on Developments in Language Theory, DLT'04 (2004) (0)
This paper list is powered by the following services:
Other Resources About Michael Dinneen
What Schools Are Affiliated With Michael Dinneen?
Michael Dinneen is affiliated with the following schools:
