1102 search results - page 113 / 221 » Generalizing Updates: From Models to Programs |
92
Voted
STOC
2010
ACM
15 years 4 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
111
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
139
Voted
FIDJI
2003
Springer
15 years 5 months ago
2003
Springer
The popular slogan ”write once, run anywhere” effectively renders the expressive capabilities of the Java programming framework for developing, deploying, and reusing target-i...
CPHYSICS
2008
15 years 18 days ago
2008
We present wannier90, a program for calculating maximally-localised Wannier functions (MLWF) from a set of Bloch energy bands that may or may not be attached to or mixed with othe...
109
Voted
ISCA
2007
IEEE
15 years 6 months ago
2007
IEEE
Speculative compiler optimizations are effective in improving both single-thread performance and reducing power consumption, but their implementation introduces significant compl...