A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk
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

H. K. Dai, Z. Wang
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk
LATA, 2015.

LATA 2015
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{LATA-2015-DaiW,
	author        = "H. K. Dai and Z. Wang",
	booktitle     = "{Proceedings of the Ninth International Conference on Language and Automata Theory and Applications}",
	doi           = "10.1007/978-3-319-15579-1_10",
	isbn          = "978-3-319-15578-4",
	pages         = "133--144",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk}",
	volume        = 8977,
	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.