default search action
Ruben Specogna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Marco De Piante
, Michele Midrio
Sub-Gigahertz Path Loss Measurement Campaign in Marine Environment: A Case Study. Sensors 24(8): 2582 (2024) - 2023
- [j19]Antonino Vacalebre
Low-rank compression techniques in integral methods for eddy currents problems. Comput. Phys. Commun. 289: 108756 (2023) - [j18]Silvano Pitassi, Riccardo Ghiloni, Igor Petretti, Francesco Trevisan, Ruben Specogna:
The curved mimetic finite difference method: Allowing grids with curved faces. J. Comput. Phys. 490: 112294 (2023) - 2022
- [j17]Silvano Pitassi, Riccardo Ghiloni, Ruben Specogna:
Inverting the discrete curl operator: A novel graph algorithm to find a vector potential of a given vector field. J. Comput. Phys. 466: 111404 (2022) - [j16]Aldi Hoxha
Design Optimization of PCB-Based Rotary-Inductive Position Sensors. Sensors 22(13): 4683 (2022) - [i7]Silvano Pitassi, Igor Petretti, Francesco Trevisan, Ruben Specogna:
The curved Mimetic Finite Difference method: allowing grids with curved faces. CoRR abs/2203.13105 (2022) - 2021
- [j15]Dimitri Voltolina
Optimized cycle basis in volume integral formulations for large scale eddy-current problems. Comput. Phys. Commun. 265: 108004 (2021) - [j14]Silvano Pitassi, Riccardo Ghiloni
The role of the dual grid in low-order compatible numerical schemes on general meshes. J. Comput. Phys. 436: 110285 (2021) - [i6]Riccardo Fontanini, Marco Massarotto, Ruben Specogna, Francesco Driussi, Mirko Loghi, David Esseni:
Modelling and design of FTJs as high reading-impedance synaptic devices. CoRR abs/2105.00752 (2021) - [i5]Silvano Pitassi, Riccardo Ghiloni, Ruben Specogna:
Inverting the discrete curl operator: a novel graph algorithm to find a vector potential of a given vector field. CoRR abs/2111.04431 (2021) - 2020
- [i4]Silvano Pitassi, Francesco Trevisan, Ruben Specogna:
Explicit geometric construction of sparse inverse mass matrices for arbitrary tetrahedral grids. CoRR abs/2012.01094 (2020)
2010 – 2019
- 2019
- [j13]Antonio Affanni
Estimating the Volume of Unknown Inclusions in an Electrically Conducting Body with Voltage Measurements. Sensors 19(3): 637 (2019) - [c2]Mauro Passarotto, Gentjan Qama, Ruben Specogna:
A Fast and Efficient Simulation Method for Inductive Position Sensors Design. IEEE SENSORS 2019: 1-4 - [c1]Antonio Affanni, Francesco Trevisan, Ruben Specogna:
Novel sensor to measure the volume of growth for in vitro bioassays. SAS 2019: 1-6 - 2018
- [j12]Ana Alonso Rodríguez, Enrico Bertolazzi
Efficient construction of 2-chains representing a basis of H 2 ( Ω ¯ , ∂ Ω ; ℤ ) $H_{2}(\overline {\Omega }, \partial {\Omega }; \mathbb {Z})$. Adv. Comput. Math. 44(5): 1411-1440 (2018) - 2017
- [j11]Ana Alonso Rodríguez, Enrico Bertolazzi
Efficient Construction of 2-Chains with a Prescribed Boundary. SIAM J. Numer. Anal. 55(3): 1159-1187 (2017) - 2016
- [j10]Daniele A. Di Pietro
An a posteriori-driven adaptive Mixed High-Order method with application to electrostatics. J. Comput. Phys. 326: 35-55 (2016) - 2015
- [i3]Silvano Chialina, Matteo Cicuttin, Lorenzo Codecasa, Giovanni Solari, Ruben Specogna, Francesco Trevisan:
Modeling of anechoich chambers with equivalent materials and equivalent sources. CoRR abs/1511.08410 (2015) - 2014
- [j9]Paolo Bettini
Computation of stationary 3D halo currents in fusion devices with accuracy control. J. Comput. Phys. 273: 100-117 (2014) - [j8]Pawel Dlotko
Topology Preserving Thinning of Cell Complexes. IEEE Trans. Image Process. 23(10): 4486-4495 (2014) - [j7]Ruben Specogna
Extraction of VLSI Multiconductor Transmission Line Parameters by Complementarity. IEEE Trans. Very Large Scale Integr. Syst. 22(1): 146-154 (2014) - 2013
- [j6]Pawel Dlotko
Physics inspired algorithms for (co)homology computations of three-dimensional combinatorial manifolds with boundary. Comput. Phys. Commun. 184(10): 2257-2266 (2013) - [j5]Antonio Affanni
Combined Electro-Optical Imaging for the Time Evolution of White Thrombus Growth in Artificial Capillaries. IEEE Trans. Instrum. Meas. 62(11): 2954-2959 (2013) - [i2]Pawel Dlotko, Ruben Specogna:
Topology preserving thinning for cell complexes. CoRR abs/1309.1628 (2013) - 2012
- [j4]Antonio Affanni
A Discrete Geometric Approach to Cell Membrane and Electrode Contact Impedance Modeling. IEEE Trans. Biomed. Eng. 59(9): 2619-2627 (2012) - [i1]Pawel Dlotko, Ruben Specogna:
Physics inspired algorithms for (co)homology computation. CoRR abs/1212.1360 (2012) - 2011
- [j3]Ruben Specogna
A discrete geometric approach to solving time independent Schrödinger equation. J. Comput. Phys. 230(4): 1370-1381 (2011) - 2010
- [j2]Lorenzo Codecasa
A new set of basis functions for the discrete geometric approach. J. Comput. Phys. 229(19): 7401-7410 (2010) - [j1]Pawel Dlotko
Critical Analysis of the Spanning Tree Techniques. SIAM J. Numer. Anal. 48(4): 1601-1624 (2010)
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-19 00:57 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: