4940 search results - page 430 / 988 » On the Complexity of Universal Programs |
161
click to vote
TCC
2010
Springer
15 years 5 months ago
2010
Springer
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...
169
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Existential types provide a simple and elegant foundation for uning generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting ...
438
click to vote
Lab
The Institute's mission is to produce excellent, innovative and nationalistic engineers and to advance the field of electrical and electronics engineering.
The undergr...
176
Voted
TLDI
2005
ACM
16 years 12 days ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
194
Voted
PLDI
2004
ACM
16 years 8 days ago
2004
ACM
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...