3454 search results - page 594 / 691 » Modern computer algebra |
145
Voted
FM
2006
Springer
15 years 7 months ago
2006
Springer
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
139
Voted
ASIACRYPT
2008
Springer
15 years 5 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
147
Voted
ICDCS
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
138
Voted
PPSC
1993
15 years 5 months ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
147
Voted
CSR
2008
Springer
15 years 3 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...