# Alok Aggarwal

According to our database

Collaborative distances:

^{1}, Alok Aggarwal authored at least 91 papers between 1983 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Comparative Analysis of Elliptic Curve Cryptography Based Lightweight Authentication Protocols for RFID-Sensor Integrated MANETs.

Proceedings of the Intelligent Systems Design and Applications, 2018

An Efficient Outlier Detection Mechanism for RFID-Sensor Integrated MANET.

Proceedings of the Intelligent Systems Design and Applications, 2018

2017

A novel lightweight key management scheme for RFID-sensor integrated hierarchical MANET based on internet of things.

IJAIP, 2017

2016

Design and Analysis of Lightweight Trust Mechanism for Secret Data using Lightweight Cryptographic Primitives in MANETs.

I. J. Network Security, 2016

A simulation annealing based anti-collision protocol for RFID tag identification.

Proceedings of the Ninth International Conference on Contemporary Computing, 2016

Simulation and cost analysis of group authentication protocols.

Proceedings of the Ninth International Conference on Contemporary Computing, 2016

Analysis of DCNS anti-collision protocol with contiguous channel allocation.

Proceedings of the Ninth International Conference on Contemporary Computing, 2016

2014

Design and Analysis of Lightweight Trust Mechanism for Accessing Data in MANETs.

TIIS, 2014

Cost and performance analysis of server-centric authentication protocol in supply chain management.

Proceedings of the 2014 IEEE International Symposium on Signal Processing and Information Technology, 2014

2013

Outlier Detection and Treatment for Lightweight Mobile Ad Hoc Networks.

Proceedings of the Quality, Reliability, Security and Robustness in Heterogeneous Networks, 2013

Lightweight trust propagation scheme for resource constraint mobile ad-hoc networks (MANETs).

Proceedings of the Sixth International Conference on Contemporary Computing, 2013

2012

Lightweight Cryptographic Primitives for Mobile Ad Hoc Networks.

Proceedings of the Recent Trends in Computer Networks and Distributed Systems Security, 2012

Efficient Hierarchical Threshold Symmetric Group Key Management Protocol for Mobile Ad Hoc Networks.

Proceedings of the Contemporary Computing - 5th International Conference, 2012

Situation recognition in sensor based environments using concept lattices.

Proceedings of the CUBE International IT Conference & Exhibition, 2012

Composing Signatures for Misuse Intrusion Detection System Using Genetic Algorithm in an Offline Environment.

Proceedings of the Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology (ACITY) July 13-15, 2012, Chennai, India, 2012

2011

Efficient, generalized indoor WiFi GraphSLAM.

Proceedings of the IEEE International Conference on Robotics and Automation, 2011

2008

Emerging markets - Labor supply in the Indian IT industry.

Commun. ACM, 2008

2007

Computing the Optimal Amount of Constellation Distortion in OFDM Systems.

Proceedings of IEEE International Conference on Communications, 2007

2006

Minimizing the Peak-to-Average Power Ratio of OFDM Signals Using Convex Optimization.

IEEE Trans. Signal Processing, 2006

Optimal Peak-to-Average Power Ratio Reduction in MIMO-OFDM Systems.

Proceedings of IEEE International Conference on Communications, 2006

2005

A convex interior-point method for optimal OFDM PAR reduction.

Proceedings of IEEE International Conference on Communications, 2005

2004

On the symmetric angle-restricted nearest neighbor problem.

Inf. Process. Lett., 2004

2003

Minimizing the peak-to-average power ratio of OFDM signals via convex optimization.

Proceedings of the Global Telecommunications Conference, 2003

2000

Compression Tolerant Watermarking for Image Verification.

Proceedings of the 2000 International Conference on Image Processing, 2000

Clustering algorithms for wireless ad hoc networks.

Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000

1999

Cooperative Multiobjective Decision Support for the Paper Industry.

Interfaces, 1999

1998

Drawing of Two-Dimensional Irregular Meshes.

Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997

Parallel Searching in Generalized Monge Arrays.

Algorithmica, 1997

The Angular-Metric Traveling Salesman Problem.

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Efficient Routing in Optical Networks.

J. ACM, 1996

Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout.

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality.

J. Algorithms, 1995

1994

Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications.

Discrete & Computational Geometry, 1994

Optimal Parallel Sorting in Multi-Level Storage.

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Efficient Routing and Scheduling Algorithms for Optical Networks.

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Improved Algorithms for Economic Lot Size Problems.

Operations Research, 1993

An Improved Algorithm for the Traveler's Problem.

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Consecutive Interval Query and Dynamic Programming on Intervals.

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications.

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

Optimal Time Bounds for Some Proximity Problems in the Plane.

Inf. Process. Lett., 1992

Parallel Complexity of Computing a Maximal Set of Disjoint Paths.

Inf. Process. Lett., 1992

Editor's Foreword.

Algorithmica, 1992

Efficient Minimum Cost Matching Using Quadrangle Inequality

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Finding k Points with Minimum Diameter and Related Problems.

J. Algorithms, 1991

Deferred Data Structure for the Nearest Neighbor Problem.

Inf. Process. Lett., 1991

Computing external farthest neighbors for a simple polygon.

Discrete Applied Mathematics, 1991

Multilayer Grid Embeddings for VLSI.

Algorithmica, 1991

A Lower Bound on the Area of Permutation Layouts.

Algorithmica, 1991

Optimal Tradeoffs for Addition on Systolic Arrays.

Algorithmica, 1991

1990

Communication Complexity of PRAMs.

Theor. Comput. Sci., 1990

Parallel Depth-First Search in General Directed Graphs.

SIAM J. Comput., 1990

Computing the Longest Diagonal of a Simple Polygon.

Inf. Process. Lett., 1990

A Tight Lower Bound for the Train Reversal Problem.

Inf. Process. Lett., 1990

Applications of generalized matrix searching to geometric algorithms.

Discrete Applied Mathematics, 1990

Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract)

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Parallel Searching in Generalized Monge Arrays with Applications.

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

1989

Finding Minimal Convex Nested Polygons

Inf. Comput., October, 1989

A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex Polygon.

Inf. Process. Lett., 1989

On Computing the Closest Boundary Point on the Convex Hull.

Inf. Process. Lett., 1989

A Generalized Model for Understanding Evasiveness.

Inf. Process. Lett., 1989

A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.

Discrete & Computational Geometry, 1989

Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version).

Proceedings of the Algorithms and Data Structures, 1989

Parallel Depth-First Search in General Directed Graphs (Preliminary Version)

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

On Communication Latency in PRAM Computations.

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

Fining

*k*Points with Minimum Spanning Trees and Related Problems.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

A random NC algorithm for depth first search.

Combinatorica, 1988

The Input/Output Complexity of Sorting and Related Problems.

Commun. ACM, 1988

Parallel Computational Geometry.

Algorithmica, 1988

Energy Consumption in VLSI Circuits (Preliminary Version)

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Virtual Memory Algorithms (Preliminary Version)

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Communication Complexity of PRAMs (Preliminary Version).

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version)

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks.

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

A Model for Hierarchical Memory

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

A Random NC Algorithm for Depth First Search

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

The I/O Complexity of Sorting and Related Problems (Extended Abstract).

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Hierarchical Memory with Block Transfer

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

Fast Algorithms for Computing the Largest Empty Rectangle.

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Optimal Bounds for Finding Maximum on Array of Processors with

*k*Global Buses.
IEEE Trans. Computers, 1986

An Optimal Algorithm for Finding Minimal Enclosing Triangles.

J. Algorithms, 1986

Fast Computation of the Modality of Polygons.

J. Algorithms, 1986

Geometric Applications of a Matrix Searching Algorithm.

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

Optimal Tradeoffs for Addition on Systolic Arrays (Extended Abstract).

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Minimum area circumscribing Polygons.

The Visual Computer, 1985

Tradeoffs for VLSI Models with Subpolynomial Delay

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Multi-Layer Grid Embeddings

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Parallel Computational Geometry (Extended Abstract)

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Finding minimal convex nested polygons.

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

A Comparative Study of X-Tree, Pyramid and Related Machines

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Period-Time Tradeoffs for VLSI Models with Delay (Preliminary Version)

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983