The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Luke Pebody: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luke Pebody
    The Reconstructibility of Finite Abelian Groups. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:37, n:6, pp:867-892 [Journal]
  2. Paul Balister, Béla Bollobás, J. Cutler, Luke Pebody
    The Interlace Polynomial of Graphs at - 1. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:7, pp:761-767 [Journal]
  3. Béla Bollobás, Luke Pebody, Oliver Riordan
    Contraction-Deletion Invariants for Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:320-345 [Journal]
  4. Luke Pebody
    The largest strongly consecutive repeat-free code. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:3, pp:551-555 [Journal]
  5. Luke Pebody, A. J. Radcliffe, Alex D. Scott
    Finite Subsets of the Plane are 18-Reconstructible. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:2, pp:262-275 [Journal]

  6. Reconstructing Odd Necklaces. [Citation Graph (, )][DBLP]


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