Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=3595

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Completeness for parity problems
Leslie G. Valiant
Lecture Notes in Computer Science 3595, 2005, pp. 1-8
Monotony and surprise
Alberto Apostolico
Lecture Notes in Computer Science 3595, 2005, pp. 9-9
Smoothed analysis of algorithms and heuristics
Shang-Hua Teng
Lecture Notes in Computer Science 3595, 2005, pp. 10-11
Gene network: Model, dynamics and simulation
Shiquan Wu, Xun Gu
Lecture Notes in Computer Science 3595, 2005, pp. 12-21
Conserved interval distance computation between non-trivial genomes
Guillaume Blin, Romeo Rizzi
Lecture Notes in Computer Science 3595, 2005, pp. 22-31
RNA multiple structural alignment with longest common subsequences
Sergey Bereg, Binhai Zhu
Lecture Notes in Computer Science 3595, 2005, pp. 32-41
Perfect sorting by reversals
Marie-France Sagot, Eric Tannier
Lecture Notes in Computer Science 3595, 2005, pp. 42-51
Genome rearrangements with partially ordered chromosomes
Chunfang Zheng, David Sankoff
Lecture Notes in Computer Science 3595, 2005, pp. 52-62
Quartet-based phylogeny reconstruction from gene orders
Tao Liu, Jijun Tang, Bernard M.E. Moret
Lecture Notes in Computer Science 3595, 2005, pp. 63-73
Algorithmic and complexity issues of three clustering methods in microarray data analysis
Jinsong Tan, Kok Seng Chua, Louxin Zhang
Lecture Notes in Computer Science 3595, 2005, pp. 74-83
RIATA-HGT: A fast and accurate heuristic for reconstructing horizontal gene transfer
Luay Nakhleh, Derek Ruths, Li-San Wang
Lecture Notes in Computer Science 3595, 2005, pp. 84-93
A new pseudoknots folding algorithm for RNA structure prediction
Hengwu Li, Daming Zhu
Lecture Notes in Computer Science 3595, 2005, pp. 94-103
Rapid homology search with two-stage extension and daughter seeds
Miklós Csŭrös, Bin Ma
Lecture Notes in Computer Science 3595, 2005, pp. 104-114
On the approximation of computing evolutionary trees
Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul
Lecture Notes in Computer Science 3595, 2005, pp. 115-125
Theoretically good distributed CDMA/OVSF code assignment for wireless ad hoc networks
Xiang-Yang Li, Peng-Jun Wan
Lecture Notes in Computer Science 3595, 2005, pp. 126-135
Improved approximation algorithms for the capacitated multicast routing problem
Zhipeng Cai, Guohui Lin, Guoliang Xue
Lecture Notes in Computer Science 3595, 2005, pp. 136-145
Construction of scale-free networks with partial information
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
Lecture Notes in Computer Science 3595, 2005, pp. 146-155
Radio networks with reliable communication
Yvo Desmedt, Yongge Wang, Rei Safavi-Naini, Huaxiong Wang
Lecture Notes in Computer Science 3595, 2005, pp. 156-166
Geometric network design with selfish agents
Martin Hoefer, Piotr Krysta
Lecture Notes in Computer Science 3595, 2005, pp. 167-178
Bicriteria network design via iterative rounding
Piotr Krysta
Lecture Notes in Computer Science 3595, 2005, pp. 179-187
Interference in cellular networks: The minimum membership set cover problem
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger
Lecture Notes in Computer Science 3595, 2005, pp. 188-198
Routing and coloring for maximal number of trees
Xujin Chen, Xiaodong Hu, Tianping Shuai
Lecture Notes in Computer Science 3595, 2005, pp. 199-209
Share the multicast payment fairly
WeiZhao Wang, Xiang-Yang Li, Zheng Sun
Lecture Notes in Computer Science 3595, 2005, pp. 210-219
On packing and coloring hyperedges in a cycle
Jianping Li, Kang Li, Ken C.K. Law, Hao Zhao
Lecture Notes in Computer Science 3595, 2005, pp. 220-229
Fault-tolerant relay node placement in wireless sensor networks
Hai Liu, Peng-Jun Wan, Xiaohua Jia
Lecture Notes in Computer Science 3595, 2005, pp. 230-239

Seiten 1 2 3 4 >