output
20022013
most citedDevice-independent security of quantum cryptography against collective attacks

1.8k citations

Showing 2013Show all

27 papers · 1 filter

cs.DS20133 cited

Combining Binary Search Trees

Erik D. Demaine, John Iacono, Stefan Langerman +1

We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of…

astro-ph.HE20132 cited

Does a hadron-quark phase transition in dense matter preclude the existence of massive neutron stars ?

N. Chamel, A. F. Fantina, J. M. Pearson +1

We study the impact of a hadron-quark phase transition on the maximum neutron-star mass. The hadronic part of the equation of state relies on the most up-to-date Skyrme nuclear ene…

cs.DS2013

The Power and Limitations of Static Binary Search Trees with Lazy Finger

Prosenjit Bose, Karim Douïeb, John Iacono +1

A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic o…

hep-th20136 cited

Minimal Model for an Unbalanced Holographic Superconductor

Daniele Musso

We describe the simplest holographic model for an s-wave unbalanced superconductor in 2+1 dimensions. We study its phase diagram and linear response features with particular attent…

cs.AI201333 cited

Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence (1992)

Bruce D'Ambrosio, Didier Dubois, Philippe Smets +1

This is the Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence, which was held in Stanford, CA, July 17-19, 1992

math.CO20132 cited

Excluding Graphs as Immersions in Surface Embedded Graphs

Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos

We prove a structural characterization of graphs that forbid a fixed graph as an immersion and can be embedded in a surface of Euler genus . In particular, we prove that a g…