DSpace
 

DSpace at IIT Bombay >

Browsing by Author NARAYANAN, H

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 19 to 38 of 45
< previous   next >
Issue DateTitleAuthor(s)
2003Improving graph partitions using submodular functionsPATKAR, SB; NARAYANAN, H
2002Mathematical methods in VLSIATRE, MV; SUBRAMANIAN, S; NARAYANAN, H
2004Mathematical programming and resistor transformer diode networksNARAYANAN, H
1978MAXIMUM POWER TRANSFER THEOREMNARAYANAN, H
1991A new approach to the problem of PLA partitioning using the theory of the principal lattice of partitions of a submodular functionROY, SUBIR; NARAYANAN, H
1997A new partitioning strategy based on supermodular functionsPATKAR, SACHIN; BATTERYWALA, SH; CHANDRAMOULI, M; NARAYANAN, H
2001A note on optimal covering augmentation for graphic polymatroidsPATKAR, SB; NARAYANAN, H
2003A note on the minimization of symmetric and general submodular functionsNARAYANAN, H
2002On duality of behavioural systemsPILLAI, HK; NARAYANAN, H
2005On set functions that can be extended to convex functionalsNARAYANAN, H
1990ON THE MINIMUM HYBRID RANK OF A GRAPH RELATIVE TO A PARTITION OF ITS EDGES AND ITS APPLICATION TO ELECTRICAL NETWORK ANALYSISNARAYANAN, H
2000Orthogonal partitioning and gated clock architecture for low power realization of FSMsSHELAR, RUPESH S; NARAYANAN, H; DESAI, MP
2007Parallelization of DC analysis through multiport decompositionTRIVEDI, GAURAV; DESAI, MP; NARAYANAN, H
2008Polyhedrally tight set functions and discrete convexityFUJISHIGE, S; NARAYANAN, H
1991THE PRINCIPAL LATTICE OF PARTITIONS OF A SUBMODULAR FUNCTIONNARAYANAN, H
1992Principal lattice of partitions of submodular functions on graphs - fast algorithms for principal partition and generic rigidityPATKAR, S; NARAYANAN, H
1992PRINCIPAL LATTICE OF PARTITIONS OF SUBMODULAR FUNCTIONS ON GRAPHS - FAST ALGORITHMS FOR PRINCIPAL PARTITION AND GENERIC RIGIDITYPATKAR, S; NARAYANAN, H
1994RANDOMIZED PARALLEL ALGORITHMS FOR MATROID UNION AND INTERSECTION, WITH APPLICATIONS TO ARBORESENCES AND EDGE-DISJOINT SPANNING-TREESNARAYANAN, H; SARAN, H; VAZIRANI, VV
2003The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular functionDESAI, MP; NARAYANAN, H; PATKAR, SB
1995A ROUNDING TECHNIQUE FOR THE POLYMATROID MEMBERSHIP PROBLEMNARAYANAN, H
Showing results 19 to 38 of 45
< previous   next >

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback