default search action
Leocadio G. Casado
Leocadio González Casado
Person information
- affiliation: University of Almería, Informatics Department
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c29]Eligius M. T. Hendrix
, Leocadio G. Casado
On Polytopal Branch and Bound with Monotonicity. ICCSA (Workshops 2) 2024: 397-414 - 2022
- [j38]Boglárka G.-Tóth
On monotonicity and search strategies in face-based copositivity detection algorithms. Central Eur. J. Oper. Res. 30(3): 1071-1092 (2022) - [c28]Leocadio G. Casado
On Monotonicity Detection in Simplicial Branch and Bound over a Simplex. ICCSA (Workshops 2) 2022: 113-126 - 2021
- [j37]Linas Stripinis
On MATLAB experience in accelerating DIRECT-GLce algorithm for constrained global optimization through dynamic data structures and parallelization. Appl. Math. Comput. 390: 125596 (2021) - [j36]Cristóbal Medina-López
An SDN approach to detect targeted attacks in P2P fully connected overlays. Int. J. Inf. Sec. 20(2): 245-255 (2021) - [j35]Boglárka G.-Tóth
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic. J. Glob. Optim. 80(4): 779-804 (2021) - [j34]Eligius M. T. Hendrix
On derivative based bounding for simplicial branch and bound. RAIRO Oper. Res. 55(3): 2023-2034 (2021) - 2020
- [j33]Eligius M. T. Hendrix
Preface: Special issue Europt 2018. J. Glob. Optim. 77(1): 1-2 (2020)
2010 – 2019
- 2019
- [j32]Cristóbal Medina-López
Reducing Streaming Cost While Increasing Privacy: A Case Study on a Smartphone and Chromecast Using Peer-to-Peer Technology to Skip Third-Party Servers. IEEE Consumer Electron. Mag. 8(2): 50-55 (2019) - 2018
- [j31]Guillermo Aparicio, Jose M. G. Salmerón, Leocadio G. Casado
Parallel algorithms for computing the smallest binary tree size in unit simplex refinement. J. Parallel Distributed Comput. 112: 166-178 (2018) - 2017
- [j30]Jose M. G. Salmerón, Guillermo Aparicio, Leocadio G. Casado
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement. J. Comb. Optim. 33(2): 389-402 (2017) - [j29]Juan F. R. Herrera, Jose M. G. Salmerón
On parallel Branch and Bound frameworks for Global Optimization. J. Glob. Optim. 69(3): 547-560 (2017) - [j28]Gloria Ortega López, Ernestas Filatovas
Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU. J. Glob. Optim. 69(3): 607-627 (2017) - [c27]Leocadio G. Casado, Eligius M. T. Hendrix, Jose M. G. Salmerón, Boglárka G.-Tóth
On Grid Aware Refinement of the Unit Hypercube and Simplex: Focus on the Complete Tree Size. ICCSA (3) 2017: 165-180 - [c26]Cristóbal Medina-López, Vicente González Ruiz, Leocadio G. Casado
On mitigating pollution and free-riding attacks by Shamir's Secret Sharing in fully connected P2P systems. IWCMC 2017: 711-716 - 2016
- [j27]Daniela Ventura, Aitor Gómez-Goiri
Security analysis and resource requirements of group-oriented user access control for hardware-constrained wireless network services. Log. J. IGPL 24(1): 80-91 (2016) - [j26]Jose M. G. Salmerón, Leocadio G. Casado, Eligius M. T. Hendrix:
On Bisecting the Unit Simplex Using Various Distance Norms. Informatica 27(2): 351-366 (2016) - [j25]Leocadio G. Casado
Preface: special issue MAGO 2014. J. Glob. Optim. 64(2): 197-198 (2016) - [j24]Boglárka G.-Tóth
On refinement of the unit simplex using regular simplices. J. Glob. Optim. 64(2): 305-323 (2016) - [c25]Cristóbal Medina-López, Ilshat Shakirov, Leocadio G. Casado
On Pollution Attacks in Fully Connected P2P Networks Using Trusted Peers. ISDA 2016: 144-153 - 2015
- [j23]Guillermo Aparicio, Leocadio G. Casado, Eligius M. T. Hendrix, Boglárka G.-Tóth, Inmaculada García:
On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex. Informatica 26(1): 17-32 (2015) - [c24]Cristóbal Medina-López, Leocadio G. Casado
Pollution Attacks Detection in the P2PSP Live Streaming System. CISIS-ICEUTE 2015: 401-410 - [c23]Juan F. R. Herrera, Leocadio G. Casado
Heuristics for Longest Edge Selection in Simplicial Branch and Bound. ICCSA (2) 2015: 445-456 - [c22]Jose-Roman Bilbao-Castro, Gabriel Barrionuevo, Dolores Ruiz-Lupión
Weaver: A Multiagent, Spatial-Explicit and High-Performance Framework to Study Complex Ecological Networks. PAAMS (Workshops) 2015: 139-150 - 2014
- [c21]Juan F. R. Herrera, Eligius M. T. Hendrix, Leocadio G. Casado
Data Parallelism in Traffic Control Tables with Arrival Information. Euro-Par Workshops (1) 2014: 60-70 - [c20]Juan F. R. Herrera
On Simplicial Longest Edge Bisection in Lipschitz Global Optimization. ICCSA (2) 2014: 104-114 - [c19]Guillermo Aparicio, Leocadio G. Casado
Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex. ICCSA (2) 2014: 115-125 - 2013
- [j22]J. A. M. Naranjo, Leocadio G. Casado
An updated view on centralized secure group communications. Log. J. IGPL 21(4): 659-670 (2013) - [j21]José L. Berenguel, Leocadio G. Casado
On estimating workload in interval branch-and-bound global optimization algorithms. J. Glob. Optim. 56(3): 821-844 (2013) - [j20]José L. Berenguel, Leocadio G. Casado
On interval branch-and-bound for additively separable functions with common variables. J. Glob. Optim. 56(3): 1101-1121 (2013) - [j19]Juan Álvaro Muñoz Naranjo, Pablo Orduña, Aitor Gómez-Goiri, Diego López-de-Ipiña, Leocadio González Casado:
Enabling User Access Control in Energy-constrained Wireless Smart Environments. J. Univers. Comput. Sci. 19(17): 2490-2505 (2013) - [j18]Juan F. R. Herrera
A threaded approach of the quadratic bi-blending algorithm. J. Supercomput. 64(1): 38-48 (2013) - [j17]J. A. M. Naranjo
Fully distributed authentication with locality exploitation for the CoDiP2P peer-to-peer computing platform. J. Supercomput. 65(3): 1037-1049 (2013) - [c18]Juan F. R. Herrera
Dynamic and Hierarchical Load-Balancing Techniques Applied to Parallel Branch-and-Bound Methods. 3PGCIC 2013: 497-502 - [c17]Guillermo Aparicio, Leocadio G. Casado
On Computational Aspects of a Regular n-Simplex Bisection. 3PGCIC 2013: 513-518 - [c16]Remigijus Paulavicius
A Parallel DISIMPL for Pile Placement Optimization in Grillage-Type Foundations. 3PGCIC 2013: 525-530 - [c15]Juan F. R. Herrera
On a Hybrid MPI-Pthread Approach for Simplicial Branch-and-Bound. IPDPS Workshops 2013: 1764-1770 - [c14]Juan Álvaro Muñoz Naranjo, Aitor Gómez-Goiri
Extending a User Access Control Proposal for Wireless Network Services with Hierarchical User Credentials. SOCO-CISIS-ICEUTE 2013: 601-610 - 2012
- [j16]J. A. M. Naranjo
Asynchronous privacy-preserving iterative computation on peer-to-peer networks. Computing 94(8-10): 763-782 (2012) - [j15]J. A. M. Naranjo
A suite of algorithms for key distribution and authentication in centralized secure multicast environments. J. Comput. Appl. Math. 236(12): 3042-3051 (2012) - [c13]Juan Francisco Sanjuan-Estrada, Leocadio G. Casado
Performance Driven Cooperation between Kernel and Auto-tuning Multi-threaded Interval B&B Applications. ICCSA (1) 2012: 57-70 - [c12]José L. Berenguel, Leocadio G. Casado
On Lower Bounds Using Additively Separable Terms in Interval B&B. ICCSA (3) 2012: 119-132 - [c11]Eligius M. T. Hendrix
Global Optimization Simplex Bisection Revisited Based on Considerations by Reiner Horst. ICCSA (3) 2012: 159-173 - [c10]J. A. M. Naranjo
Lightweight User Access Control in Energy-Constrained Wireless Network Services. UCAmI 2012: 33-41 - 2011
- [j14]Leocadio G. Casado
On determining the cover of a simplex by spheres centered at its vertices. J. Glob. Optim. 50(4): 645-655 (2011) - [j13]J. A. M. Naranjo, Leocadio G. Casado, Juan Antonio López Ramos:
Group Oriented Renewal of Secrets and Its Application to Secure Multicast. J. Inf. Sci. Eng. 27(4): 1303-1313 (2011) - [j12]J. F. Sanjuan-Estrada, Leocadio G. Casado
Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures. J. Supercomput. 58(3): 376-384 (2011) - [c9]J. A. M. Naranjo
Keeping Group Communications Private: An Up-to-Date Review on Centralized Secure Multicast. CISIS 2011: 151-159 - [c8]J. F. Sanjuan-Estrada, Leocadio G. Casado
Adaptive Parallel Interval Global Optimization Algorithms Based on their Performance for Non-dedicated Multicore Architectures. PDP 2011: 252-256 - 2010
- [c7]Juan Álvaro Muñoz Naranjo
A Key Distribution Scheme for Live Streaming Multi-tree Overlays. CISIS 2010: 223-230
2000 – 2009
- 2009
- [c6]J. A. M. Naranjo
Key Management Schemes for Peer-to-Peer Multimedia Streaming Overlay Networks. WISTP 2009: 128-142 - 2008
- [j11]Eligius M. T. Hendrix
The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach. Eur. J. Oper. Res. 191(3): 803-815 (2008) - [j10]Leocadio G. Casado
Branch-and-Bound interval global optimization on shared memory multiprocessors. Optim. Methods Softw. 23(5): 689-701 (2008) - 2007
- [b1]Péter Gábor Szabó, Mihály Csaba Markót, Tibor Csendes, Eckhard Specht, Leocadio G. Casado, Inmaculada García:
New Approaches to Circle Packing in a Square - With Program Codes. Optimization and its applications 6, Springer 2007, ISBN 978-0-387-45673-7, pp. I-XIV, 1-238 - [j9]Boglárka Tóth
Multi-dimensional pruning from the Baumann point in an Interval Global Optimization Algorithm. J. Glob. Optim. 38(2): 215-236 (2007) - [j8]Leocadio G. Casado
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints. J. Glob. Optim. 39(4): 577-593 (2007) - 2006
- [j7]Mihály Csaba Markót
New interval methods for constrained global optimization. Math. Program. 106(2): 287-318 (2006) - [c5]J. F. Sanjuan-Estrada, Leocadio G. Casado, Inmaculada García:
Reliable computation of roots to render real polynomials in complex space. GRAPP 2006: 305-312 - [c4]J. F. Sanjuan-Estrada, Leocadio G. Casado, Inmaculada García:
Rendering (COMPLEX) algebraic surfaces. VISAPP (1) 2006: 139-146 - 2004
- [j6]J. A. Martínez, Leocadio G. Casado
On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms. Numer. Algorithms 37(1-4): 61-69 (2004) - [c3]José Antonio Martínez
Interval Parallel Global Optimization with Charm++. PARA 2004: 161-168 - 2003
- [j5]Leocadio G. Casado
New Interval Analysis Support Functions Using Gradient Information in a Global Minimization Algorithm. J. Glob. Optim. 25(4): 345-362 (2003) - [c2]J. F. Sanjuan-Estrada, Leocadio G. Casado
Reliable Algorithms for Ray Intersection in Computer Graphics Based on Interval Arithmetic. SIBGRAPI 2003: 35-44 - 2002
- [j4]Leocadio G. Casado
Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions. SIAM J. Sci. Comput. 24(2): 359-376 (2002) - 2001
- [j3]Leocadio González Casado
Experiments with a new selection criterion in a fast interval optimization algorithm. J. Glob. Optim. 19(3): 247-264 (2001) - 2000
- [j2]Leocadio G. Casado
A New Multisection Technique in Interval Methods for Global Optimization. Computing 65(3): 263-269 (2000) - [j1]Leocadio G. Casado
Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions. Reliab. Comput. 6(2): 179-191 (2000)
1990 – 1999
- 1999
- [c1]Leocadio G. Casado
Work load balance approaches for branch and bound algorithms on distributed systems. PDP 1999: 155-162
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-09-10 01:17 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: