Sciweavers

2430 search results - page 298 / 486
» Computing Tutte Polynomials
Sort
View
136
Voted
ECOOP
1993
Springer
15 years 7 months ago
Type Inference of SELF
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...
Ole Agesen, Jens Palsberg, Michael I. Schwartzbach
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
15 years 7 months ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
148
Voted
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
15 years 7 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
128
Voted
ASIACRYPT
2006
Springer
15 years 7 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
160
Voted
DNA
2006
Springer
159views Bioinformatics» more  DNA 2006»
15 years 7 months ago
Minimal Parallelism for Polarizationless P Systems
Minimal parallelism was recently introduced [3] as a way the rules of a P system are used: from each set of applicable rules associated to the same membrane, at least one must be a...
Tseren-Onolt Ishdorj