Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Pawel Gawrychowski, Shay Mozes, Oren Weimann
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
ICALP, 2015.

ICALP v1 2015
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-v1-2015-GawrychowskiMW,
	author        = "Pawel Gawrychowski and Shay Mozes and Oren Weimann",
	booktitle     = "{Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Part I}",
	doi           = "10.1007/978-3-662-47672-7_47",
	isbn          = "978-3-662-47671-0",
	pages         = "580--592",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search}",
	volume        = 9134,
	year          = 2015,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.