Linda Morales

479 total citations
22 papers, 211 citations indexed

About

Linda Morales is a scholar working on Artificial Intelligence, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Linda Morales has authored 22 papers receiving a total of 211 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 7 papers in Computer Networks and Communications and 6 papers in Electrical and Electronic Engineering. Recurrent topics in Linda Morales's work include graph theory and CDMA systems (6 papers), Genome Rearrangement Algorithms (5 papers) and Power Line Communications and Noise (4 papers). Linda Morales is often cited by papers focused on graph theory and CDMA systems (6 papers), Genome Rearrangement Algorithms (5 papers) and Power Line Communications and Noise (4 papers). Linda Morales collaborates with scholars based in United States and Japan. Linda Morales's co-authors include I. Hal Sudborough, Mohammad Heydari, Mohamed Eltoweissy, Bhadrachalam Chitturi, Walter Voit, Melissa Dark, Sergey Bereg, Doina Bein, Wolfgang Bein and Clay Shields and has published in prestigious journals such as Information Sciences, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Linda Morales

20 papers receiving 191 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Linda Morales United States	7	141	69	34	24	23	22	211
Jean‐Frédéric Myoupo France	11	176 1.2×	91 1.3×	11 0.3×	51 2.1×	38 1.7×	47	268
Gautam Goel United States	10	60 0.4×	42 0.6×	13 0.4×	17 0.7×	139 6.0×	19	291
Frank C. Lin United States	7	227 1.6×	25 0.4×	47 1.4×	10 0.4×	61 2.7×	14	334
Benjamin Dowling United Kingdom	9	147 1.0×	133 1.9×	7 0.2×	31 1.3×	88 3.8×	18	320
S. W. Song Brazil	7	100 0.7×	82 1.2×	7 0.2×	25 1.0×	22 1.0×	25	201
Jeremy Archuleta United States	6	187 1.3×	41 0.6×	19 0.6×	22 0.9×	90 3.9×	13	315
Sylvain Guérin France	3	66 0.5×	36 0.5×	10 0.3×	11 0.5×	5 0.2×	9	129
H. K. Dai United States	6	35 0.2×	81 1.2×	35 1.0×	11 0.5×	251 10.9×	18	347
Paul Stelling United States	7	129 0.9×	49 0.7×	8 0.2×	163 6.8×	27 1.2×	9	335
Petr Kolman Czechia	12	117 0.8×	79 1.1×	49 1.4×	25 1.0×	49 2.1×	35	298

Countries citing papers authored by Linda Morales

Since Specialization

Citations

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

Fields of papers citing papers by Linda Morales

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Linda Morales

This figure shows the co-authorship network connecting the top 25 collaborators of Linda Morales. A scholar is included among the top collaborators of Linda Morales 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 Linda Morales. Linda Morales 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

Bereg, Sergey, et al.. (2022). Using permutation rational functions to obtain permutation arrays with large hamming distance. Designs Codes and Cryptography. 90(7). 1659–1677. 2 indexed citations

Bereg, Sergey, et al.. (2019). New lower bounds for permutation arrays using contraction. Designs Codes and Cryptography. 87(9). 2105–2128. 3 indexed citations

Bereg, Sergey, et al.. (2018). Maximizing Hamming Distance in Contraction of Permutation Arrays.. arXiv (Cornell University). 1 indexed citations

Bereg, Sergey, et al.. (2017). Parallel Partition and Extension. 53. 1–6. 2 indexed citations

Bereg, Sergey, et al.. (2017). Kronecker product and tiling of permutation arrays for hamming distances. 4. 2198–2202. 2 indexed citations

Bereg, Sergey, Linda Morales, & I. Hal Sudborough. (2016). Extending permutation arrays: improving MOLS bounds. Designs Codes and Cryptography. 83(3). 661–683. 6 indexed citations

Morales, Linda & Hal Sudborough. (2010). A quadratic lower bound for Topswops. Theoretical Computer Science. 411(44-46). 3965–3970. 1 indexed citations

Yamauchi, Yukiko, Doina Bein, Toshimitsu Masuzawa, Linda Morales, & I. Hal Sudborough. (2009). Calibrating embedded protocols on asynchronous systems. Information Sciences. 180(10). 1793–1801. 3 indexed citations

Dark, Melissa, et al.. (2008). An information security ethics education model. Journal of computing sciences in colleges. 23(6). 82–88. 9 indexed citations

10.

Bein, Wolfgang, Lawrence L. Larmore, Linda Morales, & I. Hal Sudborough. (2008). A Faster and Simpler 2-Approximation Algorithm for Block Sorting.

11.

Bein, Doina, Linda Morales, Wolfgang Bein, et al.. (2008). Clustering and the Biclique Partition Problem. Hawaii International Conference on System Sciences. 475–475. 6 indexed citations

12.

Chitturi, Bhadrachalam, et al.. (2008). An (18/11)n upper bound for sorting by prefix reversals. Theoretical Computer Science. 410(36). 3372–3390. 34 indexed citations

13.

Bein, Wolfgang, Lawrence L. Larmore, Linda Morales, & I. Hal Sudborough. (2008). A quadratic time 2-approximation algorithm for block sorting. Theoretical Computer Science. 410(8-10). 711–717. 2 indexed citations

14.

Heydari, Mohammad, Linda Morales, Clay Shields, & I. Hal Sudborough. (2007). Computing Cross Associations for Attack Graphs and Other Applications. 270b–270b. 4 indexed citations

15.

Heydari, Mohammad, Linda Morales, & I. Hal Sudborough. (2006). Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast. 2918. 218b–218b. 9 indexed citations

16.

Eltoweissy, Mohamed, Mohammad Heydari, Linda Morales, & I. Hal Sudborough. (2004). Combinatorial Optimization of Group Key Management. Journal of Network and Systems Management. 12(1). 33–50. 107 indexed citations

17.

Eltoweissy, Mohamed, Mohammad Heydari, Linda Morales, & I. Hal Sudborough. (2004). Towards trusted online dissemination of consumer information. 46. 6 pp.–6 pp.. 1 indexed citations

18.

Morales, Linda, I. Hal Sudborough, Mohamed Eltoweissy, & Mohammad Heydari. (2003). Combinatorial optimization of multicast key management. 9 pp.–9 pp.. 12 indexed citations

19.

Morales, Linda & I. Hal Sudborough. (2002). Comparing star and pancake networks. Lecture notes in computer science. 18–36. 1 indexed citations

20.

Morales, Linda, et al.. (1996). Pancake networks and pancake problems. 129–129. 1 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