![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. P. Sreenivasa Kumar K. Hima Prasad , P. Sreenivasa Kumar: Efficient indexing and querying of XML data using modified Prüfer sequences. CIKM 2005 : 397-404 G. V. Subramanyam , P. Sreenivasa Kumar: Efficient Handling of Sibling Axis in Xpath. COMAD 2005 : 95-102 Sujatha R. Upadhyaya , Saleena N , P. Sreenivasa Kumar: Knowledge Table Driven Ontology Enhancement. Description Logics 2005 Sujatha R. Upadhyaya , P. Sreenivasa Kumar: ERONTO: a tool for extracting ontologies from extended E/R diagrams. SAC 2005 : 666-670 G. V. Subramanyam , P. Sreenivasa Kumar: Efficient Processing of Multiple Structural Join Queries. BNCOD 2004 : 112-123 M. K. MadhuMohan , Sujatha R. Upadhyaya , P. Sreenivasa Kumar: SAQI: Semantics Aware Query Interface. ICDCIT 2004 : 178-193 P. Kiran , K. Prasanna , Deepak Khemani , P. Sreenivasa Kumar: Design of CBR System for Multi Variate Time Series Analysis. IICAI 2003 : 819-832 M. Shiva Kumar , P. Sreenivasa Kumar: Static lightpath establishment in WDM networks - New ILP formulations and heuristic algorithms. Computer Communications 25 (1): 109-114 (2002) P. Sreenivasa Kumar, C. E. Veni Madhavan : Clique tree generalization and new subclasses of chordal graphs. Discrete Applied Mathematics 117 (1-3): 109-131 (2002) M. Shiva Kumar , P. Sreenivasa Kumar: Lightpath setup time optimization in wavelength routed all-optical networks. Computer Communications 24 (10): 984-995 (2001) K. R. Venugopal , M. Shiva Kumar , P. Sreenivasa Kumar: A heuristic for placement of limited range wavelength converters in all-optical networks. Computer Networks 35 (2-3): 143-163 (2001) C. Vijayanand , M. Shiva Kumar , K. R. Venugopal , P. Sreenivasa Kumar: Converter placement in all-optical networks using genetic algorithms. Computer Communications 23 (13): 1223-1234 (2000) M. Shiva Kumar , P. Sreenivasa Kumar: Minimizing Lightpath Set-up Times in Wavelength Routed All-Optical Networks. HiPC 1999 : 394-398 K. R. Venugopal , M. Shiva Kumar , P. Sreenivasa Kumar: A Heuristic for Placement of Limited Range Wavelength Converters in All-Optical Networks. INFOCOM 1999 : 908-915 K. R. Venugopal , E. Ezhil Rajan , P. Sreenivasa Kumar: Impact of wavelength converters in wavelength routed all-optical networks. Computer Communications 22 (3): 244-257 (1999) N. Kalyana Rama Prasad , P. Sreenivasa Kumar: On Generating Strong Elimination Orderings of Strongly Chordal Graphs. FSTTCS 1998 : 221-232 P. Sreenivasa Kumar, C. E. Veni Madhavan : Minimal Vertex Separators of Chordal Graphs. Discrete Applied Mathematics 89 (1-3): 155-168 (1998) P. Sreenivasa Kumar, M. Kishore Kumar , A. Basu : Parallel Algorithms for Sparse Triangular System Solution. Parallel Computing 19 (2): 187-196 (1993) S. Chandra , M. Jain , A. Basu , P. Sreenivasa Kumar: Sorting Algorithms on Transputer Arrays. Parallel Computing 19 (6): 595-607 (1993) M. Kishore Kumar , P. Sreenivasa Kumar, A. Basu : A Library Environment for Distributed-Memory Multiprocessors. IPPS 1992 : 483-486 N. Ch. Veeraraghavulu , P. Sreenivasa Kumar, C. E. Veni Madhavan : A Linear-Time Algorithm for Isomorphism of a Subclass of Chordal Graphs. Inf. Process. Lett. 44 (1): 45-49 (1992) P. Sreenivasa Kumar, M. Kishore Kumar , A. Basu : A parallel algorithm for elimination tree computation and symbolic factorization. Parallel Computing 18 (8): 849-856 (1992) B. V. Purushotham , Anirban Basu , P. Sreenivasa Kumar, Lalit M. Patnaik : Performance Estimation of LU Factorisation on Message Passing Multiprocessors. Parallel Processing Letters 2 : 51-60 (1992) P. Sreenivasa Kumar, C. E. Veni Madhavan : A New Class of Separators and Planarity of Chordal Graphs. FSTTCS 1989 : 30-43 1 [ 3 ] [ 5 ] [ 6 ] [ 7 ] 2 [ 2 ] 3 [ 6 ] 4 [ 6 ] 5 [ 18 ] 6 [ 18 ] 7 [ 3 ] [ 5 ] [ 7 ] 8 [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 17 ] 9 [ 1 ] [ 4 ] [ 8 ] [ 16 ] 10 [ 19 ] 11 [ 22 ] 12 [ 2 ] 13 [ 24 ] 14 [ 9 ] 15 [ 18 ] 16 [ 2 ] 17 [ 10 ] 18 [ 20 ] [ 23 ] 19 [ 19 ] [ 21 ] [ 22 ] 20 [ 4 ] 21 [ 10 ] [ 11 ] [ 13 ] [ 14 ] 22 [ 13 ] ![]() ©2006 Association for Computing Machinery |