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

• The inverse satisfiability problem
  Dimitris Kavvadias, Martha Sideri
  Lecture Notes in Computer Science 1090, 1996, pp. 250-259
• The join can lower complexity
  Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
  Lecture Notes in Computer Science 1090, 1996, pp. 260-267
• On the distribution of eigenvalues of graphs
  Xuerong Yong
  Lecture Notes in Computer Science 1090, 1996, pp. 268-272
• On the difficulty of designing good classifiers
  Michelangelo Grigni, Vincent Mirelli, Christos H. Papadimitriou
  Lecture Notes in Computer Science 1090, 1996, pp. 273-279
• Approximating Latin square extensions
  S. Ravi Kumar, Alexander Russell, Ravi Sundaram
  Lecture Notes in Computer Science 1090, 1996, pp. 280-289
• Approximating minimum keys and optimal substructure screens
  Tatsuya Akutsu, Feng Bao
  Lecture Notes in Computer Science 1090, 1996, pp. 290-299
• Reductions and convergence rates of average time
  Jay Belanger, Jie Wang
  Lecture Notes in Computer Science 1090, 1996, pp. 300-309
• On the complexity of computational problems associated with simple stochastic games
  Akio Yanbe, Kouichi Sakurai
  Lecture Notes in Computer Science 1090, 1996, pp. 310-322
• On the complexity of commutativity analysis
  Oscar Ibarra, Pedro Diniz, Martin Rinard
  Lecture Notes in Computer Science 1090, 1996, pp. 323-332
• Improved non-approximability results for vertex cover with density constraints
  Andrea E.F. Clementi, Luca Trevisan
  Lecture Notes in Computer Science 1090, 1996, pp. 333-342
• Some notes on the nearest neighbour interchange distance
  Ming Li, John Tromp, Louxin Zhang
  Lecture Notes in Computer Science 1090, 1996, pp. 343-351
• Distributed computing in asynchronous networks with Byzantine edges
  Vasant Shanbhogue, Moti Yung
  Lecture Notes in Computer Science 1090, 1996, pp. 352-360
• Weight biased leftist trees and modified skip lists
  Seonghun Cho, Sartaj Sahni
  Lecture Notes in Computer Science 1090, 1996, pp. 361-370
• Probabilistic analysis of local search and NP-completeness result for constraint satisfaction
  Hoong Chuin Lau
  Lecture Notes in Computer Science 1090, 1996, pp. 371-380
• On the reconfiguration of chains
  Sue Whitesides, Naixun Pei
  Lecture Notes in Computer Science 1090, 1996, pp. 381-390
• Two-guarding a rectilinear polygon
  Xuehou Tan, Binhai Zhu
  Lecture Notes in Computer Science 1090, 1996, pp. 391-400
• Three systems for shared generation of authenticators
  R. Safavi-Naini
  Lecture Notes in Computer Science 1090, 1996, pp. 401-410
• Efficient generation of elliptic curve cryptosystems
  Kwok-Yan Lam, San Ling, Lucas C-K Hui
  Lecture Notes in Computer Science 1090, 1996, pp. 411-416
• Superconnectivity for minimal multi-loop networks
  Jixiang Meng
  Lecture Notes in Computer Science 1090, 1996, pp. 417-419