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

• Polynomial equations-solving and its applications
  Wen-tsun Wu
  Lecture Notes in Computer Science 834, 1994, pp. 1-9
• Quasi-random combinatorial structures
  Ronald L. Graham
  Lecture Notes in Computer Science 834, 1994, pp. 10-10
• Hamiltonian abstract Voronoi diagrams in linear time
  Rolf Klein, Andrzej Lingas
  Lecture Notes in Computer Science 834, 1994, pp. 11-19
• Every set of disjoint line segments admits a binary tree
  Prosenjit Bose, Michael E. Houle, Godfried Toussaint
  Lecture Notes in Computer Science 834, 1994, pp. 20-28
• The traveling cameraman problem, with applications to automatic optical inspection
  Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki
  Lecture Notes in Computer Science 834, 1994, pp. 29-37
• On determining the congruity of point sets in higher dimensions
  Tatsuya Akutsu
  Lecture Notes in Computer Science 834, 1994, pp. 38-46
• On random hard sets for NP
  Ronald V. Book, Osamu Watanabe
  Lecture Notes in Computer Science 834, 1994, pp. 47-55
• Computing solutions uniquely collapses the polynomial hierarchy
  Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman
  Lecture Notes in Computer Science 834, 1994, pp. 56-64
• Verifying the determinant in parallel
  Miklos Santha, Sovanna Tan
  Lecture Notes in Computer Science 834, 1994, pp. 65-73
• Hardness of approximating graph transformation problem
  Chih-Long Lin
  Lecture Notes in Computer Science 834, 1994, pp. 74-82
• Randomized wait-free naming
  Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul Vitányi
  Lecture Notes in Computer Science 834, 1994, pp. 83-91
• Unifying themes for network selection
  Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
  Lecture Notes in Computer Science 834, 1994, pp. 92-100
• Robust asynchronous algorithms in networks with a fault detection ring
  M. Molcho, S. Zaks
  Lecture Notes in Computer Science 834, 1994, pp. 101-109
• Distributed algorithms for finding small cycle covers in arbitrary networks
  Esther Jennings, Lenka Motyc̑ková
  Lecture Notes in Computer Science 834, 1994, pp. 110-118
• A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming
  Xiang-sun Zhang, Hui-can Zhu
  Lecture Notes in Computer Science 834, 1994, pp. 119-127
• Analysis of the convergency of topology preserving neural networks on learning
  Daming Zhu, Shaohan Ma, Hongze Qiu
  Lecture Notes in Computer Science 834, 1994, pp. 128-136
• On helping and interactive proof systems
  V. Arvind, J. Köbler, R. Schuler
  Lecture Notes in Computer Science 834, 1994, pp. 137-145
• Average time complexity of the SAT1.2 algorithm
  Jun Gu, Qian-Ping Gu
  Lecture Notes in Computer Science 834, 1994, pp. 146-154
• Average cost to produce partial orders
  Jingsen Chen
  Lecture Notes in Computer Science 834, 1994, pp. 155-163
• Two notes on low-density subset sum algorithms
  Daxing Li, Shaohan Ma
  Lecture Notes in Computer Science 834, 1994, pp. 164-171
• Rotation distance, triangulations of planar surfaces and hyperbolic geometry
  Jin-Yi Cai, Michael D. Hirsch
  Lecture Notes in Computer Science 834, 1994, pp. 172-180
• Finitely representable spatial objects and efficient computation
  Yongmao Chen, Terence R. Smith
  Lecture Notes in Computer Science 834, 1994, pp. 181-189
• Computing all small cuts in undirected networks
  Hiroshi Nagamochi, Kazuhiro Nishimura, Toshihide Ibaraki
  Lecture Notes in Computer Science 834, 1994, pp. 190-198
• Edge-coloring and f-coloring for various classes of graphs
  Xiao Zhou, Takao Nishizeki
  Lecture Notes in Computer Science 834, 1994, pp. 199-207
• Edge-disjoint paths in permutation graphs
  C.P. Gopalakrishnan, C. Pandu Rangan
  Lecture Notes in Computer Science 834, 1994, pp. 208-216