Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Shi, Qi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Resource-efficient authentic key establishment in heterogeneous wireless sensor networks
Qi Shi
,
Ning Zhang
,
Madjid Merabti
,
Kashif Kifayat
Journal Parallel Distributed Computing
73
(2), 2013, pp. 235-249
Efficient algorithms for the conditional covering problem
Robert Benkoczi
,
Binay Bhattacharya
,
Yuzhuang Hu
,
Chien-Hsin Lin
,
Qiaosheng Shi
,
Biing-Feng Wang
Information and Computation
219
, 2012, pp. 39-57
CPSS: A computational platform for the analysis of small RNA deep sequencing data
Yuanwei Zhang
,
Bo Xu
,
Yifan Yang
,
Rongjun Ban
,
Huan Zhang
,
Xiaohua Jiang
,
Howard J. Cooke
,
Yu Xue
,
Qinghua Shi
Bioinformatics
28
(14), 2012, pp. 1925-1927
Prediction of novel pre-microRNAs with high accuracy through boosting and SVM
Yuanwei Zhang
,
Yifan Yang
,
Huan Zhang
,
Xiaohua Jiang
,
Bo Xu
,
Yu Xue
,
Yunxia Cao
,
Qian Zhai
,
Yong Zhai
,
Mingqing Xu
,
Howard J. Cooke
,
Qinghua Shi
Bioinformatics
27
(10), 2011, pp. 1436-1437
Optimal movement of mobile sensors for barrier coverage of a planar region
Binay Bhattacharya
,
Mike Burmester
,
Yuzhuang Hu
,
Evangelos Kranakis
,
Qiaosheng Shi
,
Andreas Wiese
Theoretical Computer Science
410
(52), 2009, pp. 5515-5528
Approximation algorithms for a network design problem
Binay Bhattacharya
,
Yuzhuang Hu
,
Qiaosheng Shi
Lecture Notes in Computer Science
5609
, 2009, pp. 225-237
Optimal algorithms for the path/tree-shaped facility location problems in trees
Binay Bhattacharya
,
Qiaosheng Shi
,
Arie Tamir
Algorithmica
55
(4), 2009, pp. 601-618
Single vehicle scheduling problems on path/tree/cycle networks with release and handling times
Binay Bhattacharya
,
Paz Carmi
,
Yuzhuang Hu
,
Qiaosheng Shi
Lecture Notes in Computer Science
5369
, 2008, pp. 800-811
On
k
-d range search with Patricia tries
Bradford G. Nickerson
,
Qingxiu Shi
SIAM Journal on Computing
37
(5), 2008, pp. 1373-1386
Efficient algorithms for center problems in cactus networks
Boaz Ben-Moshe
,
Binay Bhattacharya
,
Qiaosheng Shi
,
Arie Tamir
Theoretical Computer Science
378
(3), 2007, pp. 237-252
Optimal algorithms for the weighted
p
-center problems on the real line for small
p
Binay Bhattacharya
,
Qiaosheng Shi
Lecture Notes in Computer Science
4619
, 2007, pp. 529-540
Optimal algorithms for the path/tree-shaped facility location problems in trees
Binay Bhattacharya
,
Yuzhuang Hu
,
Qiaosheng Shi
,
Arie Tamir
Lecture Notes in Computer Science
4288
, 2006, pp. 379-388
Efficient algorithms for the weighted 2-center problem in a cactus graph
Boaz Ben-Moshe
,
Binay Bhattacharya
,
Qiaosheng Shi
Lecture Notes in Computer Science
3827
, 2005, pp. 693-703
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Qingmin Shi
,
Joseph JaJa
Information Processing Letters
95
(3), 2005, pp. 382-388
Novel transformation techniques using
Q
-heaps with applications to computational geometry
Qingmin Shi
,
Joseph JaJa
SIAM Journal on Computing
34
(6), 2005, pp. 1474-1492
A new framework for addressing temporal range queries and some preliminary results
Qingmin Shi
,
Joseph JaJa
Theoretical Computer Science
332
(1-3), 2005, pp. 109-121
Space-efficient and fast algorithms for multidimensional dominance reporting and counting
Joseph JaJa
,
Christian W. Mortensen
,
Qingmin Shi
Lecture Notes in Computer Science
3341
, 2004, pp. 558-568
Techniques for indexing and querying temporal observations for a collection of objects
Qingmin Shi
,
Joseph JaJa
Lecture Notes in Computer Science
3341
, 2004, pp. 822-834
Fast algorithms for 3-D dominance reporting and counting
Qingmin Shi
,
Joseph Jaja
International Journal of Foundations of Computer Science
15
(4), 2004, pp. 673-684
Fast algorithms for a class of temporal range queries
Qingmin Shi
,
Joseph JaJa
Lecture Notes in Computer Science
2748
, 2003, pp. 91-102