Long pages

Showing below up to 50 results in range #51 to #100.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

51. (hist) ‎Single-qubit transform of a state vector, locality ‎[6,157 bytes]
52. (hist) ‎Boruvka's, scalability ‎[5,868 bytes]
53. (hist) ‎Horners, locality ‎[5,792 bytes]
54. (hist) ‎Single-qubit transform of a state vector, scalability ‎[5,789 bytes]
55. (hist) ‎Bellman-Ford, scalability ‎[5,787 bytes]
56. (hist) ‎Cholesky decomposition, SCALAPACK ‎[5,529 bytes]
57. (hist) ‎Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, locality ‎[5,336 bytes]
58. (hist) ‎Boruvka's, locality ‎[5,049 bytes]
59. (hist) ‎Bellman-Ford, locality ‎[4,769 bytes]
60. (hist) ‎Pairwise summation of numbers ‎[4,707 bytes]
61. (hist) ‎One step of the dqds, LAPACK ‎[4,696 bytes]
62. (hist) ‎Cholesky decomposition, scalability ‎[4,546 bytes]
63. (hist) ‎Orthogonalization method ‎[4,430 bytes]
64. (hist) ‎QR decomposition of dense nonsingular matrices ‎[4,050 bytes]
65. (hist) ‎Linpack, HPL ‎[4,026 bytes]
66. (hist) ‎Dot product, locality ‎[3,730 bytes]
67. (hist) ‎Finding maximal flow in a transportation network ‎[3,721 bytes]
68. (hist) ‎The serial-parallel summation method, scalability ‎[3,552 bytes]
69. (hist) ‎Dense matrix multiplication, scalability ‎[3,550 bytes]
70. (hist) ‎The serial-parallel summation method, locality ‎[3,524 bytes]
71. (hist) ‎Givens method, locality ‎[3,509 bytes]
72. (hist) ‎LU decomposition via Gaussian elimination, scalability ‎[3,407 bytes]
73. (hist) ‎Dot product, scalability ‎[3,105 bytes]
74. (hist) ‎Assignment problem ‎[2,797 bytes]
75. (hist) ‎DCSC for finding the strongly connected components, C++, MPI, Parallel Boost Graph Library ‎[2,639 bytes]
76. (hist) ‎Poisson equation, solving with DFT, scalability ‎[2,604 bytes]
77. (hist) ‎Householder (reflections) method for reducing of a matrix to Hessenberg form ‎[2,422 bytes]
78. (hist) ‎Purdom's, Boost Graph Library ‎[2,304 bytes]
79. (hist) ‎The dqds algorithm for calculating singular values of bidiagonal matrices ‎[1,840 bytes]
80. (hist) ‎Givens (rotations) method for the QR decomposition of a matrix ‎[1,809 bytes]
81. (hist) ‎Search for isomorphic subgraphs ‎[1,659 bytes]
82. (hist) ‎Kruskal's, C++, MPI, Parallel Boost Graph Library ‎[1,457 bytes]
83. (hist) ‎LU decomposition using Gaussian elimination with pivoting ‎[1,423 bytes]
84. (hist) ‎Householder (reflections) method for the QR decomposition of a matrix ‎[1,401 bytes]
85. (hist) ‎Dijkstra, C++, MPI: Parallel Boost Graph Library, 2 ‎[1,350 bytes]
86. (hist) ‎Boruvka's, C++, MPI, Parallel Boost Graph Library ‎[1,261 bytes]
87. (hist) ‎Longest shortest path, Java, WebGraph ‎[1,256 bytes]
88. (hist) ‎Cooley-Tukey, locality ‎[1,114 bytes]
89. (hist) ‎Dijkstra, C++, MPI: Parallel Boost Graph Library, 1 ‎[1,009 bytes]
90. (hist) ‎Δ-stepping, C++, MPI, Parallel Boost Graph Library ‎[964 bytes]
91. (hist) ‎Dijkstra, C++, Boost Graph Library ‎[963 bytes]
92. (hist) ‎DFS, C++, Boost Graph Library ‎[957 bytes]
93. (hist) ‎Triangular decomposition of a Gram matrix ‎[950 bytes]
94. (hist) ‎LU decomposition via Gaussian elimination ‎[943 bytes]
95. (hist) ‎Ford–Fulkerson, C++, Boost Graph Library ‎[937 bytes]
96. (hist) ‎Poisson equation, solving with DFT, PFFT ‎[918 bytes]
97. (hist) ‎Poisson equation, solving with DFT, AccFFT ‎[908 bytes]
98. (hist) ‎Poisson equation, solving with DFT, MKL FFT ‎[902 bytes]
99. (hist) ‎Poisson equation, solving with DFT, FFTE ‎[898 bytes]
100. (hist) ‎Poisson equation, solving with DFT, cuFFT ‎[897 bytes]

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)