Jehoshua Bruck

According to our database1, Jehoshua Bruck authored at least 288 papers between 1987 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

IEEE Fellow

IEEE Fellow 2001, "For contributions to the theory and practice of parallel, distributed and fault-tolerant computing.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
On the Uncertainty of Information Retrieval in Associative Memories.
IEEE Trans. Information Theory, 2019

Iterative Programming of Noisy Memory Cells.
CoRR, 2019

2018
Evolution of k-mer Frequencies and Entropy in Duplication and Substitution Mutation Systems.
CoRR, 2018

On Coding over Sliced Information.
CoRR, 2018

The Capacity of Some Pólya String Models.
CoRR, 2018

Two Deletion Correcting Codes from Indicator Vectors.
CoRR, 2018

Stash in a Flash.
Proceedings of the 11th ACM International Systems and Storage Conference, 2018

How to Best Share a Big Secret.
Proceedings of the 11th ACM International Systems and Storage Conference, 2018

Two Deletion Correcting Codes from Indicator Vectors.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Attaining the 2nd Chargaff Rule by Tandem Duplications.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Stash in a Flash.
Proceedings of the 16th USENIX Conference on File and Storage Technologies, 2018

2017
Optimal Rebuilding of Multiple Erasures in MDS Codes.
IEEE Trans. Information Theory, 2017

Switch Codes: Codes for Fully Parallel Reconstruction.
IEEE Trans. Information Theory, 2017

Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms.
IEEE Trans. Information Theory, 2017

Capacity and Expressiveness of Genomic Tandem Duplication.
IEEE Trans. Information Theory, 2017

Duplication Distance to the Root for Binary Sequences.
IEEE Trans. Information Theory, 2017

Generic Secure Repair for Distributed Storage.
CoRR, 2017

Correcting errors by natural redundancy.
Proceedings of the 2017 Information Theory and Applications Workshop, 2017

Noise and uncertainty in string-duplication systems.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Secret sharing with optimal decoding and repair bandwidth.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Secure RAID schemes from EVENODD and STAR codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Stopping set elimination for LDPC codes.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Constructions and Decoding of Cyclic Codes Over b-Symbol Read Channels.
IEEE Trans. Information Theory, 2016

Explicit Minimum Storage Regenerating Codes.
IEEE Trans. Information Theory, 2016

Communication Efficient Secret Sharing.
IEEE Trans. Information Theory, 2016

The Capacity of String-Duplication Systems.
IEEE Trans. Information Theory, 2016

Bounds for Permutation Rate-Distortion.
IEEE Trans. Information Theory, 2016

Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes.
IEEE Trans. Information Theory, 2016

Codes Correcting Erasures and Deletions for Rank Modulation.
IEEE Trans. Information Theory, 2016

Systematic Error-Correcting Codes for Permutations and Multi-Permutations.
IEEE Trans. Information Theory, 2016

Approximate sorting of data streams with limited storage.
J. Comb. Optim., 2016

Optimal Rebuilding of Multiple Erasures in MDS Codes.
CoRR, 2016

Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms.
CoRR, 2016

Duplication Distance to the Root for Binary Sequences.
CoRR, 2016

Duplication-correcting codes for data storage in the DNA of living organisms.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Secure RAID schemes for distributed storage.
Proceedings of the IEEE International Symposium on Information Theory, 2016

The capacity of some Pólya string models.
Proceedings of the IEEE International Symposium on Information Theory, 2016

On the duplication distance of binary strings.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Systematic Error-Correcting Codes for Rank Modulation.
IEEE Trans. Information Theory, 2015

Rank-Modulation Rewrite Coding for Flash Memories.
IEEE Trans. Information Theory, 2015

Algorithms for Generating Probabilities with Multivalued Stochastic Relay Circuits.
IEEE Trans. Computers, 2015

Capacity and Expressiveness of Genomic Tandem Duplication.
CoRR, 2015

Communication Efficient Secret Sharing.
CoRR, 2015

Rewriting Flash Memories by Message Passing.
CoRR, 2015

Reliability and hardware implementation of rank modulation flash memory.
Proceedings of the 2015 15th Non-Volatile Memory Technology Symposium (NVMTS), 2015

Error correction through language processing.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Is there a new way to correct errors.
Proceedings of the 2015 Information Theory and Applications Workshop, 2015

Capacity and expressiveness of genomic tandem duplication.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Rewriting flash memories by message passing.
Proceedings of the IEEE International Symposium on Information Theory, 2015

A stochastic model for genomic interspersed duplication.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Access Versus Bandwidth in Codes for Storage.
IEEE Trans. Information Theory, 2014

Synthesis of Stochastic Flow Networks.
IEEE Trans. Computers, 2014

Logic operations in memory using a memristive Akers array.
Microelectronics Journal, 2014

Guest Editorial Communication Methodologies for the Next-Generation Storage Systems.
IEEE Journal on Selected Areas in Communications, 2014

Explicit MDS Codes for Optimal Repair Bandwidth.
CoRR, 2014

Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes.
CoRR, 2014

The Capacity of String-Replication Systems.
CoRR, 2014

Rate-Distortion for Ranking with Incomplete Information.
CoRR, 2014

Error correction and partial information rewriting for flash memories.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Polar coding for noisy write-once memories.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Single-deletion-correcting codes over permutations.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Codes correcting erasures and deletions for rank modulation.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The capacity of string-duplication systems.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Bounds for permutation rate-distortion.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Systematic codes for rank modulation.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Approximate Sorting of Data Streams with Limited Storage.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
Nonuniform Codes for Correcting Asymmetric Errors in Data Storage.
IEEE Trans. Information Theory, 2013

Zigzag Codes: MDS Array Codes With Optimal Rebuilding.
IEEE Trans. Information Theory, 2013

Trajectory Codes for Flash Memory.
IEEE Trans. Information Theory, 2013

Generalized Gray Codes for Local Rank Modulation.
IEEE Trans. Information Theory, 2013

On the Average Complexity of Reed-Solomon List Decoders.
IEEE Trans. Information Theory, 2013

Access vs. Bandwidth in Codes for Storage
CoRR, 2013

Systematic Error-Correcting Codes for Rank Modulation.
CoRR, 2013

Rank-Modulation Rewrite Coding for Flash Memories.
CoRR, 2013

Systematic Codes for Rank Modulation.
CoRR, 2013

Error correcting code for flash memories.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Sequence reconstruction for Grassmann graphs and permutations.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Information-theoretic study of voting systems.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

In-memory computing of Akers logic array.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Codes for network switches.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Joint rewriting and error correction in write-once memories.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Building consensus via iterative voting.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Rank-modulation rewriting codes for flash memories.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Error-correcting codes for multipermutations.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Efficient Generation of Random Bits From Finite State Markov Chains.
IEEE Trans. Information Theory, 2012

On the Capacity and Programming of Flash Memories.
IEEE Trans. Information Theory, 2012

Low-Complexity Array Codes for Random and Clustered 4-Erasures.
IEEE Trans. Information Theory, 2012

Cyclic Boolean circuits.
Discrete Applied Mathematics, 2012

Balanced Modulation for Nonvolatile Memories
CoRR, 2012

Nonuniform Codes for Correcting Asymmetric Errors in Data Storage
CoRR, 2012

Efficiently Extracting Randomness from Imperfect Stochastic Processes
CoRR, 2012

Linear Transformations for Randomness Extraction
CoRR, 2012

Streaming Algorithms for Optimal Generation of Random Bits
CoRR, 2012

A Universal Scheme for Transforming Binary Algorithms to Generate Random Bits from Loaded Dice
CoRR, 2012

Synthesis of Stochastic Flow Networks
CoRR, 2012

The Synthesis and Analysis of Stochastic Switching Circuits
CoRR, 2012

Bit-fixing codes for multi-level cells.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Systematic error-correcting codes for rank modulation.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Variable-length extractors.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Decoding of cyclic codes over symbol-pair read channels.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On the uncertainty of information retrieval in associative memories.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Long MDS codes for optimal repair bandwidth.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Access vs. bandwidth in codes for storage.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Modeling biological circuits with urn functions.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Trade-offs between instantaneous and total capacity in multi-cell flash memories.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Content-assisted file decoding for nonvolatile memories.
Proceedings of the Conference Record of the Forty Sixth Asilomar Conference on Signals, 2012

2011
Constant-Weight Gray Codes for Local Rank Modulation.
IEEE Trans. Information Theory, 2011

Transforming Probabilities With Combinational Logic.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2011

Neural network computation with DNA strand displacement cascades.
Nature, 2011

Zigzag Codes: MDS Array Codes with Optimal Rebuilding
CoRR, 2011

Compressed Encoding for Rank Modulation
CoRR, 2011

On Codes for Optimal Rebuilding Access
CoRR, 2011

MDS Array Codes with Optimal Rebuilding
CoRR, 2011

Generalized Gray Codes for Local Rank Modulation
CoRR, 2011

Generating Probability Distributions using Multivalued Stochastic Relay Circuits
CoRR, 2011

Maximizing the storage capacity of nonvolatile memories.
Proceedings of the Information Theory and Applications Workshop, 2011

Error-correcting schemes with dynamic thresholds in nonvolatile memories.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Nonuniform codes for correcting asymmetric errors.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Linear extractors for extracting randomness from noisy sources.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

MDS array codes with optimal rebuilding.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Generating probability distributions using multivalued stochastic relay circuits.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Patterned cells for phase change memories.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Variable-level cells for nonvolatile memories.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Generalized Gray codes for local rank modulation.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Compressed encoding for rank modulation.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On codes for optimal rebuilding access.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
On the capacity of the precision-resolution system.
IEEE Trans. Information Theory, 2010

Correcting charge-constrained errors in the rank-modulation scheme.
IEEE Trans. Information Theory, 2010

Storage coding for wear leveling in flash memories.
IEEE Trans. Information Theory, 2010

Rewriting codes for joint information storage in flash memories.
IEEE Trans. Information Theory, 2010

Codes for asymmetric limited-magnitude errors with application to multilevel flash memories.
IEEE Trans. Information Theory, 2010

Trajectory Codes for Flash Memory
CoRR, 2010

Efficient Generation of Random Bits from Finite State Markov Chains
CoRR, 2010

Rebuilding for Array Codes in Distributed Storage Systems
CoRR, 2010

Constrained codes for phase-change memories.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

On the synthesis of stochastic flow networks.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Generalizing the Blum-Elias method for generating random bits from Markov chains.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Partial rank modulation for flash memories.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Data movement and aggregation in flash memories.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Localization and routing in sensor networks by local angle information.
TOSN, 2009

Network Coding: A Computational Perspective.
IEEE Trans. Information Theory, 2009

Rank modulation for flash memories.
IEEE Trans. Information Theory, 2009

Cyclic Lowest Density MDS Array Codes.
IEEE Trans. Information Theory, 2009

Shortening Array Codes and the Perfect 1-Factorization Conjecture.
IEEE Trans. Information Theory, 2009

Interleaving schemes on circulant graphs with two offsets.
Discrete Mathematics, 2009

Storage Coding for Wear Leveling in Flash Memories
CoRR, 2009

On the expressibility of stochastic switching circuits.
Proceedings of the IEEE International Symposium on Information Theory, 2009

The robustness of stochastic switching networks.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Universal rewriting in constrained memories.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Storage coding for wear leveling in flash memories.
Proceedings of the IEEE International Symposium on Information Theory, 2009

On the capacity of bounded rank modulation for flash memories.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Constrained Codes as Networks of Relations.
IEEE Trans. Information Theory, 2008

Optimal Universal Schedules for Discrete Broadcast.
IEEE Trans. Information Theory, 2008

Computation with finite stochastic chemical reaction networks.
Natural Computing, 2008

Stochastic switching circuit synthesis.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Error-correcting codes for rank modulation.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Rank modulation for flash memories.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Joint coding for flash memory storage.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Array codes for clustered column erasures.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
MAP: Medial axis based geometric routing in sensor networks.
Wireless Networks, 2007

Distributed broadcasting and mapping protocols in directed anonymous networks.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Floating Codes for Joint Information Storage in Write Asymmetric Memories.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Codes for Multi-Level Flash Memories: Correcting Asymmetric Limited-Magnitude Errors.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Buffer Coding for Asymmetric Multi-Level Memory.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Constrained Codes as Networks of Relations.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Synthesizing Stochasticity in Biochemical Systems.
Proceedings of the 44th Design Automation Conference, 2007

2006
The encoding complexity of network coding.
IEEE Trans. Information Theory, 2006

Optimal Interleaving on Tori.
SIAM J. Discrete Math., 2006

Anti-Jamming Schedules for Wireless Data Broadcast Systems.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Cyclic Low-Density MDS Array Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Weighted Bloom filter.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Shortening Array Codes and the Perfect 1-Factorization Conjecture.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On the Capacity of Precision-Resolution Constrained Systems.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Network file storage with graceful performance degradation.
TOS, 2005

Multicluster interleaving on paths and cycles.
IEEE Trans. Information Theory, 2005

Localization and routing in sensor networks by local angle information.
Proceedings of the 6th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2005

MAP: medial axis based geometric routing in sensor networks.
Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, 2005

Staleness vs. waiting time in universal discrete broadcast.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

The encoding complexity of network coding.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Network coding for non-uniform demands.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Monotone percolation and the topology control of wireless networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004
A Geometric Theorem for Network Design.
IEEE Trans. Computers, 2004

Optimal universal schedules for discrete broadcast.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Optimal t-interleaving on tori.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Scheduling for efficient data broadcast over two channels.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Miscorrection probability beyond the minimum distance.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Optimal Content Placement for En-Route Web Caching.
Proceedings of the 2nd IEEE International Symposium on Network Computing and Applications (NCA 2003), 2003

The synthesis of cyclic combinational circuits.
Proceedings of the 40th Design Automation Conference, 2003

Bridging Paradigm Gaps Between Biology and Engineering.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002
Splitting schedules for internet broadcast communication.
IEEE Trans. Information Theory, 2002

Algebraic Techniques for Constructing Minimal Weight Threshold Functions.
SIAM J. Discrete Math., 2002

2001
A Group Membership Algorithm with a Practical Specification.
IEEE Trans. Parallel Distrib. Syst., 2001

Computing in the RAIN: A Reliable Array of Independent Nodes.
IEEE Trans. Parallel Distrib. Syst., 2001

Introduction to the Special Section on Dependable Network Computing.
IEEE Trans. Parallel Distrib. Syst., 2001

The Raincore API for Clusters of Networking Elements.
IEEE Internet Computing, 2001

The Raincore Distributed Session Service for Networking Elements.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

2000
Coding for tolerance and detection of skew in parallel asynchronous communications.
IEEE Trans. Information Theory, 2000

MDS array codes for correcting a single criss-cross error.
IEEE Trans. Information Theory, 2000

Tolerating Multiple Faults in Multistage Interconnection Networks with Minimal Extra Stages.
IEEE Trans. Computers, 2000

Computing in the RAIN: A Reliable Array of Independent Nodes.
Proceedings of the Parallel and Distributed Processing, 2000

1999
Low-density MDS codes and factors of complete graphs.
IEEE Trans. Information Theory, 1999

X-Code: MDS Array Codes with Optimal Encoding.
IEEE Trans. Information Theory, 1999

Efficient digital-to-analog encoding.
IEEE Trans. Information Theory, 1999

A Consistent History Link Connectivity Protocol.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

1998
Deterministic Voting in Distributed Systems Using Error-Correcting Codes.
IEEE Trans. Parallel Distrib. Syst., 1998

Interleaving Schemes for Multidimensional Cluster Errors.
IEEE Trans. Information Theory, 1998

Analysis of Checkpointing Schemes with Task Duplication.
IEEE Trans. Computers, 1998

Partial-Sum Queries in OLAP Data Cubes Using Covering Codes.
IEEE Trans. Computers, 1998

A Coding Approach for Detection of Tampering in Write-Once Optical Disks.
IEEE Trans. Computers, 1998

Highly Available Distributed Storage Systems.
Proceedings of the Workshop on Wide Area Networks and High Performance Computing, 1998

A Consistent History Link Connectivity Protocol.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Fault-Tolerant Switched Local Area Networks.
IPPS/SPDP, 1998

1997
Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems.
IEEE Trans. Parallel Distrib. Syst., 1997

Performance Optimization of Checkpointing Schemes with Task Duplication.
IEEE Trans. Computers, 1997

An On-Line Algorithm for Checkpoint Placement.
IEEE Trans. Computers, 1997

Fault-Tolerant Meshes with Small Degree.
SIAM J. Comput., 1997

Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations.
J. Parallel Distrib. Comput., 1997

Reflections on "Representations of Sets of Boolean Functions by Commutative Rings" by Roman Smolensky.
Computational Complexity, 1997

Partial-Sum Queries in Data Cubes Using Covering Codes.
Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1997

Multiple Threshold Neural Logic.
Proceedings of the Advances in Neural Information Processing Systems 10, 1997

1996
On the Design and Implementation of Broadcast and Global Combine Operations Using the Postal Model.
IEEE Trans. Parallel Distrib. Syst., 1996

Fault-tolerant cube graphs and coding theory.
IEEE Trans. Information Theory, 1996

MDS array codes with independent parity symbols.
IEEE Trans. Information Theory, 1996

Efficient Digital to Analog Encoding
Electronic Colloquium on Computational Complexity (ECCC), 1996

On Neural Networks with Minimal Weights
Electronic Colloquium on Computational Complexity (ECCC), 1996

On optimal placements of processors in tori networks.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

An on-line algorithm for checkpoint placement.
Proceedings of the Seventh International Symposium on Software Reliability Engineering, 1996

1995
Computing Global Combine Operations in the Multiport Postal Model.
IEEE Trans. Parallel Distrib. Syst., 1995

CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers.
IEEE Trans. Parallel Distrib. Syst., 1995

Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes.
IEEE Trans. Computers, 1995

EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures.
IEEE Trans. Computers, 1995

Delay-Insensitive Pipelined Communicatioon on Parallel Buses.
IEEE Trans. Computers, 1995

On the Construction of Fault-Tolerant Cube-Connected Cycles Networks.
J. Parallel Distrib. Comput., 1995

Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations.
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

On Neural Networks with Minimal Weights.
Proceedings of the Advances in Neural Information Processing Systems 8, 1995

PCODE: an efficient and reliable collective communication protocol for unreliable broadcast domain.
Proceedings of IPPS '95, 1995

1994
Fault-Tolerant de Bruijn and Shuffle-Exchange Networks.
IEEE Trans. Parallel Distrib. Syst., 1994

Coding for delay-insensitive communication with partial synchronization.
IEEE Trans. Information Theory, 1994

Tolerating Faults in a Mesh with a Row of Spare Nodes.
Theor. Comput. Sci., 1994

Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes.
IEEE Trans. Computers, 1994

A Note on "A Systematic (12, 8) Code for Correcting Single Errors and Detecting Adjacent Errors".
IEEE Trans. Computers, 1994

Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition.
SIAM J. Discrete Math., 1994

The IBM External User Interface for Scalable Parallel Systems.
Parallel Computing, 1994

On optimal broadcasting in faulty hypercubes.
Discrete Applied Mathematics, 1994

Analysis of Checkpointing Schemes for Multiprocessor Systems.
Proceedings of the 13th Symposium on Reliable Distributed Systems, 1994

On the design and implementation of broadcast and global combine operations using the postal model.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems.
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

PCODE: Efficient Parallel Computing over Distributed Environments.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

EVENODD: An Optimal Scheme for Tolerating Double Disk Failures in RAID Architectures.
Proceedings of the 21st Annual International Symposium on Computer Architecture. Chicago, 1994

CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers.
Proceedings of the 8th International Symposium on Parallel Processing, 1994

1993
Depth efficient neural networks for division and related problems.
IEEE Trans. Information Theory, 1993

Constructions of skew-tolerant and skew-detecting codes.
IEEE Trans. Information Theory, 1993

Coding for skew-tolerant parallel asynchronous communications.
IEEE Trans. Information Theory, 1993

Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares.
IEEE Trans. Computers, 1993

Efficient Global Combine Operations in Multi-Port Message-Passing Systems.
Parallel Processing Letters, 1993

Computing Global Combine Operations in the Multi-Port Postal Model.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Fault-Tolerant Meshes with Small Degree.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hybercubes.
Proceedings of the Digest of Papers: FTCS-23, 1993

1992
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs.
IEEE Trans. Information Theory, 1992

Tolerating Faults in Hypercubes Using Subcube Partitioning.
IEEE Trans. Computers, 1992

New Techniques for Constructing EC/AUED Codes.
IEEE Trans. Computers, 1992

Polynomial Threshold Functions, AC^0 Functions, and Spectral Norms.
SIAM J. Comput., 1992

Multiple Message Broadcasting wiht Generalized Fibonacci Trees.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Tolerating Faults in a Mesh with a Row of Spare Nodes.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Fault-Tolerant de Bruijn and Shuffle-Exchange Networks.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

Efficient Fault-Tolerant Mesh and Hypercube Architectures.
Proceedings of the Digest of Papers: FTCS-22, 1992

Unordered Error-Correcting Codes and their Applications.
Proceedings of the Digest of Papers: FTCS-22, 1992

Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Running algorithms efficiently on faulty hypercubes (extended abstract).
SIGARCH Computer Architecture News, 1991

On the Power of Threshold Circuits with Small Weights.
SIAM J. Discrete Math., 1991

How to Play Bowling in Parallel on the Grid.
J. Algorithms, 1991

Fault-tolerant meshes with minimal numbers of spares.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Neural Computing with Small Weights.
Proceedings of the Advances in Neural Information Processing Systems 4, 1991

On the Construction of Fault-Tolerant Cube-Connected Cycles Networks.
Proceedings of the International Conference on Parallel Processing, 1991

1990
On the number of spurious memories in the Hopfield model.
IEEE Trans. Information Theory, 1990

The hardness of decoding linear codes with preprocessing.
IEEE Trans. Information Theory, 1990

Decoding the Golay code with Venn diagrams.
IEEE Trans. Information Theory, 1990

Efficient Algorithms for Reconfiguration in VLSI/WSI Arrays.
IEEE Trans. Computers, 1990

Harmonic Analysis of Polynomial Threshold Functions.
SIAM J. Discrete Math., 1990

On the power of neural networks for solving hard problems.
J. Complexity, 1990

Running Algorithms Efficiently on Faulty Hypercubes.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

On Finding Non-Intersecting Paths in Grids and Its Application in Reconfiguring VLSI/WSI Arrays.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Polynomial Threshold Functions, AC^0 Functions and Spectral Norms (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Neural networks, error-correcting codes, and polynomials over the binary n -cube.
IEEE Trans. Information Theory, 1989

Some new EC/AUED codes.
Proceedings of the Nineteenth International Symposium on Fault-Tolerant Computing, 1989

1988
A generalized convergence theorem for neural networks.
IEEE Trans. Information Theory, 1988

A study on neural networks.
Int. J. Intell. Syst., 1988

1987
On the Power of Neural Networks for Solving Hard Problems.
Proceedings of the Neural Information Processing Systems, Denver, Colorado, USA, 1987, 1987


  Loading...