33 search results - page 1 / 7 » Lightweight semiformal time complexity analysis for purely f... |
POPL
2008
ACM
14 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...
ICS
2005
Tsinghua U.
13 years 10 months ago
2005
Tsinghua U.
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...
TCS
2010
13 years 2 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
ICCD
2003
IEEE
14 years 1 months ago
2003
IEEE
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
BMCBI
2005
13 years 4 months ago
2005
Background: The identification of local similarities between two protein structures can provide clues of a common function. Many different methods exist for searching for similar ...