Sciweavers

1686 search results - page 61 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ICALP
2010
Springer
14 years 11 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
ITICSE
2005
ACM
15 years 3 months ago
Testing first: emphasizing testing in early programming courses
The complexity of languages like Java and C++ can make introductory programming classes in these languages extremely challenging for many students. Part of the complexity comes fr...
Will Marrero, Amber Settle
PPOPP
2009
ACM
15 years 10 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
ICCS
2009
Springer
15 years 4 months ago
Modular, Fine-Grained Adaptation of Parallel Programs
We present a modular approach to realizing fine-grained adaptation of program behavior in a parallel environment. Using a compositional framework based on function call intercepti...
Pilsung Kang 0002, Naresh K. C. Selvarasu, Naren R...
TOG
2008
106views more  TOG 2008»
14 years 9 months ago
BSGP: bulk-synchronous GPU programming
We present BSGP, a new programming language for general purpose computation on the GPU. A BSGP program looks much the same as a sequential C program. Programmers only need to supp...
Qiming Hou, Kun Zhou, Baining Guo