-
1
-
-
0024082546
-
INPUT/OUTPUT COMPLEXITY of SORTING and RELATED PROBLEMS
-
DOI 10.1145/48529.48535
-
Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31(9), 1116-1127 (1988) (Pubitemid 18662481)
-
(1988)
Communications of the ACM
, vol.31
, Issue.9
, pp. 1116-1127
-
-
Aggarwal, A.1
Vitter, J.S.2
-
2
-
-
57349105595
-
Fundamental parallel algorithms for private-cache chip multiprocessors
-
Arge, L., Goodrich, M.T., Nelson, M.J., Sitchinava, N.: Fundamental parallel algorithms for private-cache chip multiprocessors. In: SPAA, pp. 197-206 (2008)
-
(2008)
SPAA
, pp. 197-206
-
-
Arge, L.1
Goodrich, M.T.2
Nelson, M.J.3
Sitchinava, N.4
-
4
-
-
57749174818
-
Cache-oblivious red-blue line segment intersection
-
Halperin, D., Mehlhorn, K. (eds.) ESA 2008. Springer, Heidelberg
-
Arge, L., Mølhave, T., Zeh, N.: Cache-oblivious red-blue line segment intersection. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 88-99. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.5193
, pp. 88-99
-
-
Arge, L.1
Mølhave, T.2
Zeh, N.3
-
5
-
-
0024681436
-
Cascading divide-and-conquer: A technique for designing parallel algorithms
-
Atallah, M.J., Cole, R., Goodrich, M.T.: Cascading divide-and-conquer: A technique for designing parallel algorithms. SIAM J. Comp. 18(3), 499-532 (1989)
-
(1989)
SIAM J. Comp.
, vol.18
, Issue.3
, pp. 499-532
-
-
Atallah, M.J.1
Cole, R.2
Goodrich, M.T.3
-
6
-
-
78349257287
-
Efficient plane sweeping in parallel
-
Atallah, M.J., Goodrich, M.T.: Efficient plane sweeping in parallel. In: SOCG, pp. 216-225 (1986)
-
(1986)
SOCG
, pp. 216-225
-
-
Atallah, M.J.1
Goodrich, M.T.2
-
7
-
-
0023833316
-
Parallel algorithms for some functions of two convex polygons
-
Atallah, M.J., Goodrich, M.T.: Parallel algorithms for some functions of two convex polygons. Algorithmica 3, 535-548 (1988)
-
(1988)
Algorithmica
, vol.3
, pp. 535-548
-
-
Atallah, M.J.1
Goodrich, M.T.2
-
8
-
-
32144449245
-
Concurrent cacheoblivious B-trees
-
Bender, M.A., Fineman, J.T., Gilbert, S., Kuszmaul, B.C.: Concurrent cacheoblivious B-trees. In: SPAA, pp. 228-237 (2005)
-
(2005)
SPAA
, pp. 228-237
-
-
Bender, M.A.1
Fineman, J.T.2
Gilbert, S.3
Kuszmaul, B.C.4
-
9
-
-
58449090994
-
Provably good multicore cache performance for divide-and-conquer algorithms
-
Blelloch, G.E., Chowdhury, R.A., Gibbons, P.B., Ramachandran, V., Chen, S., Kozuch, M.: Provably good multicore cache performance for divide-and-conquer algorithms. In: SODA, pp. 501-510 (2008)
-
(2008)
SODA
, pp. 501-510
-
-
Blelloch, G.E.1
Chowdhury, R.A.2
Gibbons, P.B.3
Ramachandran, V.4
Chen, S.5
Kozuch, M.6
-
10
-
-
84869191441
-
Cache oblivious distribution sweeping
-
Widmayer, P., Ruiz, F.T., Bueno, R.M., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. Springer, Heidelberg
-
Brodal, G.S., Fagerberg, R.: Cache oblivious distribution sweeping. In: Widmayer, P., Ruiz, F.T., Bueno, R.M., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 426-438. Springer, Heidelberg (2002)
-
(2002)
LNCS
, vol.2380
, pp. 426-438
-
-
Brodal, G.S.1
Fagerberg, R.2
-
11
-
-
35248831668
-
The cache-oblivious gaussian elimination paradigm: Theoretical framework, parallelization and experimental evaluation
-
Chowdhury, R.A., Ramachandran, V.: The cache-oblivious gaussian elimination paradigm: Theoretical framework, parallelization and experimental evaluation. In: SPAA, pp. 71-80 (2007)
-
(2007)
SPAA
, pp. 71-80
-
-
Chowdhury, R.A.1
Ramachandran, V.2
-
12
-
-
57349161938
-
Cache-efficient dynamic programming for multicores
-
Chowdhury, R.A., Ramachandran, V.: Cache-efficient dynamic programming for multicores. In: SPAA, pp. 207-216 (2008)
-
(2008)
SPAA
, pp. 207-216
-
-
Chowdhury, R.A.1
Ramachandran, V.2
-
13
-
-
77954024841
-
Oblivious algorithms for multicores and network of processors
-
Chowdhury, R.A., Silvestri, F., Blakeley, B., Ramachandran, V.: Oblivious algorithms for multicores and network of processors. In: IPDPS (2010)
-
(2010)
IPDPS
-
-
Chowdhury, R.A.1
Silvestri, F.2
Blakeley, B.3
Ramachandran, V.4
-
14
-
-
78349275590
-
Efficient parallel algorithms for geometric partitioning problems through parallel range searching
-
Datta, A.: Efficient parallel algorithms for geometric partitioning problems through parallel range searching. In: ICPP, pp. 202-209 (1994)
-
(1994)
ICPP
, pp. 202-209
-
-
Datta, A.1
-
15
-
-
0027794853
-
Scalable parallel geometric algorithms for coarse grained multicomputers
-
Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable parallel geometric algorithms for coarse grained multicomputers. In: SOCG, pp. 298-307 (1993)
-
(1993)
SOCG
, pp. 298-307
-
-
Dehne, F.1
Fabri, A.2
Rau-Chaplin, A.3
-
18
-
-
0026206952
-
Intersecting line segments in parallel with an output-sensitive number of processors
-
Goodrich, M.T.: Intersecting line segments in parallel with an output-sensitive number of processors. SIAM J. Comp. 20(4), 737-755 (1991)
-
(1991)
SIAM J. Comp.
, vol.20
, Issue.4
, pp. 737-755
-
-
Goodrich, M.T.1
-
19
-
-
0027803891
-
External-memory computational geometry
-
Goodrich, M.T., Tsay, J.J., Vengroff, D.E., Vitter, J.S.: External-memory computational geometry. In: FOCS, pp. 714-723 (1993)
-
(1993)
FOCS
, pp. 714-723
-
-
Goodrich, M.T.1
Tsay, J.J.2
Vengroff, D.E.3
Vitter, J.S.4
|