Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1276

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

On physical mapping algorithms: An error-tolerant test for the consecutive ones property
Wen-Lian Hsu
Lecture Notes in Computer Science 1276, 1997, pp. 242-250
The median problem for breakpoints in comparative genomics
David Sankoff, Mathieu Blanchette
Lecture Notes in Computer Science 1276, 1997, pp. 251-263
Fast algorithms for aligning sequences with restricted affine gap penalties
Kun-Mao Chao
Lecture Notes in Computer Science 1276, 1997, pp. 264-273
A matrix representation of phylogenetic trees
Sanzheng Qiao, W.S.-Y. Wang
Lecture Notes in Computer Science 1276, 1997, pp. 274-283
Edge and node searching problems on trees
Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan-Yi Tang
Lecture Notes in Computer Science 1276, 1997, pp. 284-293
Construction of nearly optimal multiway trees
Peter Becker
Lecture Notes in Computer Science 1276, 1997, pp. 294-303
Optimal algorithms for circle partitioning
Kuo-Hui Tsai, Da-Wei Wang
Lecture Notes in Computer Science 1276, 1997, pp. 304-310
Hexagonal routing of multiterminal nets
Xuehou Tan, Xiaoyu Song
Lecture Notes in Computer Science 1276, 1997, pp. 311-320
Design and analysis of parallel set-term unification
Seung-Jin Lim, Yiu-Kai Ng
Lecture Notes in Computer Science 1276, 1997, pp. 321-330
On modularity of completeness in order-sorted term rewriting systems
Yoshinobu Kawabe, Naohiro Ishii
Lecture Notes in Computer Science 1276, 1997, pp. 331-342
A three-valued quantificational logic of context
Kaile Su, Decheng Ding, Houwang Chen
Lecture Notes in Computer Science 1276, 1997, pp. 343-352
A compact storage scheme for fast wavelet-based subregion retrieval
A.S. Poulakidas, A. Srinivasan, O. Egecioglu, O. Ibarra, T. Yang
Lecture Notes in Computer Science 1276, 1997, pp. 353-362
A declustering algorithm for minimising spatial join cost
Yanchun Zhang, Jitian Xiao, Xiaofang Zhou
Lecture Notes in Computer Science 1276, 1997, pp. 363-372
Fixed topology Steiner trees and spanning forests with applications in network communications
Lusheng Wang, Xiaohua Jia
Lecture Notes in Computer Science 1276, 1997, pp. 373-382
A branch-and-bound algorithm for computing node weighted Steiner minimum trees
Guoliang Xue
Lecture Notes in Computer Science 1276, 1997, pp. 383-392
A complete characterization of repetitive morphisms over the two-letter alphabet
Yuji Kobayashi, Friedrich Otto, Patrice Séébold
Lecture Notes in Computer Science 1276, 1997, pp. 393-402
An algorithm for identifying spliced languages
Sam M. Kim
Lecture Notes in Computer Science 1276, 1997, pp. 403-411
The shapes of trees
Ulrich Hertrampf
Lecture Notes in Computer Science 1276, 1997, pp. 412-421
Tally languages accepted by alternating multitape finite automata
Dainis Geidmanis, Jānis Kaņeps, Kalvis Apsītis, Daina Taimiņa, Elena Calude
Lecture Notes in Computer Science 1276, 1997, pp. 422-430
Independent spanning trees of chordal rings
Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi
Lecture Notes in Computer Science 1276, 1997, pp. 431-440
Rearrangeable graphs
Qing Hu, Yixin Zhang, Xiaojun Shen
Lecture Notes in Computer Science 1276, 1997, pp. 441-450
Projective torus networks
Ting-Yi Sung, Tung-Yang Ho, Lih-Hsing Hsu
Lecture Notes in Computer Science 1276, 1997, pp. 451-459
On the 100\% rule of sensitivity analysis in linear programming
Pu Cai, Jin-Yi Cai
Lecture Notes in Computer Science 1276, 1997, pp. 460-469
Enumerating triangulations for products of two simplices and for arbitrary configurations of points
Fumihiko Takeuchi, Hiroshi Imai
Lecture Notes in Computer Science 1276, 1997, pp. 470-481
Tree structure genetic algorithm with a nourishment mechanism
Zhangang Han, Ruqian Lu
Lecture Notes in Computer Science 1276, 1997, pp. 482-491

Seiten < 1 2 3 >