| 2007 |
|---|
| 32 | | 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
Springer 2007 |
| 31 | EE | Michael J. Dinneen,
Rongwei Lai:
Properties of vertex cover obstructions.
Discrete Mathematics 307(21): 2484-2500 (2007) |
| 30 | EE | Cristian S. Calude,
Michael J. Dinneen:
Exact Approximations of omega Numbers.
I. J. Bifurcation and Chaos 17(6): 1937-1954 (2007) |
| 2006 |
|---|
| 29 | | 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
Springer 2006 |
| 2005 |
|---|
| 28 | | 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
Springer 2005 |
| 2004 |
|---|
| 27 | | Cristian Calude,
Elena Calude,
Michael J. Dinneen:
Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings
Springer 2004 |
| 26 | EE | Joshua J. Arulanandham,
Cristian Calude,
Michael J. Dinneen:
Balance Machines: Computing = Balancing.
Aspects of Molecular Computing 2004: 36-48 |
| 25 | EE | Joshua J. Arulanandham,
Cristian Calude,
Michael J. Dinneen:
A fast natural algorithm for searching.
Theor. Comput. Sci. 320(1): 3-13 (2004) |
| 2003 |
|---|
| 24 | | 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
DMTCS 2003 |
| 23 | EE | Michael J. Dinneen,
Nian Zhou:
An Optimal Family of Bounded-Degree Broadcast Networks.
Electr. Notes Theor. Comput. Sci. 78: (2003) |
| 22 | EE | Michael J. Dinneen,
Bakhadyr Khoussainov:
Update games and update networks.
J. Discrete Algorithms 1(1): 53-65 (2003) |
| 21 | EE | Cristian Calude,
Elena Calude,
Michael J. Dinneen:
What is the Value of Taxicab(6)?
J. UCS 9(10): 1196-1203 (2003) |
| 2002 |
|---|
| 20 | | Cristian Calude,
Michael J. Dinneen,
Ferdinand Peper:
Unconventional Models of Computation, Third International Conference, UMC 2002, Kobe, Japan, October 15-19, 2002, Proceedings
Springer 2002 |
| 19 | | Joshua J. Arulanandham,
Cristian Calude,
Michael J. Dinneen:
Bead-Sort: A Natural Sorting Algorithm.
Bulletin of the EATCS 76: 153-161 (2002) |
| 18 | | Hans L. Bodlaender,
Michael J. Dinneen,
Bakhadyr Khoussainov:
Relaxed Update and Partition Network Games.
Fundam. Inform. 49(4): 301-312 (2002) |
| 17 | EE | Michael J. Dinneen,
Geoffrey Pritchard,
Mark C. Wilson:
Degree- and time-constrained broadcast networks.
Networks 39(3): 121-129 (2002) |
| 2001 |
|---|
| 16 | | 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 |
| 15 | EE | Hans L. Bodlaender,
Michael J. Dinneen,
Bakhadyr Khoussainov:
On Game-Theoretic Models of Networks.
ISAAC 2001: 550-561 |
| 14 | EE | Michael J. Dinneen,
Kevin Cattell,
Michael R. Fellows:
Forbidden minors to graphs with small feedback sets.
Discrete Mathematics 230(1-3): 215-252 (2001) |
| 2000 |
|---|
| 13 | EE | Michael J. Dinneen,
Liu Xiong:
A Characterization of Graphs with Vertex Cover Six.
COCOON 2000: 180-192 |
| 12 | EE | Michael J. Dinneen,
Bakhadyr Khoussainov:
Update Networks and Their Routing Strategies.
WG 2000: 127-136 |
| 11 | EE | 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) |
| 1999 |
|---|
| 10 | EE | Michael J. Dinneen,
Jose A. Ventura,
Mark C. Wilson,
Golbon Zakeri:
Compound Constructions of Broadcast Networks.
Discrete Applied Mathematics 93(2-3): 205-232 (1999) |
| 9 | | Michael J. Dinneen,
Jose A. Ventura,
Mark C. Wilson,
Golbon Zakeri:
Construction of Time Relaxed Minimal Broadcast Networks.
Parallel Processing Letters 9(1): 53-68 (1999) |
| 1997 |
|---|
| 8 | EE | Douglas S. Bridges,
Cristian Calude,
Michael J. Dinneen,
Bakhadyr Khoussainov:
Logic in Computer Science.
J. UCS 3(11): 1133 (1997) |
| 7 | EE | Michael J. Dinneen:
Too Many Minor Order Obstructions.
J. UCS 3(11): 1199-1206 (1997) |
| 1996 |
|---|
| 6 | EE | 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 |
|---|
| 5 | | Kevin Cattell,
Michael J. Dinneen,
Michael R. Fellows:
Obstructions to Within a Few Vertices or Edges of Acyclic.
WADS 1995: 415-427 |
| 4 | EE | Tony L. Brewster,
Michael J. Dinneen,
Vance Faber:
A computational attack on the conjectures of Graffiti: New counterexamples and proofs.
Discrete Mathematics 147(1-3): 35-55 (1995) |
| 1994 |
|---|
| 3 | | Kevin Cattell,
Michael J. Dinneen:
A Characterization of Graphs with Vertex Cover up to Five.
ORDAL 1994: 86-99 |
| 1992 |
|---|
| 2 | | 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 |
|---|
| 1 | | Michael J. Dinneen,
Michael R. Fellows,
Vance Faber:
Algebraic Constructions of Efficient Broadcast Networks.
AAECC 1991: 152-158 |
