Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/fcs/BaiW06
%A Bai, Yongsheng
%A Weems, Bob P.
%B FCS
%D 2006
%E Arabnia, Hamid R.
%E Murgin, Mark
%I CSREA Press
%K dblp
%P 81-87
%T Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences.
%U http://dblp.uni-trier.de/db/conf/fcs/fcs2006.html#BaiW06
%@ 1-60132-015-9
@inproceedings{conf/fcs/BaiW06,
added-at = {2007-01-02T00:00:00.000+0100},
author = {Bai, Yongsheng and Weems, Bob P.},
biburl = {https://www.bibsonomy.org/bibtex/26d9b11a8d4903a0ad19cb495d73a1f0a/dblp},
booktitle = {FCS},
crossref = {conf/fcs/2006},
date = {2007-01-02},
description = {dblp},
editor = {Arabnia, Hamid R. and Murgin, Mark},
interhash = {acda9bc90554ff72e2ddaade7fa38106},
intrahash = {6d9b11a8d4903a0ad19cb495d73a1f0a},
isbn = {1-60132-015-9},
keywords = {dblp},
pages = {81-87},
publisher = {CSREA Press},
timestamp = {2007-01-02T00:00:00.000+0100},
title = {Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences.},
url = {http://dblp.uni-trier.de/db/conf/fcs/fcs2006.html#BaiW06},
year = 2006
}