Faster and Simpler Sketches of Valuation Functions

A Simpler and Faster Version of Two-Dimensional Gel Electrophoresis Using Vertical, Mini SDS-PAGE Apparatus

We have modified one of the most useful methods of protein separation; namely, two dimensional gel electrophoresis (2-DE). This modified version of 2-DE is not only simpler and easier but also faster than all the currently available methods. In this method, isoelectric focusing is carried out in the first dimension using a vertical sodium dodecyl sulfate polyacrylamide gel electrop...

Faster and Simpler Approximation of Stable Matchings

We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m) time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(nm) time, where n denotes the number of people and m is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extensio...

Faster and Simpler Minimal Conflicting Set Identification

Let C be a finite set of n elements and R = {r1, r2, . . . , rm} a family of m subsets of C. A subset X of R verifies the Consecutive Ones Property (C1P) if there exists a permutation P of C such that each ri in X is an interval of P . A Minimal Conflicting Set (MCS) S ⊆ R is a subset of R that does not verify the C1P, but such that any of its proper subsets does. In this paper, we present a ne...

Faster Valuation of Financial Derivatives

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), and asymptotically optimal with very small hidden constants. Our methods involve a new kind of trapdoor, and include specialized algorithms for inverting LWE, randomly sampling SIS preimages, and securely delegating trapdoor...