Sciweavers

22 search results - page 2 / 5
» An O(M(n) log n) algorithm for the Jacobi symbol
Sort
View
ASIACRYPT
2009
Springer
14 years 2 months ago
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
Tibor Jager, Jörg Schwenk
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
14 years 1 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
SIAMREV
2011
63views more  SIAMREV 2011»
12 years 10 months ago
Discrete Symbol Calculus
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
Laurent Demanet, Lexing Ying
ICALP
2009
Springer
14 years 8 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 1 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki