( en | de | ru )

 

Disambiguation of "Galesi, Nicola"

Author of the publication

copydeleteadd this publication to your clipboard
Proofs of Space: When Space Is of the Essence.

, , , and . SCN, volume 8642 of Lecture Notes in Computer Science, page 538-557. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nicola Mößner

Nicola Ettlin

Nicola Gess

Nicola Brocca

Nicola Breugst

 

Other publications of authors with the same name

Vertex-connectivity for node failure identification in Boolean Network Tomography., , and . Inf. Process. Lett., (February 2024)On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies., , and . ACM Trans. Comput. Log., 17 (4): 26 (2016)Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography., and . Theor. Comput. Sci., (2022)Space proof complexity for random 3-CNFs., , , , , and . Inf. Comput., (2017)Optimality of size-width tradeoffs for resolution., and . Comput. Complex., 10 (4): 261-276 (2001)Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography., and . ICDCS, page 212-222. IEEE Computer Society, (2018)Cops-Robber Games and the Resolution of Tseitin Formulas., , and . SAT, volume 10929 of Lecture Notes in Computer Science, page 311-326. Springer, (2018)On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares., , and . MFCS, volume 241 of LIPIcs, page 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Paris-Harrington Tautologies., , and . CCC, page 93-103. IEEE Computer Society, (2011)Resolution and the Binary Encoding of Combinatorial Principles., , and . CCC, volume 137 of LIPIcs, page 6:1-6:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)