Interpolation between bases and the shuffle exchange network
From MaRDI portal
Publication:1114665
DOI10.1016/S0195-6698(89)80030-7zbMATH Open0662.94026OpenAlexW2048881478MaRDI QIDQ1114665FDOQ1114665
Authors: Michael Tarsi, Nathan Linial
Publication date: 1989
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(89)80030-7
Recommendations
- scientific article; zbMATH DE number 3930907
- On the rearrangeability of shuffle-exchange networks
- scientific article; zbMATH DE number 5252182
- scientific article; zbMATH DE number 4063007
- Network interpolation
- An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network
- A note on interpolating bases
- Binary shuffle bases for quasi-symmetric functions
- On the method of interchanging networks for permutation problems
Applications of graph theory to circuits and networks (94C15) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Title not available (Why is that?)
- Automorphisms of a Free Associative Algebra of Rank 2.I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Notes on Shuffle/Exchange-Type Switching Networks
- The Universality of the Shuffle-Exchange Network
- Parallel Processing with the Perfect Shuffle
- Title not available (Why is that?)
- Automorphisms of a Free Associative Algebra of Rank 2. II
- Ultracomputers
- The Frobenius number and partitions of a finite vector space
Cited In (3)
This page was built for publication: Interpolation between bases and the shuffle exchange network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114665)