On the Number of Stable States in a NOR Network
From MaRDI portal
Publication:5517249
DOI10.1109/PGEC.1965.264092zbMath0142.12903OpenAlexW1996517398MaRDI QIDQ5517249
Publication date: 1965
Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/pgec.1965.264092
Related Items
A parallel algorithm for the generation of a permutation and applications ⋮ Bounds on the size of merging networks ⋮ Solving visibility problems on MCCs of smaller size ⋮ A note on Gray code and odd-even merge ⋮ An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits ⋮ On the multisearching problem for hypercubes ⋮ Parametric search made practical ⋮ The queue-read queue-write asynchronous PRAM model ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ Parallel \(N\)-free order recognition ⋮ Bounds on the size of test sets for sorting and related networks ⋮ A sorting network in bounded arithmetic ⋮ Trends in systolic and cellular computation ⋮ Communication primitives for BSP computers ⋮ An efficient counting network ⋮ Optimal conclusive sets for comparator networks ⋮ A phenomenon in the theory of sorting ⋮ Timing conditions for linearizability in uniform counting networks ⋮ A note on constructing binary heaps with periodic networks. ⋮ k-fold bitonic sort on a mesh-connected parallel computer ⋮ Deterministic sorting in nearly logarithmic time on the hypercube and related computers
