Sciweavers

IPL
2000
77views more  IPL 2000»
13 years 11 months ago
Efficient loopless generation of Gray codes for k-ary trees
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
Limin Xiang, Kazuo Ushijima, Changjie Tang
IPL
2000
119views more  IPL 2000»
13 years 11 months ago
Cyclic-cubes and wrap-around butterflies
Recently a new family of Cayley graphs of fixed even node degree called the Cyclic-cubes were proposed as interconnection networks by Fu and Chau (1998). We show that these networ...
Meghanad D. Wagh, Prakash Math, Osman Guzide
IPL
2000
97views more  IPL 2000»
13 years 11 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
IPL
2000
98views more  IPL 2000»
13 years 11 months ago
Linear complexity of the Naor-Reingold pseudo-random function
We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of t...
Igor Shparlinski
IPL
2000
95views more  IPL 2000»
13 years 11 months ago
An efficient upper bound of the rotation distance of binary trees
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
Jean Marcel Pallo
IPL
2000
111views more  IPL 2000»
13 years 11 months ago
On the performance of the first-fit coloring algorithm on permutation graphs
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
Stavros D. Nikolopoulos, Charis Papadopoulos
IPL
2000
94views more  IPL 2000»
13 years 11 months ago
On rewrite constraints and context unification
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
Joachim Niehren, Sophie Tison, Ralf Treinen
IPL
2000
92views more  IPL 2000»
13 years 11 months ago
A general method to speed up fixed-parameter-tractable algorithms
Rolf Niedermeier, Peter Rossmanith