dblp.uni-trier.dewww.uni-trier.de

Pilar de la Torre

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2003
17EEPilar de la Torre: How efficiently can room at the bottom be traded away for speed at the top? Natural Computing 2(4): 349-389 (2003)
2002
16EEPilar de la Torre: How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top? DNA 2002: 95-111
2001
15EEPilar 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): 275-298 (2001)
1998
14 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: 214-228
13EEPilar de la Torre, David T. Kao: An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms. Discrete Mathematics 180(1-3): 123-142 (1998)
1997
12 Pilar de la Torre, David T. Kao: A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys. J. Algorithms 22(2): 217-295 (1997)
1996
11 Pilar de la Torre, Clyde P. Kruskal: Submachine Locality in the Bulk Synchronous Setting (Extended Abstract). Euro-Par, Vol. II 1996: 352-358
10 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: 542-553
9 Pilar de la Torre, Clyde P. Kruskal: Exact Bandwith of Parallel-Processor Networks. SIROCCO 1996: 195-209
1995
8 Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer: Optimal Edge Ranking of Trees in Polynomial Time. Algorithmica 13(6): 592-618 (1995)
7 Pilar de la Torre, Clyde P. Kruskal: Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems. J. Algorithms 19(1): 1-24 (1995)
1994
6 Pilar de la Torre, Clyde P. Kruskal: A Calculus of Adaptive Purpose Parallel Computation. IFIP Congress (1) 1994: 521-526
1993
5 Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer: Optimal Edge Ranking of Trees in Polynomial Time. SODA 1993: 138-144
1992
4 Pilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka: Optimal Tree Ranking is in NC. Parallel Processing Letters 2: 31-41 (1992)
1991
3 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: 286-287
2 Pilar de la Torre, Clyde P. Kruskal: Towards a Single Model of Efficient Computation in Real Parallel Machines. PARLE (1) 1991: 6-24
1989
1 Gary D. Knott, Pilar de la Torre: Hash Table Collision Resolution with Direct Chaining. J. Algorithms 10(1): 20-34 (1989)

Coauthor Index

1Raymond Greenlaw [4] [5] [8]
2David T. Kao [10] [12] [13]
3Gary D. Knott [1]
4Clyde P. Kruskal [2] [3] [6] [7] [9] [11] [15]
5Lata Narayanan [14]
6David Peleg [14]
7Teresa M. Przytycka [4]
8Alejandro A. Schäffer [5] [8]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)