4940 search results - page 85 / 988 » On the Complexity of Universal Programs |
108
click to vote
JSS
2007
15 years 4 months ago
2007
Objective: Comparison of program defects caused by programmer pairs and solo developers. Design: Analysis of programs developed during two counter balanced experiments. Setting: P...
111
click to vote
ICALP
1999
Springer
15 years 8 months ago
1999
Springer
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
135
click to vote
ORL
1998
15 years 4 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
157
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
134
click to vote
SIGPLAN
2008
15 years 4 months ago
2008
As research in programming language design, implementation, and application advances, we must regularly revisit the undergraduate curriculum to ensure course content advances simi...