Sciweavers

171 search results - page 1 / 35
» Finger trees: a simple general-purpose data structure
Sort
View
JFP
2006
67views more  JFP 2006»
13 years 4 months ago
Finger trees: a simple general-purpose data structure
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...
Ralf Hinze, Ross Paterson
POPL
2008
ACM
14 years 5 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
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...
Nils Anders Danielsson
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
13 years 6 months ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal
CPM
2009
Springer
128views Combinatorics» more  CPM 2009»
13 years 8 months ago
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan ...
JEI
2008
109views more  JEI 2008»
13 years 3 months ago
New approach for liveness detection in fingerprint scanners based on valley noise analysis
Recent research has shown that it is possible to spoof a variety of fingerprint scanners using some simple techniques with molds made from plastic, clay, Play-Doh, silicon, or gela...
Bozhao Tan, Stephanie A. C. Schuckers