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

• The Steiner minimal tree problem in the \lambda-geometry plane
  D.T. Lee, C.F. Shen
  Lecture Notes in Computer Science 1178, 1996, pp. 247-255
• A study of the LMT-skeleton
  Siu-Wing Cheng, Naoki Katoh, Manabu Sugai
  Lecture Notes in Computer Science 1178, 1996, pp. 256-265
• A new subgraph of minimum weight triangulations
  Cao An Wang, Francis Chin, Yin-Feng Xu
  Lecture Notes in Computer Science 1178, 1996, pp. 266-274
• Dynamic tree routing under the "Matching with Consumption" model
  Grammati E. Pantziou, Alan Roberts, Antonis Symvonis
  Lecture Notes in Computer Science 1178, 1996, pp. 275-284
• Dimension-exchange token distribution on the mesh and the torus
  Michael E. Houle, Gavin Turner
  Lecture Notes in Computer Science 1178, 1996, pp. 285-294
• Directed Hamiltonian packing in d-dimensional meshes and its application
  Jae-Ha Lee, Chan-Su Shin, Kyung-Yong Chwa
  Lecture Notes in Computer Science 1178, 1996, pp. 295-304
• k-pairs non-crossing shortest paths in a simple polygon
  Evanthia Papadopoulou
  Lecture Notes in Computer Science 1178, 1996, pp. 305-314
• Minimum convex partition of a polygon with holes by cuts in given directions
  A. Lingas, V. Soltan
  Lecture Notes in Computer Science 1178, 1996, pp. 315-325
• Efficient list ranking on the reconfigurable mesh, with applications
  Tatsuya Hayashi, Koji Nakano, Stephan Olariu
  Lecture Notes in Computer Science 1178, 1996, pp. 326-335
• Periodic merging networks
  Mirosƚaw Kutyƚowski, Krzysztof Loryś, Brigitte Oesterdiekhoff
  Lecture Notes in Computer Science 1178, 1996, pp. 336-345
• Minimizing wavelengths in an all-optical ring network
  Gordon Wilfong
  Lecture Notes in Computer Science 1178, 1996, pp. 346-355
• Competitive analysis of on-line disk scheduling
  Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei, Hsu-Chun Yen
  Lecture Notes in Computer Science 1178, 1996, pp. 356-365
• Scheduling interval ordered tasks with non-uniform deadlines
  Jacques Verriet
  Lecture Notes in Computer Science 1178, 1996, pp. 366-375
• Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis
  Kouichi Sakurai, Yuliang Zheng
  Lecture Notes in Computer Science 1178, 1996, pp. 376-385
• The multi-variable modular polynomial and its applications to cryptography
  Tsuyoshi Takagi, Shozo Naito
  Lecture Notes in Computer Science 1178, 1996, pp. 386-396
• Bounds and algorithms for a practical task allocation model
  Tsan-sheng Hsu, Dian Rae Lopez
  Lecture Notes in Computer Science 1178, 1996, pp. 397-406
• Scheduling algorithms for strict multithreaded computations
  Panagiota Fatourou, Paul Spirakis
  Lecture Notes in Computer Science 1178, 1996, pp. 407-416
• On multi-threaded paging
  Esteban Feuerstein, Alejandro Strejilevich de Loma
  Lecture Notes in Computer Science 1178, 1996, pp. 417-426
• A fast and efficient homophonic coding algorithm
  Boris Ryabko, Andrey Fionov
  Lecture Notes in Computer Science 1178, 1996, pp. 427-435
• An improvement of the digital cash protocol of Okamoto and Ohta
  Osamu Watanabe, Osamu Yamashita
  Lecture Notes in Computer Science 1178, 1996, pp. 436-445