| 2008 |
|---|
| 74 | EE | Alok Aggarwal:
Emerging markets - Labor supply in the Indian IT industry.
Commun. ACM 51(12): 21-23 (2008) |
| 2007 |
|---|
| 73 | EE | Alok Aggarwal,
Erik R. Stauffer,
Teresa H. Meng:
Computing the Optimal Amount of Constellation Distortion in OFDM Systems.
ICC 2007: 2918-2923 |
| 2004 |
|---|
| 72 | EE | Alok Aggarwal,
Youngcheul Wee:
On the symmetric angle-restricted nearest neighbor problem.
Inf. Process. Lett. 92(3): 121-126 (2004) |
| 2000 |
|---|
| 71 | EE | Lakshmi Ramachandran,
Manika Kapoor,
Abhinanda Sarkar,
Alok Aggarwal:
Clustering algorithms for wireless ad hoc networks.
DIAL-M 2000: 54-63 |
| 70 | | Harpal S. Bassali,
Jatin Chhugani,
Saurabh Agarwal,
Alok Aggarwal,
Pradeep Dubey:
Compression Tolerant Watermarking for Image Verification.
ICIP 2000 |
| 69 | | 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) |
| 1999 |
|---|
| 68 | | Alok Aggarwal,
C. Pandu Rangan:
Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings
Springer 1999 |
| 67 | | Alok Aggarwal,
Don Coppersmith,
Sanjeev Khanna,
Rajeev Motwani,
Baruch Schieber:
The Angular-Metric Traveling Salesman Problem.
SIAM J. Comput. 29(3): 697-711 (1999) |
| 1998 |
|---|
| 66 | EE | Alok Aggarwal,
S. Rao Kosaraju,
Mihai Pop:
Drawing of Two-Dimensional Irregular Meshes.
Graph Drawing 1998: 1-14 |
| 65 | EE | Alok Aggarwal,
Takeshi Tokuyama:
Consecutive Interval Query and Dynamic Programming on Intervals.
Discrete Applied Mathematics 85(1): 1-24 (1998) |
| 1997 |
|---|
| 64 | | Alok Aggarwal,
Don Coppersmith,
Sanjeev Khanna,
Rajeev Motwani,
Baruch Schieber:
The Angular-Metric Traveling Salesman Problem.
SODA 1997: 221-229 |
| 63 | | Alok Aggarwal,
Dina Kravets,
James K. Park,
Sandeep Sen:
Parallel Searching in Generalized Monge Arrays.
Algorithmica 19(3): 291-317 (1997) |
| 1996 |
|---|
| 62 | EE | 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 |
| 61 | EE | 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) |
| 1995 |
|---|
| 60 | | 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) |
| 59 | | Alok Aggarwal,
Takeshi Tokuyama:
An Improved Algorithm for the Traveler's Problem.
J. Algorithms 19(2): 318-330 (1995) |
| 1994 |
|---|
| 58 | | 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 |
| 57 | | Alok Aggarwal,
C. Greg Plaxton:
Optimal Parallel Sorting in Multi-Level Storage.
SODA 1994: 659-668 |
| 56 | | Alok Aggarwal,
Baruch Schieber,
Takeshi Tokuyama:
Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications.
Discrete & Computational Geometry 12: 263-280 (1994) |
| 1993 |
|---|
| 55 | | Alok Aggarwal,
Takeshi Tokuyama:
Consecutive Interval Query and Dynamic Programming on Intervals.
ISAAC 1993: 466-475 |
| 54 | | Alok Aggarwal,
Takeshi Tokuyama:
An Improved Algorithm for the Traveler's Problem.
ISAAC 1993: 476-485 |
| 53 | EE | Alok Aggarwal,
Baruch Schieber,
Takeshi Tokuyama:
Finding a Minimum Weight K-Link Path in Graphs with Monge Property and Applications.
Symposium on Computational Geometry 1993: 189-197 |
| 1992 |
|---|
| 52 | | Alok Aggarwal,
Amotz Bar-Noy,
Samir Khuller,
Dina Kravets,
Baruch Schieber:
Efficient Minimum Cost Matching Using Quadrangle Inequality
FOCS 1992: 583-592 |
| 51 | | Alok Aggarwal:
Editor's Foreword.
Algorithmica 7(1): 1-2 (1992) |
| 50 | | Alok Aggarwal:
Parallel Complexity of Computing a Maximal Set of Disjoint Paths.
Inf. Process. Lett. 41(3): 149-151 (1992) |
| 49 | | 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) |
| 1991 |
|---|
| 48 | | Alok Aggarwal,
Maria M. Klawe,
Peter W. Shor:
Multilayer Grid Embeddings for VLSI.
Algorithmica 6(1): 129-151 (1991) |
| 47 | | Alok Aggarwal,
J. Lawrence Carter,
S. Rao Kosaraju:
Optimal Tradeoffs for Addition on Systolic Arrays.
Algorithmica 6(1): 49-71 (1991) |
| 46 | | 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) |
| 45 | EE | Pankaj K. Agarwal,
Alok Aggarwal,
Boris Aronov,
S. Rao Kosaraju,
Baruch Schieber,
Subhash Suri:
Computing external farthest neighbors for a simple polygon.
Discrete Applied Mathematics 31(2): 97-111 (1991) |
| 44 | | Alok Aggarwal,
Prabhakar Raghavan:
Deferred Data Structure for the Nearest Neighbor Problem.
Inf. Process. Lett. 40(3): 119-122 (1991) |
| 43 | | Alok Aggarwal,
Hiroshi Imai,
Naoki Katoh,
Subhash Suri:
Finding k Points with Minimum Diameter and Related Problems.
J. Algorithms 12(1): 38-56 (1991) |
| 1990 |
|---|
| 42 | EE | Alok Aggarwal,
Dina Kravets,
James K. Park,
Sandeep Sen:
Parallel Searching in Generalized Monge Arrays with Applications.
SPAA 1990: 259-268 |
| 41 | | Alok Aggarwal,
Mark Hansen,
Frank Thomson Leighton:
Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract)
STOC 1990: 331-340 |
| 40 | EE | Alok Aggarwal,
Maria M. Klawe:
Applications of generalized matrix searching to geometric algorithms.
Discrete Applied Mathematics 27(1-2): 3-23 (1990) |
| 39 | | Alok Aggarwal,
Subhash Suri:
Computing the Longest Diagonal of a Simple Polygon.
Inf. Process. Lett. 35(1): 13-18 (1990) |
| 38 | | Alok Aggarwal,
Frank Thomson Leighton:
A Tight Lower Bound for the Train Reversal Problem.
Inf. Process. Lett. 35(6): 301-304 (1990) |
| 37 | | Alok Aggarwal,
Richard J. Anderson,
Ming-Yang Kao:
Parallel Depth-First Search in General Directed Graphs.
SIAM J. Comput. 19(2): 397-409 (1990) |
| 36 | | Alok Aggarwal,
Ashok K. Chandra,
Marc Snir:
Communication Complexity of PRAMs.
Theor. Comput. Sci. 71(1): 3-28 (1990) |
| 1989 |
|---|
| 35 | EE | Alok Aggarwal,
Ashok K. Chandra,
Marc Snir:
On Communication Latency in PRAM Computations.
SPAA 1989: 11-21 |
| 34 | | Alok Aggarwal,
Richard J. Anderson,
Ming-Yang Kao:
Parallel Depth-First Search in General Directed Graphs (Preliminary Version)
STOC 1989: 297-308 |
| 33 | EE | Alok Aggarwal,
Hiroshi Imai,
Naoki Katoh,
Subhash Suri:
Fining k Points with Minimum Spanning Trees and Related Problems.
Symposium on Computational Geometry 1989: 283-291 |
| 32 | | Alok Aggarwal,
Shlomo Moran,
Peter W. Shor,
Subhash Suri:
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version).
WADS 1989: 115-134 |
| 31 | | Alok Aggarwal,
Leonidas J. Guibas,
James B. Saxe,
Peter W. Shor:
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
Discrete & Computational Geometry 4: 591-604 (1989) |
| 30 | | Alok Aggarwal,
Heather Booth,
Joseph O'Rourke,
Subhash Suri,
Chee-Keng Yap:
Finding Minimal Convex Nested Polygons
Inf. Comput. 83(1): 98-110 (1989) |
| 29 | | Alok Aggarwal,
Don Coppersmith,
Daniel J. Kleitman:
A Generalized Model for Understanding Evasiveness.
Inf. Process. Lett. 30(4): 205-208 (1989) |
| 28 | | 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) |
| 27 | | Alok Aggarwal,
Michael Hawrylycz:
On Computing the Closest Boundary Point on the Convex Hull.
Inf. Process. Lett. 31(6): 311-314 (1989) |
| 1988 |
|---|
| 26 | | Alok Aggarwal,
Ming-Deh A. Huang:
Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks.
AWOC 1988: 339-350 |
| 25 | | Alok Aggarwal,
James K. Park:
Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version)
FOCS 1988: 497-512 |
| 24 | | Alok Aggarwal,
Ashok K. Chandra:
Communication Complexity of PRAMs (Preliminary Version).
ICALP 1988: 1-17 |
| 23 | | Alok Aggarwal,
Ashok K. Chandra:
Virtual Memory Algorithms (Preliminary Version)
STOC 1988: 173-185 |
| 22 | | Alok Aggarwal,
Ashok K. Chandra,
Prabhakar Raghavan:
Energy Consumption in VLSI Circuits (Preliminary Version)
STOC 1988: 205-216 |
| 21 | | Alok Aggarwal,
Bernard Chazelle,
Leonidas J. Guibas,
Colm Ó'Dúnlaing,
Chee-Keng Yap:
Parallel Computational Geometry.
Algorithmica 3: 293-327 (1988) |
| 20 | | Alok Aggarwal,
Richard J. Anderson:
A random NC algorithm for depth first search.
Combinatorica 8(1): 1-12 (1988) |
| 19 | EE | Alok Aggarwal,
Jeffrey Scott Vitter:
The Input/Output Complexity of Sorting and Related Problems.
Commun. ACM 31(9): 1116-1127 (1988) |
| 1987 |
|---|
| 18 | | Alok Aggarwal,
Ashok K. Chandra,
Marc Snir:
Hierarchical Memory with Block Transfer
FOCS 1987: 204-216 |
| 17 | | Alok Aggarwal,
Jeffrey Scott Vitter:
The I/O Complexity of Sorting and Related Problems (Extended Abstract).
ICALP 1987: 467-478 |
| 16 | | Alok Aggarwal,
Bowen Alpern,
Ashok K. Chandra,
Marc Snir:
A Model for Hierarchical Memory
STOC 1987: 305-314 |
| 15 | | Alok Aggarwal,
Richard J. Anderson:
A Random NC Algorithm for Depth First Search
STOC 1987: 325-334 |
| 14 | | 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 |
| 13 | EE | Alok Aggarwal,
Subhash Suri:
Fast Algorithms for Computing the Largest Empty Rectangle.
Symposium on Computational Geometry 1987: 278-290 |
| 12 | | 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) |
| 1986 |
|---|
| 11 | | Alok Aggarwal,
S. Rao Kosaraju:
Optimal Tradeoffs for Addition on Systolic Arrays (Extended Abstract).
Aegean Workshop on Computing 1986: 57-69 |
| 10 | EE | Alok Aggarwal,
Maria M. Klawe,
Shlomo Moran,
Peter W. Shor,
Robert E. Wilber:
Geometric Applications of a Matrix Searching Algorithm.
Symposium on Computational Geometry 1986: 285-292 |
| 9 | | Alok Aggarwal:
Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses.
IEEE Trans. Computers 35(1): 62-64 (1986) |
| 8 | | 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) |
| 7 | | Alok Aggarwal,
Robert Melville:
Fast Computation of the Modality of Polygons.
J. Algorithms 7(3): 369-381 (1986) |
| 1985 |
|---|
| 6 | | Alok Aggarwal,
Maria M. Klawe,
David Lichtenstein,
Nathan Linial,
Avi Wigderson:
Multi-Layer Grid Embeddings
FOCS 1985: 186-196 |
| 5 | | Alok Aggarwal,
Bernard Chazelle,
Leonidas J. Guibas,
Colm Ó'Dúnlaing,
Chee-Keng Yap:
Parallel Computational Geometry (Extended Abstract)
FOCS 1985: 468-477 |
| 4 | | Alok Aggarwal:
Tradeoffs for VLSI Models with Subpolynomial Delay
STOC 1985: 59-68 |
| 3 | | Alok Aggarwal,
Jyun-Sheng Chang,
Chee-Keng Yap:
Minimum area circumscribing Polygons.
The Visual Computer 1(2): 112-117 (1985) |
| 1984 |
|---|
| 2 | | Alok Aggarwal:
A Comparative Study of X-Tree, Pyramid and Related Machines
FOCS 1984: 89-99 |
| 1983 |
|---|
| 1 | | Alok Aggarwal:
Period-Time Tradeoffs for VLSI Models with Delay (Preliminary Version)
FOCS 1983: 372-382 |
