Urmăriți
Pat Morin
Pat Morin
Carleton University
Adresă de e-mail confirmată pe scs.carleton.ca - Pagina de pornire
Titlu
Citat de
Citat de
Anul
Routing with guaranteed delivery in ad hoc wireless networks
P Bose, P Morin, I Stojmenović, J Urrutia
Proceedings of the 3rd international workshop on Discrete algorithms and …, 1999
25501999
Online routing in triangulations
A Aggarwal, CP Rangan, P Bose, P Morin
Algorithms and Computation: 10th International Symposium, ISAAC’99 Chennai …, 1999
426*1999
Output-sensitive algorithms for computing nearest-neighbour decision boundaries
D Bremner, E Demaine, J Erickson, J Iacono, S Langerman, P Morin, ...
Discrete & Computational Geometry 33, 593-604, 2005
2852005
On the false-positive rate of Bloom filters
P Bose, H Guo, E Kranakis, A Maheshwari, P Morin, J Morrison, M Smid, ...
Information Processing Letters 108 (4), 210-213, 2008
2682008
Planar graphs have bounded queue-number
V Dujmović, G Joret, P Micek, P Morin, T Ueckerdt, DR Wood
Journal of the ACM (JACM) 67 (4), 1-38, 2020
1482020
Layout of graphs with bounded tree-width
V Dujmovic, P Morin, DR Wood
SIAM Journal on Computing 34 (3), 553-579, 2005
1372005
Fast approximations for sums of distances, clustering and the Fermat–Weber problem
P Bose, A Maheshwari, P Morin
Computational Geometry 24 (3), 135-146, 2003
1312003
Online routing in convex subdivisions
P Bose, A Brodnik, S Carlsson, ED Demaine, R Fleischer, A López-Ortiz, ...
International Journal of Computational Geometry & Applications 12 (04), 283-295, 2002
1292002
Cuckoo hashing: further analysis
L Devroye, P Morin
Information Processing Letters 86 (4), 215-219, 2003
1102003
Space-efficient planar convex hull algorithms
H Brönnimann, J Iacono, J Katajainen, P Morin, J Morrison, G Toussaint
Theoretical Computer Science 321 (1), 25-40, 2004
108*2004
Layered separators in minor-closed graph classes with applications
V Dujmović, P Morin, DR Wood
Journal of Combinatorial Theory, Series B 127, 111-147, 2017
93*2017
Range mode and range median queries on lists and trees
D Krizanc, P Morin, M Smid
Nordic Journal of Computing 12 (1), 1-17, 2005
912005
Competitive online routing in geometric graphs
P Bose, P Morin
Theoretical Computer Science 324 (2-3), 273-288, 2004
912004
Covering things with things
S Langerman, P Morin
Discrete & Computational Geometry 33, 717-729, 2005
842005
Succinct orthogonal range search structures on a grid with applications to text indexing
P Bose, M He, A Maheshwari, P Morin
Workshop on Algorithms and Data Structures, 98-109, 2009
822009
Ordered theta graphs
P Bose, J Gudmundsson, P Morin
Computational Geometry 28 (1), 11-18, 2004
822004
Adjacency labelling for planar graphs (and beyond)
V Dujmović, L Esperet, C Gavoille, G Joret, P Micek, P Morin
Journal of the ACM (JACM) 68 (6), 1-33, 2021
742021
On simplifying dot maps
M De Berg, P Bose, O Cheong, P Morin
Computational Geometry 27 (1), 43-62, 2004
712004
Online routing in geometric graphs
P Morin
Phd thesis, Carleton University, 2001.(Cited on pages 1, 2, 25, and 26.), 2001
632001
Notes on large angle crossing graphs
V Dujmovic, J Gudmundsson, P Morin, T Wolle
arXiv preprint arXiv:0908.3545, 2009
612009
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20