Sciweavers

    IPL
    2000
    77views more  IPL 2000»
    Efficient loopless generation of Gray codes for k-ary trees
    13 years 10 months ago
    Efficient loopless generation of Gray codes for k-ary trees
    Download  teacher.scu.edu.cn
    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
    claim paper
    Read More »
    IPL
    2000
    119views more  IPL 2000»
    Cyclic-cubes and wrap-around butterflies
    13 years 10 months ago
    Cyclic-cubes and wrap-around butterflies
    Download  www.lehigh.edu
    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
    claim paper
    Read More »
    IPL
    2000
    97views more  IPL 2000»
    A fast algorithm for computing large Fibonacci numbers
    13 years 10 months ago
    A fast algorithm for computing large Fibonacci numbers
    Download  www.ii.uni.wroc.pl
    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
    claim paper
    Read More »
    IPL
    2000
    78views more  IPL 2000»
    Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
    13 years 10 months ago
    Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
    Download  www.cs.rochester.edu
    Daniel Stefankovic
    claim paper
    Read More »
    IPL
    2000
    98views more  IPL 2000»
    Linear complexity of the Naor-Reingold pseudo-random function
    13 years 10 months ago
    Linear complexity of the Naor-Reingold pseudo-random function
    Download  www.math.missouri.edu
    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
    claim paper
    Read More »
    IPL
    2000
    53views more  IPL 2000»
    On the security of a convertible group signature scheme
    13 years 10 months ago
    On the security of a convertible group signature scheme
    Download  www.islab.iecs.fcu.edu.tw
    Shahrokh Saeednia
    claim paper
    Read More »
    IPL
    2000
    95views more  IPL 2000»
    An efficient upper bound of the rotation distance of binary trees
    13 years 10 months ago
    An efficient upper bound of the rotation distance of binary trees
    Download  www.cs.cmu.edu
    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
    claim paper
    Read More »
    IPL
    2000
    111views more  IPL 2000»
    On the performance of the first-fit coloring algorithm on permutation graphs
    13 years 10 months ago
    On the performance of the first-fit coloring algorithm on permutation graphs
    Download  www.ii.uib.no
    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
    claim paper
    Read More »
    IPL
    2000
    94views more  IPL 2000»
    On rewrite constraints and context unification
    13 years 10 months ago
    On rewrite constraints and context unification
    Download  www.ps.uni-saarland.de
    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
    claim paper
    Read More »
    IPL
    2000
    92views more  IPL 2000»
    A general method to speed up fixed-parameter-tractable algorithms
    13 years 10 months ago
    A general method to speed up fixed-parameter-tractable algorithms
    Download  faculty.cs.tamu.edu
    Rolf Niedermeier, Peter Rossmanith
    claim paper
    Read More »
    123next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.