Sidharth Jaggi
Computer Networks and Communications · 2005–2008
A researcher in the Science corpus: 2 papers; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 19 citations into it
- Electrical and Electronic Engineering — 11 citations into it
Whom Sidharth Jaggi trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Ralf Koetter
- T. Ho
- Muriel Médard
- Peter Sanders
- Ning Cai
- Frank R. Kschischang
- Michelle Effros
- Raymond W. Yeung
Who trusts Sidharth Jaggi overall
Papers from Sidharth Jaggi's perspective
Ordered by how strongly the researchers Sidharth Jaggi trusts endorse each paper. Same corpus, a different order for every researcher.
- Network information flow (IEEE Transactions on Information Theory)
- The benefits of coding over routing in a randomized setting (IEEE International Symposium on Information Theory. Proceedings)
- Polynomial time algorithms for network information flow (ACM Symposium on Parallelism in Algorithms and Architectures)
- Coding for Errors and Erasures in Random Network Coding (IEEE Transactions on Information Theory)
- An algebraic approach to network coding (Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252))
- Polynomial time algorithms for multicast network code construction (IEEE Transactions on Information Theory)
- Capacity of wireless erasure networks (IEEE Transactions on Information Theory)
- Full length article: On coding for reliable communication over packet networks
- Practical Byzantine fault tolerance
- Secure routing for mobile ad hoc networks (IEEE Communications Surveys and Tutorials)
Their papers
- Resilient Network Coding in the Presence of Byzantine Adversaries (2008) — 570 citations
- Polynomial time algorithms for multicast network code construction (2005) — 993 citations