The SCEAS System
Navigation Menu

Search the dblp DataBase


K. Subramani: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. K. Subramani
    Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2005, pp:320-333 [Conf]
  2. K. Subramani
    On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope. [Citation Graph (0, 0)][DBLP]
    AISC, 2002, pp:217-230 [Conf]
  3. K. Subramani
    On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2002, pp:57-65 [Conf]
  4. K. Subramani
    Zero-Clairvoyant Scheduling with Inter-period Constraints. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2004, pp:236-247 [Conf]
  5. K. Subramani
    Analyzing Selected Quantified Integer Programs. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2004, pp:342-356 [Conf]
  6. K. Subramani
    Parametric Scheduling for Network Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:550-560 [Conf]
  7. K. Subramani
    An Analysis of Quantified Linear Programs. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:265-277 [Conf]
  8. K. Subramani, Dejan Desovski
    A New Verification Procedure for Partially Clairvoyant Scheduling. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2005, pp:127-141 [Conf]
  9. K. Subramani, Ashok K. Agrawala
    A Dual Interpretation of "Standard Constraints" in Parametric Scheduling. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 2000, pp:121-133 [Conf]
  10. K. Subramani
    Parametric Scheduling - Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    HiPC, 2001, pp:36-46 [Conf]
  11. K. Subramani, Kiran Yellajyosula
    A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers. [Citation Graph (0, 0)][DBLP]
    HiPC, 2004, pp:111-122 [Conf]
  12. K. Subramani, Dejan Desovski
    On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2005, pp:180-187 [Conf]
  13. K. Subramani, Lisa Kovalchick
    Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science, 2003, pp:377-387 [Conf]
  14. K. Subramani
    On Clausal Equivalence and Hull Inclusion. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:188-201 [Conf]
  15. K. Subramani, Kiran Yellajyosula, A. Osman
    Distributed Algorithms for Partially Clairvoyant Dispatchers. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  16. Hans Kleine Büning, K. Subramani, Xishun Zhao
    On Boolean Models for Quantified Boolean Horn Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:93-104 [Conf]
  17. K. Subramani
    A Specification Framework for Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2002, pp:195-207 [Conf]
  18. Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani
    Resource-Optimal Scheduling Using Priced Timed Automata. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:220-235 [Conf]
  19. K. Subramani
    An Analysis of Zero-Clairvoyant Scheduling. [Citation Graph (0, 0)][DBLP]
    TACAS, 2002, pp:98-112 [Conf]
  20. K. Subramani, John Argentieri
    Analyzing Chain Programs over Difference Constraints. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:171-180 [Conf]
  21. K. Subramani
    Totally Clairvoyant Scheduling with Relative Timing Constraints. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2006, pp:398-411 [Conf]
  22. K. Subramani
    A Comprehensive Framework for Specifying Clairvoyance, Constraints and Periodicity in Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2005, v:48, n:3, pp:259-272 [Journal]
  23. K. Subramani, C. Tauras
    An approximation algorithm for state minimization in 2-MDFAs. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2006, v:18, n:4, pp:421-431 [Journal]
  24. K. Subramani, Lisa Kovalchick
    A greedy strategy for detecting negative cost cycles in networks. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2005, v:21, n:4, pp:607-623 [Journal]
  25. Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani
    On using priced timed automata to achieve optimal scheduling. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2006, v:29, n:1, pp:97-114 [Journal]
  26. K. Subramani
    Cascading random walks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:599-622 [Journal]
  27. K. Subramani
    Partially clairvoyant scheduling for aggregate constraints. [Citation Graph (0, 0)][DBLP]
    JAMDS, 2005, v:9, n:4, pp:225-240 [Journal]
  28. K. Subramani
    An Analysis of Partially Clairvoyant Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Math. Model. Algorithms, 2003, v:2, n:2, pp:97-119 [Journal]
  29. K. Subramani, Dejan Desovski
    Out of order quantifier elimination for Standard Quantified Linear Programs. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2005, v:40, n:6, pp:1383-1396 [Journal]
  30. K. Subramani
    On deciding the non-emptiness of 2SAT polytopes with respect to First Order Queries. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2004, v:50, n:3, pp:281-292 [Journal]
  31. K. Subramani
    Periodic Linear Programming with applications to real-time scheduling. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2005, v:15, n:2, pp:383-406 [Journal]
  32. K. Subramani
    Tractable Fragments of Presburger Arithmetic. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:5, pp:647-668 [Journal]
  33. K. Subramani
    An Analysis of Totally Clairvoyant Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:2, pp:113-133 [Journal]
  34. K. Subramani
    Erratum: An Analysis of Totally Clairvoyant Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:6, pp:551-552 [Journal]
  35. K. Subramani
    Optimal length tree-like resolution refutations for 2SAT formulas. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2004, v:5, n:2, pp:316-320 [Journal]
  36. K. Subramani, Dejan Desovski
    On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection. [Citation Graph (0, 0)][DBLP]
    Applied Mathematics and Computation, 2006, v:173, n:1, pp:273-305 [Journal]
  37. K. Subramani
    A Randomized Algorithm for BBCSPs in the Prover-Verifier Model. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2007, pp:455-466 [Conf]
  38. Hans Kleine Büning, K. Subramani, Xishun Zhao
    Boolean Functions as Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2007, v:39, n:1, pp:49-75 [Journal]

  39. Accomplishing Approximate FCFS Fairness Without Queues. [Citation Graph (, )][DBLP]

  40. A Combinatorial Algorithm for Horn Programs. [Citation Graph (, )][DBLP]

  41. Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem. [Citation Graph (, )][DBLP]

  42. Absorbing Random Walks and the NAE2SAT Problem. [Citation Graph (, )][DBLP]

  43. Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. [Citation Graph (, )][DBLP]

  44. Random walks for selected boolean implication and equivalence problems. [Citation Graph (, )][DBLP]

  45. On a decision procedure for quantified linear programs. [Citation Graph (, )][DBLP]

  46. Distributed algorithms for partially clairvoyant dispatchers. [Citation Graph (, )][DBLP]

  47. Computing inversion pair cardinality through partition-based sorting. [Citation Graph (, )][DBLP]

Search in 0.071secs, Finished in 0.073secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002