42230 search results - page 8184 / 8446 » Algorithms and Complexity Results for |
154
click to vote
CHI
2002
ACM
16 years 7 months ago
2002
ACM
We propose a formal experimental paradigm designed to help evaluate scrolling interaction techniques. Such a method is needed by interaction designers to quantify scrolling perfor...
292
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
317
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected interactions between concurrent threads. Much previous work has focused on det...
171
click to vote
OSDI
2006
ACM
16 years 7 months ago
2006
ACM
Existing virtual memory systems usually work well with applications written in C and C++, but they do not provide adequate support for garbage-collected applications. The performa...
186
Voted
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...