output
20022019
most citedLeftover Hashing Against Quantum Side Information

313 citations

Showing 2017Show all

23 papers · 1 filter

cs.DB201725 cited

G-CORE: A Core for Future Graph Query Languages

Renzo Angles, Marcelo Arenas, Pablo Barceló +9

We report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider…

math.PR2017

Switch chain mixing times through triangle counts

Tom Bannink, Remco van der Hofstad, Clara Stegehuis

Sampling uniform simple graphs with power-law degree distributions with degree exponent is a non-trivial problem. We propose a method to sample uniform simple graphs th…

cs.GT2017

Fixed Price Approximability of the Optimal Gain From Trade

Riccardo Colini-Baldeschi, Paul Goldberg, Bart de Keijzer +2

Bilateral trade is a fundamental economic scenario comprising a strategically acting buyer and seller, each holding valuations for the item, drawn from publicly known distributions…

cs.LG20177 cited

A Tight Excess Risk Bound via a Unified PAC-Bayesian-Rademacher-Shtarkov-MDL Complexity

Peter D. Grünwald, Nishant A. Mehta

We present a novel notion of complexity that interpolates between and generalizes some classic existing complexity notions in learning theory: for estimators like empirical risk mi…

physics.space-ph201778 cited

Classification of Solar Wind with Machine Learning

Enrico Camporeale, Algo Carè, Joseph E. Borovsky

We present a four-category classification algorithm for the solar wind, based on Gaussian Process. The four categories are the ones previously adopted in Xu & Borovsky [2015]: ejec…

cs.LO20173 cited

Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)

Jos Baeten, Bas Luttik, Fei Yang

The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequen…