BibSLEIGH
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
Travelled to:
1 × Denmark
1 × Japan
1 × Poland
2 × USA
Collaborated with:
O.Weimann P.Gawrychowski P.N.Klein K.Fox C.Sommer E.D.Demaine B.Rossman
Talks about:
decomposit (2) submatrix (2) maximum (2) planar (2) matric (2) queri (2) time (2) mong (2) predecessor (1) bicriteria (1)

Person: Shay Mozes

DBLP DBLP: Mozes:Shay

Contributed to:

ICALP (1) 20152015
STOC 20152015
ICALP (1) 20142014
STOC 20132013
ICALP 20072007

Wrote 5 papers:

ICALP-v1-2015-GawrychowskiMW #matrix #query
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (PG, SM, OW), pp. 580–592.
STOC-2015-FoxKM #approximate #polynomial
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection (KF, PNK, SM), pp. 841–850.
ICALP-v1-2014-GawrychowskiMW #matrix #query
Improved Submatrix Maximum Queries in Monge Matrices (PG, SM, OW), pp. 525–537.
STOC-2013-KleinMS #graph #linear #recursion
Structured recursive separator decompositions for planar graphs in linear time (PNK, SM, CS), pp. 505–514.
ICALP-2007-DemaineMRW #algorithm #composition #distance #edit distance
An Optimal Decomposition Algorithm for Tree Edit Distance (EDD, SM, BR, OW), pp. 146–157.

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.