Pilar de la Torre

Available identifiers

Publication	Date of Publication	Type
How efficiently can room at the bottom be traded away for speed at the top?	2004-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4414663	2003-07-25	Paper
Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search	2001-11-21	Paper
https://portal.mardi4nfdi.de/entity/Q4250440	1999-06-17	Paper
An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms	1998-06-02	Paper
A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys	1997-05-20	Paper
Upper and lower bounds for recurrent and recursively decomposable parallel processor‐networks	1996-12-12	Paper
Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems	1995-07-24	Paper
Optimal edge ranking of trees in polynomial time	1995-06-19	Paper
https://portal.mardi4nfdi.de/entity/Q3140414	1994-11-29	Paper
Hash table collision resolution with direct chaining	1989-01-01	Paper
On a function analogous to log η(τ)	1975-01-01	Paper
On the transformation of log \(\eta (\tau)\)	1974-01-01	Paper

This page was built for person: Pilar de la Torre