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: Series=LNCS AND Volume=2387

• The assembly of the human and mouse genomes
  Gene Myers
  Lecture Notes in Computer Science 2387, 2002, pp. 1-1
• Data structures for one-dimensional packet classification using most-specific-rule matching
  Sartaj Sahni
  Lecture Notes in Computer Science 2387, 2002, pp. 2-2
• DNA complementarity and paradigms of computing
  Arto Salomaa
  Lecture Notes in Computer Science 2387, 2002, pp. 3-17
• On higher Arthur-Merlin classes
  Jin-Yi Cai, Denis Charles, A. Pavan, Samik Sengupta
  Lecture Notes in Computer Science 2387, 2002, pp. 18-27
• (2+f(n))-SAT and its properties
  Xiaotie Deng, C.H. Lee, Yunlei Zhao, Hong Zhu
  Lecture Notes in Computer Science 2387, 2002, pp. 28-36
• On the minimal polynomial of a matrix
  Thanh Minh Hoang, Thomas Thierauf
  Lecture Notes in Computer Science 2387, 2002, pp. 37-46
• Computable real functions of bounded variation and semi-computable real numbers
  Robert Rettinger, Xizhong Zheng, Burchard von Braunmühl
  Lecture Notes in Computer Science 2387, 2002, pp. 47-56
• Improved compact routing tables for planar networks via orderly spanning trees
  Hsueh-I Lu
  Lecture Notes in Computer Science 2387, 2002, pp. 57-66
• Coloring algorithms on subcubic graphs
  Harold N. Gabow, San Skulrattanakulchai
  Lecture Notes in Computer Science 2387, 2002, pp. 67-76
• Efficient algorithms for the Hamiltonian problem on distance-hereditary graphs
  Sun-yuan Hsieh, Chin-wen Ho, Tsan-sheng Hsu, Ming-tat Ko
  Lecture Notes in Computer Science 2387, 2002, pp. 77-86
• Extending the accommodating function
  Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
  Lecture Notes in Computer Science 2387, 2002, pp. 87-96
• Inverse parametric sequence alignment
  Fangting Sun, David Fernández-Baca, Wei Yu
  Lecture Notes in Computer Science 2387, 2002, pp. 97-106
• The full Steiner tree problem in phylogeny
  Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee
  Lecture Notes in Computer Science 2387, 2002, pp. 107-116
• Inferring a union of halfspaces from examples
  Tatsuya Akutsu, Sascha Ott
  Lecture Notes in Computer Science 2387, 2002, pp. 117-126
• Dictionary look-up within small edit distance
  Abdullah N. Arslan, Ömer Eğecioğlu
  Lecture Notes in Computer Science 2387, 2002, pp. 127-136
• Polynomial interpolation of the elliptic curve and XTR discrete logarithm
  Tanja Lange, Arne Winterhof
  Lecture Notes in Computer Science 2387, 2002, pp. 137-143
• Co-orthogonal codes
  Vince Grolmusz
  Lecture Notes in Computer Science 2387, 2002, pp. 144-152
• Efficient power-sum systolic architectures for public-key cryptosystems in GF(2 ^m)
  Nam-Yeun Kim, Won-Ho Lee, Kee-Young Yoo
  Lecture Notes in Computer Science 2387, 2002, pp. 153-161
• A combinatorial approach to anonymous membership broadcast
  Huaxiong Wang, Josef Pieprzyk
  Lecture Notes in Computer Science 2387, 2002, pp. 162-170
• Solving constraint satisfaction problems with DNA computing
  Evgeny Dantsin, Alexander Wolpert
  Lecture Notes in Computer Science 2387, 2002, pp. 171-180
• New architecture and algorithms for degradable VLSI/WSI arrays
  Wu Jigang, Heiko Schröder, Srikanthan Thambipillai
  Lecture Notes in Computer Science 2387, 2002, pp. 181-190
• Cluster: A fast tool to identify groups of similar programs
  Casey Carter, Nicholas Tran
  Lecture Notes in Computer Science 2387, 2002, pp. 191-199
• Broadcasting in generalized de Bruijn digraphs
  Yosuke Kikuchi, Shingo Osawa, Yukio Shibata
  Lecture Notes in Computer Science 2387, 2002, pp. 200-209
• On the connected domination number of random regular graphs
  William Duckworth, Bernard Mans
  Lecture Notes in Computer Science 2387, 2002, pp. 210-219
• On the number of minimum cuts in a graph
  L. Sunil Chandran, L. Shankar Ram
  Lecture Notes in Computer Science 2387, 2002, pp. 220-229