4940 search results - page 29 / 988 » On the Complexity of Universal Programs |
118
Voted
ISSTA
2006
ACM
15 years 7 months ago
2006
ACM
Static analysis has gained much attention over the past few years in applications such as bug finding and program verification. As software becomes more complex and componentize...
IJET
2006
15 years 1 months ago
2006
One of the primary goals of undergraduate studies programs is to promote the professional and personal growth and success of their students. First year students, however, often suf...
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
121
Voted
SODA
2000
ACM
15 years 3 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
136
Voted
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...