Lars Eirik Danielsen

432 total citations
13 papers, 192 citations indexed

About

Lars Eirik Danielsen is a scholar working on Artificial Intelligence, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Lars Eirik Danielsen has authored 13 papers receiving a total of 192 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Artificial Intelligence, 6 papers in Computer Networks and Communications and 4 papers in Electrical and Electronic Engineering. Recurrent topics in Lars Eirik Danielsen's work include Coding theory and cryptography (8 papers), Error Correcting Code Techniques (6 papers) and Quantum Computing Algorithms and Architecture (6 papers). Lars Eirik Danielsen is often cited by papers focused on Coding theory and cryptography (8 papers), Error Correcting Code Techniques (6 papers) and Quantum Computing Algorithms and Architecture (6 papers). Lars Eirik Danielsen collaborates with scholars based in Norway, Spain and Sweden. Lars Eirik Danielsen's co-authors include Matthew G. Parker, Adán Cabello, José R. Portillo, Elias Amselem, Mohamed Bourennane, Patrick Solé, Claude Carlet, T. Aaron Gulliver, Constanza Riera and Eirik Rosnes and has published in prestigious journals such as Physical Review Letters, Physical Review A and Discrete Applied Mathematics.

In The Last Decade

Lars Eirik Danielsen

12 papers receiving 182 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Lars Eirik Danielsen Norway 8 169 96 39 38 23 13 192
Frédéric Sauvage United States 7 225 1.3× 101 1.1× 51 1.3× 21 0.6× 8 0.3× 15 284
Dmitry Gavinsky United States 9 176 1.0× 53 0.6× 108 2.8× 17 0.4× 15 0.7× 27 208
Mehdi Mhalla France 7 126 0.7× 66 0.7× 45 1.2× 11 0.3× 25 1.1× 22 146
John van de Wetering Netherlands 7 245 1.4× 98 1.0× 90 2.3× 40 1.1× 5 0.2× 22 267
Michael E. Beverland United States 9 286 1.7× 177 1.8× 114 2.9× 32 0.8× 26 1.1× 11 345
Tomas Jochym-O’Connor Canada 9 294 1.7× 135 1.4× 130 3.3× 38 1.0× 13 0.6× 19 323
Diego García-Martín Spain 9 284 1.7× 130 1.4× 47 1.2× 22 0.6× 9 0.4× 14 326
Bobak T. Kiani United States 7 231 1.4× 91 0.9× 50 1.3× 16 0.4× 6 0.3× 15 251
Naqueeb Ahmad Warsi India 7 170 1.0× 97 1.0× 18 0.5× 49 1.3× 10 0.4× 18 202
Hongyu Liang China 7 50 0.3× 142 1.5× 37 0.9× 6 0.2× 22 1.0× 17 211

Countries citing papers authored by Lars Eirik Danielsen

Since Specialization
Citations

This map shows the geographic impact of Lars Eirik Danielsen'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 Lars Eirik Danielsen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lars Eirik Danielsen more than expected).

Fields of papers citing papers by Lars Eirik Danielsen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Lars Eirik Danielsen. 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 Lars Eirik Danielsen. The network helps show where Lars Eirik Danielsen may publish in the future.

Co-authorship network of co-authors of Lars Eirik Danielsen

This figure shows the co-authorship network connecting the top 25 collaborators of Lars Eirik Danielsen. A scholar is included among the top collaborators of Lars Eirik Danielsen 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 Lars Eirik Danielsen. Lars Eirik Danielsen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

13 of 13 papers shown
1.
Cabello, Adán, et al.. (2013). Basic exclusivity graphs in quantum correlations. Physical Review A. 88(3). 20 indexed citations
2.
Danielsen, Lars Eirik, et al.. (2013). On graphs and codes preserved by edge local complementation. Designs Codes and Cryptography. 74(3). 601–621.
3.
Amselem, Elias, et al.. (2012). Experimental Fully Contextual Correlations. Physical Review Letters. 108(20). 200405–200405. 45 indexed citations
4.
Cabello, Adán, et al.. (2012). Quantum social networks. Journal of Physics A Mathematical and Theoretical. 45(28). 285101–285101. 10 indexed citations
5.
Cabello, Adán, et al.. (2011). Optimal preparation of graph states. Physical Review A. 83(4). 22 indexed citations
6.
Riera, Constanza, et al.. (2010). Improved adaptive belief propagation decoding using edge-local complementation. 774–778. 1 indexed citations
7.
Danielsen, Lars Eirik & Matthew G. Parker. (2010). Directed graph representation of half-rate additive codes over GF(4). Designs Codes and Cryptography. 59(1-3). 119–130. 7 indexed citations
8.
Carlet, Claude, Lars Eirik Danielsen, Matthew G. Parker, & Patrick Solé. (2010). Self-dual bent functions. 1(4). 384–384. 24 indexed citations
9.
Riera, Constanza, et al.. (2010). On iterative decoding of HDPC codes using weight-bounding graph operations. Repository for Publications and Research Data (ETH Zurich). 2 indexed citations
10.
Danielsen, Lars Eirik & Matthew G. Parker. (2009). Interlace polynomials: Enumeration, unimodality and connections to codes. Discrete Applied Mathematics. 158(6). 636–648. 3 indexed citations
11.
Danielsen, Lars Eirik & Matthew G. Parker. (2008). Edge local complementation and equivalence of binary linear codes. Designs Codes and Cryptography. 49(1-3). 161–170. 12 indexed citations
12.
Danielsen, Lars Eirik & Matthew G. Parker. (2006). On the classification of all self-dual additive codes over GF(4) of length up to 12. Journal of Combinatorial Theory Series A. 113(7). 1351–1367. 39 indexed citations
13.
Danielsen, Lars Eirik, T. Aaron Gulliver, & Matthew G. Parker. (2006). Aperiodic propagation criteria for Boolean functions. Information and Computation. 204(5). 741–770. 7 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

Breakdown of academic impact, for papers by Frédéric Sauvage Breakdown of academic impact, for papers by Dmitry Gavinsky Breakdown of academic impact, for papers by Mehdi Mhalla Breakdown of academic impact, for papers by John van de Wetering Breakdown of academic impact, for papers by Michael E. Beverland Breakdown of academic impact, for papers by Tomas Jochym-O’Connor Breakdown of academic impact, for papers by Diego García-Martín Breakdown of academic impact, for papers by Bobak T. Kiani Breakdown of academic impact, for papers by Naqueeb Ahmad Warsi Breakdown of academic impact, for papers by Hongyu Liang
Rankless by CCL
2026