Pilar de la Torre

According to our database, Pilar de la Torre authored at least 20 papers between 1983 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2004

Foreword.

Pilar de la Torre, Michael Mitzenmacher, Rajmohan Rajaraman, Berthold Vöcking

Theory Comput. Syst., 2004

2003

How efficiently can room at the bottom be traded away for speed at the top?

Pilar de la Torre

Nat. Comput., 2003

2001

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

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

Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper).

Pilar de la Torre, Lata Narayanan, David Peleg

Proceedings of the SIROCCO'98, 1998

Space-time-wavelength network with group communication locality.

Radim Bartos, Pilar de la Torre, Rajgopal Kannan

Proceedings of the Multichannel Optical Networks: Theory and Practice, 1998

1997

A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys.

Pilar de la Torre, David T. Kao

J. Algorithms, 1997

1996

Exact Bandwith of Parallel-Processor Networks.

Pilar de la Torre, Clyde P. Kruskal

Proceedings of the SIROCCO'96, 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

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Submachine Locality in the Bulk Synchronous Setting (Extended Abstract).

Pilar de la Torre, Clyde P. Kruskal

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems.

Pilar de la Torre, Clyde P. Kruskal

J. Algorithms, 1995

Optimal Edge Ranking of Trees in Polynomial Time.

Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer

Algorithmica, 1995

A structural theory of recursively decomposable parallel processor-networks.

Pilar de la Torre, Clyde P. Kruskal

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

1994

A Calculus of Adaptive Purpose Parallel Computation.

Pilar de la Torre, Clyde P. Kruskal

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1992

Optimal Tree Ranking is in NC.

Pilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka

Parallel Process. Lett., 1992

Towards a single model of efficient computation in real parallel machines.

Pilar de la Torre, Clyde P. Kruskal

Future Gener. Comput. Syst., 1992

1991

Super critical tree numbering and optimal tree ranking are in NC.

Pilar de la Torre, Raymond Greenlaw

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

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

Proceedings of the International Conference on Parallel Processing, 1991

1989

Hash Table Collision Resolution with Direct Chaining.

Gary D. Knott, Pilar de la Torre

J. Algorithms, 1989

1983

Histogram concavity analysis as an aid in threshold selection.

Azriel Rosenfeld, Pilar de la Torre

IEEE Trans. Syst. Man Cybern., 1983