English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

More Efficient Parallel Totally Monotone Matrix Searching

MPS-Authors
/persons/resource/persons44170

Bradford,  Phillip Gnassi
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44431

Fleischer,  Rudolf
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45509

Smid,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3956-0
Abstract
There is no abstract available