4940 search results - page 83 / 988 » On the Complexity of Universal Programs |
119
click to vote
ESOP
2009
Springer
15 years 11 months ago
2009
Springer
ion for Concurrent Objects Ivana Filipovi´c, Peter O’Hearn, Noam Rinetzky, and Hongseok Yang Queen Mary University of London, UK Concurrent data structures are usually designed ...
140
click to vote
COCOA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
115
click to vote
INFOSECCD
2006
ACM
15 years 10 months ago
2006
ACM
As Armstrong Atlantic State University prepares to enter the wireless world during the 2006-07 academic year, it is important that those connecting to the university’s network u...
128
click to vote
SIGUCCS
2006
ACM
15 years 10 months ago
2006
ACM
In recent years, the use of a computer has become a requirement for success in a collegiate environment, and the demand for mobile computing has sharply increased. In response to ...
162
click to vote
POPL
1999
ACM
15 years 8 months ago
1999
ACM
An increasing number of systems rely on programming language technology to ensure safety and security of low-level code. Unfortunately, these systems typically rely on a complex, ...