| Design and Analysis of Lightweight Trust Mechanism for Accessing Data in MANETs. | 0 | 0.34 | 2014 |
| Outlier Detection and Treatment for Lightweight Mobile Ad Hoc Networks. | 5 | 0.44 | 2013 |
| Lightweight Trust Propagation Scheme For Resource Constraint Mobile Ad-Hoc Networks (Manets) | 0 | 0.34 | 2013 |
| Lightweight Cryptographic Primitives for Mobile Ad Hoc Networks. | 5 | 0.44 | 2012 |
| Efficient Hierarchical Threshold Symmetric Group Key Management Protocol for Mobile Ad Hoc Networks. | 6 | 0.69 | 2012 |
| Situation recognition in sensor based environments using concept lattices | 3 | 0.39 | 2012 |
| Composing Signatures for Misuse Intrusion Detection System Using Genetic Algorithm in an Offline Environment. | 5 | 0.48 | 2012 |
| Emerging markets: Labor supply in the Indian IT industry | 7 | 0.51 | 2008 |
| Computing the Optimal Amount of Constellation Distortion in OFDM Systems | 2 | 0.47 | 2007 |
| Optimal Peak-To-Average Power Ratio Reduction In Mimo-Ofdm Systems | 5 | 0.58 | 2006 |
| A convex interior-point method for optimal OFDM PAR reduction | 8 | 1.10 | 2005 |
| On the symmetric angle-restricted nearest neighbor problem | 0 | 0.34 | 2004 |
| Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout | 10 | 0.64 | 2000 |
| Clustering algorithms for wireless ad hoc networks | 56 | 6.64 | 2000 |
| Cooperative Multiobjective Decision Support for the Paper Industry | 24 | 2.20 | 1999 |
| The Angular-Metric Traveling Salesman Problem | 30 | 2.03 | 1999 |
| Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings | 31 | 4.00 | 1999 |
| Drawing of Two-Dimensional Irregular Meshes | 0 | 0.34 | 1998 |
| Parallel Searching in Generalized Monge Arrays | 1 | 0.35 | 1997 |
| Efficient routing in optical networks | 42 | 3.77 | 1996 |
| Efficient minimum cost matching and transportation using the quadrangle inequality | 12 | 1.02 | 1995 |
| Optimal parallel sorting in multi-level storage | 26 | 2.25 | 1994 |
| Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications | 16 | 0.81 | 1994 |
| Improved algorithms for economic lot size problems | 147 | 12.47 | 1993 |
| Finding a minimum weight K-link path in graphs with Monge property and applications | 18 | 2.41 | 1993 |
| An improved algorithm for the traveler's problem | 0 | 0.34 | 1993 |
| Consecutive interval query and dynamic programming on intervals | 3 | 1.36 | 1993 |
| Optimal time bounds for some proximity problems in the plane | 12 | 1.08 | 1992 |
| Parallel complexity of computing a maximal set of disjoint paths | 0 | 0.34 | 1992 |
| Multilayer Grid Embeddings for VLSI | 32 | 6.16 | 1991 |
| Deferred data structure for the nearest neighbor problem | 4 | 0.45 | 1991 |
| Optimal tradeoffs for addition on systolic arrays | 2 | 0.43 | 1991 |
| Computing external farthest neighbors for a simple polygon | 9 | 0.65 | 1991 |
| Finding k points with minimum diameter and related problems | 62 | 9.86 | 1991 |
| A Lower Bound on the Area of Permutation Layouts | 11 | 1.60 | 1991 |
| Applications of generalized matrix searching to geometric algorithms | 29 | 2.68 | 1990 |
| Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract) | 7 | 1.77 | 1990 |
| Communication complexity of PRAMs | 129 | 15.30 | 1990 |
| On computing the closest boundary point on the convex hull | 5 | 0.94 | 1989 |
| Parallel Depth-First Search in General Directed Graphs (Preliminary Version) | 2 | 0.41 | 1989 |
| Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version) | 3 | 0.41 | 1989 |
| Communication Complexity of PRAMs (Preliminary Version) | 15 | 8.90 | 1988 |
| The I/O complexity of sorting and related problems | 548 | 49.15 | 1988 |
| Parallel Computational Geometry | 175 | 16.77 | 1988 |
| Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version) | 21 | 2.38 | 1988 |
| Energy Consumption in VLSI Circuits (Preliminary Version) | 1 | 0.40 | 1988 |
| Virtual Memory Algorithms (Preliminary Version) | 2 | 0.55 | 1988 |
| Geometric Applications of a Matrix-Searching Algorithm | 108 | 17.85 | 1987 |
| Hierarchical memory with block transfer | 92 | 11.89 | 1987 |
| The I/O Complexity of Sorting and Related Problems (Extended Abstract) | 1 | 0.64 | 1987 |
