I agree that this site is using cookies. You can find further informations here.
X
Bose, Prosenjit K.
308  results:
Search for persons X
?
1

A time–space trade-off for computing the k-visibility regio..:

Bahoo, Yeganeh ; Banyassady, Bahareh ; Bose, Prosenjit K...
Theoretical Computer Science.  789 (2019)  - p. 13-21 , 2019
Link: https://doi.org/10.1016/..
 
?
2

Design, synthesis and biological evaluation of 2-substitute..:

Gopinath, Vadiraj S. ; Pinjari, Jakir ; Dere, Ravindra T....
European Journal of Medicinal Chemistry.  69 (2013)  - p. 527-536 , 2013
Link: https://doi.org/10.1016/..
 
?
3

Synthesis and antimicrobial activity of 2-substituted [4-(1..:

Sridhara, Ajjanna M. ; Venugopala Reddy, Kallam R. ; Keshavayya, Jathi...
European Journal of Medicinal Chemistry.  45 (2010)  11 - p. 4983-4989 , 2010
Link: https://doi.org/10.1016/..
 
?
4

The power and limitations of static binary search trees wit..:

Bose, P. (Prosenjit) ; Douïeb, K. (Karim) ; Iacono, J. (John).
https://ir.library.carleton.ca/pub/20198.  , 2014
Link: https://ir.library.carle..
 
?
5

Layered working-set trees:

Bose, P. (Prosenjit) ; Douïeb, K. (Karim) ; Dujmović, V. (Vida).
https://ir.library.carleton.ca/pub/6023.  , 2012
Link: https://ir.library.carle..
 
?
6

Common unfoldings of polyominoes and polycubes:

Aloupis, G. (Greg) ; Bose, P. (Prosenjit) ; Collette, S. (Sébastien)...
https://ir.library.carleton.ca/pub/5829.  , 2011
Link: https://ir.library.carle..
 
?
7

Should static search trees ever be unbalanced?:

Bose, P. (Prosenjit) ; Douïeb, K. (Karim)
https://ir.library.carleton.ca/pub/5308.  , 2010
Link: https://ir.library.carle..
 
?
8

An O(log log n)-competitive binary search tree with optimal..:

Bose, P. (Prosenjit) ; Douïeb, K. (Karim) ; Dujmović, V. (Vida).
https://ir.library.carleton.ca/pub/5010.  , 2010
Link: https://ir.library.carle..
 
?
9

Flipping your lid:

Ahn, H.-K ; Bose, Prosenjit ; Czyzowicz, J...
https://dspace.library.uu.nl/handle/1874/2490.  , 2001
Link: https://dspace.library.u..
 
?
10

A Steiner-point-based algorithm for approximate shortest pa..:

Bose, Prosenjit ; Esteban, Guillermo ; Maheshwari, Anil
Theoretical Computer Science.  1001 (2024)  - p. 114583 , 2024
Link: https://doi.org/10.1016/..
 
?
11

Routing on heavy path WSPD spanners:

Bose, Prosenjit ; Tuttle, Tyler
Computational Geometry.  , 2024
Link: https://doi.org/10.1016/..
 
?
12

Improved Routing on the Delaunay Triangulation:

Bonichon, Nicolas ; Bose, Prosenjit ; De Carufel, Jean-Lou...
Discrete & Computational Geometry.  70 (2023)  3 - p. 495-549 , 2023
Link: https://doi.org/10.1007/..
 
?
13

On the Spanning and Routing Ratio of the Directed Theta-Fou..:

Bose, Prosenjit ; De Carufel, Jean-Lou ; Hill, Darryl.
Discrete & Computational Geometry.  71 (2023)  3 - p. 872-892 , 2023
Link: https://doi.org/10.1007/..
 
?
14

Approximating the Smallest k-Enclosing Geodesic Disc in a S..:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Bose, Prosenjit ; D'Angelo, Anthony ; Durocher, Stephane - p. 179-192 , 2023
Link: https://doi.org/10.1007/..
 
?
15

Simple linear time algorithms for piercing pairwise interse..:

Biniaz, Ahmad ; Bose, Prosenjit ; Wang, Yunkai
Computational Geometry.  114 (2023)  - p. 102011 , 2023
Link: https://doi.org/10.1016/..
 
1-15