The following pages link to Pilar de la Torre (Q1381818):
Displayed 14 items.
- Item:Q1381818 (redirect page) (← links)
- An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms (Q1381820) (← links)
- How efficiently can room at the bottom be traded away for speed at the top? (Q1426835) (← links)
- On the transformation of log \(\eta (\tau)\) (Q1844865) (← links)
- Optimal edge ranking of trees in polynomial time (Q1892584) (← links)
- A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys (Q3128196) (← links)
- (Q3140414) (← links)
- On a function analogous to log <i>η</i>(<i>τ</i>) (Q4101909) (← links)
- Hash table collision resolution with direct chaining (Q4203804) (← links)
- (Q4250440) (← links)
- (Q4414663) (← links)
- Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems (Q4840217) (← links)
- Upper and lower bounds for recurrent and recursively decomposable parallel processor‐networks (Q4884664) (← links)
- Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search (Q5949570) (← links)