More Efficient Parallel Totally Monotone Matrix Searching

Bradford, Phillip Gnassi; Fleischer, Rudolf; Smid, Michiel

doi:10.1006/jagm.1996.0824

Local TagsRelease HistoryDetailsSummary

More Efficient Parallel Totally Monotone Matrix Searching

Bradford, P. G., Fleischer, R., & Smid, M. (1997). More Efficient Parallel Totally Monotone Matrix Searching. Journal of Algorithms, 23(2), 386-400. doi:10.1006/jagm.1996.0824.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3956-0 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-3FB2-3

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Bradford, Phillip Gnassi¹, Author
Fleischer, Rudolf¹, Author
Smid, Michiel¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1997

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517915
Other: Local-ID: C1256428004B93B8-9E66CFB32A211269C12565D7004DBCD1-BrFlSm97
BibTex Citekey: Brandford-et-al_JoA97
DOI: 10.1006/jagm.1996.0824

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Algorithms

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Orlando, Fla. : Academic Press

Pages: - Volume / Issue: 23 (2) Sequence Number: - Start / End Page: 386 - 400 Identifier: ISSN: 0196-6774
CoNE: https://pure.mpg.de/cone/journals/resource/954922648097