dblp.uni-trier.dewww.uni-trier.de

Prosenjit Gupta

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
33EEYokesh Kumar, Prosenjit Gupta: External memory layout vs. schematic. ACM Trans. Design Autom. Electr. Syst. 14(2): (2009)
2008
32 Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Michiel H. M. Smid: Data Structures for Range-Aggregate Extent Queries. CCCG 2008
31EEYokesh Kumar, Ravi Janardan, Prosenjit Gupta: Efficient algorithms for reverse proximity query problems. GIS 2008: 39
2007
30EEYokesh Kumar, Prosenjit Gupta: Reducing EPL Alignment Errors for Large VLSI Layouts. ISQED 2007: 233-238
29EEYokesh Kumar, Prosenjit Gupta: An External Memory Circuit Validation Algorithm for Large VLSI Layouts. ISVLSI 2007: 510-511
2006
28EER. Sharathkumar, Prosenjit Gupta: Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts. CCCG 2006
27 Prosenjit Gupta: Range-Aggregate Query Problems Involving Geometric Aggregation Operations. Nord. J. Comput. 13(4): 294-308 (2006)
2005
26EEN. Madhusudhanan, Prosenjit Gupta, Abhijit Mitra: Efficient Algorithms for Range Queries in Protein Sequence Analysis. CCCG 2005: 146-149
25EEProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Non-intersection Queries on Aggregated Geometric Data. COCOON 2005: 544-553
24EEProsenjit Gupta: Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations. ISAAC 2005: 892-901
2004
23EEVamsikrishna Kundeti, Prosenjit Gupta: Efficient polygon enclosure algorithms for device extraction from VLSI layouts. CCCG 2004: 82-85
22EERavindranath Jampani, Risivardhan Thonangi, Prosenjit Gupta: Overlaying Multiple Maps Efficiently. CIT 2004: 263-272
1999
21 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)
20 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)
19 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)
18EEProsenjit 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
17 Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta: On Some Geometric Optimization Problems in Layered Manufacturing. WADS 1997: 136-149
16EEProsenjit 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)
15 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)
1996
14 Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Efficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons. CCCG 1996: 8-13
13 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
12 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)
11 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)
10EEProsenjit 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)
1995
9EEProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid, Bhaskar DasGupta: The Rectangle Enclosure and Point-Dominance Problems Revisited. Symposium on Computational Geometry 1995: 162-171
8 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
7 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)
6 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)
1994
5 Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects. ESA 1994: 278-289
4 Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: On Intersection Searching Problems Involving Curved Objects. SWAT 1994: 183-194
3EEProsenjit 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
2 Al Borchers, Prosenjit Gupta: Extending the Quadrangle Inequality to Speed-Up Dynamic Programming. Inf. Process. Lett. 49(6): 287-290 (1994)
1993
1 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

1Al Borchers [2]
2Bhaskar DasGupta [9] [15]
3Ravindranath Jampani [22]
4Ravi Janardan [1] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [25] [31] [32]
5Yokesh Kumar [29] [30] [31] [32] [33]
6Vamsikrishna Kundeti [23]
7N. Madhusudhanan [26]
8Jayanth Majhi [8] [10] [13] [17] [19] [20] [21]
9Abhijit Mitra [26]
10Jörg Schwerdt [20]
11R. Sharathkumar [28]
12Michiel H. M. Smid [1] [3] [4] [5] [6] [7] [9] [11] [12] [14] [15] [16] [17] [18] [20] [21] [25] [32]
13Risi Thonangi (Risivardhan Thonangi) [22]
14Tony C. Woo [8] [10]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)