default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlok Aggarwal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j45]Madam Chakradar, Alok Aggarwal
, Xiaochun Cheng, Anuj Rani, Manoj Kumar, Achyut Shankar:
A Non-invasive Approach to Identify Insulin Resistance with Triglycerides and HDL-c Ratio Using Machine learning. Neural Process. Lett. 55(1): 93-113 (2023)- 2022
- [j44]Amarpreet Singh, Mohammad S. Obaidat, Sandeep Singh, Alok Aggarwal, Kamaljeet Kaur, Balqies Sadoun, Manoj Kumar, Kuei-Fang Hsiao:
A simulation model to reduce the fuel consumption through efficient road traffic modelling. Simul. Model. Pract. Theory 121: 102658 (2022)
2010 – 2019
- 2019
- [c54]Esteban Real, Alok Aggarwal, Yanping Huang, Quoc V. Le:
Regularized Evolution for Image Classifier Architecture Search. AAAI 2019: 4780-4789 - 2018
- [c53]Adarsh Kumar, Alok Aggarwal:
An Efficient Outlier Detection Mechanism for RFID-Sensor Integrated MANET. ISDA (1) 2018: 853-863 - [c52]Adarsh Kumar, Alok Aggarwal:
Comparative Analysis of Elliptic Curve Cryptography Based Lightweight Authentication Protocols for RFID-Sensor Integrated MANETs. ISDA (1) 2018: 934-944 - [i1]Esteban Real, Alok Aggarwal, Yanping Huang, Quoc V. Le:
Regularized Evolution for Image Classifier Architecture Search. CoRR abs/1802.01548 (2018) - 2017
- [j43]Adarsh Kumar, Krishna Gopal, Alok Aggarwal:
A novel lightweight key management scheme for RFID-sensor integrated hierarchical MANET based on internet of things. Int. J. Adv. Intell. Paradigms 9(2/3): 220-245 (2017) - 2016
- [j42]Adarsh Kumar, Krishna Gopal, Alok Aggarwal:
Design and Analysis of Lightweight Trust Mechanism for Secret Data using Lightweight Cryptographic Primitives in MANETs. Int. J. Netw. Secur. 18(1): 1-18 (2016) - [c51]Adarsh Kumar, Alok Aggarwal:
Analysis of DCNS anti-collision protocol with contiguous channel allocation. IC3 2016: 1-7 - [c50]Adarsh Kumar, Krishna Gopal, Alok Aggarwal:
Simulation and cost analysis of group authentication protocols. IC3 2016: 1-7 - [c49]Adarsh Kumar, Mukta Goyal, K. Rajalakshmi, Alok Aggarwal:
A simulation annealing based anti-collision protocol for RFID tag identification. IC3 2016: 1-7 - 2014
- [j41]Adarsh Kumar, Krishna Gopal, Alok Aggarwal:
Design and Analysis of Lightweight Trust Mechanism for Accessing Data in MANETs. KSII Trans. Internet Inf. Syst. 8(3): 1119-1143 (2014) - [c48]Adarsh Kumar, Krishna Gopal, Alok Aggarwal:
Cost and performance analysis of server-centric authentication protocol in supply chain management. ISSPIT 2014: 269-274 - 2013
- [c47]Adarsh Kumar, Krishna Gopal, Alok Aggarwal:
Lightweight trust propagation scheme for resource constraint mobile ad-hoc networks (MANETs). IC3 2013: 421-426 - [c46]Adarsh Kumar, Krishna Gopal, Alok Aggarwal:
Outlier Detection and Treatment for Lightweight Mobile Ad Hoc Networks. QSHINE 2013: 750-763 - 2012
- [c45]Mayank Kumar Goyal, Alok Aggarwal:
Composing Signatures for Misuse Intrusion Detection System Using Genetic Algorithm in an Offline Environment. ACITY (1) 2012: 151-157 - [c44]Sangeeta Mittal, Alok Aggarwal, S. L. Maskara:
Situation recognition in sensor based environments using concept lattices. CUBE 2012: 579-584 - [c43]Adarsh Kumar, Alok Aggarwal, Charu:
Efficient Hierarchical Threshold Symmetric Group Key Management Protocol for Mobile Ad Hoc Networks. IC3 2012: 335-346 - [c42]Adarsh Kumar, Alok Aggarwal:
Lightweight Cryptographic Primitives for Mobile Ad Hoc Networks. SNDS 2012: 240-251 - 2011
- [c41]Joseph Huang, David Millman, Morgan Quigley, David Stavens, Sebastian Thrun, Alok Aggarwal:
Efficient, generalized indoor WiFi GraphSLAM. ICRA 2011: 1038-1043
2000 – 2009
- 2008
- [j40]Alok Aggarwal:
Emerging markets - Labor supply in the Indian IT industry. Commun. ACM 51(12): 21-23 (2008) - 2007
- [c40]Alok Aggarwal, Erik R. Stauffer, Teresa H. Meng:
Computing the Optimal Amount of Constellation Distortion in OFDM Systems. ICC 2007: 2918-2923 - 2006
- [j39]Alok Aggarwal, Teresa H. Meng:
Minimizing the Peak-to-Average Power Ratio of OFDM Signals Using Convex Optimization. IEEE Trans. Signal Process. 54(8): 3099-3110 (2006) - [c39]Alok Aggarwal, Erik R. Stauffer, Teresa H. Meng:
Optimal Peak-to-Average Power Ratio Reduction in MIMO-OFDM Systems. ICC 2006: 3094-3099 - 2005
- [c38]Alok Aggarwal, Teresa H. Meng:
A convex interior-point method for optimal OFDM PAR reduction. ICC 2005: 1985-1990 - 2004
- [j38]Alok Aggarwal, Youngcheul Wee:
On the symmetric angle-restricted nearest neighbor problem. Inf. Process. Lett. 92(3): 121-126 (2004) - 2003
- [c37]Alok Aggarwal, Teresa H. Meng:
Minimizing the peak-to-average power ratio of OFDM signals via convex optimization. GLOBECOM 2003: 2385-2389 - 2000
- [j37]Alok Aggarwal, Jon M. Kleinberg, David P. Williamson:
Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. SIAM J. Comput. 29(4): 1321-1333 (2000) - [c36]Lakshmi Ramachandran, Manika Kapoor, Abhinanda Sarkar, Alok Aggarwal:
Clustering algorithms for wireless ad hoc networks. DIAL-M 2000: 54-63 - [c35]Harpal S. Bassali, Jatin Chhugani, Saurabh Agarwal, Alok Aggarwal, Pradeep Dubey:
Compression Tolerant Watermarking for Image Verification. ICIP 2000: 430-433
1990 – 1999
- 1999
- [j36]Sesh Murthy, Rama Akkiraju, Richard Goodwin, Pinar Keskinocak, John Rachlin, Frederick Y. Wu, James Yeh, Robert Fuhrer, Santhosh Kumaran, Alok Aggarwal, Martin C. Sturzenbecker, Ranga Jayaraman, Robert Daigle:
Cooperative Multiobjective Decision Support for the Paper Industry. Interfaces 29(5): 5-30 (1999) - [j35]Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber:
The Angular-Metric Traveling Salesman Problem. SIAM J. Comput. 29(3): 697-711 (1999) - [e4]Alok Aggarwal, C. Pandu Rangan:
Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings. Lecture Notes in Computer Science 1741, Springer 1999, ISBN 3-540-66916-7 [contents] - 1998
- [j34]Alok Aggarwal, Takeshi Tokuyama:
Consecutive Interval Query and Dynamic Programming on Intervals. Discret. Appl. Math. 85(1): 1-24 (1998) - [c34]Alok Aggarwal, S. Rao Kosaraju, Mihai Pop:
Drawing of Two-Dimensional Irregular Meshes. GD 1998: 1-14 - 1997
- [j33]Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen:
Parallel Searching in Generalized Monge Arrays. Algorithmica 19(3): 291-317 (1997) - [c33]Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber:
The Angular-Metric Traveling Salesman Problem. SODA 1997: 221-229 - 1996
- [j32]Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan:
Efficient Routing in Optical Networks. J. ACM 43(6): 973-1001 (1996) - [c32]Alok Aggarwal, Jon M. Kleinberg, David P. Williamson:
Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. STOC 1996: 585-594 - 1995
- [j31]Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber:
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. J. Algorithms 19(1): 116-143 (1995) - [j30]Alok Aggarwal, Takeshi Tokuyama:
An Improved Algorithm for the Traveler's Problem. J. Algorithms 19(2): 318-330 (1995) - 1994
- [j29]Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama:
Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications. Discret. Comput. Geom. 12: 263-280 (1994) - [c31]Alok Aggarwal, Amotz Bar-Noy, Don Coppersmith, Rajiv Ramaswami, Baruch Schieber, Madhu Sudan:
Efficient Routing and Scheduling Algorithms for Optical Networks. SODA 1994: 412-423 - [c30]Alok Aggarwal, C. Greg Plaxton:
Optimal Parallel Sorting in Multi-Level Storage. SODA 1994: 659-668 - 1993
- [j28]Alok Aggarwal, James K. Park:
Improved Algorithms for Economic Lot Size Problems. Oper. Res. 41(3): 549-571 (1993) - [c29]Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama:
Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. SCG 1993: 189-197 - [c28]Alok Aggarwal, Takeshi Tokuyama:
Consecutive Interval Query and Dynamic Programming on Intervals. ISAAC 1993: 466-475 - [c27]Alok Aggarwal, Takeshi Tokuyama:
An Improved Algorithm for the Traveler's Problem. ISAAC 1993: 476-485 - [e3]S. Rao Kosaraju, David S. Johnson, Alok Aggarwal:
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA. ACM 1993, ISBN 0-89791-591-7 [contents] - 1992
- [j27]Alok Aggarwal:
Editor's Foreword. Algorithmica 7(1): 1-2 (1992) - [j26]Alok Aggarwal:
Parallel Complexity of Computing a Maximal Set of Disjoint Paths. Inf. Process. Lett. 41(3): 149-151 (1992) - [j25]Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari:
Optimal Time Bounds for Some Proximity Problems in the Plane. Inf. Process. Lett. 42(1): 55-60 (1992) - [c26]Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber:
Efficient Minimum Cost Matching Using Quadrangle Inequality. FOCS 1992: 583-592 - 1991
- [j24]Alok Aggarwal, J. Lawrence Carter, S. Rao Kosaraju:
Optimal Tradeoffs for Addition on Systolic Arrays. Algorithmica 6(1): 49-71 (1991) - [j23]Alok Aggarwal, Maria M. Klawe, Peter W. Shor:
Multilayer Grid Embeddings for VLSI. Algorithmica 6(1): 129-151 (1991) - [j22]Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson:
A Lower Bound on the Area of Permutation Layouts. Algorithmica 6(2): 241-255 (1991) - [j21]Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri:
Computing external farthest neighbors for a simple polygon. Discret. Appl. Math. 31(2): 97-111 (1991) - [j20]Alok Aggarwal, Prabhakar Raghavan:
Deferred Data Structure for the Nearest Neighbor Problem. Inf. Process. Lett. 40(3): 119-122 (1991) - [j19]Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri:
Finding k Points with Minimum Diameter and Related Problems. J. Algorithms 12(1): 38-56 (1991) - [e2]Alok Aggarwal:
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 28-30 January 1991, San Francisco, California, USA. ACM/SIAM 1991, ISBN 0-89791-376-0 [contents] - 1990
- [j18]Alok Aggarwal, Maria M. Klawe:
Applications of generalized matrix searching to geometric algorithms. Discret. Appl. Math. 27(1-2): 3-23 (1990) - [j17]Alok Aggarwal, Subhash Suri:
Computing the Longest Diagonal of a Simple Polygon. Inf. Process. Lett. 35(1): 13-18 (1990) - [j16]Alok Aggarwal, Frank Thomson Leighton:
A Tight Lower Bound for the Train Reversal Problem. Inf. Process. Lett. 35(6): 301-304 (1990) - [j15]Alok Aggarwal, Richard J. Anderson, Ming-Yang Kao:
Parallel Depth-First Search in General Directed Graphs. SIAM J. Comput. 19(2): 397-409 (1990) - [j14]Alok Aggarwal, Ashok K. Chandra, Marc Snir:
Communication Complexity of PRAMs. Theor. Comput. Sci. 71(1): 3-28 (1990) - [c25]Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen:
Parallel Searching in Generalized Monge Arrays with Applications. SPAA 1990: 259-268 - [c24]Alok Aggarwal, Mark Hansen, Frank Thomson Leighton:
Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract). STOC 1990: 331-340
1980 – 1989
- 1989
- [j13]Alok Aggarwal, Leonidas J. Guibas, James B. Saxe, Peter W. Shor:
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. Discret. Comput. Geom. 4: 591-604 (1989) - [j12]Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap:
Finding Minimal Convex Nested Polygons. Inf. Comput. 83(1): 98-110 (1989) - [j11]Alok Aggarwal, Don Coppersmith, Daniel J. Kleitman:
A Generalized Model for Understanding Evasiveness. Inf. Process. Lett. 30(4): 205-208 (1989) - [j10]Alok Aggarwal, Dina Kravets:
A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex Polygon. Inf. Process. Lett. 31(1): 17-20 (1989) - [j9]Alok Aggarwal, Michael Hawrylycz:
On Computing the Closest Boundary Point on the Convex Hull. Inf. Process. Lett. 31(6): 311-314 (1989) - [c23]Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri:
Fining k Points with Minimum Spanning Trees and Related Problems. SCG 1989: 283-291 - [c22]Alok Aggarwal, Ashok K. Chandra, Marc Snir:
On Communication Latency in PRAM Computations. SPAA 1989: 11-21 - [c21]Alok Aggarwal, Richard J. Anderson, Ming-Yang Kao:
Parallel Depth-First Search in General Directed Graphs (Preliminary Version). STOC 1989: 297-308 - [c20]Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri:
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). WADS 1989: 115-134 - 1988
- [j8]Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap:
Parallel Computational Geometry. Algorithmica 3: 293-327 (1988) - [j7]Alok Aggarwal, Jeffrey Scott Vitter:
The Input/Output Complexity of Sorting and Related Problems. Commun. ACM 31(9): 1116-1127 (1988) - [j6]Alok Aggarwal, Richard J. Anderson:
A random NC algorithm for depth first search. Comb. 8(1): 1-12 (1988) - [c19]Alok Aggarwal, Ming-Deh A. Huang:
Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks. AWOC 1988: 339-350 - [c18]Alok Aggarwal, James K. Park:
Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version). FOCS 1988: 497-512 - [c17]Alok Aggarwal, Ashok K. Chandra:
Communication Complexity of PRAMs (Preliminary Version). ICALP 1988: 1-17 - [c16]Alok Aggarwal, Ashok K. Chandra:
Virtual Memory Algorithms (Preliminary Version). STOC 1988: 173-185 - [c15]Alok Aggarwal, Ashok K. Chandra, Prabhakar Raghavan:
Energy Consumption in VLSI Circuits (Preliminary Version). STOC 1988: 205-216 - 1987
- [j5]Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber:
Geometric Applications of a Matrix-Searching Algorithm. Algorithmica 2: 195-208 (1987) - [c14]Alok Aggarwal, Subhash Suri:
Fast Algorithms for Computing the Largest Empty Rectangle. SCG 1987: 278-290 - [c13]Alok Aggarwal, Ashok K. Chandra, Marc Snir:
Hierarchical Memory with Block Transfer. FOCS 1987: 204-216 - [c12]Alok Aggarwal, Jeffrey Scott Vitter:
The I/O Complexity of Sorting and Related Problems (Extended Abstract). ICALP 1987: 467-478 - [c11]Alok Aggarwal, Leonidas J. Guibas, James B. Saxe, Peter W. Shor:
A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. STOC 1987: 39-45 - [c10]Alok Aggarwal, Bowen Alpern, Ashok K. Chandra, Marc Snir:
A Model for Hierarchical Memory. STOC 1987: 305-314 - [c9]Alok Aggarwal, Richard J. Anderson:
A Random NC Algorithm for Depth First Search. STOC 1987: 325-334 - 1986
- [j4]Joseph O'Rourke, Alok Aggarwal, Sanjeev R. Maddila, Michael Baldwin:
An Optimal Algorithm for Finding Minimal Enclosing Triangles. J. Algorithms 7(2): 258-269 (1986) - [j3]Alok Aggarwal, Robert Melville:
Fast Computation of the Modality of Polygons. J. Algorithms 7(3): 369-381 (1986) - [j2]Alok Aggarwal:
Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses. IEEE Trans. Computers 35(1): 62-64 (1986) - [c8]Alok Aggarwal, S. Rao Kosaraju:
Optimal Tradeoffs for Addition on Systolic Arrays (Extended Abstract). Aegean Workshop on Computing 1986: 57-69 - [c7]Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber:
Geometric Applications of a Matrix Searching Algorithm. SCG 1986: 285-292 - [e1]Alok Aggarwal:
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986. ACM 1986, ISBN 0-89791-194-6 [contents] - 1985
- [j1]Alok Aggarwal, Jyun-Sheng Chang, Chee-Keng Yap:
Minimum area circumscribing Polygons. Vis. Comput. 1(2): 112-117 (1985) - [c6]Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap:
Finding minimal convex nested polygons. SCG 1985: 296-304 - [c5]Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson:
Multi-Layer Grid Embeddings. FOCS 1985: 186-196 - [c4]Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap:
Parallel Computational Geometry (Extended Abstract). FOCS 1985: 468-477 - [c3]Alok Aggarwal:
Tradeoffs for VLSI Models with Subpolynomial Delay. STOC 1985: 59-68 - 1984
- [c2]Alok Aggarwal:
A Comparative Study of X-Tree, Pyramid and Related Machines. FOCS 1984: 89-99 - 1983
- [c1]Alok Aggarwal:
Period-Time Tradeoffs for VLSI Models with Delay (Preliminary Version). FOCS 1983: 372-382
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
