K. Subramani

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

51EEK. Subramani: Absorbing Random Walks and the NAE2SAT Problem. FAW 2008: 89-100
50EEK. Subramani, Kiran Yellajyosula, A. Osman: Distributed algorithms for partially clairvoyant dispatchers. Cluster Computing 11(2): 115-131 (2008)
49EEK. Subramani: Computing inversion pair cardinality through partition-based sorting. Computing 83(1): 41-54 (2008)
48 K. Subramani, Kamesh Madduri: A Randomized Queueless Algorithm for Breadth-First Search. I. J. Comput. Appl. 15(3): 177-186 (2008)
47EEK. Subramani, Kiran Yellajyosula: On the Design and Implementation of a Shared Memory Dispatcher for Partially Clairvoyant Schedulers. International Journal of Parallel Programming 36(4): 386-411 (2008)
46EEK. Subramani, Kamesh Madduri: Accomplishing Approximate FCFS Fairness Without Queues. HiPC 2007: 540-551
45EEK. Subramani: A Randomized Algorithm for BBCSPs in the Prover-Verifier Model. ICTAC 2007: 455-466
44EEK. Subramani: On a decision procedure for quantified linear programs. Ann. Math. Artif. Intell. 51(1): 55-77 (2007)
43EEK. Subramani, Dejan Desovski: An empirical analysis of algorithms for partially Clairvoyant scheduling. IJPEDS 22(5): 331-353 (2007)
42EEK. Subramani: A polynomial time algorithm for Zero-Clairvoyant scheduling. J. Applied Logic 5(4): 667-680 (2007)
41EEHans Kleine Büning, K. Subramani, Xishun Zhao: Boolean Functions as Models for Quantified Boolean Formulas. J. Autom. Reasoning 39(1): 49-75 (2007)
40EEK. Subramani: A Zero-Space algorithm for Negative Cost Cycle Detection in networks. J. Discrete Algorithms 5(3): 408-421 (2007)
39EESanjit A. Seshia, K. Subramani, Randal E. Bryant: On Solving Boolean Combinations of UTVPI Constraints. JSAT 3(1-2): 67-90 (2007)
38EEK. Subramani, John Argentieri: Analyzing Chain Programs over Difference Constraints. TAMC 2006: 171-180
37EEK. Subramani: Totally Clairvoyant Scheduling with Relative Timing Constraints. VMCAI 2006: 398-411
36EEK. Subramani, Dejan Desovski: On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection. Applied Mathematics and Computation 173(1): 273-305 (2006)
35EEK. Subramani, C. Tauras: An approximation algorithm for state minimization in 2-MDFAs. Formal Asp. Comput. 18(4): 421-431 (2006)
34EEJacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani: On using priced timed automata to achieve optimal scheduling. Formal Methods in System Design 29(1): 97-114 (2006)
33 K. Subramani, John Argentieri: Chain Programming over Difference Constraints. Nord. J. Comput. 13(4): 309-327 (2006)
32EEK. Subramani: Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks. ADHOC-NOW 2005: 320-333
31EEK. Subramani, Dejan Desovski: A New Verification Procedure for Partially Clairvoyant Scheduling. FORMATS 2005: 127-141
30EEK. Subramani, Dejan Desovski: On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks. International Conference on Computational Science (1) 2005: 180-187
29EEK. Subramani: A Comprehensive Framework for Specifying Clairvoyance, Constraints and Periodicity in Real-Time Scheduling. Comput. J. 48(3): 259-272 (2005)
28EEK. Subramani, Lisa Kovalchick: A greedy strategy for detecting negative cost cycles in networks. Future Generation Comp. Syst. 21(4): 607-623 (2005)
27EEK. Subramani: Cascading random walks. Int. J. Found. Comput. Sci. 16(3): 599-622 (2005)
26EEK. Subramani: An Analysis of Totally Clairvoyant Scheduling. J. Scheduling 8(2): 113-133 (2005)
25EEK. Subramani: Erratum: An Analysis of Totally Clairvoyant Scheduling. J. Scheduling 8(6): 551-552 (2005)
24EEK. Subramani, Dejan Desovski: Out of order quantifier elimination for Standard Quantified Linear Programs. J. Symb. Comput. 40(6): 1383-1396 (2005)
23EEK. Subramani: Partially clairvoyant scheduling for aggregate constraints. JAMDS 9(4): 225-240 (2005)
22EEK. Subramani: Periodic Linear Programming with applications to real-time scheduling. Mathematical Structures in Computer Science 15(2): 383-406 (2005)
21EEK. Subramani: Tractable Fragments of Presburger Arithmetic. Theory Comput. Syst. 38(5): 647-668 (2005)
20EEK. Subramani: Zero-Clairvoyant Scheduling with Inter-period Constraints. ASIAN 2004: 236-247
19EEK. Subramani, Kiran Yellajyosula: A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers. HiPC 2004: 111-122
18EEK. Subramani: Analyzing Selected Quantified Integer Programs. IJCAR 2004: 342-356
17EEK. Subramani, Kiran Yellajyosula, A. Osman: Distributed Algorithms for Partially Clairvoyant Dispatchers. IPDPS 2004
16EEJacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani: Resource-Optimal Scheduling Using Priced Timed Automata. TACAS 2004: 220-235
15EEK. Subramani: Optimal length tree-like resolution refutations for 2SAT formulas. ACM Trans. Comput. Log. 5(2): 316-320 (2004)
14EEK. Subramani: On deciding the non-emptiness of 2SAT polytopes with respect to First Order Queries. Math. Log. Q. 50(3): 281-292 (2004)
13EEK. Subramani: An Analysis of Quantified Linear Programs. DMTCS 2003: 265-277
12EEK. Subramani: On Clausal Equivalence and Hull Inclusion. ICTCS 2003: 188-201
11EEK. Subramani, Lisa Kovalchick: Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem. International Conference on Computational Science 2003: 377-387
10EEHans Kleine Büning, K. Subramani, Xishun Zhao: On Boolean Models for Quantified Boolean Horn Formulas. SAT 2003: 93-104
9 K. Subramani: An Analysis of Partially Clairvoyant Scheduling. J. Math. Model. Algorithms 2(2): 97-119 (2003)
8EEK. Subramani: On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope. AISC 2002: 217-230
7EEK. Subramani: On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas. ASIAN 2002: 57-65
6EEK. Subramani: A Specification Framework for Real-Time Scheduling. SOFSEM 2002: 195-207
5EEK. Subramani: An Analysis of Zero-Clairvoyant Scheduling. TACAS 2002: 98-112
4EEK. Subramani: Parametric Scheduling for Network Constraints. COCOON 2001: 550-560
3EEK. Subramani: Parametric Scheduling - Algorithms and Complexity. HiPC 2001: 36-46
2EEK. Subramani: A polyhedral projection procedure for Q2SAT. Electronic Notes in Discrete Mathematics 9: 369-375 (2001)
1EEK. Subramani, Ashok K. Agrawala: A Dual Interpretation of "Standard Constraints" in Parametric Scheduling. FTRTFT 2000: 121-133

Coauthor Index

1Ashok K. Agrawala [1]
2John Argentieri [33] [38]
3Randal E. Bryant [39]
4Hans Kleine Büning [10] [41]
5Dejan Desovski [24] [30] [31] [36] [43]
6Lisa Kovalchick [11] [28]
7Kim Guldstrand Larsen [16] [34]
8Kamesh Madduri [46] [48]
9A. Osman [17] [50]
10Jacob Illum Rasmussen [16] [34]
11Sanjit A. Seshia [39]
12C. Tauras [35]
13Kiran Yellajyosula [17] [19] [47] [50]
14Xishun Zhao [10] [41]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)