Publications related to Continuous time random walks with Erlangian pausing time distributions

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.

The number field sieve

Arjen Lenstra

The number field sieve is an algorithm to factor integers of the form

r^e-s

for small positive

r

and

s

. The authors present a report on work in progress on this algorithm. They informally describe the algorithm, discuss several implementation related ...

Springer Berlin Heidelberg1993

Finite parts of the spectrum of a Riemann surface

Gilles André Courtois

Let S and

S'

be compact Riemann surfaces of the same genus g (g

ge 2)

endowed with the Poincaré metric of constant negative curvature -1. par The authors show that for every

epsilon >0

, there exists an integer

m=m(g,epsilon)

with the property: Assum ...

1990

Continuous time random walks with Erlangian pausing time distributions

Graph Chatbot

Chat with Graph Search

Accuracy criteria for linearised diffusion wave flood routing

The number field sieve

Finite parts of the spectrum of a Riemann surface

The number field sieve

Finite parts of the spectrum of a Riemann surface

Accuracy criteria for linearised diffusion wave flood routing