| Publication | Date of Publication | Type |
|---|
| On Optimal k-Deletion Correcting Codes | 2021-07-23 | Paper |
| On Coding Over Sliced Information | 2021-07-22 | Paper |
| Two Deletion Correcting Codes From Indicator Vectors | 2020-09-29 | Paper |
| Evolution of $k$ -Mer Frequencies and Entropy in Duplication and Substitution Mutation Systems | 2020-09-29 | Paper |
| The Entropy Rate of Some Pólya String Models | 2020-01-28 | Paper |
| On the Uncertainty of Information Retrieval in Associative Memories | 2019-07-19 | Paper |
| New techniques for constructing EC/AUED codes | 2018-09-14 | Paper |
| Partial-sum queries in OLAP data cubes using covering codes | 2018-07-09 | Paper |
| Capacity and Expressiveness of Genomic Tandem Duplication | 2018-06-27 | Paper |
| Duplication Distance to the Root for Binary Sequences | 2018-06-27 | Paper |
| Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms | 2017-10-19 | Paper |
| Network Coding: A Computational Perspective | 2017-08-08 | Paper |
| Shortening Array Codes and the Perfect $1$-Factorization Conjecture | 2017-08-08 | Paper |
| Cyclic Lowest Density MDS Array Codes | 2017-08-08 | Paper |
| Rank Modulation for Flash Memories | 2017-08-08 | Paper |
| Switch Codes: Codes for Fully Parallel Reconstruction | 2017-07-27 | Paper |
| Rewriting Codes for Joint Information Storage in Flash Memories | 2017-07-27 | Paper |
| Correcting Charge-Constrained Errors in the Rank-Modulation Scheme | 2017-07-27 | Paper |
| Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories | 2017-07-27 | Paper |
| On the Capacity of the Precision-Resolution System | 2017-07-27 | Paper |
| Efficient Generation of Random Bits From Finite State Markov Chains | 2017-07-12 | Paper |
| On the Capacity and Programming of Flash Memories | 2017-07-12 | Paper |
| Low-Complexity Array Codes for Random and Clustered 4-Erasures | 2017-07-12 | Paper |
| Constant-Weight Gray Codes for Local Rank Modulation | 2017-07-12 | Paper |
| Synthesis of Stochastic Flow Networks | 2017-06-20 | Paper |
| Nonuniform Codes for Correcting Asymmetric Errors in Data Storage | 2017-06-08 | Paper |
| On the Average Complexity of Reed–Solomon List Decoders | 2017-06-08 | Paper |
| Zigzag Codes: MDS Array Codes With Optimal Rebuilding | 2017-06-08 | Paper |
| Optimal Rebuilding of Multiple Erasures in MDS Codes | 2017-06-08 | Paper |
| Generalized Gray Codes for Local Rank Modulation | 2017-06-08 | Paper |
| Trajectory Codes for Flash Memory | 2017-06-08 | Paper |
| Access Versus Bandwidth in Codes for Storage | 2017-05-16 | Paper |
| Communication Efficient Secret Sharing | 2017-04-28 | Paper |
| Explicit Minimum Storage Regenerating Codes | 2017-04-28 | Paper |
| Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes | 2017-04-28 | Paper |
| Systematic Error-Correcting Codes for Permutations and Multi-Permutations | 2017-04-28 | Paper |
| Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels | 2017-04-28 | Paper |
| Bounds for Permutation Rate-Distortion | 2017-04-28 | Paper |
| The Capacity of String-Duplication Systems | 2017-04-28 | Paper |
| Codes Correcting Erasures and Deletions for Rank Modulation | 2017-04-28 | Paper |
| Rank-Modulation Rewrite Coding for Flash Memories | 2017-04-28 | Paper |
| Systematic Error-Correcting Codes for Rank Modulation | 2017-04-28 | Paper |
| Approximate sorting of data streams with limited storage | 2016-11-29 | Paper |
| Approximate Sorting of Data Streams with Limited Storage | 2014-09-26 | Paper |
| Distributed broadcasting and mapping protocols in directed anonymous networks | 2014-03-13 | Paper |
| Cyclic Boolean circuits | 2012-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081629 | 2011-03-09 | Paper |
| Interleaving schemes on circulant graphs with two offsets | 2009-12-10 | Paper |
| Computation with finite stochastic chemical reaction networks | 2009-11-04 | Paper |
| Constrained Codes as Networks of Relations | 2009-02-24 | Paper |
| Optimal Universal Schedules for Discrete Broadcast | 2009-02-24 | Paper |
| Multicluster Interleaving on Paths and Cycles | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3547208 | 2008-12-21 | Paper |
| Optimal Interleaving on Tori | 2007-11-16 | Paper |
| Continuum percolation with unreliable and spread-out connections | 2005-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665047 | 2005-04-09 | Paper |
| Algebraic Techniques for Constructing Minimal Weight Threshold Functions | 2004-01-08 | Paper |
| Covering algorithms, continuum percolation and the geometry of wireless networks | 2003-11-17 | Paper |
| EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures | 2003-10-14 | Paper |
| Splitting schedules for Internet broadcast communication | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228444 | 2002-01-20 | Paper |
| Coding for tolerance and detection of skew in parallel asynchronous communications | 2001-03-19 | Paper |
| Low-density MDS codes and factors of complete graphs | 2000-09-07 | Paper |
| MDS array codes for correcting a single criss-cross error | 2000-09-07 | Paper |
| Depth efficient neural networks for division and related problems | 2000-08-14 | Paper |
| X-code: MDS array codes with optimal encoding | 1999-11-21 | Paper |
| Efficient digital-to-analog encoding | 1999-11-21 | Paper |
| Interleaving schemes for multidimensional cluster errors | 1998-10-27 | Paper |
| Reflections on ``Representations of sets of Boolean functions by commutative rings by Roman Smolensky | 1998-02-11 | Paper |
| Fault-Tolerant Meshes with Small Degree | 1998-02-10 | Paper |
| Fault-tolerant cube graphs and coding theory | 1997-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4893414 | 1996-11-20 | Paper |
| MDS array codes with independent parity symbols | 1996-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4322842 | 1995-08-24 | Paper |
| Coding for delay-insensitive communication with partial synchronization | 1995-07-12 | Paper |
| The IBM external user interface for scalable parallel systems | 1995-01-29 | Paper |
| Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes | 1995-01-01 | Paper |
| Delay-insensitive pipelined communication on parallel buses | 1995-01-01 | Paper |
| On optimal broadcasting in faulty hypercubes | 1994-12-11 | Paper |
| Constructions of skew-tolerant and skew-detecting codes | 1994-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138924 | 1994-09-20 | Paper |
| Tolerating faults in a mesh with a row of spare nodes | 1994-07-21 | Paper |
| Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition | 1994-05-12 | Paper |
| Embedding cube-connected cycles graphs into faulty hypercubes | 1994-01-01 | Paper |
| Coding for skew-tolerant parallel asynchronous communications | 1993-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858427 | 1993-01-01 | Paper |
| Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms | 1992-06-28 | Paper |
| Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs | 1992-06-28 | Paper |
| On the Power of Threshold Circuits with Small Weights | 1992-06-26 | Paper |
| How to play bowling in parallel on the grid | 1991-01-01 | Paper |
| On the power of neural networks for solving hard problems | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033703 | 1990-01-01 | Paper |
| Harmonic Analysis of Polynomial Threshold Functions | 1990-01-01 | Paper |
| The hardness of decoding linear codes with preprocessing | 1990-01-01 | Paper |
| On the number of spurious memories in the Hopfield model (neural network) | 1990-01-01 | Paper |
| Decoding the Golay code with Venn diagrams | 1990-01-01 | Paper |
| A generalized convergence theorem for neural networks | 1989-01-01 | Paper |
| Neural networks, error-correcting codes, and polynomials over the binary n-cube | 1989-01-01 | Paper |
| A study on neural networks | 1988-01-01 | Paper |
