Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access
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

Daniel Reidenbach, Markus L. Schmid
Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access
LATA, 2011.

LATA 2011
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{LATA-2011-ReidenbachS,
	author        = "Daniel Reidenbach and Markus L. Schmid",
	booktitle     = "{Proceedings of the Fifth International Conference on Language and Automata Theory and Applications}",
	doi           = "10.1007/978-3-642-21254-3_37",
	isbn          = "978-3-642-21253-6",
	pages         = "465--476",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access}",
	volume        = 6638,
	year          = 2011,
}

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.