Histogram concavity analysis as an aid in threshold selection. - Azriel Rosenfeld; Pilar de la Torre (IEEE Trans. Syst. Man Cybern., 1983)

Hash Table Collision Resolution with Direct Chaining. - Gary D. Knott; Pilar de la Torre (J. Algorithms, 1989)

Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search. - Pilar de la Torre; Clyde P. Kruskal (ICPP (3), 1991)

Super critical tree numbering and optimal tree ranking are in NC. - Pilar de la Torre; Raymond Greenlaw (SPDP, 1991)

Towards a single model of efficient computation in real parallel machines. - Pilar de la Torre; Clyde P. Kruskal (Future Gener. Comput. Syst., 1992)

Optimal Tree Ranking is in NC. - Pilar de la Torre; Raymond Greenlaw; Teresa M. Przytycka (Parallel Process. Lett., 1992)

A Calculus of Adaptive Purpose Parallel Computation. - Pilar de la Torre; Clyde P. Kruskal (IFIP Congress (1), 1994)

A structural theory of recursively decomposable parallel processor-networks. - Pilar de la Torre; Clyde P. Kruskal (SPDP, 1995)

Optimal Edge Ranking of Trees in Polynomial Time. - Pilar de la Torre; Raymond Greenlaw; Alejandro A. Schäffer (Algorithmica, 1995)

Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems. - Pilar de la Torre; Clyde P. Kruskal (J. Algorithms, 1995)

Submachine Locality in the Bulk Synchronous Setting (Extended Abstract). - Pilar de la Torre; Clyde P. Kruskal (Euro-Par, Vol. II, 1996)

A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries. - Pilar de la Torre; David T. Kao (MFCS, 1996)

Exact Bandwith of Parallel-Processor Networks. - Pilar de la Torre; Clyde P. Kruskal (SIROCCO, 1996)

A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys. - Pilar de la Torre; David T. Kao (J. Algorithms, 1997)

Space-time-wavelength network with group communication locality. - Radim Bartos; Pilar de la Torre; Rajgopal Kannan (Multichannel Optical Networks: Theory and Practice, 1998)

Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper). - Pilar de la Torre; Lata Narayanan; David Peleg (SIROCCO, 1998)

An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms. - Pilar de la Torre; David T. Kao (Discret. Math., 1998)

Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search. - Pilar de la Torre; Clyde P. Kruskal (Theory Comput. Syst., 2001)

How efficiently can room at the bottom be traded away for speed at the top? - Pilar de la Torre (Nat. Comput., 2003)

Foreword. - Pilar de la Torre; Michael Mitzenmacher; Rajmohan Rajaraman; Berthold Vöcking (Theory Comput. Syst., 2004)