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

• Efficient list ranking algorithms on reconfigurable mesh
  Sung-Ryul Kim, Kunsoo Park
  Lecture Notes in Computer Science 1858, 2000, pp. 262-271
• Tripods do not pack densely
  Alexandre Tiskin
  Lecture Notes in Computer Science 1858, 2000, pp. 272-280
• An efficient k nearest neighbor searching algorithm for a query line
  Subhas C. Nandy
  Lecture Notes in Computer Science 1858, 2000, pp. 281-290
• Tetrahedralization of two nested convex polyhedra
  Cao An Wang, Boting Yang
  Lecture Notes in Computer Science 1858, 2000, pp. 291-298
• Efficient algorithms for two-center problems for a convex polygon
  Sung Kwon Kim, Chan-Su Shin
  Lecture Notes in Computer Science 1858, 2000, pp. 299-309
• On computation of arbitrage for markets with friction
  Xiaotie Deng, Zhongfei Li, Shouyang Wang
  Lecture Notes in Computer Science 1858, 2000, pp. 310-319
• On some optimization problems in obnoxious facility location
  Zhongping Qin, Yinfeng Xu, Binhai Zhu
  Lecture Notes in Computer Science 1858, 2000, pp. 320-329
• Generating necklaces and strings with forbidden substrings
  Frank Ruskey, Joe Sawada
  Lecture Notes in Computer Science 1858, 2000, pp. 330-339
• Optimal labelling of point features in the slider model
  Gunnar W. Klau, Petra Mutzel
  Lecture Notes in Computer Science 1858, 2000, pp. 340-350
• Mappings for conflict-free access of paths in elementary data structures
  Alan A. Bertossi, M. Cristina Pinotti
  Lecture Notes in Computer Science 1858, 2000, pp. 351-361
• Theory of trinomial heaps
  Tadao Takaoka
  Lecture Notes in Computer Science 1858, 2000, pp. 362-372
• Polyhedral aspects of the consecutive ones problem
  Marcus Oswald, Gerhard Reinelt
  Lecture Notes in Computer Science 1858, 2000, pp. 373-382
• The complexity of physical mapping with strict chimerism
  Stephan Weis, Rüdiger Reischuk
  Lecture Notes in Computer Science 1858, 2000, pp. 383-395
• Logical analysis of data with decomposable structures
  Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki
  Lecture Notes in Computer Science 1858, 2000, pp. 396-406
• Learning from approximate data
  Shirley Cheung H.C.
  Lecture Notes in Computer Science 1858, 2000, pp. 407-415
• A combinatorial approach to asymmetric traitor tracing
  Reihaneh Safavi-Naini, Yejing Wang
  Lecture Notes in Computer Science 1858, 2000, pp. 416-425
• Removing complexity assumptions from concurrent zero-knowledge proofs
  Giovanni Di Crescenzo
  Lecture Notes in Computer Science 1858, 2000, pp. 426-435
• One-way probabilistic reversible and quantum one-counter automata
  Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
  Lecture Notes in Computer Science 1858, 2000, pp. 436-446
• Similarity enrichment in image compression through weighted finite automata
  Zhuhan Jiang, Bruce Litow, Olivier de Vel
  Lecture Notes in Computer Science 1858, 2000, pp. 447-456
• On the power of input-synchronized alternating finite automata
  Hiroaki Yamamoto
  Lecture Notes in Computer Science 1858, 2000, pp. 457-466
• Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction
  Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara
  Lecture Notes in Computer Science 1858, 2000, pp. 467-476