Sciweavers

7106 search results - page 412 / 1422
» Restricted Complexity, General Complexity
Sort
View
PPOPP
2009
ACM
16 years 7 months ago
A comparison of programming models for multiprocessors with explicitly managed memory hierarchies
On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and...
Scott Schneider, Jae-Seung Yeom, Benjamin Rose, Jo...
ICALP
2009
Springer
16 years 7 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
ICSE
2004
IEEE-ACM
16 years 7 months ago
Unifying Artifacts and Activities in a Visual Tool for Distributed Software Development Teams
In large projects, software developers struggle with two sources of complexity ? the complexity of the code itself, and the complexity of the process of producing it. Both of thes...
Jon Froehlich, Paul Dourish
ICSE
2004
IEEE-ACM
16 years 7 months ago
Automated Support for Development, Maintenance, and Testing in the Presence of Implicit Control Flow
Although object-oriented languages can improve programming practices, their characteristics may introduce new problems for software engineers. One important problem is the presenc...
Saurabh Sinha, Alessandro Orso, Mary Jean Harrold
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
16 years 4 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan