809 search results - page 70 / 162 » 04421 Abstracts Collection - Algebraic Methods in Computatio... |
105
click to vote
CONCUR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
100
click to vote
TLCA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
119
click to vote
IMA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as side-channel a...
MOC
1998
15 years 1 months ago
1998
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
119
click to vote
ICCSA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...