The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alok Aggarwal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  70. Finding minimal convex nested polygons. [Citation Graph (, )][DBLP]


  71. Computing the Optimal Amount of Constellation Distortion in OFDM Systems. [Citation Graph (, )][DBLP]


  72. Emerging markets - Labor supply in the Indian IT industry. [Citation Graph (, )][DBLP]


  73. Computing external farthest neighbors for a simple polygon. [Citation Graph (, )][DBLP]


  74. Applications of generalized matrix searching to geometric algorithms. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002