583 search results - page 47 / 117 » Finding Answers to Complex Questions |
111
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
DAGSTUHL
2006
15 years 4 months ago
2006
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...
128
click to vote
TCC
2009
Springer
16 years 3 months ago
2009
Springer
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
132
click to vote
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
127
click to vote
VLDB
1999
ACM
15 years 6 months ago
1999
ACM
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...