1282 search results - page 108 / 257 » Practical Loss-Resilient Codes |
128
click to vote
ISSAC
1999
Springer
15 years 9 months ago
1999
Springer
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
159
Voted
AC
1997
Springer
15 years 9 months ago
1997
Springer
This paper describes the state of the art for cryptographic primitives that are used for protecting the authenticity of information: cryptographic hash functions and digital signat...
281
Voted
Book
"EJB Design Patterns goes beyond high-level design pattern descriptions into critical EJB-specific implementation issues, illustrated with source code implementations. The boo...
109
click to vote
VMCAI
2005
Springer
15 years 10 months ago
2005
Springer
We present a technique to prove termination of multipath polynomial programs, an expressive class of loops that enables practical traction and analysis. The technique is based on ï...
141
click to vote
ERLANG
2003
ACM
15 years 10 months ago
2003
ACM
This paper describes how the Erlang programming language could be extended with parameterized modules, in a way that is compatible with existing code. This provides a powerful way...