default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinda Morales
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Sergey Bereg
, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough:
Using permutation rational functions to obtain permutation arrays with large hamming distance. Des. Codes Cryptogr. 90(7): 1659-1677 (2022)- 2020
- [j8]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Constructing permutation arrays using partition and extension. Des. Codes Cryptogr. 88(2): 311-339 (2020) - [c16]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough:
Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. WAIFI 2020: 234-252 - [i4]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough:
Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. CoRR abs/2003.10072 (2020)
2010 – 2019
- 2019
- [j7]Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
New lower bounds for permutation arrays using contraction. Des. Codes Cryptogr. 87(9): 2105-2128 (2019) - [i3]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough, Alexander Wong:
Equivalence Relations for Computing Permutation Polynomials. CoRR abs/1911.12823 (2019) - 2018
- [i2]Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Maximizing Hamming Distance in Contraction of Permutation Arrays. CoRR abs/1804.03768 (2018) - [i1]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Constructing Permutation Arrays using Partition and Extension. CoRR abs/1804.08252 (2018) - 2017
- [j6]Sergey Bereg, Linda Morales, Ivan Hal Sudborough:
Extending permutation arrays: improving MOLS bounds. Des. Codes Cryptogr. 83(3): 661-683 (2017) - [c15]Linda Morales, Carlos Francisco H. Morales, Juan López, Víctor del Cid, Sebastian Enríquez:
The Effects of User Adaptability to Automation for a Robotic Art Box. CHI Extended Abstracts 2017: 148-153 - [c14]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Parallel Partition and Extension. CISS 2017: 1-6 - [c13]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Kronecker product and tiling of permutation arrays for hamming distances. ISIT 2017: 2198-2202 - 2010
- [j5]Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa, Linda Morales, Ivan Hal Sudborough:
Calibrating embedded protocols on asynchronous systems. Inf. Sci. 180(10): 1793-1801 (2010) - [j4]Linda Morales, Ivan Hal Sudborough:
A quadratic lower bound for Topswops. Theor. Comput. Sci. 411(44-46): 3965-3970 (2010) - [c12]Saïd Bettayeb, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough:
Stack and Queue Layouts for Toruses and Extended Hypercubes. HICSS 2010: 1-10
2000 – 2009
- 2009
- [j3]Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough:
A quadratic time 2-approximation algorithm for block sorting. Theor. Comput. Sci. 410(8-10): 711-717 (2009) - [j2]Bhadrachalam Chitturi, William Fahle, Z. Meng, Linda Morales, Charles O. Shields Jr., Ivan Hal Sudborough, Walter Voit:
An (18/11)n upper bound for sorting by prefix reversals. Theor. Comput. Sci. 410(36): 3372-3390 (2009) - [c11]Wolfgang W. Bein, Shahram Latifi, Linda Morales, Ivan Hal Sudborough:
Bounding the Size of k-Tuple Covers. HICSS 2009: 1-8 - 2008
- [c10]Doina Bein, Linda Morales, Wolfgang W. Bein, Charles O. Shields Jr., Z. Meng, Ivan Hal Sudborough:
Clustering and the Biclique Partition Problem. HICSS 2008: 475 - [c9]Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa, Linda Morales, Ivan Hal Sudborough:
Calibrating an Embedded Protocol on an Asynchronous System. IDC 2008: 227-236 - 2007
- [c8]Linda Morales, Melissa Dark:
Information Security Education and Foundational Research. HICSS 2007: 269 - [c7]Mohammad Hossain Heydari, Linda Morales, Charles O. Shields Jr., Ivan Hal Sudborough:
Computing Cross Associations for Attack Graphs and Other Applications. HICSS 2007: 270 - [r1]Melissa Dark, Richard G. Epstein, Linda Morales, Terry A. Countermine, Qing Yuan:
Pedagogical Framework for EthicalDevelopment. Encyclopedia of Information Ethics and Security 2007: 507-512 - 2006
- [c6]Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough:
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast. HICSS 2006 - [c5]Linda Morales, Melissa Dark:
Minitrack Introduction. HICSS 2006 - 2005
- [c4]Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough:
A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT 2005: 115-124 - 2004
- [j1]Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough:
Combinatorial Optimization of Group Key Management. J. Netw. Syst. Manag. 12(1): 33-50 (2004) - [c3]Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough:
Towards Trusted Online Dissemination of Consumer Information. HICSS 2004 - 2003
- [c2]Linda Morales, Ivan Hal Sudborough, Mohamed Eltoweissy, Mohammad Hossain Heydari:
Combinatorial Optimization of Multicast Key Management. HICSS 2003: 332 - 2002
- [c1]Linda Morales, Ivan Hal Sudborough:
Comparing Star and Pancake Networks. The Essence of Computation 2002: 18-36
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
