Sciweavers

4940 search results - page 194 / 988
» On the Complexity of Universal Programs
Sort
View
MP
1998
83views more  MP 1998»
15 years 5 months ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
POPL
2004
ACM
16 years 6 months ago
Tridirectional typechecking
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...
Joshua Dunfield, Frank Pfenning
TPDS
1998
114views more  TPDS 1998»
15 years 5 months ago
On the Automatic Parallelization of the Perfect Benchmarks
We present a set of advanced program parallelization techniques that are able to signi cantly improve the performance of application programs. We present evidence for this improve...
Rudolf Eigenmann, Jay Hoeflinger, David A. Padua
PLPV
2009
ACM
16 years 3 months ago
Type invariants for Haskell
Haskell’s multi-parameter type classes, together with functional dependencies, allow the specification of complex type-level opera
Tom Schrijvers, Louis-Julien Guillemette, Stefan M...
ITICSE
2006
ACM
16 years 6 days ago
Once she makes it, she is there: gender differences in computer science study
When you sit in a Computer Science lecture at any university in the western world, what are the chances that the person sitting next to you will be a woman? Furthermore, what are ...
Tamar Vilner, Ela Zur