Simon R. Blackburn⋆

1.8k total citations
55 papers, 743 citations indexed

About

Simon R. Blackburn⋆ is a scholar working on Artificial Intelligence, Electrical and Electronic Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Simon R. Blackburn⋆ has authored 55 papers receiving a total of 743 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Artificial Intelligence, 25 papers in Electrical and Electronic Engineering and 21 papers in Computational Theory and Mathematics. Recurrent topics in Simon R. Blackburn⋆'s work include Coding theory and cryptography (35 papers), graph theory and CDMA systems (24 papers) and Cellular Automata and Applications (11 papers). Simon R. Blackburn⋆ is often cited by papers focused on Coding theory and cryptography (35 papers), graph theory and CDMA systems (24 papers) and Cellular Automata and Applications (11 papers). Simon R. Blackburn⋆ collaborates with scholars based in United Kingdom, Israel and Australia. Simon R. Blackburn⋆'s co-authors include Tuvi Etzion, Stefanie Gerke, Igor E. Shparlinski, Kenneth G. Paterson, Peter Wild, Peter Neumann, Douglas R. Stinson, Seán Murphy, Jaime Gutiérrez and Domingo Gómez‐Pérez and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and Mathematics of Computation.

In The Last Decade

Simon R. Blackburn⋆

54 papers receiving 693 citations

Peers

Simon R. Blackburn⋆

CTM

EEE

DMC

CNC

Andrew Klapper United States

Daniel Panario Canada

Jean–Pierre Tillich France

Michael J. Dinneen New Zealand

George Havas Australia

Ravi B. Boppana United States

Shachar Lovett United States

Jaikumar Radhakrishnan India

M. Sipser United States

Gyula O. H. Katona Hungary

Andrew Klapper United States

Simon R. Blackburn⋆

697 ×1.8

328 ×1.2

CTM

479 ×1.7

EEE

129 ×0.8

DMC

124 ×0.8

CNC

Citations per year, relative to Simon R. Blackburn⋆ Simon R. Blackburn⋆ (= 1×) peers Andrew Klapper

Countries citing papers authored by Simon R. Blackburn⋆

Since Specialization

Citations

This map shows the geographic impact of Simon R. Blackburn⋆'s research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Simon R. Blackburn⋆ with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Simon R. Blackburn⋆ more than expected).

Fields of papers citing papers by Simon R. Blackburn⋆

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Simon R. Blackburn⋆. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Simon R. Blackburn⋆. The network helps show where Simon R. Blackburn⋆ may publish in the future.

Co-authorship network of co-authors of Simon R. Blackburn⋆

This figure shows the co-authorship network connecting the top 25 collaborators of Simon R. Blackburn⋆. A scholar is included among the top collaborators of Simon R. Blackburn⋆ based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Simon R. Blackburn⋆. Simon R. Blackburn⋆ is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Blackburn⋆, Simon R., et al.. (2023). Constructions and Bounds for Codes With Restricted Overlaps. IEEE Transactions on Information Theory. 70(4). 2479–2490. 5 indexed citations

Weber, Jos H., Kees A. Schouhamer Immink, & Simon R. Blackburn⋆. (2016). Pearson Codes. IEEE Transactions on Information Theory. 9 indexed citations

Blackburn⋆, Simon R., et al.. (2014). The discrete logarithm problem for exponents of bounded height. LMS Journal of Computation and Mathematics. 17(A). 148–156. 2 indexed citations

Blackburn⋆, Simon R., et al.. (2012). Cryptanalysis of three matrix-based key establishment protocols. SHILAP Revista de lepidopterología. 1 indexed citations

Blackburn⋆, Simon R.. (2011). The existence of k-radius sequences. Journal of Combinatorial Theory Series A. 119(1). 212–217. 11 indexed citations

Blackburn⋆, Simon R., Tuvi Etzion, & Siaw‐Lynn Ng. (2010). Traceability codes. Journal of Combinatorial Theory Series A. 117(8). 1049–1057. 13 indexed citations

Blackburn⋆, Simon R. & Stefanie Gerke. (2009). Connectivity of the uniform random intersection graph. Discrete Mathematics. 309(16). 5130–5140. 57 indexed citations

Blackburn⋆, Simon R., Tuvi Etzion, Douglas R. Stinson, & Gregory M. Zaverucha. (2008). A bound on the size of separating hash families. Journal of Combinatorial Theory Series A. 115(7). 1246–1256. 18 indexed citations

Blackburn⋆, Simon R. & Igor E. Shparlinski. (2007). On the average energy of circulant graphs. Linear Algebra and its Applications. 428(8-9). 1956–1963. 17 indexed citations

10.

Blackburn⋆, Simon R.. (2006). Sets of permutations that generate the symmetric group pairwise. Journal of Combinatorial Theory Series A. 113(7). 1572–1581. 19 indexed citations

11.

Blackburn⋆, Simon R. & Igor E. Shparlinski. (2006). Character sums and nonlinear recurrence sequences. Discrete Mathematics. 306(12). 1126–1131. 4 indexed citations

12.

Blackburn⋆, Simon R., Domingo Gómez‐Pérez, Jaime Gutiérrez, & Igor E. Shparlinski. (2004). Predicting nonlinear pseudorandom number generators. Mathematics of Computation. 74(251). 1471–1495. 26 indexed citations

13.

Blackburn⋆, Simon R., Domingo Gómez‐Pérez, Jaime Gutiérrez, & Igor E. Shparlinski. (2003). Predicting the Inversive Generator. Lecture notes in computer science. 2898. 264–275. 1 indexed citations

14.

Blackburn⋆, Simon R.. (2000). Perfect Hash Families: Probabilistic Methods and Explicit Constructions. Journal of Combinatorial Theory Series A. 92(1). 54–60. 35 indexed citations

15.

Blackburn⋆, Simon R.. (1999). Groups of Prime Power Order with Derived Subgroup of Prime Order. Journal of Algebra. 219(2). 625–657. 19 indexed citations

16.

Blackburn⋆, Simon R.. (1998). Orthogonal Sequences of Polynomials over Arbitrary Fields. Journal of Number Theory. 68(1). 99–111. 7 indexed citations

17.

Blackburn⋆, Simon R. & Peter Wild. (1998). Optimal Linear Perfect Hash Families. Journal of Combinatorial Theory Series A. 83(2). 233–250. 33 indexed citations

18.

Blackburn⋆, Simon R., Seán Murphy, & Kenneth G. Paterson. (1997). Comments on “Theory and applications of cellular automata in cryptography”. IEEE Transactions on Software Engineering. 23(9). 637–638. 4 indexed citations

19.

Blackburn⋆, Simon R., Tuvi Etzion, & Kenneth G. Paterson. (1996). Permutation Polynomials, de Bruijn Sequences, and Linear Complexity. Journal of Combinatorial Theory Series A. 76(1). 55–82. 25 indexed citations

20.

Blackburn⋆, Simon R.. (1996). A note on sequences with the shift and add property. Designs Codes and Cryptography. 9(3). 251–256. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact