P. Feldmann

3.3k total citations · 1 hit paper
56 papers, 2.2k citations indexed

About

P. Feldmann is a scholar working on Electrical and Electronic Engineering, Statistical and Nonlinear Physics and Hardware and Architecture. According to data from OpenAlex, P. Feldmann has authored 56 papers receiving a total of 2.2k indexed citations (citations by other indexed papers that have themselves been cited), including 49 papers in Electrical and Electronic Engineering, 13 papers in Statistical and Nonlinear Physics and 13 papers in Hardware and Architecture. Recurrent topics in P. Feldmann's work include Low-power high-performance VLSI design (36 papers), VLSI and FPGA Design Techniques (13 papers) and Model Reduction and Neural Networks (13 papers). P. Feldmann is often cited by papers focused on Low-power high-performance VLSI design (36 papers), VLSI and FPGA Design Techniques (13 papers) and Model Reduction and Neural Networks (13 papers). P. Feldmann collaborates with scholars based in United States, Germany and Austria. P. Feldmann's co-authors include R.W. Freund, Jaijeet Roychowdhury, D. Long, S.W. Director, Robert Melville, K. Sri Rama Krishna, Roland W. Freund, R.A. Rohrer, Stephen W. Director and Alper Demir and has published in prestigious journals such as IEEE Journal of Solid-State Circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems and IEEE Transactions on Circuits and Systems.

In The Last Decade

P. Feldmann

52 papers receiving 2.0k citations

Hit Papers

Efficient linear circuit analysis by Pade approximation v... 1995 2026 2005 2015 1995 250 500 750

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
P. Feldmann United States 21 1.6k 987 401 327 319 56 2.2k
R.W. Freund United States 14 1.2k 0.7× 1.1k 1.1× 455 1.1× 299 0.9× 155 0.5× 18 1.7k
M. Celik United States 17 1.8k 1.1× 901 0.9× 297 0.7× 209 0.6× 239 0.7× 54 2.2k
L.T. Pillage United States 17 2.7k 1.6× 523 0.5× 131 0.3× 134 0.4× 1.1k 3.5× 40 2.9k
Ramachandra Achar Canada 28 2.6k 1.6× 349 0.4× 114 0.3× 228 0.7× 87 0.3× 183 2.9k
Yangfeng Su China 16 419 0.3× 451 0.5× 296 0.7× 128 0.4× 57 0.2× 63 1.0k
K. Kundert United States 20 1.8k 1.1× 239 0.2× 147 0.4× 51 0.2× 225 0.7× 39 2.1k
Eli Chiprout United States 18 1.3k 0.8× 300 0.3× 99 0.2× 59 0.2× 276 0.9× 50 1.4k
S. Grivet‐Talocia Italy 23 2.1k 1.3× 296 0.3× 81 0.2× 285 0.9× 40 0.1× 196 2.7k
Kishore Singhal United States 10 867 0.5× 106 0.1× 101 0.3× 58 0.2× 189 0.6× 16 1.1k
P.A. Brennan United States 7 1.5k 0.9× 133 0.1× 81 0.2× 48 0.1× 143 0.4× 8 1.7k

Countries citing papers authored by P. Feldmann

Since Specialization
Citations

This map shows the geographic impact of P. Feldmann's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by P. Feldmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites P. Feldmann more than expected).

Fields of papers citing papers by P. Feldmann

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by P. Feldmann. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by P. Feldmann. The network helps show where P. Feldmann may publish in the future.

Co-authorship network of co-authors of P. Feldmann

This figure shows the co-authorship network connecting the top 25 collaborators of P. Feldmann. A scholar is included among the top collaborators of P. Feldmann based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with P. Feldmann. P. Feldmann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Zhu, Hengliang, et al.. (2015). Efficient Transient Analysis of Power Delivery Network With Clock/Power Gating by Sparse Approximation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 34(3). 409–421. 5 indexed citations
2.
Li, Peng, et al.. (2011). Simulation and Verification of Electronic and Biological Systems. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 12 indexed citations
3.
Liu, Frank & P. Feldmann. (2011). Pure nodal analysis for efficient on-chip interconnect model order reduction. 32. 2493–2496.
4.
Hatami, Safar, et al.. (2009). Efficient compression and handling of current source model library waveforms. Design, Automation, and Test in Europe. 1178–1183. 3 indexed citations
5.
Melville, Robert, P. Feldmann, & Jaijeet Roychowdhury. (2002). Efficient multi-tone distortion analysis of analog integrated circuits. 241–244. 49 indexed citations
6.
Feldmann, P. & Jaijeet Roychowdhury. (2002). Computation of circuit waveform envelopes using an efficient, matrix-decomposed harmonic balance algorithm. 295–300. 25 indexed citations
7.
Demir, Alper & P. Feldmann. (2000). Stochastic modeling and performance evaluation for digital clock and data recovery circuits. 340–344. 2 indexed citations
8.
Freund, R.W. & P. Feldmann. (1998). Reduced-order modeling of large linear passive multi-terminal circuits using matrix-padé approximation. Design, Automation, and Test in Europe. 530–537. 19 indexed citations
9.
Feldmann, P. & Roland W. Freund. (1997). Circuit noise evaluation by Padé approximation based model-reduction techniques. International Conference on Computer Aided Design. 132–138. 24 indexed citations
10.
Feldmann, P. & Jaijeet Roychowdhury. (1996). Computation of circuit waveform envelopes using an efficient, matrix-decomposed harmonic balance algorithm. International Conference on Computer Aided Design. 295–300. 35 indexed citations
11.
Freund, R.W. & P. Feldmann. (1996). Reduced-order modeling of large passive linear circuits by means of the SYPVL algorithm. 280–287. 72 indexed citations
12.
Feldmann, P. & R.W. Freund. (1995). Reduced-order modeling of large linear subcircuits via a block Lanczos algorithm. 474–479. 175 indexed citations
13.
Feldmann, P.. (1995). Reduced-Order Modeling of Large Linear Subcircuits via a Block Lanczos Algorithm. Proceedings - ACM IEEE Design Automation Conference. 47 indexed citations
14.
Feldmann, P. & R.W. Freund. (1995). Efficient linear circuit analysis by Pade approximation via the Lanczos process. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 14(5). 639–649. 983 indexed citations breakdown →
15.
Feldmann, P. & Roland W. Freund. (1994). Efficient linear circuit analysis by Pade´ approximation via the Lanczos process. European Design Automation Conference. 170–175. 22 indexed citations
16.
Freund, R.W. & P. Feldmann. (1994). Efficient small-signal circuit analysis and sensitivity computations with the PVL algorithm. International Conference on Computer Aided Design. 404–411. 14 indexed citations
17.
Feldmann, P. & Stephen W. Director. (1993). Integrated circuit quality optimization using surface integrals. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 12(12). 1868–1879. 33 indexed citations
18.
Feldmann, P., et al.. (1993). Statistical integrated circuit design. IEEE Journal of Solid-State Circuits. 28(3). 193–202. 76 indexed citations
19.
Feldmann, P., Robert Melville, & S. Moinian. (1992). Automatic differentiation in circuit simulation and device modeling. International Conference on Computer Aided Design. 248–253. 4 indexed citations
20.
Dohse, Knuth, et al.. (1983). Autor/inn/en. KJ / Kritische Justiz. 16(3). 347–347. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026