Sciweavers

2763 search results - page 416 / 553
» The Dangerous 'All' in Specifications
Sort
View
ICFP
2009
ACM
16 years 7 months ago
A concurrent ML library in concurrent Haskell
rrent ML, synchronization abstractions can be defined and passed as values, much like functions in ML. This mechanism admits a powerful, modular style of concurrent programming, c...
Avik Chaudhuri
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 7 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
SIGCSE
2009
ACM
135views Education» more  SIGCSE 2009»
16 years 7 months ago
Methodology for successful undergraduate recruiting in computer science at comprehensive public universities
This paper presents a methodology for increasing undergraduate Computer Science (CS) major enrollment at comprehensive public universities, particularly those that have first gene...
Patricia Morreale, Stan Kurkovsky, George Chang
PPOPP
2009
ACM
16 years 7 months ago
Detecting and tolerating asymmetric races
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
Paruj Ratanaworabhan, Martin Burtscher, Darko Kiro...
PPOPP
2009
ACM
16 years 7 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha