10988 search results - page 199 / 2198 » Algorithmic Folding Complexity |
230
Voted
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
104
Voted
AIIA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Complex networks like the scale-free model proposed by BarabasiAlbert are observed in many biological systems and the application of this topology to artificial neural ne...
136
click to vote
COCO
2003
Springer
15 years 8 months ago
2003
Springer
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
134
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
120
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...