Mauro Leoncini

According to our database1, Mauro Leoncini authored at least 57 papers between 1991 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
WebFPTI: A tool to predict the toxicity/pathogenicity of mineral fibres including asbestos.
Earth Sci. Informatics, 2021

An 800-mA Time-Based Boost Converter in 0.18µm BCD with Right-Half-Plane Zero Elimination and 96% Power Efficiency.
Proceedings of the 47th ESSCIRC 2021, 2021

2020
Distributed balanced color assignment on arbitrary networks.
Theor. Comput. Sci., 2020

A Novel Start-Up Technique for Time-Based Boost Converters with Seamless PFM/PWM Transition.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2020

2019
Fully Integrated, 406 $\mu$A, $\text{5 }^{\circ}$/hr, Full Digital Output Lissajous Frequency-Modulated Gyroscope.
IEEE Trans. Ind. Electron., 2019

A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF.
Real Time Syst., 2019

A distributed message-optimal assignment on rings.
J. Parallel Distributed Comput., 2019

2018
Efficient Behavioral Simulation of Charge-Pump Phase-Locked Loops.
IEEE Trans. Circuits Syst. I Regul. Pap., 2018

2017
A branch-and-bound algorithm to compute a tighter bound to tardiness for preemptive global EDF scheduler.
Proceedings of the 25th International Conference on Real-Time Networks and Systems, 2017

Distributed Beta-assignment on Graphs.
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

2016
Towards User-Aware Service Composition.
Proceedings of the Nature of Computation and Communication, 2016

2015
CMStalker: A Combinatorial Tool for Composite Motif Discovery.
IEEE ACM Trans. Comput. Biol. Bioinform., 2015

CNVScan: detecting borderline copy number variations in NGS data via scan statistics.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
AMBIT: Towards an Architecture for the Development of Context-dependent Applications and Systems.
Proceedings of the 3rd International Conference on Context-Aware Systems and Applications, 2014

2013
CMF: A Combinatorial Tool to Find Composite Motifs.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

CE<sup>3</sup> Customizable and Easily Extensible Ensemble Tool for Motif Discovery.
Proceedings of the International Work-Conference on Bioinformatics and Biomedical Engineering, 2013

2012
Direct vs 2-Stage Approaches to Structured Motif Finding.
Algorithms Mol. Biol., 2012

2011
A High Performing Tool for Residue Solvent Accessibility Prediction.
Proceedings of the Information Technology in Bio- and Medical Informatics, 2011

2009
K-Boost: A Scalable Algorithm for High-Quality Clustering of Microarray Gene Expression Data.
J. Comput. Biol., 2009

Partially controlled deployment strategies for wireless sensors.
Ad Hoc Networks, 2009

Self Organization and Self Maintenance of Mobile Ad Hoc Networks through Dynamic Topology Control.
Proceedings of the Architecting Dependable Systems VII, 2009

2008
An STDMA-based framework for QoS provisioning in wireless mesh networks.
Proceedings of the IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, 2008

2007
Topology control with better radio models: Implications for energy and multi-hop interference.
Perform. Evaluation, 2007

High-Throughput Analysis of Gene Expression Data for Personalized Medicine.
ERCIM News, 2007

<i>FPF-SB</i> : A Scalable Algorithm for Microarray Gene Expression Data Clustering.
Proceedings of the Digital Human Modeling, 2007

2006
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks.
IEEE Trans. Mob. Comput., 2006

Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games.
Electron. Colloquium Comput. Complex., 2006

Distributed algorithm for a color assignment on asynchronous rings.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games.
Proceedings of the Algorithms, 2006

2005
Analysis of a wireless sensor dropping problem in wide-area environmental monitoring.
Proceedings of the Fourth International Symposium on Information Processing in Sensor Networks, 2005

Comparison of Cell-Based and Topology-Control-Based Energy Conservation in Wireless Sensor Networks.
Proceedings of the Handbook on Theoretical and Algorithmic Aspects of Sensor, 2005

2004
Approximation algorithms for a hierarchically structured bin packing problem.
Inf. Process. Lett., 2004

2003
Computation of the Lovász Theta Function for Circulant Graphs
Electron. Colloquium Comput. Complex., 2003

Generating Realistic Data Sets for Combinatorial Auctions.
Proceedings of the 2003 IEEE International Conference on Electronic Commerce (CEC 2003), 2003

The lit K-neigh protocol for symmetric topology control in ad hoc networks.
Proceedings of the 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2003

2002
Reliable parallel solution of bidiagonal systems.
Numerische Mathematik, 2002

On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001
The Role of Arithmetic in Fast Parallel Matrix Inversion.
Algorithmica, 2001

Distributed Algorithm for Certain Assignment Problems.
Proceedings of the Procedings of the 5th International Conference on Principles of Distributed Systems. OPODIS 2001, 2001

2000
Reliable Solution of Tridiagonal Systems of Linear Equations.
SIAM J. Numer. Anal., 2000

On the Lovász Number of Certain Circulant Graphs.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
Parallel Complexity of Numerically Accurate Linear System Solvers.
SIAM J. Comput., 1999

1998
Stable solution of tridiagonal systems.
Numer. Algorithms, 1998

1997
Parallel Algorithms for Certain Matrix Computations.
Theor. Comput. Sci., 1997

On the Parallel Complexity of Matrix Factorization Algorithms.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

How Does One Solve a Tridiagonal System of Linear Equations?
Proceedings of the Large-Scale Scientific Computation for Engineering and Environmental Problems, 1997

1996
Strong NP-Completeness of a Matrix Similarity Problem.
Theor. Comput. Sci., 1996

On the Parallel Complexity of Gaussian Elimination with Pivoting.
J. Comput. Syst. Sci., 1996

On Speed versus Accuracy: Some Case Studies.
J. Complex., 1996

Parallel Complexity of Householder QR Factorization.
Proceedings of the Algorithms, 1996

1994
Oracle Computations in Parallel Numerical Linear Algebra.
Theor. Comput. Sci., 1994

How Much Can We Speedup Gaussian Elimination with Pivoting?
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993
Introduction to parallel processing.
International computer science series, Addison-Wesley, ISBN: 978-0-201-56887-5, 1993

1992
Repeated Matrix Squaring for the Parallel Solution of Linear Systems.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

1991
Matrix inversion in <i>RNC</i><sup>1</sup>.
J. Complex., 1991

An experimental environment for design and analysis of global routing heuristics.
Proceedings of the First Great Lakes Symposium on VLSI, 1991

Parallel complexity of linear system solution.
World Scientific, ISBN: 978-981-02-0502-7, 1991


  Loading...