Pilar de la Torre

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
How efficiently can room at the bottom be traded away for speed at the top? Natural Computing	2004-03-15	Paper
scientific article; zbMATH DE number 1953210 (Why is no real title available?)	2003-07-25	Paper
Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search Theory of Computing Systems	2001-11-21	Paper
scientific article; zbMATH DE number 1303794 (Why is no real title available?)	1999-06-17	Paper
An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms Discrete Mathematics	1998-06-02	Paper
A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys Journal of Algorithms	1997-05-20	Paper
Upper and lower bounds for recurrent and recursively decomposable parallel processor‐networks Communications on Pure and Applied Mathematics	1996-12-12	Paper
Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems Journal of Algorithms	1995-07-24	Paper
Optimal edge ranking of trees in polynomial time Algorithmica	1995-06-19	Paper
scientific article; zbMATH DE number 437538 (Why is no real title available?)	1994-11-29	Paper
Hash table collision resolution with direct chaining Journal of Algorithms	1989-01-01	Paper
On a function analogous to log η(τ) Nagoya Mathematical Journal	1975-01-01	Paper
On the transformation of log \(\eta (\tau)\) Duke Mathematical Journal	1974-01-01	Paper

Research outcomes over time

This page was built for person: Pilar de la Torre