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=2108

• Complete problems for Valiant's class of qp-computable families of polynomials
  Markus Bläser
  Lecture Notes in Computer Science 2108, 2001, pp. 1-10
• Log-space constructible universal traversal sequences for cycles of length O(n^{4.03})
  Michal Koucký
  Lecture Notes in Computer Science 2108, 2001, pp. 11-20
• On universally polynomial context-free languages
  Nicholas Tran
  Lecture Notes in Computer Science 2108, 2001, pp. 21-27
• Separating oblivious and non-oblivious BPs
  Kazuo Iwama, Yasuo Okabe, Toshiro Takase
  Lecture Notes in Computer Science 2108, 2001, pp. 28-38
• Program schemes, queues, the recursive spectrum and zero-one laws
  Iain A. Stewart
  Lecture Notes in Computer Science 2108, 2001, pp. 39-48
• Algebraic properties for P-selectivity
  Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
  Lecture Notes in Computer Science 2108, 2001, pp. 49-58
• Parallelizability of some P-complete geometric problems in the EREW-PRAM
  Carla Denise Castanho, Wei Chen, Koichi Wada, Akihiro Fujiwara
  Lecture Notes in Computer Science 2108, 2001, pp. 59-63
• Enhanced sequence reconstruction with DNA microarray application
  Samuel A. Heath, Franco P. Preparata
  Lecture Notes in Computer Science 2108, 2001, pp. 64-74
• Non-approximability of weighted multiple sequence alignment
  Bodo Siebert
  Lecture Notes in Computer Science 2108, 2001, pp. 75-85
• A greedy algorithm for optimal recombination
  Shiquan Wu, Xun Gu
  Lecture Notes in Computer Science 2108, 2001, pp. 86-90
• Generating well-shaped d-dimensional Delaunay meshes
  Xiang-Yang Li
  Lecture Notes in Computer Science 2108, 2001, pp. 91-100
• Towards compatible triangulations
  Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado
  Lecture Notes in Computer Science 2108, 2001, pp. 101-110
• An improved upper bound on the size of planar convex-hulls
  Abdullah N. Arslan, Ömer Eğecioğlu
  Lecture Notes in Computer Science 2108, 2001, pp. 111-120
• On the planar two-watchtower problem
  Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu
  Lecture Notes in Computer Science 2108, 2001, pp. 121-130
• Efficient generation of triconnected plane triangulations
  Shin-ichi Nakano
  Lecture Notes in Computer Science 2108, 2001, pp. 131-141
• Packing two disks into a polygonal environment
  Prosenjit Bose, Pat Morin, Antoine Vigneron
  Lecture Notes in Computer Science 2108, 2001, pp. 142-149
• Maximum red/blue interval matching with applications
  Danny Z. Chen, Xiaobo (Sharon) Hu, Xiaodong Wu
  Lecture Notes in Computer Science 2108, 2001, pp. 150-158
• Computing farthest neighbors on a convex polytope
  Otfried Cheong, Chan-Su Shin, Antoine Vigneron
  Lecture Notes in Computer Science 2108, 2001, pp. 159-169
• Finding an optimal bridge between two polygons
  Xuehou Tan
  Lecture Notes in Computer Science 2108, 2001, pp. 170-180
• How good is sink insertion?
  Xiang-Yang Li, Yu Wang
  Lecture Notes in Computer Science 2108, 2001, pp. 181-190
• Polynomial time algorithms for three-label point labeling
  Rob Duncan, Jianbo Qian, Binhai Zhu
  Lecture Notes in Computer Science 2108, 2001, pp. 191-200
• Approximation algorithms for the watchman route and zookeeper's problems
  Xuehou Tan
  Lecture Notes in Computer Science 2108, 2001, pp. 201-206
• PC-trees vs. PQ-trees
  Wen-Lian Hsu
  Lecture Notes in Computer Science 2108, 2001, pp. 207-217
• Stacks versus deques
  Holger Petersen
  Lecture Notes in Computer Science 2108, 2001, pp. 218-227
• Optimizing a computational method for length lower bounds for reflecting sequences
  H.K. Dai
  Lecture Notes in Computer Science 2108, 2001, pp. 228-236