<we><edit> <!-- questions and answers -->
hash
efficiency
type-theory
algorithm-analysis
recurrence-relation
optimization
space-complexity
regular-languages
linear-algebra
computer-architecture
greedy-algorithms
information-theory
search-trees
pushdown-automata
compilers
concurrency
proof-techniques
logic
semantics
landau-notation
decision-problem
correctness-proof
np-complete
lambda-calculus
computational-geometry
data-structures
Fibonacci Heap / Binomial Heap - Decrease Key
algorithms
data-structures
heaps
Data structure optimized for merging maps on partitions
data-structures
runtime-analysis
AVL Tree Inner Nodes
data-structures
search-trees
balanced-search-trees
binary-search-trees
Show that the successor of a node is the lowest ancestor of the node whose left child is also an ancestor of that node
data-structures
search-trees
binary-search-trees
a little question on the analysis of the disjoint set
algorithms
algorithm-analysis
data-structures
time-complexity
union-find
Number of heaps using n distinct integers- Time complexity
algorithms
data-structures
time-complexity
dynamic-programming
heaps
I'm looking for best algorithms to compare two Circular Linked List?
algorithms
data-structures
java
Worst Case Scenario in MaxHeapify
data-structures
runtime-analysis
heaps
How to assign the increasing keys to the nodes of a complete binary tree on n nodes in inorder?
data-structures
binary-trees
binary-search
Can a CD disk and the memory of a device have an infinite space storage?
algorithms
data-structures
Accounting value of Splay trees?
data-structures
correctness-proof
splay-trees
When to rebalance the AVL tree?
data-structures
binary-trees
binary-search-trees
Trying to understand a way to split an AVL tree in O(log n)
algorithms
data-structures
binary-trees
search-trees
balanced-search-trees
AVL vs (2, 3) vs (2, m) trees
data-structures
search-trees
hash-table subsets
algorithms
data-structures
sets
hash-tables
Increasing all keys in a min bin-heap in O(1)
data-structures
heaps
priority-queues
What is the minimum required storage for a sparse, depth-first octree?
data-structures
trees
encoding-scheme
storage
What do we benefit from using ternary search trees rather than binary search trees?
data-structures
binary-trees
search-trees
Precomputation for partial products in monoids
algorithms
data-structures
How can one create variables in tuple relation calculus?
data-structures
logic
relational-algebra
Question about the difference between radix trees and patricia trees
data-structures
trees
Soft Question: Looking for resources on computation over reals
complexity-theory
data-structures
mathematical-foundations
Worst time complexity for finding a median number for a list and array data structure
algorithm-analysis
data-structures
runtime-analysis
Occupancy of a B+ Tree
data-structures
database-theory
Are degree and order the same thing when referring to a B-Tree
terminology
data-structures
search-trees
dictionaries
How to understand the probablistic analysis of skiplist?
algorithm-analysis
data-structures
mathematical-analysis
Is there a special name for a queue that works with groups of elements
data-structures
queues
Which of the following sequences could not be the sequences of nodes examined in a binary search tree?
data-structures
binary-search-trees
Name for type of actions that only care for outcome
data-structures
Is a BST considered a data structure or abstract data type
data-structures
binary-trees
abstract-data-types
Find Length of longest substring with all 1's in a binary string with k queries
algorithms
complexity-theory
data-structures
time-complexity
c++
Traverse Matrix in Reverse Diagonal strips
algorithms
data-structures
c
adjacency-matrix
data structure to store n-tuple keys
data-structures
Amortized time of insertion into an Array list
algorithm-analysis
data-structures
runtime-analysis
arrays
amortized-analysis
Creating an K-nary tree that is balanced in both width and depth for N nodes. N known a priori
data-structures
trees
Structure for the best string matching
data-structures
What data structure should I use for storing my data?
data-structures
database-theory
hash-tables
search-problem
storage
Time complexity of searching an element in Binary Search Tree
algorithm-analysis
data-structures
runtime-analysis
binary-search-trees
Access a tree by level without traversing
algorithms
data-structures
Make appends not degrade a splay tree
data-structures
search-trees
splay-trees
Best-Case Running Time For Binary Search Tree Insertion
terminology
data-structures
runtime-analysis
binary-trees
Canonical representation of finite maps on non-overlapping finite rational intervals
data-structures
intervals
equality
Which data structure to use for accessing min/max in constant-time?
data-structures
efficiency
Dynamic non-Euclidean closest pair
algorithms
data-structures
Using DCEL to represent "simple geometric objects"
data-structures
computational-geometry
Index for multidimensional space?
algorithms
data-structures
database-theory
Covering the unit square by smaller squares of variable sizes
algorithms
data-structures
computational-geometry
Does the rebalancing propagate upwards only to update the height of the nodes in an AVL tree?
data-structures
binary-trees
search-trees
balanced-search-trees
Complexity of deleting an element in a skew heap
data-structures
heaps
amortized-analysis
An AVL tree is a BST, but AVL tree can be not complete, then why do we define AVL tree a BST?
data-structures
binary-search-trees
Finding the nth to last node in a linked list
algorithms
data-structures
linked-lists
What is the time complexity of memory allocation assumed to be?
algorithm-analysis
data-structures
runtime-analysis
arrays
memory-allocation
How to efficiently get frequency of subranges and update its values altogether?
data-structures
Finding the heaviest interval in a one-dimensional space containing a point
data-structures
time-complexity
search-algorithms
nearest-neighbour
How to find longest possible identical sequence in Array A and B?
algorithms
data-structures
Why only use the max in left sub-tree as root instead of min in right sub-tree after deletion a node in a splay tree?
data-structures
trees
splay-trees
How huffman tree uses MinHeap?
data-structures
heaps
Finding median from given range
algorithms
data-structures
selection-problem
combine divergent persistent red-black tree instances
algorithms
data-structures
persistent-data-structure
Data structure for handling intervals
algorithms
data-structures
binary-search-trees
Find height of deepest FULL level in binary tree
algorithms
data-structures
binary-trees
recursion
Understanding commutativity and associativity for primitive types
algorithms
data-structures
parallel-computing
Why is the array used for a restricted hashing scheme always sized to a 4k + 3 prime?
algorithms
data-structures
Is there a name for this traversal-optimized representation of a binary tree data structure?
data-structures
terminology
binary-trees
What precisely/concisely is the "head" of a singly linked list? I ask bc of ambiguity online
data-structures
linked-lists
Detecting Non-Natural-Language Data
algorithms
data-structures
Proving that a specific Fibonacci heap can't exist
data-structures
heaps
In a Binary Search Tree what is the base of the log in this Big O notation
complexity-theory
data-structures
Why is Big O not defined here for a hash table?
data-structures
hash
What is the average depth of an incrementally built kd-tree?
data-structures
Algorithms for tabulating/counting/frequency counting?
algorithms
data-structures
data-mining
data-sets
Does Bloom filter with false positive rate greater than 0.5 make sense?
data-structures
bloom-filters
Merge 2 Binary Heaps
data-structures
heaps
Compact mapping from an involuted set
data-structures
sets
bioinformatics
finite-sets
succinct-data-structures
Data structure for querying a set of multisets
data-structures
reference-request
sets
finite-sets
stack vs queue efficiency
data-structures
efficiency
stacks
queues
Dynamic connectivity in forests with constant query time
algorithms
graphs
data-structures
In Disjoint Sets, why do we make the smaller tree the subtree of the larger one?
data-structures
How to calculate multibit trie storage size?
data-structures
trees
storage
space-analysis
What is a "closed set" in context of AI? How is it different from an open set or a frontier?
algorithms
graphs
data-structures
artificial-intelligence
Bucket Priority Queues with large integers for $O(1)$ insert and extract~min?
data-structures
efficiency
priority-queues
Dictionary matching problem: dictionary size estimation
algorithm-analysis
data-structures
strings
dictionaries
string-matching
What is the only condition that would cause the Insert operation of a dynamic data structure to return a “data structure full” error?
data-structures
dynamic-programming
linked-lists
Read nodes of a BST in blocks of size $k$ and traverse it in $\mathcal{O}(log_kn)$
data-structures
binary-trees
binary-search-trees
How is the data stored in AVL tree in a memory?
data-structures
search-trees
balanced-search-trees
storage
Maximizing book picked using two stacks
data-structures
trees
stacks
Name for tree where each node has the aggregate of its children
data-structures
terminology
trees
Maximum depth of a B+ tree
data-structures
search-trees
balanced-search-trees
Checking whether at least n/2 + 1 elements of a set/vector are equal
algorithms
data-structures
Why hasn't functional programming researched dynamic trees?
data-structures
trees
functional-programming
Storing the stream in less space
algorithms
data-structures
Variable size and CPU performance
data-structures
memory-hardware
cpu
performance
Using Pascal's Triangle to implement queues and stacks using heaps
algorithms
data-structures
heaps
counting
queues
Separating two strings without a separating character
data-structures
strings
Gale Shapley - Everyone ends up with second choice of partner
algorithms
data-structures
Doubt regarding address calculation in two-dimensional arrays
data-structures
programming-languages
arrays
lower-bounds
c
Not able to devise a concrete solution for the given graph query
graphs
graph-theory
data-structures
Update and find-smallest-absolute-value operations on a tree
algorithms
data-structures
trees
binary-trees
Is linked list a preferable underlying basic DS for a collection mutable through an iterator
data-structures
arrays
linked-lists
iteration
Big o notation help?
algorithms
data-structures
asymptotics
upper-bound