Computing Order Statistics in the Farey Sequence

Cached

Download Links

by Corina E. Pǎtra¸scu
Citations:1 - 0 self

Active Bibliography

Approximating Rational Numbers by Fractions – unknown authors
1 Computing All-Pairs Shortest Paths by Leveraging Low Treewidth – Léon Planken, Mathijs De Weerdt, Roman Van Der Krogt - 2012
The Discrete Runs Test and the Discrete Maximum of – Andrew Shapira
Explicit Bounds for the Approximation Error in – Lutz Dümbgen, Christoph Leuenberger - 2007
Chi-square test Χ2 Number of Flips n Summation Sign Σ Degrees of Freedom df Probability P Expected Values E Observed Values O – Anam Saghir
The Mandelbrot Set and The Farey Tree – Robert Devaney Boston, Robert L. Devaney - 1999
1 A Recursion for the Farey Sequence – Scott B. Guthery - 2009
ARNOL ′ D TONGUES ARISING FROM A GRAZING-SLIDING BIFURCATION OF A PIECEWISE-SMOOTH SYSTEM RÓBERT SZALAI ⋆ AND – Hinke M. Osinga
Fourier transform (QFT). We give an upper bound of Fast – Richard Cleve, John Watrous
2 On Valiant’s holographic algorithms – Jin-yi Cai
Chennai,Tamilnadu, – Murugeshwari B, Jayakumar C, Sarukesi K
1 Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots – Yves Igor Jerschow, Martin Mauve
1 Taking Roots over High Extensions of Finite Fields – Javad Doliskani, Éric Schost
6 Quantum hidden subgroup algorithms on free groups, (in preparation – Samuel J. Lomonaco, Jr., Louis H. Kauffman
Some Connections Between Primitive Roots and Quadratic Non-Residues Modulo a Prime – Sorin Iftene
CS 787: Advanced Algorithms Topic: Primality Testing – Presenters Maheswaran
Computing all MOD-functions simultaneously – Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi
55 Fast parallel circuits for the quantum Fourier transform – Richard Cleve, John Watrous - 2000
Modular Square Root Puzzles: Design of Non-Parallelizable and Non-Interactive Client Puzzles – Yves Igor Jerschow , Martin Mauve - 2012