Sciweavers

2252 search results - page 12 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
TOC
2008
94views more  TOC 2008»
13 years 7 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
IPPS
1999
IEEE
13 years 12 months ago
Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
Hettihe P. Dharmasena, Ramachandran Vaidyanathan
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
WADS
1997
Springer
93views Algorithms» more  WADS 1997»
13 years 11 months ago
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds
Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro
WADS
1993
Springer
87views Algorithms» more  WADS 1993»
13 years 11 months ago
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms
Lars Arge, Mikael Knudsen, Kirsten Larsen