default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMauro Leoncini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Paolo Melillo
, Simone Zaffin, Mauro Leoncini, Alberto Brunero, Alessandro Gasparini, Salvatore Levantino, Massimo Ghioni:
A Wide-Input-Range Time-Based Buck Converter With Adaptive Gain and Continuous Phase Preset for Seamless PFM/PWM Transitions. IEEE Trans. Circuits Syst. I Regul. Pap. 71(7): 3436-3447 (2024)- [c34]Gabriele Magni, Paolo Melillo, Alessandro Bertolini, Mauro Leoncini, Massimo Ghioni:
A 10-MHz Three-Level Buck Converter with Dual-Loop Time-Based Control and Flying Capacitor Voltage-Balance for Fast DVS. PRIME 2024: 1-4 - 2023
- [j26]Mauro Leoncini, Alessandro Bertolini, Paolo Melillo, Salvatore Levantino, Massimo Ghioni:
Integration of loop gain measurement circuit for stability evaluation in DC/DC converters with time-based control. Integr. 90: 196-204 (2023) - [c33]Paolo Melillo, Mauro Leoncini, Simone Zaffin, Alberto Brunero, Alessandro Gasparini, Salvatore Levantino, Massimo Ghioni:
A Compact Wide-Input-Range Time-Domain Buck Converter with Fast Transient Response for Industrial Applications. ESSCIRC 2023: 433-436 - [c32]Simone Zaffin, Stefano Macario, Alessandro Bertolini, Mauro Leoncini, Massimo Ghioni:
Common-Gate Zero Current Detector with Body-Voltage Based Offset Compensation. PRIME 2023: 353-356 - 2022
- [b3]Mauro Leoncini:
Time-based controller for DCDC boost converter with right-half-plane zero mitigation. Polytechnic University of Milan, Italy, 2022 - [c31]Alessandro Dago, Mauro Leoncini, Alberto Cattani, Salvatore Levantino, Massimo Ghioni:
A Novel Common-Gate Comparator with Auto-Zeroing Offset Cancellation. PRIME 2022: 81-84 - [c30]Mauro Leoncini, Paolo Melillo, Alessandro Bertolini, Salvatore Levantino, Massimo Ghioni:
Integrated Loop-Gain Measurement Circuit for DC/DC Boost Converters with Time-Based Control. PRIME 2022: 253-256 - [c29]Andrea Artioli, Luca Bedogni, Mauro Leoncini:
Re-identification Attack based on Few-Hints Dataset Enrichment for Ubiquitous Applications. WF-IoT 2022: 1-6 - 2021
- [j25]Alessandro F. Gualtieri, Mauro Leoncini, Lorenzo Rinaldi, Alessandro Zoboli, Dario Di Giuseppe:
WebFPTI: A tool to predict the toxicity/pathogenicity of mineral fibres including asbestos. Earth Sci. Informatics 14(4): 2401-2409 (2021) - [c28]Mauro Leoncini, Alessandro Bertolini, Alessandro Gasparini, Salvatore Levantino, Massimo Ghioni:
An 800-mA Time-Based Boost Converter in 0.18µm BCD with Right-Half-Plane Zero Elimination and 96% Power Efficiency. ESSCIRC 2021: 223-226 - 2020
- [j24]Gianluca De Marco, Mauro Leoncini, Manuela Montangero:
Distributed balanced color assignment on arbitrary networks. Theor. Comput. Sci. 809: 313-326 (2020) - [c27]Tommaso Rosa, Mauro Leoncini, Salvatore Levantino, Massimo Ghioni:
A Novel Start-Up Technique for Time-Based Boost Converters with Seamless PFM/PWM Transition. ISCAS 2020: 1-5
2010 – 2019
- 2019
- [j23]Gianluca De Marco, Mauro Leoncini, Manuela Montangero:
A distributed message-optimal assignment on rings. J. Parallel Distributed Comput. 132: 284-298 (2019) - [j22]Mauro Leoncini, Manuela Montangero, Paolo Valente:
A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF. Real Time Syst. 55(2): 349-386 (2019) - [j21]Mauro Leoncini, Marco Bestetti, Andrea Bonfanti, Stefano Facchinetti, Paolo Minotti, Giacomo Langfelder:
Fully Integrated, 406 $\mu$A, $\text{5 }^{\circ}$/hr, Full Digital Output Lissajous Frequency-Modulated Gyroscope. IEEE Trans. Ind. Electron. 66(9): 7386-7396 (2019) - 2018
- [j20]Mauro Leoncini, Andrea Bonfanti, Salvatore Levantino, Andrea L. Lacaita:
Efficient Behavioral Simulation of Charge-Pump Phase-Locked Loops. IEEE Trans. Circuits Syst. I Regul. Pap. 65-I(6): 1968-1980 (2018) - 2017
- [c26]Mauro Leoncini, Gianluca De Marco, Lucia Mazzali, Manuela Montangero:
Distributed Beta-assignment on Graphs. ICTCS/CILC 2017: 109-120 - [c25]Mauro Leoncini, Manuela Montangero, Paolo Valente:
A branch-and-bound algorithm to compute a tighter bound to tardiness for preemptive global EDF scheduler. RTNS 2017: 128-137 - 2016
- [c24]Giacomo Cabri, Mauro Leoncini, Riccardo Martoglia, Franco Zambonelli:
Towards User-Aware Service Composition. ICTCC 2016: 11-21 - 2015
- [j19]Mauro Leoncini, Manuela Montangero, Marco Pellegrini, Karina Panucia Tillan:
CMStalker: A Combinatorial Tool for Composite Motif Discovery. IEEE ACM Trans. Comput. Biol. Bioinform. 12(5): 1123-1136 (2015) - [c23]Elisabetta Bergamini, Romina D'Aurizio, Mauro Leoncini, Marco Pellegrini:
CNVScan: detecting borderline copy number variations in NGS data via scan statistics. BCB 2015: 335-344 - [i5]Gianluca De Marco, Mauro Leoncini, Manuela Montangero:
A Distributed Message-Optimal Assignment on Rings. CoRR abs/1502.02427 (2015) - 2014
- [c22]Giacomo Cabri, Mauro Leoncini, Riccardo Martoglia:
AMBIT: Towards an Architecture for the Development of Context-dependent Applications and Systems. ICCASA 2014: 64-68 - 2013
- [c21]Karina Panucia Tillan, Mauro Leoncini, Manuela Montangero:
CE3 Customizable and Easily Extensible Ensemble Tool for Motif Discovery. IWBBIO 2013: 365-374 - [c20]Mauro Leoncini, Manuela Montangero, Marco Pellegrini, Karina Panucia Tillan:
CMF: A Combinatorial Tool to Find Composite Motifs. LION 2013: 196-208 - 2012
- [j18]Maria Federico, Mauro Leoncini, Manuela Montangero, Paolo Valente:
Direct vs 2-Stage Approaches to Structured Motif Finding. Algorithms Mol. Biol. 7: 20 (2012) - 2011
- [c19]Lorenzo Palmieri, Maria Federico, Mauro Leoncini, Manuela Montangero:
A High Performing Tool for Residue Solvent Accessibility Prediction. ITBAM 2011: 138-152
2000 – 2009
- 2009
- [j17]Mauro Leoncini, Giovanni Resta, Paolo Santi:
Partially controlled deployment strategies for wireless sensors. Ad Hoc Networks 7(1): 1-23 (2009) - [j16]Filippo Geraci, Mauro Leoncini, Manuela Montangero, Marco Pellegrini, M. Elena Renda:
K-Boost: A Scalable Algorithm for High-Quality Clustering of Microarray Gene Expression Data. J. Comput. Biol. 16(6): 859-873 (2009) - [c18]Douglas M. Blough, Giovanni Resta, Paolo Santi, Mauro Leoncini:
Self Organization and Self Maintenance of Mobile Ad Hoc Networks through Dynamic Topology Control. WADS 2009: 26-52 - 2008
- [c17]Mauro Leoncini, Paolo Santi, Paolo Valente:
An STDMA-based framework for QoS provisioning in wireless mesh networks. MASS 2008: 223-232 - 2007
- [j15]Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi:
Topology control with better radio models: Implications for energy and multi-hop interference. Perform. Evaluation 64(5): 379-398 (2007) - [c16]Filippo Geraci, Mauro Leoncini, Manuela Montangero, Marco Pellegrini, M. Elena Renda:
FPF-SB : A Scalable Algorithm for Microarray Gene Expression Data Clustering. HCI (12) 2007: 606-615 - [i4]Paolo Santi, Douglas M. Blough, Mauro Leoncini, Giovanni Resta:
Topology Control with Better Radio Models: Implications for Energy and Multi-Hop Interference. Geometry in Sensor Networks 2007 - [i3]Filippo Geraci, Mauro Leoncini, Manuela Montangero, Marco Pellegrini, Maria Elena Renda:
High-Throughput Analysis of Gene Expression Data for Personalized Medicine. ERCIM News 2007(69) (2007) - 2006
- [j14]Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi:
The k-Neighbors Approach to Interference Bounded and Symmetric Topology Control in Ad Hoc Networks. IEEE Trans. Mob. Comput. 5(9): 1267-1282 (2006) - [c15]Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games. ESA 2006: 232-243 - [c14]Gianluca De Marco, Mauro Leoncini, Manuela Montangero:
Distributed algorithm for a color assignment on asynchronous rings. IPDPS 2006 - [i2]Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c13]Mauro Leoncini, Giovanni Resta, Paolo Santi:
Analysis of a wireless sensor dropping problem in wide-area environmental monitoring. IPSN 2005: 239-245 - [c12]Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi:
Topology control with better radio models: implications for energy and multi-hop interference. MSWiM 2005: 260-268 - [p1]Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi:
Comparison of Cell-Based and Topology-Control-Based Energy Conservation in Wireless Sensor Networks. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks 2005: 507-528 - 2004
- [j13]Bruno Codenotti, Gianluca De Marco, Mauro Leoncini, Manuela Montangero, Massimo Santini:
Approximation algorithms for a hierarchically structured bin packing problem. Inf. Process. Lett. 89(5): 215-221 (2004) - 2003
- [c11]Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi:
The lit K-neigh protocol for symmetric topology control in ad hoc networks. MobiHoc 2003: 141-152 - [c10]Andrea Bonaccorsi, Bruno Codenotti, Nicola Dimitri, Mauro Leoncini, Giovanni Resta, Paolo Santi:
Generating Realistic Data Sets for Combinatorial Auctions. CEC 2003: 331-338 - [i1]Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Reneta P. Barneva, Mauro Leoncini:
Computation of the Lovász Theta Function for Circulant Graphs. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j12]Ilan Bar-On, Mauro Leoncini:
Reliable parallel solution of bidiagonal systems. Numerische Mathematik 90(3): 415-440 (2002) - [c9]Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi:
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks. IFIP TCS 2002: 71-82 - 2001
- [j11]Bruno Codenotti, Mauro Leoncini, Franco P. Preparata:
The Role of Arithmetic in Fast Parallel Matrix Inversion. Algorithmica 30(4): 685-707 (2001) - [c8]Bruno Codenotti, Gianluca De Marco, Mauro Leoncini, Manuela Montangero:
Distributed Algorithm for Certain Assignment Problems. OPODIS 2001: 91-112 - 2000
- [j10]Ilan Bar-On, Mauro Leoncini:
Reliable Solution of Tridiagonal Systems of Linear Equations. SIAM J. Numer. Anal. 38(4): 1134-1153 (2000) - [c7]Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini:
On the Lovász Number of Certain Circulant Graphs. CIAC 2000: 291-305
1990 – 1999
- 1999
- [j9]Mauro Leoncini, Giovanni Manzini, Luciano Margara:
Parallel Complexity of Numerically Accurate Linear System Solvers. SIAM J. Comput. 28(6): 2030-2058 (1999) - 1998
- [j8]Ilan Bar-On, Mauro Leoncini:
Stable solution of tridiagonal systems. Numer. Algorithms 18(3-4): 361-388 (1998) - 1997
- [j7]Ilan Bar-On, Bruno Codenotti, Mauro Leoncini:
A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices. SIAM J. Matrix Anal. Appl. 18(2): 403-418 (1997) - [j6]Bruno Codenotti, Biswa N. Datta, Karabi Datta, Mauro Leoncini:
Parallel Algorithms for Certain Matrix Computations. Theor. Comput. Sci. 180(1-2): 287-308 (1997) - [c6]Ilan Bar-On, Mauro Leoncini:
How Does One Solve a Tridiagonal System of Linear Equations? LSSC 1997: 293-300 - [c5]Mauro Leoncini, Giovanni Manzini, Luciano Margara:
On the Parallel Complexity of Matrix Factorization Algorithms. SPAA 1997: 63-71 - 1996
- [j5]Mauro Leoncini:
On Speed versus Accuracy: Some Case Studies. J. Complex. 12(3): 239-253 (1996) - [j4]Mauro Leoncini:
On the Parallel Complexity of Gaussian Elimination with Pivoting. J. Comput. Syst. Sci. 53(3): 380-394 (1996) - [j3]Valentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Strong NP-Completeness of a Matrix Similarity Problem. Theor. Comput. Sci. 165(2): 483-490 (1996) - [c4]Mauro Leoncini, Giovanni Manzini, Luciano Margara:
Parallel Complexity of Householder QR Factorization. ESA 1996: 290-301 - 1994
- [j2]Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Oracle Computations in Parallel Numerical Linear Algebra. Theor. Comput. Sci. 127(1): 99-121 (1994) - [c3]Mauro Leoncini:
How Much Can We Speedup Gaussian Elimination with Pivoting? SPAA 1994: 290-297 - 1993
- [b2]Bruno Codenotti, Mauro Leoncini:
Introduction to parallel processing. International computer science series, Addison-Wesley 1993, ISBN 978-0-201-56887-5, pp. I-IX, 1-272 - 1992
- [c2]Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Repeated Matrix Squaring for the Parallel Solution of Linear Systems. PARLE 1992: 725-732 - 1991
- [b1]Bruno Codenotti, Mauro Leoncini:
Parallel complexity of linear system solution. World Scientific 1991, ISBN 978-981-02-0502-7, pp. I-IX, 1-218 - [j1]Bruno Codenotti, Mauro Leoncini:
Matrix inversion in RNC1. J. Complex. 7(3): 282-295 (1991) - [c1]Jill David, Fillia Makedon, Bruno Codenotti, Mauro Leoncini:
An experimental environment for design and analysis of global routing heuristics. Great Lakes Symposium on VLSI 1991: 225-230
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 2025-01-21 00:04 CET 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:
