The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sachin B. Patkar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sachin B. Patkar, H. Narayanan
    Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:94-105 [Conf]
  2. Sachin B. Patkar, H. Narayanan
    A Fast Algorithm for the Principle Partition of a Graph. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:288-306 [Conf]
  3. Sachin B. Patkar, H. Narayanan
    Fast Sequential and Randomised Parallel Algorithms for Rigidity and approximate Min k-cut. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:265-278 [Conf]
  4. Sachin B. Patkar, H. Narayanan
    Principal Lattice of Partition of submodular functions on Graphs: Fast algorithms for Principal Partition and Generic Rigidity. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:41-50 [Conf]
  5. H. Narayanan, Subir Roy, Sachin B. Patkar
    Approximation Algorithms for Min-k-overlap Problems Using the Principal Lattice of Partitions Approach. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:525-535 [Conf]
  6. C. R. Venugopal, S. S. S. P. Rao, Sachin B. Patkar
    Priority Scheduling in Parallel I/O Systems. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:2554-2560 [Conf]
  7. Sachin B. Patkar, Shabbir H. Batterywala, M. Chandramouli, H. Narayanan
    A New Partitioning Strategy Based on Supermodular Functions. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1997, pp:32-37 [Conf]
  8. Sachin B. Patkar, H. Narayanan
    An Efficient Practical Heuristic For Good Ratio-Cut Partitioning. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 2003, pp:64-69 [Conf]
  9. Madhav P. Desai, H. Narayanan, Sachin B. Patkar
    The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:299-310 [Journal]
  10. Sachin B. Patkar, H. Narayanan
    Improving graph partitions using submodular functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:535-553 [Journal]
  11. Satoru Fujishige, Sachin B. Patkar
    Realization of set functions as cut functions of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:199-210 [Journal]
  12. Sachin B. Patkar, H. Narayanan
    A note on optimal covering augmentation for graphic polymatroids. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:6, pp:285-290 [Journal]
  13. H. Narayanan, Subir Roy, Sachin B. Patkar
    Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:2, pp:306-330 [Journal]
  14. Sachin B. Patkar, H. Narayanan
    Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:1, pp:45-68 [Journal]
  15. Sachin B. Patkar, Brigitte Servatius, K. V. Subrahmanyam
    Abstract and Generic Rigidity in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:107-113 [Journal]

  16. Acceleration of conjugate gradient method for circuit simulation using CUDA. [Citation Graph (, )][DBLP]


  17. Exploiting Hybrid Analysis in Solving Electrical Networks. [Citation Graph (, )][DBLP]


  18. FPGA Based High Performance Double-Precision Matrix Multiplication. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002