Alok Aggarwal

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
43Efficient, generalized indoor WiFi GraphSLAM. Joseph Huang, David Millman, Morgan Quigley, David Stavens, Sebastian Thrun, Alok Aggarwal. ICRA 2011, 1038-1043. Web SearchBibTeXDownload
2000
42Compression Tolerant Watermarking for Image Verification. Harpal S. Bassali, Jatin Chhugani, Saurabh Agarwal, Alok Aggarwal, Pradeep Dubey. ICIP 2000. Web SearchBibTeX
41Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. Alok Aggarwal, Jon M. Kleinberg, David P. Williamson. SIAM J. Comput. (29): 1321-1333 (2000). Web SearchBibTeXDownload
1999
40The Angular-Metric Traveling Salesman Problem. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber. SIAM J. Comput. (29): 697-711 (1999). Cited by 24Web SearchBibTeXDownload
1998
39Consecutive Interval Query and Dynamic Programming on Intervals. Alok Aggarwal, Takeshi Tokuyama. Discrete Applied Mathematics (85): 1-24 (1998). Web SearchBibTeXDownload
1997
38The Angular-Metric Traveling Salesman Problem. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber. SODA 1997, 221-229. Cited by 24Web SearchBibTeXDownload
1996
37Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. Alok Aggarwal, Jon M. Kleinberg, David P. Williamson. STOC 1996, 585-594. Web SearchBibTeXDownload
1995
36An Improved Algorithm for the Traveler's Problem. Alok Aggarwal, Takeshi Tokuyama. J. Algorithms (19): 318-330 (1995). Web SearchBibTeXDownload
35Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber. J. Algorithms (19): 116-143 (1995). Web SearchBibTeXDownload
1994
34Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications. Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama. Discrete & Computational Geometry (12): 263-280 (1994). Web SearchBibTeXDownload
1993
33Consecutive Interval Query and Dynamic Programming on Intervals. Alok Aggarwal, Takeshi Tokuyama. ISAAC 1993, 466-475. Web SearchBibTeXDownload
32An Improved Algorithm for the Traveler's Problem. Alok Aggarwal, Takeshi Tokuyama. ISAAC 1993, 476-485. Web SearchBibTeXDownload
31Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications. Alok Aggarwal, Baruch Schieber, Takeshi Tokuyama. Symposium on Computational Geometry 1993, 189-197. Web SearchBibTeXDownload
1992
30Editor's Foreword. Fan Chung Graham, Michael A. Palis, David S. L. Wei. Algorithmica (7): 1-2 (1992). Web SearchBibTeXDownload
29Efficient Minimum Cost Matching Using Quadrangle Inequality. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber. FOCS 1992, 583-592. Web SearchBibTeXDownload
28Optimal Time Bounds for Some Proximity Problems in the Plane. Alok Aggarwal, Herbert Edelsbrunner, Prabhakar Raghavan, Prasoon Tiwari. Inf. Process. Lett. (42): 55-60 (1992). Cited by 21Web SearchBibTeXDownload
1991
27Computing external farthest neighbors for a simple polygon. Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri. Discrete Applied Mathematics (31): 97-111 (1991). Web SearchBibTeXDownload
26Deferred Data Structure for the Nearest Neighbor Problem. Alok Aggarwal, Prabhakar Raghavan. Inf. Process. Lett. (40): 119-122 (1991). Cited by 4Web SearchBibTeXDownload
25Finding k Points with Minimum Diameter and Related Problems. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri. J. Algorithms (12): 38-56 (1991). Web SearchBibTeXDownload
1990
24Computing the Longest Diagonal of a Simple Polygon. Alok Aggarwal, Subhash Suri. Inf. Process. Lett. (35): 13-18 (1990). Web SearchBibTeXDownload
23A Tight Lower Bound for the Train Reversal Problem. Alok Aggarwal, Frank Thomson Leighton. Inf. Process. Lett. (35): 301-304 (1990). Web SearchBibTeXDownload
22Parallel Depth-First Search in General Directed Graphs. Alok Aggarwal, Richard J. Anderson, Ming-Yang Kao. SIAM J. Comput. (19): 397-409 (1990). Web SearchBibTeXDownload
21Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract). Alok Aggarwal, Mark Hansen, Frank Thomson Leighton. STOC 1990, 331-340. Web SearchBibTeXDownload
20Communication Complexity of PRAMs. Alok Aggarwal, Ashok K. Chandra, Marc Snir. Theor. Comput. Sci. (71): 3-28 (1990). Web SearchBibTeXDownload
1989
19Finding Minimal Convex Nested Polygons. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap. Inf. Comput. (83): 98-110 (1989). Web SearchBibTeXDownload
18On Communication Latency in PRAM Computations. Alok Aggarwal, Ashok K. Chandra, Marc Snir. SPAA 1989, 11-21. Web SearchBibTeXDownload
17Parallel Depth-First Search in General Directed Graphs (Preliminary Version). Alok Aggarwal, Richard J. Anderson, Ming-Yang Kao. STOC 1989, 297-308. Web SearchBibTeXDownload
16Fining k Points with Minimum Spanning Trees and Related Problems. Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri. Symposium on Computational Geometry 1989, 283-291. Web SearchBibTeXDownload
15Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri. WADS 1989, 115-134. Web SearchBibTeX
1988
14Parallel Computational Geometry. Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap. Algorithmica (3): 293-327 (1988). Web SearchBibTeXDownload
13The Input/Output Complexity of Sorting and Related Problems. Alok Aggarwal, Jeffrey Scott Vitter. Commun. ACM (31): 1116-1127 (1988). Web SearchBibTeXDownload
12Communication Complexity of PRAMs (Preliminary Version). Alok Aggarwal, Ashok K. Chandra. ICALP 1988, 1-17. Web SearchBibTeXDownload
11Energy Consumption in VLSI Circuits (Preliminary Version). Alok Aggarwal, Ashok K. Chandra, Prabhakar Raghavan. STOC 1988, 205-216. Cited by 16Web SearchBibTeXDownload
10Virtual Memory Algorithms (Preliminary Version). Alok Aggarwal, Ashok K. Chandra. STOC 1988, 173-185. Web SearchBibTeXDownload
1987
9Geometric Applications of a Matrix-Searching Algorithm. Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber. Algorithmica (2): 195-208 (1987). Web SearchBibTeXDownload
8Hierarchical Memory with Block Transfer. Alok Aggarwal, Ashok K. Chandra, Marc Snir. FOCS 1987, 204-216. Web SearchBibTeXDownload
7The I/O Complexity of Sorting and Related Problems (Extended Abstract). Alok Aggarwal, Jeffrey Scott Vitter. ICALP 1987, 467-478. Web SearchBibTeXDownload
6A Model for Hierarchical Memory. Alok Aggarwal, Bowen Alpern, Ashok K. Chandra, Marc Snir. STOC 1987, 305-314. Web SearchBibTeXDownload
5Fast Algorithms for Computing the Largest Empty Rectangle. Alok Aggarwal, Subhash Suri. Symposium on Computational Geometry 1987, 278-290. Web SearchBibTeXDownload
1986
4Geometric Applications of a Matrix Searching Algorithm. Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber. Symposium on Computational Geometry 1986, 285-292. Web SearchBibTeXDownload
1985
3Parallel Computational Geometry (Extended Abstract). Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap. FOCS 1985, 468-477. Web SearchBibTeXDownload
2Finding minimal convex nested polygons. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap. Symposium on Computational Geometry 1985, 296-304. Web SearchBibTeXDownload
1Minimum area circumscribing Polygons. Alok Aggarwal, Jyun-Sheng Chang, Chee-Keng Yap. The Visual Computer (1): 112-117 (1985). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research