Linda Morales

Orcid: 0000-0003-0929-4386

According to our database1, Linda Morales authored at least 28 papers between 2002 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Using permutation rational functions to obtain permutation arrays with large hamming distance.
Des. Codes Cryptogr., 2022

2020
Constructing permutation arrays using partition and extension.
Des. Codes Cryptogr., 2020

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions.
Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

2019
New lower bounds for permutation arrays using contraction.
Des. Codes Cryptogr., 2019

Equivalence Relations for Computing Permutation Polynomials.
CoRR, 2019

2018
Maximizing Hamming Distance in Contraction of Permutation Arrays.
CoRR, 2018

2017
Extending permutation arrays: improving MOLS bounds.
Des. Codes Cryptogr., 2017

Kronecker product and tiling of permutation arrays for hamming distances.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Parallel Partition and Extension.
Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017

The Effects of User Adaptability to Automation for a Robotic Art Box.
Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems, 2017

2010
A quadratic lower bound for Topswops.
Theor. Comput. Sci., 2010

Calibrating embedded protocols on asynchronous systems.
Inf. Sci., 2010

Stack and Queue Layouts for Toruses and Extended Hypercubes.
Proceedings of the 43rd Hawaii International International Conference on Systems Science (HICSS-43 2010), 2010

2009
An (18/11)n upper bound for sorting by prefix reversals.
Theor. Comput. Sci., 2009

A quadratic time 2-approximation algorithm for block sorting.
Theor. Comput. Sci., 2009

Bounding the Size of k-Tuple Covers.
Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

2008
Calibrating an Embedded Protocol on an Asynchronous System.
Proceedings of the Intelligent Distributed Computing, Systems and Applications, Proceedings of the 2nd International Symposium on Intelligent Distributed Computing, 2008

Clustering and the Biclique Partition Problem.
Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

2007
Pedagogical Framework for EthicalDevelopment.
Proceedings of the Encyclopedia of Information Ethics and Security, 2007

Information Security Education and Foundational Research.
Proceedings of the 40th Hawaii International International Conference on Systems Science (HICSS-40 2007), 2007

Computing Cross Associations for Attack Graphs and Other Applications.
Proceedings of the 40th Hawaii International International Conference on Systems Science (HICSS-40 2007), 2007

2006
Minitrack Introduction.
Proceedings of the 39th Hawaii International International Conference on Systems Science (HICSS-39 2006), 2006

Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast.
Proceedings of the 39th Hawaii International International Conference on Systems Science (HICSS-39 2006), 2006

2005
A Faster and Simpler 2-Approximation Algorithm for Block Sorting.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Combinatorial Optimization of Group Key Management.
J. Netw. Syst. Manag., 2004

Towards Trusted Online Dissemination of Consumer Information.
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004

2003
Combinatorial Optimization of Multicast Key Management.
Proceedings of the 36th Hawaii International Conference on System Sciences (HICSS-36 2003), 2003

2002
Comparing Star and Pancake Networks.
Proceedings of the Essence of Computation, Complexity, Analysis, 2002


  Loading...