4966 search results - page 993 / 994 » its 2010 |
125
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
124
Voted
ECOOP
2010
Springer
15 years 6 months ago
2010
Springer
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
102
Voted
PODC
2010
ACM
15 years 5 months ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
125
Voted
COCO
2010
Springer
15 years 2 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
101
Voted
SIGCOMM
2010
ACM
15 years 1 months ago
2010
ACM
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...