Related publications (13)

On the Use of the Generalized Littlewood Theorem Concerning Integrals of the Logarithm of Analytical Functions for the Calculation of Infinite Sums and the Analysis of Zeroes of Analytical Functions

Recently, we have established and used the generalized Littlewood theorem concerning contour integrals of the logarithm of an analytical function to obtain a few new criteria equivalent to the Riemann hypothesis. Here, the same theorem is applied to calcul ...
MDPI2023

Redefining Energy Density for an uniaxial Dielectric Elastomer Actuator

Yves Perriard, Yoan René Cyrille Civet, Jonathan André Jean-Marie Chavanne

The dielectric elastomer actuator (DEA) is a technology known to potentially provide high energy density (0.3 - 0.4 J.cm(-3)). However, in the literature, few demonstrations have been done to evaluate this figure. To well understand the ability of this tec ...
IEEE2021

Dating Death: An Empirical Comparison of Medical Underwriters in the U.S. Life Settlements Market

Jiahua Xu

The value of a life settlement investment, manifested through a traded life insurance policy, is highly dependent on the insured's life expectancy (LE). LE estimation in life settlements relies heavily on medical underwriting. Employing different evaluatio ...
2020

Detection Under One-Bit Messaging Over Adaptive Networks

Ali H. Sayed

This paper studies the operation of multi-agent networks engaged in binary decision tasks, and derives performance expressions and performance operating curves under challenging conditions with some revealing insights. One of the main challenges in the ana ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Construction of Polar Codes With Sublinear Complexity

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Near-Optimal Noisy Group Testing via Separate Decoding of Items

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we revisit an efficient algorithm for noisy group testing in which each item is decoded separately (Malyutov and Mateev, 1980), and develop novel performance guarantees via an information-theoretic framework for general noise models. For the ...
IEEE2018

Arithmetic and geometric structures in cryptography

Benjamin Pierre Charles Wesolowski

We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...
EPFL2018

Solving a $6120$-bit DLP on a Desktop Computer

Robert Granger, Jens Markus Zumbrägel

In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. By combining the polynomial time relat ...
Springer Berlin Heidelberg2013

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.