The following pages link to Rezaul Alam Chowdhury (Q897113):
Displaying 25 items.
- (Q489763) (redirect page) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation (Q613114) (← links)
- Oblivious algorithms for multicores and networks of processors (Q897114) (← links)
- An efficient decoding technique for Huffman codes (Q1603588) (← links)
- On average edge length of minimum spanning trees (Q1606949) (← links)
- (Q1659995) (redirect page) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- An efficient cache-oblivious parallel Viterbi algorithm (Q1693231) (← links)
- Sorting using heap structure (Q2752277) (← links)
- The I/O Complexity of Computing Prime Tables (Q2802940) (← links)
- The Range 1 Query (R1Q) Problem (Q2920450) (← links)
- (Q2921735) (← links)
- Oracles for Distances Avoiding a Failed Node or Link (Q3532564) (← links)
- (Q3579404) (← links)
- Cache-oblivious dynamic programming (Q3581500) (← links)
- Mode-finding algorithms revisited (Q4256128) (← links)
- (Q4427873) (← links)
- A New String Matching Algorithm (Q4449514) (← links)
- (Q4460605) (← links)
- Calculating the square root with arbitrary order of convergence (Q4518240) (← links)
- Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs (Q4554946) (← links)
- A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort (Q4950608) (← links)
- Optimizing Read Reversals for Sequence Compression (Q5283828) (← links)
- Compiler Construction (Q5308726) (← links)
