Catalogo dei prodotti della ricerca

LAURIA, MASSIMO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 2.187
EU - Europa 298
AS - Asia 233
SA - Sud America 6
AF - Africa 1
Totale 2.725
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 2.176
IT - Italia 150
SG - Singapore 103
IN - India 72
CN - Cina 54
UA - Ucraina 38
FI - Finlandia 35
SE - Svezia 26
DE - Germania 22
GB - Regno Unito 12
CA - Canada 11
AR - Argentina 6
IE - Irlanda 6
ID - Indonesia 4
RO - Romania 3
GR - Grecia 2
BE - Belgio 1
ES - Italia 1
FR - Francia 1
NL - Olanda 1
SC - Seychelles 1
Totale 2.725
Salva come PNG Salva come JPEG
Città #
Fairfield 337
Ashburn 212
Seattle 169
Woodbridge 167
Houston 159
Chandler 119
Cambridge 114
Wilmington 104
Santa Clara 94
Singapore 73
Rome 61
Ann Arbor 59
San Paolo di Civitate 46
New York 45
Princeton 43
Plano 38
Boston 30
Dearborn 30
Lawrence 29
Beijing 28
Albano Laziale 17
Millbury 17
Washington 17
Norwalk 16
San Diego 15
Andover 13
Jacksonville 11
Los Angeles 9
North Bergen 9
Southend 8
Toronto 8
Des Moines 7
Dublin 6
Federal 6
Falls Church 5
Jakarta 4
Milan 4
Nanjing 4
Nuremberg 4
Boardman 3
Indiana 3
Laurel 3
Bühl 2
Cherry Hill 2
Grafing 2
Hefei 2
Helsinki 2
Karlsruhe 2
Kunming 2
Ottawa 2
Phoenix 2
Pisa 2
Trumbull 2
Ardea 1
Artena 1
Asciano 1
Bad Muenstereifel 1
Ballwin 1
Barcelona 1
Berkeley 1
Brussels 1
Buffalo 1
Chengdu 1
Cottbus 1
Eden Prairie 1
Falkenstein 1
Fort Worth 1
Gaeta 1
Henderson 1
Jinan 1
Lappeenranta 1
London 1
Macerata 1
Munich 1
Portland 1
Pune 1
Québec 1
Redmond 1
Redwood City 1
Rodgau 1
Shenyang 1
University Center 1
Totale 2.197
Salva come PNG Salva come JPEG
Nome #
On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies 111
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games 106
Paris-Harrington tautologies 106
A characterization of tree-like Resolution size 92
Optimality of size-degree tradeoffs for polynomial calculus 91
Narrow proofs may be maximally long 85
The complexity of proving that a graph is Ramsey 84
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. 81
Space complexity in polynomial calculus 81
null 76
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances 76
Parameterized complexity of DPLL search procedures 75
Parameterized Complexity of DPLL Search Procedures 75
On the bounded-hop MST problem on random Euclidean instances 75
From small space to small width in resolution 75
Minimum energy broadcast and disk cover in grid wireless networks 74
Cliques enumeration and tree-like resolution proofs 73
A rank lower bound for cutting Planes Proofs of Ramsey's Theorem 72
Parameterized bounded-depth Frege is not optimal 71
Tight Size-Degree Bounds for Sums-of-Squares Proofs 69
Parameterized bounded-depth Frege is not optimal 68
Minimum-Energy Broadcast and disk cover in grid wireless networks 68
On semantic cutting planes with very small coefficients 68
On the Automatizability of Polynomial Calculus 66
Narrow proofs may be maximally long 61
From small space to small width in resolution 60
Space complexity in polynomial calculus 58
The complexity of proving that a graph is Ramsey 58
A note about k-DNF resolution 57
Algorithm analysis through proof complexity 55
A rank lower bound for cutting planes proofs of Ramsey's theorem 51
null 50
null 50
Upper bounds on positional Paris–Harrington games 48
Circular (Yet Sound) Proofs 47
null 45
null 41
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares 32
Towards an understanding of polynomial calculus: New separations and lower bounds (extended abstract) 32
Clique is hard on average for regular resolution 20
null 17
On the maximal part in unrefinable partitions of triangular numbers 17
Clique Is Hard on Average for Regular Resolution 16
Circular (Yet Sound) Proofs in Propositional Logic 15
null 15
Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases 14
CNFgen: A generator of crafted benchmarks 14
Verification and generation of unrefinable partitions 13
Hardness of Approximation in PSPACE and Separation Results for Pebble Games 13
Semantic versus syntactic cutting planes 12
The power of negative reasoning 12
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares 10
Tight size-degree bounds for sums-of-squares proofs 10
Trade-offs between time and memory in a tighter model of CDCL SAT solvers 8
Totale 2.869
Salva come PNG Salva come JPEG
Categoria #
all - tutte 8.358
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 8.358
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020546 0 0 0 0 74 81 108 83 84 58 30 28
2020/2021200 22 37 11 6 2 2 5 25 44 33 12 1
2021/2022457 3 28 42 8 52 9 12 44 30 27 110 92
2022/2023384 82 91 22 31 42 35 0 18 45 1 12 5
2023/2024301 19 37 29 22 31 81 6 2 0 26 16 32
2024/2025208 10 2 31 66 99 0 0 0 0 0 0 0
Totale 2.869