( en | de | ru )

 

Disambiguation of "de la Torre, Pilar"

Author of the publication

copydeleteadd this publication to your clipboard
Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper).

, , and . SIROCCO, page 214-228. Carleton Scientific, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Martino La Torre

Hector la Torre

Luis La Torre

Silvia Eunice Gutiérrez de la Torre Julius-Maximilians-Universität Würzburg

Annabel la Torre Cevallos

 

Other publications of authors with the same name

Towards a single model of efficient computation in real parallel machines., and . Future Gener. Comput. Syst., 8 (4): 395-408 (1992)Optimal Edge Ranking of Trees in Polynomial Time., , and . Algorithmica, 13 (6): 592-618 (1995)A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys., and . J. Algorithms, 22 (2): 217-295 (1997)Submachine Locality in the Bulk Synchronous Setting (Extended Abstract)., and . Euro-Par, Vol. II, volume 1124 of Lecture Notes in Computer Science, page 352-358. Springer, (1996)A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries., and . MFCS, volume 1113 of Lecture Notes in Computer Science, page 542-553. Springer, (1996)How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top?. DNA, volume 2568 of Lecture Notes in Computer Science, page 95-111. Springer, (2002)Optimal Tree Ranking is in NC., , and . Parallel Process. Lett., (1992)Super critical tree numbering and optimal tree ranking are in NC., and . SPDP, page 767-773. IEEE Computer Society, (1991)Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper)., , and . SIROCCO, page 214-228. Carleton Scientific, (1998)Fast and Efficient Parallel Algorithms for Single Source Lexicographic Depth-First Breadth-First Search and Topological-First Search., and . ICPP (3), page 286-287. CRC Press, (1991)