1226 search results - page 143 / 246 » Proofs, Programs and Abstract Complexity |
155
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
121
Voted
TOOLS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract. Virtual machines (VMs) emulating hardware devices are generally implemented in low-level languages for performance reasons. This results in unmaintainable systems that ar...
116
click to vote
POPL
2000
ACM
15 years 7 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
131
Voted
IFL
2007
Springer
15 years 9 months ago
2007
Springer
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
143
click to vote
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. As heterogeneous computing platforms become more prevalent, the programmer must account for complex memory hierarchies in addition to the difficulties of parallel program...