The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Dukes: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk
    Topology-Transparent Schedules for Energy Limited Ad hoc Networks. [Citation Graph (0, 0)][DBLP]
    PerCom Workshops, 2006, pp:85-90 [Conf]
  2. Wensong Chu, Charles J. Colbourn, Peter Dukes
    On constant composition codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:6, pp:912-929 [Journal]
  3. Wensong Chu, Charles J. Colbourn, Peter Dukes
    Constructions for Permutation Codes in Powerline Communications. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:32, n:1-3, pp:51-64 [Journal]
  4. Peter Dukes
    On opposite orthogonal Steiner triple systems of non-prime-power order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:252, n:1-3, pp:215-218 [Journal]
  5. Peter Danziger, Peter Dukes, Terry Griggs, Eric Mendelsohn
    On the Intersection Problem for Steiner Triple Systems of Different Orders. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:3, pp:311-329 [Journal]
  6. Jeffrey H. Dinitz, Peter Dukes, Alan C. H. Ling
    Sets of three pairwise orthogonal Steiner triple systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:101, n:1, pp:90-116 [Journal]
  7. Peter Dukes, Alan C. H. Ling
    A combinatorial error bound for t-point-based sampling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:479-488 [Journal]

  8. Disjoint Partial Triple Systems of Different Orders. [Citation Graph (, )][DBLP]


  9. Note edge-colourings of K n, n with no long two-coloured cycles. [Citation Graph (, )][DBLP]


  10. Sequentially Perfect and Uniform One-Factorizations of the Complete Graph. [Citation Graph (, )][DBLP]


  11. Directed complete bipartite graph decompositions: Indirect constructions. [Citation Graph (, )][DBLP]


  12. Small maximally disjoint union-free families. [Citation Graph (, )][DBLP]


  13. The cone condition and t-designs. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
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