output
20022015
most citedObservation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC

10.9k citations

Showing 2012Show all

135 papers · 1 filter

cs.LG201230 cited

Random Spanning Trees and the Prediction of Weighted Graphs

Nicolo' Cesa-Bianchi, Claudio Gentile, Fabio Vitale +1

We investigate the problem of sequentially predicting the binary labels on the nodes of an arbitrary weighted graph. We show that, under a suitable parametrization of the problem,…

physics.ins-det2012234 cited

The GERDA experiment for the search of 0νββ decay in ^{76}Ge

GERDA Collaboration, K. -H. Ackermann, M. Agostini +136

The GERDA collaboration is performing a search for neutrinoless double beta decay of ^{76}Ge with the eponymous detector. The experiment has been installed and commissioned at the…

math.AG20121 cited

Comparison Isomorphisms for Smooth Formal Schemes

Fabrizio Andreatta, Adrian Iovita

For a smooth proper scheme or formal scheme over an unramified, complete DVR of mixed characteristics we prove a comparison isomorphism relating etale cohomology of the generic fib…

math.AG20121 cited

P-Adic families of Siegel modular cuspforms

Fabrizio Andreatta, Adrain Iovita, Vincent Pilloni

Let p be an odd prime and g an integer greater or equal to 2. We prove that a finite slope Siegel cuspidal eigenform of genus g can be p-adically deformed over the g-dimensional we…

nucl-ex201260 cited

Measurement of the half-life of the two-neutrino double beta decay of Ge-76 with the Gerda experiment

GERDA Collaboration, M. Agostini, M. Allardt +110

The primary goal of the GERmanium Detector Array (Gerda) experiment at the Laboratori Nazionali del Gran Sasso of INFN is the search for the neutrinoless double beta decay of Ge-76…

cs.FL2012

Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata

Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki

We investigate the conversion of one-way nondeterministic finite automata and context-free grammars into Parikh equivalent one-way and two-way deterministic finite automata, from a…