user7060
  • Member for 8 years, 7 months
  • Last seen this week
2 answers
9 votes
4k views
1 bookmarks
Huffman tree and maximum depth
3 answers
5 votes
4k views
1 bookmarks
Memory usage of a BST or hash table?
1 answers
4 votes
208 views
1 bookmarks
Questions about SIMD instructions
3 answers
4 votes
102 views
Reasons for decreasing the number of threads in a parallel implementation
0 answers
2 votes
678 views
Black box terminology
4 answers
2 votes
2k views
What is more important in an algorithm, small runtime or small memory usage?
1 answers
2 votes
62 views
Tolerated use of the term topology
1 answers
2 votes
88 views
A particular complexity
1 answers
2 votes
533 views
Superscalar processors and complex instructions
2 answers
2 votes
110 views
I'm lookin for a method to construct a particular grammar?
1 answers
1 votes
231 views
Average case complexity of search data structures
1 answers
1 votes
67 views
Height of data structures
2 answers
1 votes
82 views
What do you call a subtree covering a subset of contiguous leaves?
3 answers
1 votes
390 views
Term for most degenerate tree with two children on every inner node
1 answers
1 votes
65 views
1 bookmarks
Complexity terminology
2 answers
1 votes
320 views
1 bookmarks
Instruction level parallelism
1 answers
1 votes
606 views
Applications of queues
3 answers
1 votes
267 views
Additional clarification about Simultaneous Multithreading
0 answers
0 votes
18 views
Efficient way of partitionning a set into a fixed number of parts
2 answers
0 votes
736 views
scale-free networks and adjacency matrix
1 answers
0 votes
43 views
Terminology for describing a kind of server
1 answers
0 votes
2k views
Comparing random access and sequential access
2 answers
0 votes
528 views
1 bookmarks
What is the impact of synchronisation overhead on parallel speedup?
3 answers
-1 votes
225 views
Terminology for trees
1 answers
-1 votes
16 views
Use of Landau notation for determining bounds
2 answers
-2 votes
104 views
An application where we always delete the oldest object?