The following pages link to Jehoshua Bruck (Q346498):
Displayed 50 items.
- Approximate sorting of data streams with limited storage (Q346499) (← links)
- Cyclic Boolean circuits (Q442202) (← links)
- On the power of neural networks for solving hard problems (Q909457) (← links)
- Computation with finite stochastic chemical reaction networks (Q1035715) (← links)
- Interleaving schemes on circulant graphs with two offsets (Q1043964) (← links)
- The IBM external user interface for scalable parallel systems (Q1325921) (← links)
- Tolerating faults in a mesh with a row of spare nodes (Q1330431) (← links)
- On optimal broadcasting in faulty hypercubes (Q1339875) (← links)
- Reflections on ``Representations of sets of Boolean functions by commutative rings'' by Roman Smolensky (Q1377573) (← links)
- Covering algorithms, continuum percolation and the geometry of wireless networks (Q1413688) (← links)
- Continuum percolation with unreliable and spread-out connections (Q1777943) (← links)
- Coding for tolerance and detection of skew in parallel asynchronous communications (Q2705964) (← links)
- Approximate Sorting of Data Streams with Limited Storage (Q2920482) (← links)
- Communication Efficient Secret Sharing (Q2976440) (← links)
- Explicit Minimum Storage Regenerating Codes (Q2976661) (← links)
- Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes (Q2976709) (← links)
- Systematic Error-Correcting Codes for Permutations and Multi-Permutations (Q2976760) (← links)
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels (Q2976878) (← links)
- Bounds for Permutation Rate-Distortion (Q2976994) (← links)
- The Capacity of String-Duplication Systems (Q2977005) (← links)
- Codes Correcting Erasures and Deletions for Rank Modulation (Q2977041) (← links)
- Rank-Modulation Rewrite Coding for Flash Memories (Q2977326) (← links)
- Systematic Error-Correcting Codes for Rank Modulation (Q2978800) (← links)
- Access Versus Bandwidth in Codes for Storage (Q2986427) (← links)
- Nonuniform Codes for Correcting Asymmetric Errors in Data Storage (Q2989266) (← links)
- On the Average Complexity of Reed–Solomon List Decoders (Q2989321) (← links)
- Zigzag Codes: MDS Array Codes With Optimal Rebuilding (Q2989370) (← links)
- Optimal Rebuilding of Multiple Erasures in MDS Codes (Q2989643) (← links)
- (Q3033703) (← links)
- (Q3081629) (← links)
- (Q3138924) (← links)
- Harmonic Analysis of Polynomial Threshold Functions (Q3472059) (← links)
- The hardness of decoding linear codes with preprocessing (Q3484767) (← links)
- On the number of spurious memories in the Hopfield model (neural network) (Q3484776) (← links)
- Decoding the Golay code with Venn diagrams (Q3489943) (← links)
- Multicluster Interleaving on Paths and Cycles (Q3547071) (← links)
- (Q3547208) (← links)
- Constrained Codes as Networks of Relations (Q3604424) (← links)
- Optimal Universal Schedules for Discrete Broadcast (Q3604826) (← links)
- A study on neural networks (Q3794086) (← links)
- A generalized convergence theorem for neural networks (Q3818997) (← links)
- On the Power of Threshold Circuits with Small Weights (Q3979443) (← links)
- Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms (Q3990097) (← links)
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs (Q3990791) (← links)
- Coding for skew-tolerant parallel asynchronous communications (Q4202056) (← links)
- (Q4228444) (← links)
- Depth efficient neural networks for division and related problems (Q4277152) (← links)
- Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition (Q4287934) (← links)
- Constructions of skew-tolerant and skew-detecting codes (Q4307402) (← links)
- (Q4322842) (← links)