Ambedkar DUKKIPATI (ambi) Assistant Professor Dept. of Computer Science and Automation Indian Institute of Science - Bangalore phone: +91(80)22933201 email: <ad -at- csa.iisc.ernet.in> work related to: Algorithmic Algebra, Information Theory

Research | Papers | Talks | Teaching | Students | Research Links | Street Musicians

Research

Fields

• Algorithmic Algebra and Algebraic Geometry
• Information Theory and Statistical Learning

Lab

Algorithmic Algebra Laboratory (Go to research links if you want to know about this field)

Bio

B.Tech from Dept. CSE, IIT Madras; Masters from Dept. CSA, IISc; PhD from Dept. of CSA, IISc; Postdoc at Eurandom

Back to top.

Papers

Journal and Refereed Conference Publications

• P. V. Ananth. and A. Dukkipati. 'Border basis detection is NP-Complete' In Proceedings of ACM International Symposium on Symbolic and Algebraic Computation (ISSAC'2011), pp. 11-18, ACM 2011
  
  
• A. Dukkipati, J. G. Manathara. An Algebraic Implicitization and Specialization of Minimum KL-divergence Models V. P. Gerdt et al. (Eds.) In Proceedings of International Workshop on Computer Algebra in Scientific Computing (CASC'2010), Springer Lecture Notes in Computer Science, pp. 85-96, 2010.
  
  
• A. Dukkipati. 'On Kolmogorov-Nagumo averages and Nonextensive entropy' In Proceedings of International Symposium on Information Theory and its Applications(ISITA'2010),pp. 446-451 IEEE press 2010.
  
  
• A. Dukkipati, A. K. Yadav and M. N. Murty. Maximum entropy model based classification with feature selection In Proceedings of IEEE International Conference on Pattern Recognition (ICPR'2010), pp. 565-568, IEEE press, 2010.
  
  
• A. Dukkipati. Embedding maximum entropy models in algebraic varieties by Grobner bases methods. In Proceedings of IEEE International Symposium on Information Theory (ISIT'2009), pp.1904-1908, IEEE press, 2009.
  
  
• A. Dukkipati, S. Bhatnagar and M. N. Murty. On measure-theoretic aspects of nonextensive entropy functionals and corresponding maximum entropy prescriptions. Physica A, 384:124-138, 2007.
  
  
• A. Dukkipati, S. Bhatnagar and M. N. Murty. Gelfand-Yaglom-Perez theorem for generalized relative entropy functionals. Information Sciences, 177:5707-5714, 2007.
  
  
• A. Dukkipati, M. N. Murty and S. Bhatnagar. Nonextensive triangle equality and other properties of Tsallis relative-entropy minimization. Physica A, Vol. 361, pp 124-138, 2006.
  
  
• A. Dukkipati, M. N. Murty and S. Bhatnagar. Information theoretic justification of Boltzmann selection and its generalization to Tsallis case. In Proceedings of IEEE Congress on Evolutionary Computation (CEC'2005). Vol. 2, pp. 1667-1674, IEEE press, 2005. pdf ps
  
  
• A. Dukkipati, M. N. Murty and S. Bhatnagar. Properties of Kullback-Leibler Cross-Entropy minimization in Nonextensive framework. In Proceedings of IEEE International Symposium on Information Theory (ISIT'2005), pp. 2374--2378, IEEE press, 2005.
  
  
• A. Dukkipati, M. N. Murty and S. Bhatnagar. Cauchy Annealing Schedule: An Annealing Schedule for Boltzmann Selection Scheme in Evolutionary Algorithms. In Proceedings of IEEE Congress on Evolutionary Computation (CEC'2004). Vol. 1, pp. 55-62, IEEE press, 2004. pdf ps Eprint
  
  
• A. Dukkipati, M. N. Murty and S. Bhatnagar. Quotient Evolutionary Space: Abstraction of Evolutionary process w.r.t macroscopic properties. In Proceedings of IEEE Congress on Evolutionary Computation (CEC'2003). Vol. 2, pp. 846-853, IEEE press, 2003. pdf ps
  
  
• A. Dukkipati and M. N. Murty. Selection by Parts: `Selection in Two Episodes' in Evolutionary Algorithms. In Proceedings of IEEE Congress on Evolutionary Computation (CEC'2002). Vol. 1, pp. 657 - 662, IEEE press, 2002. pdf ps
  
  

Back to top.

Eprints

• J. Vachery and A. Dukkipati. On Shore and Johnson properties for a Special Case of Csiszár f-divergences, 2012. Eprint
  
• H. K. Malladi and A. Dukkipati. A Parallel Cylindrical Algebraic Decomposition Algorithm for Quantifier Elimination on Real Closed Fields, 2012. Eprint
  
• P. Ananth and A. Dukkipati. An Algebraic Characterization of Rainbow Connectivity, 2011. Eprint
  
• J. G. Manathara, A. Dukkipati and D. Ghose Tropical Algebraic approach to Consensus over Networks, 2011. Eprint
  
• J. G. Manathara, A. Dukkipati and D. Ghose On consensus under polynomial protocols, 2011. Eprint
  
• P. D. Kumar and A. Dukkipati. A two stage selective averaging LDPC decoding, 2011. Eprint
  
• P. Ananth and A. Dukkipati. On Grobner basis detection for zero-dimensional ideals, 2011. Eprint
  
• A. Dukkipati. Nonextensive Pythagoras theorem, 2006. Eprint
  

Back to top.

Technical Reports

• A. Dukkipati. On parametric and implicit algebraic descriptions of maximum entropy models. EURANDOM report 2008-038, 2008.
  
  

Back to top.

Selected Talks

• EPFL: On parametric and implicit algebraic descriptions of maximum entropy models Invited talk at Workshop on Entropy, School of Computer Science and Communications Sciences, Ecole Polytechnique Federale De Lausanne (EPFL). (Sept 2008)
  
  
• Cambridge: Grobner bases of elimination ideals and toric ideals: Applications to maximum entropy models Statistical Laboratory, Dept. of Pure mathematics \& Mathematical Statistics, University of Cambridge. (May 2008)
  
  
• Marne-la-Vall{\'e}e: On Grobner Bases of Elimination Ideals describing Maximum Entropy models. Institut Gaspard Monge, Universit{\'{e}} de Marne-la-Vall{\'e}e. (Jan 2008)
  
  
• CWI-Amsterdam: On generalized measures of information and Pythagorean theorems. Center for Mathematics and Computer Science, Amsterdam. (Sep 2007)
  
  

Back to top.

Teaching

2012

• E0 231 Algorithmic Algebra (JAN) Info - Link
  

2011

• Discrete Structures (Aug) Info - Link
  
• Information Theory, Inference and Learning Algorithms (Aug) Info - Link
  
• E0 231 Algorithmic Algebra (JAN) Info - Link
  

2010

• Information Theory, Inference and Learning Algorithms (Aug) Info - Link
  
• Probability and Statistics (Aug) (With Dr. Indrajit Bhattacharya) Info - Link
  
• E0 231 Algorithmic Algebra (JAN) Info - Link
  

2009

• E0 226 Linear Algebra and Probability (AUG) (With Prof. D. P. Patil) Link
  
• MA 314 Topics in Commutative Algebra Info
  
• E0 376 Information Theory and Statistical Inference (JAN) (with Rajesh Sundaresan) Link
  

2008

• E0 321 Algorithmic Algebra (AUG) Link
  

Back to top.

Students

PhD

• Maria Fancis (Aug 2010- )
  B.Tech (NIT Calicut)
  Area: Algorithmic Algebra
  Thesis: -
• Jithin Vachery, (Aug 2011 - )
  B.Tech (); M.Tech (CSA,IISC)
  Area : Information Theory and Statistical Learning
  Thesis: -

MSc (Engg.)

• Aritra Sen (Aug 2011- )
  B.Tech ()
  Area: Algorithmic Algebra
  Thesis: -

• Aswin Guha (Aug 2010- )
  B.Tech (NIT Trichi)
  Area: Algorithmic Algebra
  Thesis: -
• Prabhanjan V. A. (Aug 2009-Sep 2011)
  B.Tech (RV Collage)
  Area: Algorithmic Algebra
  Thesis: On the Complexity of Grobner Basis and Border Basis Detection
  Moved to: Microsoft Research Internship

ME (Project)

2011

• Hari Krishna (Algorithmic Algebra)
• Gourav Pandey (Information Theorey and Statistical Learning)
• Anirban (Information Theorey and Statistical Learning)
• Debarghya (Jointly with Prof. Shalabh Bhatnagar) (Information Theorey and Statistical Learning)
• D. Manju Venkata Satya Sriram (Information theory and statistical learning)

2010

• Hari Krishna: Nonextensive information theoretic kernel K-means clustring
  Moved to: NVDIA, Bangalore.
• Jithin Vachery: On Power-law distributions and a special case of Csiszar f-divergences.
  Moved to: PhD candidate at CSA, IISc
• Dinesh Kumar A.(jointly with Prof. Prithi Shankar) : A two stage selective averaging LDPC decoding.
  Moved to: Oracle, Bangalore

2008

• Abhay Kumar Yadav (jointly with Prof. M. Narasimha Murty) : Information theoretic approach to pattern recognition.
  Moved to: Oracle, Noida

Back to top.

Research Links

Books I like

• Nowadays many mathematical books do not seem to be written by living men who not only know, but doubt and ask and guess, who see details in their true perspective -- light surrounded by darkness -- who, endowed with a limited memory, in the twilight of questioning, discovery, and resignation, weave a connected pattern, imperfect but growing, and colored by infinite gradations of significance. The books of the type I refer to are rather like slot machines which fire at you for the price you pay a medley of axioms, definitions, lemmas, and theorems, and then remain numb and dead however you shake them - Hermann Weyl
  (From Hermann Weyl's book review of volume 2 of Courant and Hilbert's Methoden der Mathematishen Physik. The review appeared in Bull. Amer. Math. Soc. 44 (19938) 602-604. This quote is from page number 602.)
  You can find this here (link). Go to the end of the paper

Back to top.

Gen Links

• What is Algorithmic Algebra?
  • If you are a computer science student then read introduction of Bud Mishra's book Link or you can download the book from here Link
  • Else if you are a mathematics student then read introduction of Kreuzer and Robbiano's book Link
  • Else if you can just appreciate poetry then check this Link

• Prof. Paul Halmos on How to write Mathematics

• Abhayankar's paper Historical Ramblings in Algebraic Geometry and Related Algebra

• Shiryaev's essay: Everything about Kolmogorov was unusual

• New and really good book on Measure Theoretic Probability by Allan Gut Link
  or if you are in IISc check Link

• Metrics of Science: Loosenging the Stranglehold
Back to top.

This page was made with valid XHTML and CSS.