3208 search results - page 216 / 642 » A Lower Bound for Primality |
186
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
152
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
141
click to vote
COMPGEOM
2006
ACM
16 years 16 days ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
171
click to vote
ISORC
2005
IEEE
16 years 5 days ago
2005
IEEE
Heuristic algorithms have enjoyed increasing interests and success in the context of Utility Accrual (UA) scheduling. However, few analytical results, such as bounds on task-level...
172
click to vote
SOFSEM
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...