Sciweavers

165 search results - page 1 / 33
» Fast Fibonacci Encoding Algorithm
Sort
View
DATESO
2010
286views Database» more  DATESO 2010»
13 years 2 months ago
Fast Fibonacci Encoding Algorithm
Abstract. Data compression has been widely applied in many data processing areas. Compression methods use variable-length codes with the shorter codes assigned to symbols or groups...
Jirí Walder, Michal Krátký, J...
IPL
2000
97views more  IPL 2000»
13 years 4 months ago
A fast algorithm for computing large Fibonacci numbers
We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci ...
Daisuke Takahashi
TALG
2008
100views more  TALG 2008»
13 years 4 months ago
Thin heaps, thick heaps
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
Haim Kaplan, Robert Endre Tarjan
DC
2010
13 years 5 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
STRINGOLOGY
2008
13 years 6 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter