Sciweavers

1786 search results - page 1 / 358
» The Structure of Factor Oracles
Sort
View
IJFCS
2007
60views more  IJFCS 2007»
13 years 8 months ago
The Structure of Factor Oracles
Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
CPM
2009
Springer
102views Combinatorics» more  CPM 2009»
13 years 9 months ago
Statistical Properties of Factor Oracles
Factor and suffix oracles have been introduced in [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. ...
Jérémie Bourdon, Irena Rusu
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
14 years 2 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
PKC
2009
Springer
175views Cryptology» more  PKC 2009»
14 years 9 months ago
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
We address the problem of polynomial time factoring RSA moduli N1 = p1q1 with the help of an oracle. As opposed to other approaches that require an oracle that explicitly outputs b...
Alexander May, Maike Ritzenhofen
GI
2007
Springer
14 years 2 months ago
On Factoring Arbitrary Integers with Known Bits
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...
Mathias Herrmann, Alexander May