Pilar de la Torre

According to our database1, Pilar de la Torre authored at least 22 papers between 1983 and 2003.

Collaborative distances :



In proceedings 
PhD thesis 


On csauthors.net:


How efficiently can room at the bottom be traded away for speed at the top?
Natural Computing, 2003

How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top?
Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002

Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search.
Theory Comput. Syst., 2001

An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms.
Discrete Mathematics, 1998

Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper).
Proceedings of the SIROCCO'98, 1998

Space-time-wavelength network with group communication locality.
Proceedings of the Multichannel Optical Networks: Theory and Practice, 1998

A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys.
J. Algorithms, 1997

Exact Bandwith of Parallel-Processor Networks.
Proceedings of the SIROCCO'96, 1996

A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Submachine Locality in the Bulk Synchronous Setting (Extended Abstract).
Proceedings of the Euro-Par '96 Parallel Processing, 1996

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

Optimal Edge Ranking of Trees in Polynomial Time.
Algorithmica, 1995

A structural theory of recursively decomposable parallel processor-networks.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

A Calculus of Adaptive Purpose Parallel Computation.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Optimal Edge Ranking of Trees in Polynomial Time.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Optimal Tree Ranking is in NC.
Parallel Processing Letters, 1992

Towards a single model of efficient computation in real parallel machines.
Future Generation Comp. Syst., 1992

Super critical tree numbering and optimal tree ranking are in NC.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Towards a Single Model of Efficient Computation in Real Parallel Machines.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search.
Proceedings of the International Conference on Parallel Processing, 1991

Hash Table Collision Resolution with Direct Chaining.
J. Algorithms, 1989

Histogram concavity analysis as an aid in threshold selection.
IEEE Trans. Systems, Man, and Cybernetics, 1983