<my first name>91089<at>gmail<dot>com Bossone 604, 3100 Market Street, Philadelphia PA About Me: I am pursuing PhD at Drexel University under Dr. John Walsh. I am part of Adaptive Signal Processing and Information Theory Research Group (ASPITRG). I obtained my undergraduate degree in Electronics and Telecommunication Engineering from Mumbai University, India. My research interests lie in the intersection of Information Theory, Algorithms and Combinatorics. I am also interested in efficient and parallel implementations of algorithms. I am working on Characterization of Region of Entropic Vectors and Computation of rate regions for multi-source network coding which are ASPITRG projects supported very graciously by NSF under CCF-1421828, CCF-1016588 and CCF-1053702. Computation is the main tool I use to develop intuition about theoretical statements. I develop a lot of Software in C, C++, OpenMP, MPI, Python, Cython, MATLAB/Octave and more recently in GAP. My relatively latest resume can be found here.
[0] Jayant Apte, John MacLaren Walsh, "Explicit Polyhedral Bounds on Network Coding Rate Regions via Entropy Function Region: Algorithms, Symmetry, and Computation", [1] Jayant Apte, John MacLaren Walsh, "Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding ", [2] Apte, Jayant, Qi Chen, and John MacLaren Walsh. "Symmetries in the entropy space." In Information Theory Workshop (ITW), 2016 IEEE, pp. 51-55. IEEE, 2016. [3] Jayant Apte, John MacLaren Walsh, “Symmetry in Network Coding”, [4] Jayant Apte, John MacLaren Walsh, "Exploiting Symmetry in Computing Polyhedral Bounds on Network Coding Rate Regions", [5] Jayant Apte, C. Li, John MacLaren Walsh, “Algorithms for Computing Network Coding Rate Regions via Single Element Extensions of Matroids”, IEEE International Symposium on Information Theory (ISIT) 2014, Honolulu, Hawaii, Program Paper Talk [6] Jayant Apte, C. Li, John MacLaren Walsh, Steven Weber, “Exact Repair Problems With Multiple Sources”, 48th Annual Conference on Information Sciences and Systems (CISS) 2014, Princeton, NJ, Program Paper Talk [7] C. Li, Jayant Apte, John MacLaren Walsh, Steven Weber, “A New Computational Approach for Determining Rate Regions and Optimal Codes for Coded Networks”, IEEE International Symposium on Network Coding (NetCod), Calgary, Canada, Jun. 7-9, 2013 Talks:Based on B. D. McKay, Isomorph-free exhaustive generation, Journal of Algorithms, 26 (1998) 306-324.Based on Jim Geelen, Bert Gerards and Geoff Whittle, Solving Rota's conjecture,
Notices of the American Mathematical Society, Aug 17, 2014: 736–743Based on Chen, Qi; Yeung, Raymond W., Partition Symmetrical Entropy Functions, arXiv:1407.7405v1 [cs.IT]Based on Katrin Herr, R. Bödi, Symmetries in linear and integer linear programming,
Oberwolfach Report 38/2010Based on D. Bremner, M. D. Sikiric, and A. Schurmann. Polyhedral representation conversion up to symmetries. CoRR, abs/math/0702239, 2007Based on FRITZ, T., & CHAVES, R. (2013). Entropic Inequalities and Marginal Problems.
IEEE transactions on information theory, 59(2), 803-817.Based on K. Fukuda and A. Prodon. Double description method revisited. Technical report, Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland, 1995 andCatherine Lassez and Jean-Louis Lassez. Quantifier elimination for conjunctions of linear constraints via a convex hull algorithm. In Bruce Donald, Deepak Kapur, and Joseph Mundy, editors, Symbolic and Numerical Computation for Artificial Intelligence. Academic Press, 1992.Based on David Avis, lrs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm, in Gil Kalai and Günter M. Ziegler, editors, Polytopes - Combinatorics and Computation 2000 Based on A.G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright and K. Ramchandran, Network Coding for Distributed Storage Systems, IEEE Transactions on Information Theory, Vol. 56(9), 4539-4551, Sept. 2010. |