2226 search results - page 183 / 446 » Computable Analysis via Representations |
210
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
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...
206
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
202
click to vote
LCPC
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...
191
Voted
PPAM
2005
Springer
16 years 8 days ago
2005
Springer
The complexity and the dynamics of the Grid environment and of the emering workflow-based applications on the Grid require novel performance monitoring and analysis services in or...
192
click to vote
FORTE
2009
15 years 4 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...