The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael J. Dinneen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael J. Dinneen, Michael R. Fellows, Vance Faber
    Algebraic Constructions of Efficient Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    AAECC, 1991, pp:152-158 [Conf]
  2. Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen
    Balance Machines: Computing = Balancing. [Citation Graph (0, 0)][DBLP]
    Aspects of Molecular Computing, 2004, pp:36-48 [Conf]
  3. Michael J. Dinneen, Liu Xiong
    A Characterization of Graphs with Vertex Cover Six. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:180-192 [Conf]
  4. Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
    On Game-Theoretic Models of Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:550-561 [Conf]
  5. Kevin Cattell, Michael J. Dinneen
    A Characterization of Graphs with Vertex Cover up to Five. [Citation Graph (0, 0)][DBLP]
    ORDAL, 1994, pp:86-99 [Conf]
  6. Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
    Obstructions to Within a Few Vertices or Edges of Acyclic. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:415-427 [Conf]
  7. Michael J. Dinneen, Bakhadyr Khoussainov
    Update Networks and Their Routing Strategies. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:127-136 [Conf]
  8. Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri
    Compound Constructions of Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:2-3, pp:205-232 [Journal]
  9. Michael J. Dinneen, Kevin Cattell, Michael R. Fellows
    Forbidden minors to graphs with small feedback sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:215-252 [Journal]
  10. Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen
    Bead-Sort: A Natural Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:76, n:, pp:153-161 [Journal]
  11. Michael J. Dinneen, Nian Zhou
    An Optimal Family of Bounded-Degree Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal]
  12. Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
    Relaxed Update and Partition Network Games. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:49, n:4, pp:301-312 [Journal]
  13. Kevin Cattell, Michael J. Dinneen, Michael R. Fellows
    A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:4, pp:197-203 [Journal]
  14. Michael J. Dinneen, Bakhadyr Khoussainov
    Update games and update networks. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:53-65 [Journal]
  15. Douglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov
    Logic in Computer Science. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:11, pp:1133- [Journal]
  16. Cristian Calude, Elena Calude, Michael J. Dinneen
    What is the Value of Taxicab(6)? [Citation Graph (0, 0)][DBLP]
    J. UCS, 2003, v:9, n:10, pp:1196-1203 [Journal]
  17. Michael J. Dinneen
    Too Many Minor Order Obstructions. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:11, pp:1199-1206 [Journal]
  18. Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson
    Degree- and time-constrained broadcast networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:3, pp:121-129 [Journal]
  19. Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri
    Construction of Time Relaxed Minimal Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:1, pp:53-68 [Journal]
  20. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1992, v:41, n:2, pp:218-220 [Journal]
  21. Joshua J. Arulanandham, Cristian Calude, Michael J. Dinneen
    A fast natural algorithm for searching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:1, pp:3-13 [Journal]
  22. Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
    On computing graph minor obstruction sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:233, n:1-2, pp:107-127 [Journal]
  23. Tony L. Brewster, Michael J. Dinneen, Vance Faber
    A computational attack on the conjectures of Graffiti: New counterexamples and proofs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:35-55 [Journal]
  24. Michael J. Dinneen, Rongwei Lai
    Properties of vertex cover obstructions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:21, pp:2484-2500 [Journal]

  25. Discovering the Membrane Topology of Hyperdag P Systems. [Citation Graph (, )][DBLP]


  26. A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs. [Citation Graph (, )][DBLP]


  27. New Solutions to the Firing Squad Synchronization Problems for Neural and Hyperdag P Systems [Citation Graph (, )][DBLP]


  28. Experimental Evidence of Quantum Randomness Incomputability [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002