| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr J. Wojciechowski |
Computational complexity of inclusion queries over polyhedral sets.  |
ISAIM  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Natarajan Shankar, K. Subramani |
A mechanical verification of the stressing algorithm for negative cost cycle detection in networks. |
Sci. Comput. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Xiaofeng Gu |
Absorbing random walks and the NAE2SAT problem. |
Int. J. Comput. Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Gehani, Lee Zaniewski, K. Subramani |
Algorithmic Aspects of Risk Management. |
Formal Modeling: Actors, Open Systems, Biological Systems |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, James Worthington |
A New Algorithm for Linear and Integer Feasibility in Horn Constraints. |
CPAIOR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Kamesh Madduri |
Two-level heaps: a new priority queue structure with applications to the single source shortest path problem. |
Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, C. Tauras, Kamesh Madduri |
Space-time tradeoffs in negative cycle detection - An empirical analysis of the Stressing Algorithm. |
Applied Mathematics and Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | James B. Orlin, Kamesh Madduri, K. Subramani, M. Williamson |
A faster algorithm for the single source shortest path problem with few distinct positive lengths. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
On memoryless provers and insincere verifiers. |
J. Exp. Theor. Artif. Intell. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls. |
JAMDS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Hong-Jian Lai, Xiaofeng Gu |
Random walks for selected boolean implication and equivalence problems. |
Acta Inf. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Optimal Length Resolution Refutations of Difference Constraint Systems. |
J. Autom. Reasoning |
2009 |
DBLP DOI BibTeX RDF |
Difference constraint systems, Resolution refutation, Optimal length, Minimum unsatisfiable subset, Fourier-Motzkin elimination |
| 1 | Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai |
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. |
FAW |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Kamesh Madduri |
Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem. |
COCOA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Chandrasekaran, K. Subramani |
A Combinatorial Algorithm for Horn Programs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Kamesh Madduri |
A Randomized Queueless Algorithm for Breadth-First Search. |
I. J. Comput. Appl. |
2008 |
DBLP BibTeX RDF |
|
| 1 | K. Subramani, Kiran Yellajyosula |
On the Design and Implementation of a Shared Memory Dispatcher for Partially Clairvoyant Schedulers. |
International Journal of Parallel Programming |
2008 |
DBLP DOI BibTeX RDF |
Partially clairvoyant dispatcher, Loss of dispatchability, Safety interval, Shared-memory, Real-time scheduling |
| 1 | K. Subramani, C. Tauras, David Owen |
Fault Tolerant Sorting - Theoretical and Empirical Analyses of the Randomized QuickMergesort Algorithm. |
J. Math. Model. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Computing inversion pair cardinality through partition-based sorting. |
Computing |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q25, 68R99, 68W40 |
| 1 | K. Subramani, Kiran Yellajyosula, A. Osman |
Distributed algorithms for partially clairvoyant dispatchers. |
Cluster Computing |
2008 |
DBLP DOI BibTeX RDF |
Distributed dispatching, Partial clairvoyance, Loss of dispatchability, Real-time scheduling, Temporal constraints |
| 1 | K. Subramani |
Absorbing Random Walks and the NAE2SAT Problem. |
FAW |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjit A. Seshia, K. Subramani, Randal E. Bryant |
On Solving Boolean Combinations of UTVPI Constraints. |
JSAT |
2007 |
DBLP BibTeX RDF |
|
| 1 | K. Subramani |
A polynomial time algorithm for Zero-Clairvoyant scheduling. |
J. Applied Logic |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kleine Büning, K. Subramani, Xishun Zhao |
Boolean Functions as Models for Quantified Boolean Formulas. |
J. Autom. Reasoning |
2007 |
DBLP DOI BibTeX RDF |
Model, Complexity, Boolean function, Satisfiability, Propositional logic, Quantified Boolean formula |
| 1 | K. Subramani, Dejan Desovski |
An empirical analysis of algorithms for partially Clairvoyant scheduling. |
IJPEDS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
On a decision procedure for quantified linear programs. |
Ann. Math. Artif. Intell. |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68W05, 68Q17, 90C05, 68W40 |
| 1 | K. Subramani |
A Zero-Space algorithm for Negative Cost Cycle Detection in networks. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Kamesh Madduri |
Accomplishing Approximate FCFS Fairness Without Queues. |
HiPC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
A Randomized Algorithm for BBCSPs in the Prover-Verifier Model. |
ICTAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, C. Tauras |
An approximation algorithm for state minimization in 2-MDFAs. |
Formal Asp. Comput. |
2006 |
DBLP DOI BibTeX RDF |
2-MDFA, Finite state automata, State minimization |
| 1 | K. Subramani, Dejan Desovski |
On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection. |
Applied Mathematics and Computation |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, John Argentieri |
Chain Programming over Difference Constraints. |
Nord. J. Comput. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani |
On using priced timed automata to achieve optimal scheduling. |
Formal Methods in System Design |
2006 |
DBLP DOI BibTeX RDF |
Priced-timed automata, Zone-based, Linear programming, Real-time scheduling, Cost optimality |
| 1 | K. Subramani, John Argentieri |
Analyzing Chain Programs over Difference Constraints. |
TAMC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Totally Clairvoyant Scheduling with Relative Timing Constraints. |
VMCAI |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Partially clairvoyant scheduling for aggregate constraints. |
JAMDS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Dejan Desovski |
Out of order quantifier elimination for Standard Quantified Linear Programs. |
J. Symb. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Periodic Linear Programming with applications to real-time scheduling. |
Mathematical Structures in Computer Science |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Cascading random walks. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Lisa Kovalchick |
A greedy strategy for detecting negative cost cycles in networks. |
Future Generation Comp. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
An Analysis of Totally Clairvoyant Scheduling. |
J. Scheduling |
2005 |
DBLP DOI BibTeX RDF |
total clairvoyance, mutable dynamic programming, real-time systems, performance metrics |
| 1 | K. Subramani |
Erratum: An Analysis of Totally Clairvoyant Scheduling. |
J. Scheduling |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
A Comprehensive Framework for Specifying Clairvoyance, Constraints and Periodicity in Real-Time Scheduling. |
Comput. J. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Tractable Fragments of Presburger Arithmetic. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Dejan Desovski |
On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks. |
International Conference on Computational Science |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Dejan Desovski |
A New Verification Procedure for Partially Clairvoyant Scheduling. |
FORMATS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks. |
ADHOC-NOW |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
On deciding the non-emptiness of 2SAT polytopes with respect to First Order Queries. |
Math. Log. Q. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Optimal length tree-like resolution refutations for 2SAT formulas. |
ACM Trans. Comput. Log. |
2004 |
DBLP DOI BibTeX RDF |
2SAT formulas, tree-like proofs, Resolution |
| 1 | K. Subramani, Kiran Yellajyosula |
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers. |
HiPC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Analyzing Selected Quantified Integer Programs. |
IJCAR |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani |
Resource-Optimal Scheduling Using Priced Timed Automata. |
TACAS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Kiran Yellajyosula, A. Osman |
Distributed Algorithms for Partially Clairvoyant Dispatchers. |
IPDPS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Zero-Clairvoyant Scheduling with Inter-period Constraints. |
ASIAN |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
An Analysis of Partially Clairvoyant Scheduling. |
J. Math. Model. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
On Clausal Equivalence and Hull Inclusion. |
ICTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Lisa Kovalchick |
Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem. |
International Conference on Computational Science |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
An Analysis of Quantified Linear Programs. |
DMTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kleine Büning, K. Subramani, Xishun Zhao |
On Boolean Models for Quantified Boolean Horn Formulas. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
An Analysis of Zero-Clairvoyant Scheduling. |
TACAS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas. |
ASIAN |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope. |
AISC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
A Specification Framework for Real-Time Scheduling. |
SOFSEM |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
A polyhedral projection procedure for Q2SAT. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Parametric Scheduling - Algorithms and Complexity. |
HiPC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani |
Parametric Scheduling for Network Constraints. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Subramani, Ashok K. Agrawala |
A Dual Interpretation of "Standard Constraints" in Parametric Scheduling. |
FTRTFT |
2000 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")