Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems von Chakaravarthy, Venkatesan T., Checconi, Fabio, Murali, Prakash, Petrini, Fabrizio, Sabharwal, Yogish

Volltext

Improved algorithms for resource allocation under varying capacity von Chakaravarthy, Venkatesan T., Choudhury, Anamitra R., Gupta, Shalmoli, Roy, Sambudha, Sabharwal, Yogish

Volltext

Set Cover Problems with Small Neighborhood Covers von Agarwal, Archita, Chakaravarthy, Venkatesan T., Choudhury, Anamitra R., Roy, Sambudha, Sabharwal, Yogish

Volltext

Approximating maximum weight K-colorable subgraphs in chordal graphs von Chakaravarthy, Venkatesan T., Roy, Sambuddha

Volltext

Decision trees for entity identification: Approximation algorithms and hardness results von Chakaravarthy, Venkatesan T., Pandit, Vinayaka, Roy, Sambuddha, Awasthi, Pranjal, Mohania, Mukesh K.

Volltext

Oblivious Symmetric Alternation von Chakaravarthy, Venkatesan T., Roy, Sambuddha

Volltext

Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem von Chakaravarthy, Venkatesan T., Choudhury, Anamitra R., Garg, Vijay K., Sabharwal, Yogish

Volltext

Competing provers yield improved Karp–Lipton collapse results von Cai, Jin-Yi, Chakaravarthy, Venkatesan T., Hemaspaandra, Lane A., Ogihara, Mitsunori

Volltext

A Note on Zero Error Algorithms Having Oracle Access to One NP Query von Cai, Jin-Yi, Chakaravarthy, Venkatesan T.

Volltext

Scheduling split intervals with non-uniform demands von Chakaravarthy, Venkatesan T., Choudhury, Anamitra R., Roy, Sambuddha, Sabharwal, Yogish

Volltext

Time-Space Tradeoff in Derandomizing Probabilistic Logspace von Cai, Jin-Yi, Chakaravarthy, Venkatesan T., van Melkebeek, Dieter

Volltext

On the non-approximability of points-to analysis von CHAKARAVARTHY, Venkatesan T, HORWITZ, Susan

Volltext

Arthur and Merlin as Oracles von Chakaravarthy, Venkatesan T., Roy, Sambuddha

Volltext

The Problem of Context Sensitive String Matching von Chakaravarthy, Venkatesan T., Krishnamurthy, Rajasekar

Volltext

Time-Space Tradeoff in Derandomizing Probabilistic Logspace von Cai, Jin-Yi, Chakaravarthy, Venkatesan T., van Melkebeek, Dieter

Volltext

On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theoretic Perspective von Krishnamurthy, Rajasekar, Chakaravarthy, Venkatesan T., Naughton, Jeffrey F.

Volltext

Competing Provers Yield Improved Karp–Lipton Collapse Results von Cai, Jin-Yi, Chakaravarthy, Venkatesan T., Hemaspaandra, Lane A., Ogihara, Mitsunori

Volltext

Varying bandwidth resource allocation problem with bag constraints von Chakaravarthy, Venkatesan T, Pandit, Vinayaka, Sabharwal, Yogish, Seetharam, Deva P

Volltext

Keyword Search over Dynamic Categorized Information von Bhide, M., Chakaravarthy, V.T., Ramamritham, K., Roy, P.

Volltext

Resource Allocation for Covering Time Varying Demands von Chakaravarthy, Venkatesan T., Kumar, Amit, Roy, Sambuddha, Sabharwal, Yogish

Volltext