Pilar de la Torre

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