The following pages link to Roberto Tamassia
External toolsShowing 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Algorithm (links | edit)
- List of computer scientists (links | edit)
- Heap (data structure) (links | edit)
- Logarithm (links | edit)
- Prime number (links | edit)
- Priority queue (links | edit)
- Sorting algorithm (links | edit)
- Kruskal's algorithm (links | edit)
- Binary heap (links | edit)
- Associative array (links | edit)
- Depth-first search (links | edit)
- Adjacency matrix (links | edit)
- Binary logarithm (links | edit)
- Binomial heap (links | edit)
- Fibonacci heap (links | edit)
- Graph drawing (links | edit)
- Hasse diagram (links | edit)
- Graph minor (links | edit)
- Adjacency list (links | edit)
- Unit fraction (links | edit)
- Selection algorithm (links | edit)
- Graph (abstract data type) (links | edit)
- Master theorem (analysis of algorithms) (links | edit)
- Force-directed graph drawing (links | edit)
- 2–3–4 tree (links | edit)
- Dynamic array (links | edit)
- Linear probing (links | edit)
- Feedback arc set (links | edit)
- Dual graph (links | edit)
- SEQUAL framework (links | edit)
- Pairing heap (links | edit)
- Christofides algorithm (links | edit)
- GraphML (links | edit)
- Plastech Engineered Products (links | edit)
- Potential method (links | edit)
- Pierre Rosenstiehl (links | edit)
- Continuous knapsack problem (links | edit)
- Graph embedding (links | edit)
- Franco P. Preparata (links | edit)
- SPQR tree (links | edit)
- Polygonal chain (links | edit)
- Peripheral cycle (links | edit)
- Program structure tree (links | edit)
- International Symposium on Graph Drawing (links | edit)
- Graph automorphism (links | edit)
- Task allocation and partitioning in social insects (links | edit)
- Longest path problem (links | edit)
- Steinitz's theorem (links | edit)
- Skew binomial heap (links | edit)
- Coffman–Graham algorithm (links | edit)