GALESI, NICOLA
 Distribuzione geografica
Continente #
NA - Nord America 2.725
EU - Europa 560
AS - Asia 454
SA - Sud America 16
AF - Africa 2
Totale 3.757
Nazione #
US - Stati Uniti d'America 2.718
IT - Italia 238
SG - Singapore 178
IN - India 140
UA - Ucraina 134
CN - Cina 116
SE - Svezia 55
FI - Finlandia 46
DE - Germania 20
GB - Regno Unito 20
RU - Federazione Russa 18
AR - Argentina 14
ID - Indonesia 12
IE - Irlanda 10
CA - Canada 6
PK - Pakistan 5
NL - Olanda 4
RO - Romania 4
AT - Austria 2
CH - Svizzera 2
CL - Cile 2
GR - Grecia 2
IL - Israele 2
AD - Andorra 1
BE - Belgio 1
EE - Estonia 1
ES - Italia 1
IR - Iran 1
MX - Messico 1
PT - Portogallo 1
TG - Togo 1
ZA - Sudafrica 1
Totale 3.757
Città #
Fairfield 399
Woodbridge 252
Chandler 231
Santa Clara 204
Seattle 197
Houston 181
Ashburn 145
Wilmington 130
Singapore 128
Rome 96
Cambridge 95
Ann Arbor 89
Beijing 56
Delhi 53
Princeton 53
San Paolo di Civitate 49
Jacksonville 47
Millbury 45
Plano 43
New York 28
Lawrence 27
Des Moines 24
San Diego 20
Norwalk 15
Andover 14
Federal 14
Boston 12
Jakarta 12
Southend 11
Corbetta 10
Dearborn 10
Dublin 10
Ardea 7
Boardman 6
Milan 6
Albano Laziale 5
Hyderabad 5
Indiana 4
Trieste 4
Falkenstein 3
Falls Church 3
Karlsruhe 3
Lappeenranta 3
Los Angeles 3
Moscow 3
San Mateo 3
Toronto 3
Venezia 3
Bühl 2
Hefei 2
Laurel 2
London 2
Mountain View 2
North Bergen 2
Nuremberg 2
Ottawa 2
Palestrina 2
Phoenix 2
Tel Aviv 2
Washington 2
Alblasserdam 1
Andorra la Vella 1
Aprilia 1
Barcelona 1
Basel 1
Brussels 1
Buffalo 1
Comiso 1
Eden Prairie 1
Forest City 1
Fort Worth 1
Gaeta 1
Grafing 1
Helsinki 1
Kilburn 1
Kunming 1
Lomé 1
Lousã 1
Mannheim 1
Massongex 1
Mcallen 1
Mexico City 1
Monterotondo 1
Muizenberg 1
Nanjing 1
Oxford 1
Pisa 1
Potsdam 1
Provo 1
Québec 1
Redwood City 1
Rignano Flaminio 1
Rodgau 1
Stuttgart 1
Tallinn 1
Treviso 1
Trumbull 1
Vienna 1
Vittoria 1
Totale 2.827
Nome #
On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies 116
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games 110
Paris-Harrington tautologies 110
Proofs of Space: When Space Is of the Essence 108
Tight bounds for maximal identifiability of failure nodes in boolean network tomography 108
Space complexity of random formulae in resolution 103
Degree complexity for a modified pigeonhole principle 99
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus 99
Optimality of size-degree tradeoffs for polynomial calculus 95
On the complexity of resolution with bounded conjunctions. 95
A characterization of tree-like Resolution size 95
Monotone Simulations of Nonmonotone Proofs 94
On the complexity of resolution with bounded conjunctions 91
A framework for space complexity in algebraic proof systems 90
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems 89
Resolution and Pebbling Games 88
Vertex-connectivity for node failure identification in boolean network tomography 86
Optimality of size-width tradeoffs for resolution 86
Rank Bounds and Integrality Gaps for Cutting Planes Procedures 84
Monotone Proofs of the Pigeon Hole Principle 84
Monotone Proofs of the Pigeon Hole Principle 84
A predicative and decidable characterization of the polynomial classes of languages 84
Monotone Simulations of Nonmonotone Proofs. 83
Space proof complexity for random 3-CNFs 83
A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists. 82
Parameterized Complexity of DPLL Search Procedures 80
Cops-Robber games and the resolution of Tseitin Formulas 80
Parameterized complexity of DPLL search procedures 79
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank 76
Parameterized bounded-depth Frege is not optimal 75
Parameterized bounded-depth Frege is not optimal 73
Space Complexity of Random Formulae in Resolution 72
On the Automatizability of Polynomial Calculus 70
Rank Bounds and Integrality Gaps for Cutting Planes Procedures 64
The space complexity of cutting planes refutations 61
Polynomial calculus space and resolution width 61
Cops-Robber Games and the Resolution of Tseitin Formulas 59
Total space in resolution 51
Bounded-depth frege complexity of tseitin formulas for all graphs 51
Total space in resolution 48
Pseudo-Partitions, Transeversality and Locality: A combinatorial characterization for Space measure in Algebraic Systems 43
The Complexity of Treelike Systems over lamdda-Local Formulae 42
Membro di Ocmitato di Programma 41
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systemsv 41
Resolution and the binary encoding of combinatorial principles 40
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares 36
Membro di Comitato di Programma 36
Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography 36
Membro di Comitato di Programma 34
Depth Lower Bounds in Stabbing Planes for Combinatorial Principles 28
Proof complexity and the binary encoding of combinatorial principles 21
Bounded-depth Frege complexity of Tseitin formulas for all graphs 18
Ramsey Theory in Logic, Complexity and Combinatorics 18
On the Algebraic Proof Complexity of Tensor Isomorphism 16
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares 15
Vertex-connectivity for node failure identification in Boolean Network Tomography 13
Depth lower bounds in Stabbing Planes for combinatorial principles 12
Totale 3.836
Categoria #
all - tutte 10.708
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 10.708


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020453 0 0 0 0 0 0 89 95 95 115 28 31
2020/2021348 31 47 16 17 15 11 13 69 48 51 29 1
2021/2022661 12 30 52 6 65 9 6 59 48 34 234 106
2022/2023576 90 101 63 64 79 69 0 30 44 5 21 10
2023/2024218 13 35 13 13 8 32 4 5 2 40 18 35
2024/2025509 22 5 81 77 159 153 12 0 0 0 0 0
Totale 3.836