181 citations
- University of British ColumbiaCA4 papers
- University of California, BerkeleyUS4 papers
- Eindhoven University of TechnologyNL3 papers
- Hebrew University of JerusalemIL3 papers
- Charles UniversityCZ2 papers
- Courant Institute of Mathematical SciencesUS2 papers
- Microsoft Research (United Kingdom)GB2 papers
- University of California, Los AngelesUS2 papers
- University of Illinois Urbana-ChampaignUS2 papers
- Weizmann Institute of ScienceIL2 papers
- Australian National UniversityAU1 paper
- Board of the Swiss Federal Institutes of TechnologyCH1 paper
4 papers · 1 filter
A negative answer to Nevanlinna's type question and a parabolic surface with a lot of negative curvature
Itai Benjamini, Sergei Merenkov, Oded Schramm
Consider a simply connected Riemann surface represented by a Speiser graph. Nevanlinna asked if the type of the surface is determined by the mean excess of the graph: whether mean…
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
Kirsten Eisentraeger, Kristin Lauter, Peter L. Montgomery
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8 % to 8.5 % over the best known general methods when using affine coordina…
Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP
Kamal Jain, Mohammad Mahdian, Evangelos Markakis +2
In this paper, we will formalize the method of dual fitting and the idea of factor-revealing LP. This combination is used to design and analyze two greedy algorithms for the metric…
Percolation on finite graphs and isoperimetric inequalities
Noga Alon, Itai Benjamini, Alan Stacey
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly…