Analysis of two simple heuristics on a random instance of k-SAT
Journal of Algorithms
Sudden emergence of a giant k-core in a random graph
Journal of Combinatorial Theory Series B
Amplification by Read-Once Formulas
SIAM Journal on Computing
Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Linear time erasure codes with nearly optimal recovery
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A linear time erasure-resilient code with nearly optimal recovery
IEEE Transactions on Information Theory - Part 1
Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Improved classification via connectivity information
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An introduction to low-density parity-check codes
Theoretical aspects of computer science
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Introduction to Low-Density Parity-Check Codes
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The pure literal rule threshold and cores in random hypergraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
RT oblivious erasure correcting
IEEE/ACM Transactions on Networking (TON)
Rateless distributed source code design
Proceedings of the 5th International ICST Mobile Multimedia Communications Conference
Expanding window fountain codes for unequal error protection
IEEE Transactions on Communications
Fountain code design for data multicast with side information
IEEE Transactions on Wireless Communications
Rateless codes with optimum intermediate performance
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Asymptotic analysis of UEP fountain codes over BIAWGN channels
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Decentralised distributed fountain coding: asymptotic analysis and design
IEEE Communications Letters
Rateless packet approach for data gathering wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Monotone circuits for the majority function
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Foundations and Trends in Communications and Information Theory
| Hi-index | 0.01 |