The following pages link to C. Pandu Rangan (Q189690):
Displaying 50 items.
- A natural family of optimization problems with arbitrarily small approximation thresholds (Q293457) (← links)
- On conditional covering problem (Q626967) (← links)
- Secure message transmission in asynchronous networks (Q635383) (← links)
- Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393) (← links)
- An efficient distributed algorithm for centering a spanning tree of a biconnected graph (Q671408) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- Optimal parallel algorithms for path problems on planar graphs (Q673083) (← links)
- Approximate triclique coloring for register allocation (Q673230) (← links)
- Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
- Perfectly reliable message transmission (Q845819) (← links)
- Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← links)
- New sequential and parallel algorithms for interval graph recognition (Q922725) (← links)
- Perfectly reliable and secure message transmission tolerating mobile adversary (Q1017544) (← links)
- A linear space algorithm for the LCS problem (Q1101217) (← links)
- A unified approach to domination problems on interval graphs (Q1111566) (← links)
- Total domination in interval graphs revisited (Q1114413) (← links)
- On finding the minimum bandwidth of interval graphs (Q1183610) (← links)
- An O\((n \log{}n)\) algorithm for a maxmin location problem (Q1192955) (← links)
- An optimal algorithm for reconstructing a binary tree (Q1198037) (← links)
- Generalized vertex covering in interval graphs (Q1199467) (← links)
- A linear algorithm for the all-bidirectional-edges problem on planar graphs (Q1209732) (← links)
- A fast algorithm for computing sparse visibility graphs (Q1262133) (← links)
- Linear algorithm for domatic number problem on interval graphs (Q1262139) (← links)
- Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)
- Symmetric min-max heap: a simpler data structure for double-ended priority queue (Q1285766) (← links)
- A linear algorithm for centering a spanning tree of a biconnected graph (Q1332759) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- On the complexity of partial order properties (Q1590180) (← links)
- A CCA-secure collusion-resistant identity-based proxy re-encryption scheme (Q1616645) (← links)
- Leakage-resilient non-interactive key exchange in the continuous-memory leakage setting (Q1616873) (← links)
- An efficient certificateless proxy re-encryption scheme without pairing (Q1616902) (← links)
- An efficient algorithm for finding a two-pair, and its applications (Q1814097) (← links)
- Efficient parallel algorithms for permutation graphs (Q1892868) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- All-pairs-shortest-length on strongly chordal graphs (Q1923609) (← links)
- The parity path problem on some subclasses of perfect graphs (Q1923620) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Efficient asynchronous verifiable secret sharing and multiparty computation (Q2018817) (← links)
- New approach to practical leakage-resilient public-key cryptography (Q2023806) (← links)
- Efficient attribute-based proxy re-encryption with constant size ciphertexts (Q2152056) (← links)
- Asynchronous Byzantine agreement with optimal resilience (Q2251153) (← links)
- Public key encryption resilient to post-challenge leakage and tampering attacks (Q2290439) (← links)
- Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← links)
- Efficient compilers for after-the-fact leakage: from CPA to CCA-2 secure PKE to AKE (Q2399972) (← links)
- Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality (Q2430146) (← links)
- Weighted irredundance of interval graphs. (Q2583539) (← links)
- (Q2707598) (← links)
- (Q2707599) (← links)
- Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round (Q2856155) (← links)
- A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions (Q2894354) (← links)
