1132 search results - page 129 / 227 » Structural Average Case Complexity |
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
DAC
2003
ACM
14 years 10 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
COMAD
2008
13 years 10 months ago
2008
In designing and developing large complex products, people use models to describe and organize interrelated elements in both product systems (architecture, use cases, constraints....
JCC
2008
13 years 7 months ago
2008
: The prediction of the binding free energy between a ligand and a protein is an important component in the virtual screening and lead optimization of ligands for drug discovery. T...