List of computer science publications by suryajith chillara suryajith chillara, nutan limaye, srikanth srinivasan: small-depth multilinear formula lower bounds for iterated matrix multiplication, with applications. Nutan limaye, meena mahajan, b v raghavendra rao to appear in theory of computing systems, special issue of stacs 2007 conference version: symposium on theoretical aspects of computer science, aachen, germany, 2007. Nutan limaye thesissoft24 t/c - quuki nutan limaye thesis tag der promotion: 18022010acknowledgments i would like to thank my supervisor, prof dr jacobo torán his continuous support and guidance have greatly influenced my research and this work.
I am a post doctoral fellow with nutan limaye at the department of computer science and engineering, iit bombay i am broadly interested in the area of computational complexity and specifically, the topics in boolean function complexity and arithmetic circuit complexity. Lunsford handbooks nutan limaye thesis grows with students, novice to expert over 9 million citi program courses have been completed since 2000 all three. Nutan limaye graduated from the institute of mathematical sciences, chennai, india, in 2009 her advisor was meena mahajan her thesis focused on the interconnection between language classes and complexity classes.
Bibliographic details on record conf/stacs/chillaral018 suryajith chillara, nutan limaye, srikanth srinivasan: small-depth multilinear formula lower bounds for iterated matrix multiplication, with applications. Given any numeration system, we call 'carry propagation' at a number n the number of digits that are changed when going from the representation of n to the one of n+1 , and 'amortized carry propagation' the limit of the mean of the carry propagations at the first n integers, when n tends to infinity, and if it exists. Pdf (with christian engels, nutan limaye and a preliminary version was presented at the developments in language theory conference, turku, finland, 12-language operations on cellular automata classes. 9-12l11a students are able to explain the physical and chemical processes of photosynthesis and cell respiration and their importance to plant and animal life. This thesis arose in the context of the dfg research project: die komplexität des graphenisomorphieproblems and the graduate school: mathematical analysis of evolution, information and complexity i am grateful to prof dr thomas thierauf for the close collaboration.
I declare that the thesis titled parameterizing from the extremes: feasible parameterizations of some np-optimization problems is a nutan limaye, sunil simon, and. Today's post is a continuation of earlier posts (here, here, here, here) on graph isomorphism, treewidth and pathwidthas mentioned earlier, the best known upper bound for graph isomorphism of partial k-trees is logcfl. View shantanu thakoor's profile on linkedin, the world's largest professional community shantanu has 7 jobs listed on their profile see the complete profile on linkedin and discover shantanu's connections and jobs at similar companies.
View majid mahzoon's profile on linkedin, the world's largest professional community majid has 13 jobs listed on their profile see the complete profile on linkedin and discover majid's. Homepage of the electronic colloquium on computational complexity located at the hasso plattner institute of potsdam, germany. Iit, bombay - faculties list 24 nutan limaye assistant professor 022 25767732 25 bernard l pushpak bhattacharyya director 022-5764729 7 supratim biswas.
View sudeep limaye's profile on linkedin, the world's largest professional community sudeep has 7 jobs listed on their profile see the complete profile on linkedin and discover sudeep's connections and jobs at similar companies. She is working with me on her senior thesis theorem (kintali, munteanu'12) : for all constants , there exists a logspace algorithm that, when given a graph of treewidth , decides whether the pathwidth of is at most , and if so, finds a path decomposition of of width in logspace. Email: nutan [at] cse [dot] iitb [dot] ac [dot] in phone: +91 22 2576 7732. Yet another useful restriction of the ordinary contextfree languages is defined by the input-driven pushdown automata (idpda), in which the input alphabet is split into three classes, so that the.