Nicola Galesi

Nicola Galesi

Sapienza Università di Roma

H-index: 20

Europe-Italy

About Nicola Galesi

Nicola Galesi, With an exceptional h-index of 20 and a recent h-index of 12 (since 2020), a distinguished researcher at Sapienza Università di Roma, specializes in the field of Computational Complexity.

His recent articles reflect a diverse array of research interests and contributions to the field:

Vertex-connectivity for node failure identification in Boolean Network Tomography

Depth lower bounds in stabbing planes for combinatorial principles

Leibniz International Proceedings in Informatics (LIPIcs): 38th Computational Complexity Conference (CCC 2023)

Bounded-depth Frege complexity of Tseitin formulas for all graphs

On vanishing sums of roots of unity in polynomial calculus and sum-of-squares

A Note on Bounds and on the Complexity of Maximal Failure Identification in Networks

On the algebraic proof complexity of Tensor Isomorphism

Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography

Nicola Galesi Information

University

Position

___

Citations(all)

1355

Citations(since 2020)

400

Cited By

1191

hIndex(all)

20

hIndex(since 2020)

12

i10Index(all)

29

i10Index(since 2020)

15

Email

University Profile Page

Sapienza Università di Roma

Google Scholar

View Google Scholar Profile

Nicola Galesi Skills & Research Interests

Computational Complexity

Top articles of Nicola Galesi

Title

Journal

Author(s)

Publication Date

Vertex-connectivity for node failure identification in Boolean Network Tomography

Information Processing Letters

Nicola Galesi

Fariba Ranjbar

Michele Zito

2024/2/1

Depth lower bounds in stabbing planes for combinatorial principles

Logical Methods in Computer Science

Stefan Dantchev

Nicola Galesi

Abdul Ghani

Barnaby Martin

2024/1/11

Leibniz International Proceedings in Informatics (LIPIcs): 38th Computational Complexity Conference (CCC 2023)

European Conference on Object-Oriented Programming

Feiyang Jin

Lechen Yu

Tiago Cogumbreiro

Jun Shirako

Vivek Sarkar

2023/1

Bounded-depth Frege complexity of Tseitin formulas for all graphs

Annals of Pure and Applied Logic

Nicola Galesi

Dmitry Itsykson

Artur Riazanov

Anastasia Sofronova

2023/1/1

On vanishing sums of roots of unity in polynomial calculus and sum-of-squares

computational complexity

Ilario Bonacina

Nicola Galesi

Massimo Lauria

2023/12

A Note on Bounds and on the Complexity of Maximal Failure Identification in Networks

Available at SSRN 4620392

Nicola Galesi

Fariba Ranjbar

2023/9/22

On the algebraic proof complexity of Tensor Isomorphism

arXiv preprint arXiv:2305.19320

Nicola Galesi

Joshua A Grochow

Toniann Pitassi

Adrian She

2023/5/30

Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography

Theoretical Computer Science

Nicola Galesi

Fariba Ranjbar

2022/6/5

A Note on Bounds and on the Complexity of Node Failure Identification in Networks

Available at SSRN 4061002

Nicola Galesi

Fariba Ranjbar

2022/2/24

Counting and localizing defective nodes by Boolean network tomography

arXiv preprint arXiv:2101.04403

Nicola Galesi

Fariba Ranjbar

2021/1/12

Bounds on the maximal number of corrupted nodes via Boolean Network Tomography

Fariba Ranjbar

2021/7/8

Proof complexity and the binary encoding of combinatorial principles

arXiv preprint arXiv:2008.02138

Stefan Dantchev

Nicola Galesi

Abdul Ghani

Barnaby Martin

2020/8/4

Cops-robber games and the resolution of tseitin formulas

ACM Transactions on Computation Theory (TOCT)

Nicola Galesi

Navid Talebanfard

Jacobo Torán

2020/3/4

See List of Professors in Nicola Galesi University(Sapienza Università di Roma)