986 search results - page 27 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
168
click to vote
ICDCS
1995
IEEE
15 years 7 months ago
1995
IEEE
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
150
Voted
COCO
1999
Springer
15 years 8 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
126
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input po...
165
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
146
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...