This map shows the geographic impact of Tor Helleseth'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 Tor Helleseth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tor Helleseth more than expected).
This network shows the impact of papers produced by Tor Helleseth. 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 Tor Helleseth. The network helps show where Tor Helleseth may publish in the future.
Co-authorship network of co-authors of Tor Helleseth
This figure shows the co-authorship network connecting the top 25 collaborators of Tor Helleseth.
A scholar is included among the top collaborators of Tor Helleseth 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 Tor Helleseth. Tor Helleseth is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Helleseth, Tor. (2011). De Bruijn Sequence.. 315–316.
11.
Hasan, M.A., et al.. (2010). Arithmetic of finite fields : third international workshop, WAIFI 2010, Istanbul, Turkey, June 27-30, 2010 : proceedings. Springer eBooks.1 indexed citations
12.
Ding, Cunsheng, Tor Helleseth, Torleiv Kløve, & Xuesong Wang. (2007). A general construction of authentication codes. IEEE Transactions on Information Theory.18 indexed citations
13.
Helleseth, Tor, et al.. (2006). Sequences and Their Applications SETA 2006: 4th International Conference, Beijing, China, September 24-28, 2006,Proceedings (Lecture Notes in Computer Science). Springer eBooks.1 indexed citations
Helleseth, Tor, et al.. (2004). Linear complexity over F p of Sidel'nikov sequences.. TU/e Research Portal (Eindhoven University of Technology). 122.2 indexed citations
16.
Kim, Young Sik, Ji-Woong Jang, Jong‐Seon No, & Tor Helleseth. (2004). New Constructions of p -ary Bent Sequences. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 13(2). 489–494.1 indexed citations
Kim, Sang‐Hyo, Jong‐Seon No, & Tor Helleseth. (2001). Trace Representation of Lempel-Cohn-Eastman Sequences. 한국통신학회 학술대회논문집. 1082–1085.1 indexed citations
19.
Park, Choon‐Sik, et al.. (1993). All-Nothing Election Scheme and Anonymous Channel.18 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.