default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPilar de la Torre
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2004
[j11]Pilar de la Torre, Michael Mitzenmacher, Rajmohan Rajaraman, Berthold Vöcking:
Foreword. Theory Comput. Syst. 37(3): 321 (2004)- 2003
- [j10]Pilar de la Torre:
How efficiently can room at the bottom be traded away for speed at the top? Nat. Comput. 2(4): 349-389 (2003) - 2001
- [j9]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): 275-298 (2001) - 1998
- [j8]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): 123-142 (1998) - 1997
- [j7]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) - 1995
- [j6]Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer:
Optimal Edge Ranking of Trees in Polynomial Time. Algorithmica 13(6): 592-618 (1995) - [j5]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) - 1992
- [j4]Pilar de la Torre, Clyde P. Kruskal:
Towards a single model of efficient computation in real parallel machines. Future Gener. Comput. Syst. 8(4): 395-408 (1992) - [j3]Pilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka:
Optimal Tree Ranking is in NC. Parallel Process. Lett. 2: 31-41 (1992) - 1989
- [j2]Gary D. Knott, Pilar de la Torre:
Hash Table Collision Resolution with Direct Chaining. J. Algorithms 10(1): 20-34 (1989) - 1983
- [j1]Azriel Rosenfeld, Pilar de la Torre:
Histogram concavity analysis as an aid in threshold selection. IEEE Trans. Syst. Man Cybern. 13(2): 231-235 (1983)
Conference and Workshop Papers
- 2002
- [c12]Pilar de la Torre:
How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top? DNA 2002: 95-111 - 1998
- [c11]Radim Bartos, Pilar de la Torre, Rajgopal Kannan:
Space-time-wavelength network with group communication locality. Multichannel Optical Networks: Theory and Practice 1998: 239-249 - [c10]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 - 1996
- [c9]Pilar de la Torre, Clyde P. Kruskal:
Submachine Locality in the Bulk Synchronous Setting (Extended Abstract). Euro-Par, Vol. II 1996: 352-358 - [c8]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 - [c7]Pilar de la Torre, Clyde P. Kruskal:
Exact Bandwith of Parallel-Processor Networks. SIROCCO 1996: 195-209 - 1995
- [c6]Pilar de la Torre, Clyde P. Kruskal:
A structural theory of recursively decomposable parallel processor-networks. SPDP 1995: 570-578 - 1994
- [c5]Pilar de la Torre, Clyde P. Kruskal:
A Calculus of Adaptive Purpose Parallel Computation. IFIP Congress (1) 1994: 521-526 - 1993
- [c4]Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer:
Optimal Edge Ranking of Trees in Polynomial Time. SODA 1993: 138-144 - 1991
- [c3]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 - [c2]Pilar de la Torre, Clyde P. Kruskal:
Towards a Single Model of Efficient Computation in Real Parallel Machines. PARLE (1) 1991: 6-24 - [c1]Pilar de la Torre, Raymond Greenlaw:
Super critical tree numbering and optimal tree ranking are in NC. SPDP 1991: 767-773
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
