1.5k citations
- Massachusetts Institute of TechnologyUS194 papers
- Centre National de la Recherche ScientifiqueFR33 papers
- Harvard UniversityUS29 papers
- University of California, BerkeleyUS24 papers
- California Institute of TechnologyUS22 papers
- Northeastern UniversityUS22 papers
- University of CambridgeGB18 papers
- Cornell UniversityUS17 papers
- Kavli Institute for Particle Astrophysics and CosmologyUS17 papers
- Princeton UniversityUS17 papers
- MIT Computer Science and Artificial Intelligence LaboratoryUS16 papers
- Sorbonne UniversitéFR16 papers
13 papers · 1 filter
Spectroscopy of composite solid-state spin environments for improved metrology with spin ensembles
N. Bar-Gill, L. M. Pham, C. Belthangady +6
For precision coherent measurements with ensembles of quantum spins the relevant Figure-of-Merit (FOM) is the product of polarized spin density and coherence lifetime, which is gen…
A Miniature Cold-Atom Frequency Standard
Vishal Shah, Mark Mescher, Rick Stoner +2
Atomic sensors employing cold-atom technology enable unprecedented accuracy and resolution for next generation atomic clocks, magnetometers, gravimeters, and gyroscopes. To date, h…
On the rank function of a differential poset
Richard P. Stanley, Fabrizio Zanello
We study -differential posets, a class of combinatorial objects introduced in 1988 by the first author, which gathers together a number of remarkable combinatorial and algebraic…
Space-efficient Local Computation Algorithms
Noga Alon, Ronitt Rubinfeld, Shai Vardi +1
Recently Rubinfeld et al. (ICS 2011, pp. 223--238) proposed a new model of sublinear algorithms called \emph{local computation algorithms}. In this model, a computation problem …
Resource allocation with costly participation
Ali Kakhbod
We propose a new all-pay auction format in which risk-loving bidders pay a constant fee each time they bid for an object whose monetary value is common knowledge among the bidders,…
Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance
Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner +1
In this paper, we study the question of how efficiently a collection of interconnected nodes can perform a global computation in the widely studied GOSSIP model of communication. I…