The asymptotic complexity of merging networks (original) (raw)
Related papers
Theory of Computing Systems, 1998
A nonlinear lower bound on the practical combinational complexity
Theoretical Computer Science, 1995
Better understanding of batcher's merging networks
Discrete Applied Mathematics, 1989
Theory of Computing Systems, 1990
On a Simple and Stable Merging Algorithm
Journal of Korean Institute of Intelligent Systems, 2010
New upper bounds on the Boolean circuit complexity of symmetric functions
A. Kojevnikov, E. Demenkov, G. Yaroslavtsev
Information Processing Letters, 2010
On the Computational Complexity of Optimal Sorting Network Verification
PARLE'91 Parallel Architectures and Languages …, 1991
Improving bitonic sorting by wire elimination
Lower bounds of the negation-limited circuit complexity
1997
Notes on the Complexity of Switching Networks
Network Theory and Applications, 2001
Synchronizing Boolean Networks Asynchronously
SSRN Electronic Journal
Succinct and explicit circuits for sorting and connectivity
Fast self-routing permutation switching on an asymptotically minimum cost network
IEEE Transactions on Computers, 1993
Theory of wire addition and removal in combinational Boolean networks
Microelectronic Engineering, 2007
Dagstuhl Seminar on The Complexity of Boolean Functions
Beyond 0-1: The 1-N Principle and Fast Validation of N-Sorter Sorting Networks
IEEE Access
The Takeoff Towards Optimal Sorting Networks
2015
An exponential gap with the removal of one negation gate
Information Processing Letters, 2002
On Circuit Functionality in Boolean Networks
Bulletin of Mathematical Biology, 2013
Fixing monotone Boolean networks asynchronously
Information and Computation, 2020
Efficient algorithms for merging
BIT, 1983
New algorithms and lower bounds for circuits with linear threshold gates
Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014
Lower bound frontiers in arithmetical circuit complexity
2006
On Computing Structural and Behavioral Complexities of Threshold Boolean Networks
Acta Biotheoretica
The size and depth of layered Boolean circuits
Information Processing Letters, 2011
Design of High-Speed Multiway Merge Sorting Networks Using Fast Single-Stage N-Sorters and N-Filters
Efficient decomposition of comparison and its applications
1993
A survey of perceptron circuit complexity results
Proceedings of the International Joint Conference on Neural Networks, 2003., 2003
Theoretical Computer Science, 1991
A logarithmic time sort for linear size networks
Journal of the ACM, 1987
Winner-take-all networks of O (n) complexity
1988
On the complexity of planar Boolean circuits
Computational Complexity, 1995
Stability of Linear Boolean Networks
Cornell University - arXiv, 2022
A method for evaluating upper bound of simultaneous switching gates using circuit partition
… of the ASP-DAC'99. Asia …, 1999
Optimized arbitrary size networks
Proceedings. 2004 International Conference on Information and Communication Technologies: From Theory to Applications, 2004., 2004