The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. Peter J. Cameron, A. M. Vershik
    Some isometry groups of the Urysohn space. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:143, n:1-3, pp:70-78 [Journal]
  2. Peter J. Cameron
    Normal subgroups of infinite multiply transitive permutation groups. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:4, pp:343-347 [Journal]
  3. Peter J. Cameron
    There are only finitely many finite distance-transitive graphs of given valency greater than two. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:1, pp:9-13 [Journal]
  4. Peter J. Cameron, Michel Deza, Peter Frankl
    Intersection theorems in permutation groups. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:3, pp:249-260 [Journal]
  5. Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald
    Infinite highly arc transitive digraphs and universal covering digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:4, pp:377-396 [Journal]
  6. László Babai, Peter J. Cameron
    Automorphisms and Enumeration of Switching Classes of Tournaments. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  7. Peter J. Cameron
    Cycle Index, Weight Enumerator, and Tutte Polynomial. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  8. Peter J. Cameron
    Homogeneous Permutations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:0, n:2, pp:- [Journal]
  9. Jason P. Bell, Edward A. Bender, Peter J. Cameron, L. Bruce Richmond
    Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  10. Peter J. Cameron
    Counting Two-graphs Related to Trees. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1995, v:2, n:, pp:- [Journal]
  11. Peter J. Cameron, Dudley Stark
    A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  12. Neil J. Calkin, Peter J. Cameron
    Almost Odd Random Sum-Free Sets. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:1, pp:27-32 [Journal]
  13. Peter J. Cameron, William M. Kantor
    Random Permutations: Some Group-Theoretic Aspects. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:257-262 [Journal]
  14. Peter J. Cameron, Cleide Martins
    A Theorem on Reconstruction of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:1-9 [Journal]
  15. Peter J. Cameron
    Stories about Groups and Sequences. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:8, n:1-2, pp:109-133 [Journal]
  16. Priscila P. Alejandro, R. A. Bailey, Peter J. Cameron
    Association schemes and permutation groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:47-67 [Journal]
  17. Peter J. Cameron
    Some counting problems related to permutation groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:225, n:1-3, pp:77-92 [Journal]
  18. Peter J. Cameron
    Random strongly regular graphs? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:273, n:1-3, pp:103-114 [Journal]
  19. Peter J. Cameron
    Multi-letter Youden rectangles from quadratic forms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:143-151 [Journal]
  20. Peter J. Cameron
    Research problems from the 18th British Combinatorial Conference. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:441-451 [Journal]
  21. Peter J. Cameron
    Tribute. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:291, n:1-3, pp:3-0 [Journal]
  22. Peter J. Cameron
    The random graph has the strong small index property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:291, n:1-3, pp:41-43 [Journal]
  23. Peter J. Cameron
    Partitions and permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:291, n:1-3, pp:45-54 [Journal]
  24. Peter J. Cameron
    Research problems from the 19th British Combinatorial Conference. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:313-320 [Journal]
  25. Peter J. Cameron, Ian M. Wanless
    Covering radius for sets of permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:91-109 [Journal]
  26. Peter J. Cameron, Hamid Reza Maimani, G. R. Omidi, Behruz Tayfeh-Rezaie
    3-Designs from PSL(2, q). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3063-3073 [Journal]
  27. Peter J. Cameron
    Research problems from the 2003 IPM Workshop. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3174-3179 [Journal]
  28. R. A. Bailey, Peter J. Cameron, Peter Dobcsányi, John P. Morgan, Leonard H. Soicher
    Designs on the web. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3014-3027 [Journal]
  29. Peter J. Cameron, Charles R. Johnson
    The number of equivalence classes of symmetric sign patterns. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3074-3077 [Journal]
  30. Andries E. Brouwer, Peter J. Cameron, Willem H. Haemers, D. A. Preece
    Self-dual, not self-polar. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3051-3053 [Journal]
  31. Anthony Bonato, Peter J. Cameron, Dejan Delic, Stéphan Thomassé
    Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:3, pp:257-274 [Journal]
  32. Peter J. Cameron
    Homogeneous Cayley Objects. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:6, pp:745-760 [Journal]
  33. Peter J. Cameron
    Problems on Discrete Metric Spaces. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:6, pp:831-838 [Journal]
  34. Peter J. Cameron
    Metric and Topological Aspects of the Symmetric Group of Countable Degree. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:135-142 [Journal]
  35. Peter J. Cameron, C. Y. Ku
    Intersecting families of permutations. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:7, pp:881-890 [Journal]
  36. Peter Cameron, Norbert Knarr
    Tubes in PG(3, q). [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:1, pp:114-124 [Journal]
  37. Peter J. Cameron, John Sheehan, Pablo Spiga
    Semiregular automorphisms of vertex-transitive cubic graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:6, pp:924-930 [Journal]
  38. Peter J. Cameron, Sam Tarzi
    Switching with more than two colours. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:2, pp:169-177 [Journal]
  39. Peter J. Cameron
    Extending Symmetric Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1973, v:14, n:2, pp:215-220 [Journal]
  40. Peter J. Cameron
    Embedding Edge-Colored Complete Graphs in Binary Affine Spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:21, n:2, pp:203-215 [Journal]
  41. Peter J. Cameron, William M. Kantor
    Rank 3 Groups and Biplanes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:24, n:1, pp:1-23 [Journal]
  42. Peter J. Cameron, Jack H. van Lint
    On the Partial Geometry pg(6, 6, 2). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:32, n:2, pp:252-255 [Journal]
  43. Peter J. Cameron, H. D. Macpherson
    Rank three permutation groups with rank three subconstituents. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:1, pp:1-16 [Journal]
  44. Peter J. Cameron, Cheryl E. Praeger
    On 2-arc transitive graphs of girth 4. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:35, n:1, pp:1-11 [Journal]
  45. Peter J. Cameron, Albert L. Wells Jr.
    Signatures and signed switching classes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:3, pp:344-361 [Journal]
  46. Peter J. Cameron
    6-Transitive graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:28, n:2, pp:168-179 [Journal]
  47. Peter J. Cameron
    Automorphisms and cohomology of switching classes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:22, n:3, pp:297-298 [Journal]
  48. Peter J. Cameron, John J. Cannon
    Fast Recognition of Doubly Transitive Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:12, n:4/5, pp:459-474 [Journal]
  49. Peter J. Cameron, Wilfrid Hodges
    Some Combinatorics of Imperfect Information. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:2, pp:673-684 [Journal]
  50. R. A. Bailey, Peter J. Cameron
    What is a design? How should we classify them? [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:44, n:1-3, pp:223-238 [Journal]
  51. Peter J. Cameron, A. Rudvalis
    A design and a geometry for the group Fi 22. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:44, n:1-3, pp:11-14 [Journal]
  52. Peter J. Cameron
    Regular orbits of permutation groups on the power set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:307-309 [Journal]
  53. Peter J. Cameron
    Some sequences of integers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:89-102 [Journal]
  54. Peter J. Cameron
    A census of infinite distance-transitive graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:192, n:1-3, pp:11-26 [Journal]
  55. Peter J. Cameron
    On the probability of connectedness. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:175-187 [Journal]
  56. Peter J. Cameron
    Several 2-(46, 6, 3) designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:1, pp:89-90 [Journal]
  57. Peter J. Cameron
    The age of a relational structure. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:95, n:1-3, pp:49-67 [Journal]
  58. Peter J. Cameron
    Covers of graphs and EGQs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:97, n:1-3, pp:83-92 [Journal]
  59. Peter J. Cameron, Arjeh M. Cohen
    On the number of fixed point free elements in a permutation group. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:135-138 [Journal]
  60. Peter J. Cameron
    Almost all quasigroups have rank 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:111-115 [Journal]
  61. Peter J. Cameron, Cheryl E. Praeger
    Block-transitive t-designs I: point-imprimitive designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:33-43 [Journal]
  62. Peter J. Cameron
    An orbit theorem for Steiner triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:97-100 [Journal]
  63. Peter J. Cameron
    Two-graphs and trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:63-74 [Journal]
  64. Peter J. Cameron
    Infinite linear spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:129, n:1-3, pp:29-41 [Journal]

  65. 3-Designs from PGL(2, q). [Citation Graph (, )][DBLP]


  66. On the Quantum Chromatic Number of a Graph. [Citation Graph (, )][DBLP]


  67. Asymptotics for Incidence Matrix Classes. [Citation Graph (, )][DBLP]


  68. Homomorphism-Homogeneous Relational Structures. [Citation Graph (, )][DBLP]


  69. Orbital Chromatic and Flow Roots. [Citation Graph (, )][DBLP]


  70. Product action. [Citation Graph (, )][DBLP]


  71. Orbit-counting polynomials for graphs and codes. [Citation Graph (, )][DBLP]


  72. Decompositions of complete multipartite graphs. [Citation Graph (, )][DBLP]


  73. A generalisation of t-designs. [Citation Graph (, )][DBLP]


  74. On the subgroup distance problem. [Citation Graph (, )][DBLP]


  75. Random preorders and alignments. [Citation Graph (, )][DBLP]


  76. The complexity of the weight problem for permutation and matrix groups. [Citation Graph (, )][DBLP]


  77. Asymptotic enumeration of 2-covers and line graphs. [Citation Graph (, )][DBLP]


  78. Posets, homomorphisms and homogeneity. [Citation Graph (, )][DBLP]


  79. Research Problems from the BCC21. [Citation Graph (, )][DBLP]


  80. On the Subgroup Distance Problem. [Citation Graph (, )][DBLP]


  81. Permutation codes. [Citation Graph (, )][DBLP]


  82. Problems from CGCS Luminy, May 2007. [Citation Graph (, )][DBLP]


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