1686 search results - page 22 / 338 » Programs as polygraphs: computability and complexity |
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
The fact that graphics processors (GPUs) are today’s most powerful computational hardware for the dollar has motivated researchers to utilize the ubiquitous and powerful GPUs fo...
ISSTA
2010
ACM
15 years 1 months ago
2010
ACM
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
102
click to vote
FCCM
2008
IEEE
15 years 4 months ago
2008
IEEE
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...
GCC
2003
Springer
15 years 2 months ago
2003
Springer
Even though grid research is prosperous in an extensive context, few grid platforms for high performance computing are practical and in operation so far. Since most applications a...