Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Prosenjit Gupta
2010 – today
- 2013
[c27]Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan: Counting Maximal Points in a Query Orthogonal Rectangle. WALCOM 2013: 65-76- 2012
- [c26]Ananda Swarup Das, Prosenjit Gupta, Anil Kishore Kalavagattu, Jatin Agarwal, Kannan Srinathan, Kishore Kothapalli: Range Aggregate Maximal Points in the Plane. WALCOM 2012: 52-63
- 2011
- [j19]Saladi Rahul, Prosenjit Gupta, K. S. Rajan: Data Structures for Range-Aggregation over Categories. Int. J. Found. Comput. Sci. 22(7): 1707-1728 (2011)
- [j18]Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan: Data Structures for Extension Violations in a Query Range. J. Math. Model. Algorithms 10(1): 79-107 (2011)
- [c25]Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan: Detecting VLSI Layout, Connectivity Errors in a Query Window. CCCG 2011
- [c24]Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan, Kishore Kothapalli: Finding Maximum Density Axes Parallel Regions for Weighted Point Sets. CCCG 2011
- [c23]Saladi Rahul, Prosenjit Gupta, Ravi Janardan, K. S. Rajan: Efficient Top-k Queries for Orthogonal Ranges. WALCOM 2011: 110-121
- 2010
- [c22]Saladi Rahul, Haritha Bellam, Prosenjit Gupta, Krishnan Rajan: Range aggregate structures for colored geometric objects. CCCG 2010: 249-252
2000 – 2009
- 2009
- [j17]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Non-Intersection Queries on Aggregated Geometric Data. Int. J. Comput. Geometry Appl. 19(6): 479-506 (2009)
- [j16]Akash Agrawal, Prosenjit Gupta: Incremental analysis of large VLSI Layouts. Integration 42(2): 203-216 (2009)
- [j15]Yokesh Kumar, Prosenjit Gupta: External memory layout vs. schematic. ACM Trans. Design Autom. Electr. Syst. 14(2) (2009)
- [c21]Ananda Swarup Das, Prosenjit Gupta, Kannan Srinathan: Data Structures for Reporting Extension Violations in a Query Range. CCCG 2009: 129-132
- [c20]Saladi Rahul, Prosenjit Gupta, K. S. Rajan: Data Structures for Range Aggregation by Categories. CCCG 2009: 133-136
- 2008
- [c19]Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid: Data Structures for Range-Aggregate Extent Queries. CCCG 2008
- [c18]Yokesh Kumar, Ravi Janardan, Prosenjit Gupta: Efficient algorithms for reverse proximity query problems. GIS 2008: 39
- 2007
- [c17]Yokesh Kumar, Prosenjit Gupta: Reducing EPL Alignment Errors for Large VLSI Layouts. ISQED 2007: 233-238
- [c16]Yokesh Kumar, Prosenjit Gupta: An External Memory Circuit Validation Algorithm for Large VLSI Layouts. ISVLSI 2007: 510-511
- 2006
- [j14]Vamsikrishna Kundeti, Prosenjit Gupta: Optimal Algorithms for Some Polygon Enclosure Problems for VLSI Layout Analysis. J. Math. Model. Algorithms 5(3): 259-271 (2006)
- [j13]Prosenjit Gupta: Range-Aggregate Query Problems Involving Geometric Aggregation Operations. Nord. J. Comput. 13(4): 294-308 (2006)
- [c15]R. Sharathkumar, Prosenjit Gupta: Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts. CCCG 2006
- 2005
- [c14]N. Madhusudhanan, Prosenjit Gupta, Abhijit Mitra: Efficient Algorithms for Range Queries in Protein Sequence Analysis. CCCG 2005: 146-149
- [c13]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Non-intersection Queries on Aggregated Geometric Data. COCOON 2005: 544-553
- [c12]Prosenjit Gupta: Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations. ISAAC 2005: 892-901
- 2004
- [c11]Vamsikrishna Kundeti, Prosenjit Gupta: Efficient polygon enclosure algorithms for device extraction from VLSI layouts. CCCG 2004: 82-85
- [c10]Ravindranath Jampani, Risivardhan Thonangi, Prosenjit Gupta: Overlaying Multiple Maps Efficiently. CIT 2004: 263-272
1990 – 1999
- 1999
- [j12]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta: On some geometric optimization problems in layered manufacturing. Comput. Geom. 12(3-4): 219-239 (1999)
- [j11]Jayanth Majhi, Ravi Janardan, Jörg Schwerdt, Michiel H. M. Smid, Prosenjit Gupta: Minimizing support structures and trapped area in two-dimensional layered manufacturing. Comput. Geom. 12(3-4): 241-267 (1999)
- [j10]Jayanth Majhi, Prosenjit Gupta, Ravi Janardan: Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design. Comput. Geom. 13(4): 229-252 (1999)
- [j9]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. Inf. Process. Lett. 69(1): 7-13 (1999)
- 1997
- [j8]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta: The Rectangle Enclosure and Point-Dominance Problems Revisited. Int. J. Comput. Geometry Appl. 7(5): 437-455 (1997)
- [j7]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: A Technique for Adding Range Restrictions to Generalized Searching Problems. Inf. Process. Lett. 64(5): 263-269 (1997)
- [c9]Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta: On Some Geometric Optimization Problems in Layered Manufacturing. WADS 1997: 136-149
- 1996
- [j6]Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo: Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining. Computer-Aided Design 28(8): 577-587 (1996)
- [j5]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Comput. Geom. 6: 1-19 (1996)
- [j4]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. Comput. Geom. 6: 371-391 (1996)
- [c8]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. CCCG 1996: 8-13
- [c7]Jayanth Majhi, Prosenjit Gupta, Ravi Janardan: Computing a Flattest, Undercut-Free Parting Line for a Convex Polyhedron, with Application to Mold Design. WACG 1996: 109-120
- 1995
- [j3]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems. Comput. Geom. 5: 321-340 (1995)
- [j2]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. J. Algorithms 19(2): 282-317 (1995)
- [c6]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta: The Rectangle Enclosure and Point-Dominance Problems Revisited. Symposium on Computational Geometry 1995: 162-171
- [c5]Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo: Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. WADS 1995: 171-182
- 1994
- [j1]Al Borchers, Prosenjit Gupta: Extending the Quadrangle Inequality to Speed-Up Dynamic Programming. Inf. Process. Lett. 49(6): 287-290 (1994)
- [c4]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects. Symposium on Computational Geometry 1994: 369-378
- [c3]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. ESA 1994: 278-289
- [c2]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: On Intersection Searching Problems Involving Curved Objects. SWAT 1994: 183-194
- 1993
- [c1]Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. WADS 1993: 361-372
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-27 19:49 CET by the dblp team