Leocadio G. Casado
Orcid: 0000-0001-8459-4982Affiliations:
- University of Almería, Informatics Department
According to our database1,
Leocadio G. Casado
authored at least 69 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
5
10
1
1
4
1
1
1
3
4
1
6
2
3
2
2
1
1
1
1
1
2
1
1
2
1
3
3
5
4
2
1
1
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on hpca.ual.es
On csauthors.net:
Bibliography
2024
On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound.
J. Optim. Theory Appl., November, 2024
Proceedings of the Computational Science and Its Applications - ICCSA 2024 Workshops, 2024
2022
On monotonicity and search strategies in face-based copositivity detection algorithms.
Central Eur. J. Oper. Res., 2022
Proceedings of the Computational Science and Its Applications - ICCSA 2022 Workshops, 2022
2021
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic.
J. Glob. Optim., 2021
Int. J. Inf. Sec., 2021
On MATLAB experience in accelerating DIRECT-GLce algorithm for constrained global optimization through dynamic data structures and parallelization.
Appl. Math. Comput., 2021
2020
2019
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., 2019
2018
Parallel algorithms for computing the smallest binary tree size in unit simplex refinement.
J. Parallel Distributed Comput., 2018
2017
Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU.
J. Glob. Optim., 2017
J. Glob. Optim., 2017
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement.
J. Comb. Optim., 2017
On mitigating pollution and free-riding attacks by Shamir's Secret Sharing in fully connected P2P systems.
Proceedings of the 13th International Wireless Communications and Mobile Computing Conference, 2017
On Grid Aware Refinement of the Unit Hypercube and Simplex: Focus on the Complete Tree Size.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017
2016
Security analysis and resource requirements of group-oriented user access control for hardware-constrained wireless network services.
Log. J. IGPL, 2016
Proceedings of the Intelligent Systems Design and Applications, 2016
2015
On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex.
Informatica, 2015
Weaver: A Multiagent, Spatial-Explicit and High-Performance Framework to Study Complex Ecological Networks.
Proceedings of the Highlights of Practical Applications of Agents, Multi-Agent Systems, and Sustainability - The PAAMS Collection, 2015
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015
Proceedings of the International Joint Conference, 2015
2014
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014
Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014
Proceedings of the Euro-Par 2014: Parallel Processing Workshops, 2014
2013
Fully distributed authentication with locality exploitation for the CoDiP2P peer-to-peer computing platform.
J. Supercomput., 2013
J. Univers. Comput. Sci., 2013
On interval branch-and-bound for additively separable functions with common variables.
J. Glob. Optim., 2013
J. Glob. Optim., 2013
Extending a User Access Control Proposal for Wireless Network Services with Hierarchical User Credentials.
Proceedings of the International Joint Conference SOCO'13-CISIS'13-ICEUTE'13, 2013
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013
Proceedings of the Eighth International Conference on P2P, 2013
Dynamic and Hierarchical Load-Balancing Techniques Applied to Parallel Branch-and-Bound Methods.
Proceedings of the Eighth International Conference on P2P, 2013
Proceedings of the Eighth International Conference on P2P, 2013
2012
A suite of algorithms for key distribution and authentication in centralized secure multicast environments.
J. Comput. Appl. Math., 2012
Computing, 2012
Proceedings of the Ubiquitous Computing and Ambient Intelligence, 2012
Performance Driven Cooperation between Kernel and Auto-tuning Multi-threaded Interval B&B Applications.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012
Global Optimization Simplex Bisection Revisited Based on Considerations by Reiner Horst.
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012
Proceedings of the Computational Science and Its Applications - ICCSA 2012, 2012
2011
Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures.
J. Supercomput., 2011
J. Inf. Sci. Eng., 2011
J. Glob. Optim., 2011
Adaptive Parallel Interval Global Optimization Algorithms Based on their Performance for Non-dedicated Multicore Architectures.
Proceedings of the 19th International Euromicro Conference on Parallel, 2011
Keeping Group Communications Private: An Up-to-Date Review on Centralized Secure Multicast.
Proceedings of the Computational Intelligence in Security for Information Systems, 2011
2010
Proceedings of the Computational Intelligence in Security for Information Systems 2010, 2010
2009
Proceedings of the Information Security Theory and Practice. Smart Devices, 2009
2008
Optim. Methods Softw., 2008
The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach.
Eur. J. Oper. Res., 2008
2007
Multi-dimensional pruning from the Baumann point in an Interval Global Optimization Algorithm.
J. Glob. Optim., 2007
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints.
J. Glob. Optim., 2007
New Approaches to Circle Packing in a Square - With Program Codes.
Optimization and its applications 6, Springer, ISBN: 978-0-387-45673-7, 2007
2006
Rendering (COMPLEX) algebraic surfaces.
Proceedings of the VISAPP 2006: Proceedings of the First International Conference on Computer Vision Theory and Applications, 2006
Reliable computation of roots to render real polynomials in complex space.
Proceedings of the GRAPP 2006: Proceedings of the First International Conference on Computer Graphics Theory and Applications, 2006
2004
On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms.
Numer. Algorithms, 2004
Proceedings of the Applied Parallel Computing, 2004
2003
New Interval Analysis Support Functions Using Gradient Information in a Global Minimization Algorithm.
J. Glob. Optim., 2003
Reliable Algorithms for Ray Intersection in Computer Graphics Based on Interval Arithmetic.
Proceedings of the 16th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2003), 2003
2002
Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions.
SIAM J. Sci. Comput., 2002
2001
Experiments with a new selection criterion in a fast interval optimization algorithm.
J. Glob. Optim., 2001
2000
Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions.
Reliab. Comput., 2000
Computing, 2000
1999
Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99, 1999