Decision trees and random forests are common classifiers with widespread use. In this paper, we develop two protocols for privately evaluating decision trees and random forests. We operate in the… (More)

1.1. Distribution of values of L-functions. • Values at the edge of the critical strip: in particular L(1,χd ) where d is a fundamental discriminant. • Values at the center of the critical strip: ζ(… (More)

Border Gateway Protocol (BGP) is the inter-domain routing protocol currently employed in Internet. Internet growth imposes increased requirements on BGP performance. Recent studies revealed that… (More)

1.1. The Artin map. Let’s start off by reviewing the classical origins of class field theory. The motivating problem is basically to “describe” in some meaningful way the abelian extensions of a… (More)

We caution that # Fix(ψ) has to be interpreted with some care: it really denotes a fixed point count with multiplicities. A better way to phrase it as follows. Inside M ×M we have two submanifolds:… (More)

1 Overview 1.1 Vague form of the conjecture Let E be an elliptic curve over Q. I am going to describe a conjecture of Mazur and Tate which is in some sense a sequel of their investigation (together… (More)

1.1. Overview. This will be an introductory course on the geometry of numbers. We will mostly adopt a classical approach, but here is the highbrow way of describing the goal of the course. For G a… (More)

Let E be an elliptic curve over a eld k; imagine for the moment that k is of characteristic 0, although we will also be very interested in the characteristic p case. The p-divisible group of E is… (More)