Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bose, Prosenjit"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Searching on a line: A complete characterization of the optimal solution
Prosenjit Bose
,
Jean-Lou De Carufel
,
Stephane Durocher
Theoretical Computer Science
569
, 2015, pp. 24-42
Switching to directional antennas with constant increase in radius and hop distance
Prosenjit Bose
,
Paz Carmi
,
Mirela Damian
,
Robin Flatland
,
Matthew J. Katz
,
Anil Maheshwari
Algorithmica
69
(2), 2014, pp. 397-409
Competitive online routing on Delaunay triangulations
Prosenjit Bose
,
Jean-Lou De Carufel
,
Stephane Durocher
,
Perouz Taslakian
Lecture Notes in Computer Science
8503
, 2014, pp. 98-109
The price of order
Prosenjit Bose
,
Pat Morin
,
André van Renssen
Lecture Notes in Computer Science
8889
, 2014, pp. 313-325
On the stretch factor of the theta-4 graph
Luis Barba
,
Prosenjit Bose
,
Jean-Lou De Carufel
,
André van Renssen
,
Sander Verdonschot
Lecture Notes in Computer Science
8037
, 2013, pp. 109-120
Revisiting the problem of searching on a line
Prosenjit Bose
,
Jean-Lou De Carufel
,
Stephane Durocher
Lecture Notes in Computer Science
8125
, 2013, pp. 205-216
Robust geometric spanners
Prosenjit Bose
,
Vida Dujmović
,
Pat Morin
,
Michiel Smid
SIAM Journal on Computing
42
(4), 2013, pp. 1720-1736
Robust geometric spanners
Prosenjit Bose
,
Vida Dujmović
,
Pat Morin
,
Michiel Smid
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 449-458
The
\theta_5
-graph is a spanner
Prosenjit Bose
,
Pat Morin
,
André van Renssen
,
Sander Verdonschot
Lecture Notes in Computer Science
8165
, 2013, pp. 100-114
On the spanning ratio of theta-graphs
Prosenjit Bose
,
André van Renssen
,
Sander Verdonschot
Lecture Notes in Computer Science
8037
, 2013, pp. 182-194
Flips
Prosenjit Bose
Lecture Notes in Computer Science
7704
, 2013, pp. 1-1
De-amortizing binary search trees
Prosenjit Bose
,
Sébastien Collette
,
Rolf Fagerberg
,
Stefan Langerman
Lecture Notes in Computer Science
7391
, 2012, pp. 121-132
Layered working-set trees
Prosenjit Bose
,
Karim Douïeb
,
Vida Dujmović
,
John Howat
Algorithmica
63
(1-2), 2012, pp. 476-489
Every large point set contains many collinear points or an empty pentagon
Zachary Abel
,
Brad Ballinger
,
Prosenjit Bose
,
Sébastien Collette
,
Vida Dujmović
,
Ferran Hurtado
,
Scott Duke Kominers
,
Stefan Langerman
,
Attila Pór
,
David R. Wood
Graphs and Combinatorics
27
(1), 2011, pp. 47-60
Location-oblivious distributed unit disk graph coloring
Michel Barbeau
,
Prosenjit Bose
,
Paz Carmi
,
Mathieu Couture
,
Evangelos Kranakis
Algorithmica
60
(2), 2011, pp. 236-249
Switching to directional antennas with constant increase in radius and hop distance
Prosenjit Bose
,
Paz Carmi
,
Mirela Damian
,
Robin Flatland
,
Matthew J. Katz
,
Anil Maheshwari
Lecture Notes in Computer Science
6844
, 2011, pp. 134-146
Computing the greedy spanner in near-quadratic time
Prosenjit Bose
,
Paz Carmi
,
Mohammad Farshi
,
Anil Maheshwari
,
Michiel Smid
Algorithmica
58
(3), 2010, pp. 711-729
Improved methods for generating quasi-Gray codes
Prosenjit Bose
,
Paz Carmi
,
Dana Jansens
,
Anil Maheshwari
,
Pat Morin
,
Michiel Smid
Lecture Notes in Computer Science
6139
, 2010, pp. 224-235
Communication-efficient construction of the plane localized Delaunay graph
Prosenjit Bose
,
Paz Carmi
,
Michiel Smid
,
Daming Xu
Lecture Notes in Computer Science
6034
, 2010, pp. 282-293
\pi/2
-angle Yao graphs are spanners
Prosenjit Bose
,
Mirela Damian
,
Karim Douïeb
,
Joseph O'Rourke
,
Ben Seamone
,
Michiel Smid
,
Stefanie Wuhrer
Lecture Notes in Computer Science
6507
, 2010, pp. 446-457
An
O(\log \log n)
-competitive binary search tree with optimal worst-case access times
Prosenjit Bose
,
Karim Douïeb
,
Vida Dujmović
,
Rolf Fagerberg
Lecture Notes in Computer Science
6139
, 2010, pp. 38-49
Layered working-set trees
Prosenjit Bose
,
Karim Douïeb
,
Vida Dujmović
,
John Howat
Lecture Notes in Computer Science
6034
, 2010, pp. 686-696
Should static search trees ever be unbalanced?
Prosenjit Bose
,
Karim Douïeb
Lecture Notes in Computer Science
6506
, 2010, pp. 109-120
Efficient construction of near-optimal binary and multiway search trees
Prosenjit Bose
,
Karim Douïeb
Lecture Notes in Computer Science
5664
, 2009, pp. 230-241
Succinct orthogonal range search structures on a grid with applications to text indexing
Prosenjit Bose
,
Meng He
,
Anil Maheshwari
,
Pat Morin
Lecture Notes in Computer Science
5664
, 2009, pp. 98-109
Seiten 1
2
3
4
5
6
>