Pilar de la Torre

Publication Activity (10 Years)

Years Active: 1983-2004
Publications (10 Years): 0

Publications

Pilar de la Torre, Michael Mitzenmacher, Rajmohan Rajaraman, Berthold Vöcking
Foreword. Theory Comput. Syst. 37 (3) (2004)
Pilar de la Torre
How efficiently can room at the bottom be traded away for speed at the top? Nat. Comput. 2 (4) (2003)
Pilar de la Torre
How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top? DNA (2002)
Pilar de la Torre, Clyde P. Kruskal
Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search. Theory Comput. Syst. 34 (4) (2001)
Pilar de la Torre, Lata Narayanan, David Peleg
Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper). SIROCCO (1998)
Radim Bartos, Pilar de la Torre, Rajgopal Kannan
Space-time-wavelength network with group communication locality. Multichannel Optical Networks: Theory and Practice (1998)
Pilar de la Torre, David T. Kao
An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms. Discret. Math. 180 (1-3) (1998)
Pilar de la Torre, David T. Kao
A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys. J. Algorithms 22 (2) (1997)
Pilar de la Torre, David T. Kao
A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries. MFCS (1996)
Pilar de la Torre, Clyde P. Kruskal
Exact Bandwith of Parallel-Processor Networks. SIROCCO (1996)
Pilar de la Torre, Clyde P. Kruskal
Submachine Locality in the Bulk Synchronous Setting (Extended Abstract). Euro-Par, Vol. II (1996)
Pilar de la Torre, Clyde P. Kruskal
Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems. J. Algorithms 19 (1) (1995)
Pilar de la Torre, Clyde P. Kruskal
A structural theory of recursively decomposable parallel processor-networks. SPDP (1995)
Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer
Optimal Edge Ranking of Trees in Polynomial Time. Algorithmica 13 (6) (1995)
Pilar de la Torre, Clyde P. Kruskal
A Calculus of Adaptive Purpose Parallel Computation. IFIP Congress (1) (1994)
Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer
Optimal Edge Ranking of Trees in Polynomial Time. SODA (1993)
Pilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka
Optimal Tree Ranking is in NC. Parallel Process. Lett. 2 (1992)
Pilar de la Torre, Clyde P. Kruskal
Towards a single model of efficient computation in real parallel machines. Future Gener. Comput. Syst. 8 (4) (1992)
Pilar de la Torre, Raymond Greenlaw
Super critical tree numbering and optimal tree ranking are in NC. SPDP (1991)
Pilar de la Torre, Clyde P. Kruskal
Towards a Single Model of Efficient Computation in Real Parallel Machines. PARLE (1) (1991)
Pilar de la Torre, Clyde P. Kruskal
Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search. ICPP (3) (1991)
Gary D. Knott, Pilar de la Torre
Hash Table Collision Resolution with Direct Chaining. J. Algorithms 10 (1) (1989)
Azriel Rosenfeld, Pilar de la Torre
Histogram concavity analysis as an aid in threshold selection. IEEE Trans. Syst. Man Cybern. 13 (2) (1983)