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 [2]	Hilfe

Suche: Series=LNCS AND YEAR=1995

• On the computation of the radical of polynomial complete intersection ideals
  Inés Armendáriz, Pablo Solernó
  Lecture Notes in Computer Science 948, 1995, pp. 106-119
• Which families of long binary linear codes have a binomial weight distribution?
  Th. Beth, H. Kalouti, D.E. Lazic
  Lecture Notes in Computer Science 948, 1995, pp. 120-130
• The discovery of simple 7-designs with automorphism group P \Gamma L(2,32)
  Anton Betten, Adalbert Kerber, Axel Kohnert, Reinhard Laue, Alfred Wassermann
  Lecture Notes in Computer Science 948, 1995, pp. 131-145
• Fast exponentation in cryptography
  Irina E. Bocharova, Boris D. Kudryashov
  Lecture Notes in Computer Science 948, 1995, pp. 146-157
• On maximal spherical codes I
  Peter Boyvalenkov, Ivan Landgev
  Lecture Notes in Computer Science 948, 1995, pp. 158-168
• Formal computation of Galois groups with relative resolvents
  Antoine Colin
  Lecture Notes in Computer Science 948, 1995, pp. 169-182
• A case of automatic theorem proving in Euclidean geometry: The Maclane 8_3 theorem
  Pasqualina Conti, Carlo Traverso
  Lecture Notes in Computer Science 948, 1995, pp. 183-193
• Intervalizing k-colored graphs
  Hans L. Bodlaender, Babette de Fluiter
  Lecture Notes in Computer Science 944, 1995, pp. 87-98
• NC algorithms for finding a maximal set of paths with application to compressing strings
  Zhi-Zhong Chen
  Lecture Notes in Computer Science 944, 1995, pp. 99-110
• Fast gossiping by short messages
  J.-C. Bermond, L. Gargano, A.A. Rescigno, U. Vaccaro
  Lecture Notes in Computer Science 944, 1995, pp. 135-146
• Break finite automata public key cryptosystem
  Feng Bao, Yoshihide Igarashi
  Lecture Notes in Computer Science 944, 1995, pp. 147-158
• On the number of random bits in totally private computation
  Carlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro
  Lecture Notes in Computer Science 944, 1995, pp. 171-182
• The complexity of searching succinctly represented graphs
  José L. Balcázar
  Lecture Notes in Computer Science 944, 1995, pp. 208-219
• Optimal shooting: Characterizations and applications
  Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
  Lecture Notes in Computer Science 944, 1995, pp. 220-231
• Placing resources in a tree: Dynamic and static algorithms
  Vincenzo Auletta, Domenico Parente, Giuseppe Persiano
  Lecture Notes in Computer Science 944, 1995, pp. 232-243
• Shortes path queries in digraphs of small treewidth
  Shiva Chaudhuri, Christos D. Zaroliagis
  Lecture Notes in Computer Science 944, 1995, pp. 244-255
• Parallel algorithms with optimal speedup for bounded treewidth
  Hans L. Bodlaender, Torben Hagerup
  Lecture Notes in Computer Science 944, 1995, pp. 268-279
• Linear time algorithms for dominating pairs in asteroidal triple-free graphs
  Derek G. Corneil, Stephan Olariu, Lorna Stewart
  Lecture Notes in Computer Science 944, 1995, pp. 292-302
• Lower bounds on algebraic random access machines
  Amir M. Ben-Amram, Zvi Galil
  Lecture Notes in Computer Science 944, 1995, pp. 360-371
• On optimal polynomial time approximations: P-levelability vs.~\Delta-levelability
  Klaus Ambos-Spies
  Lecture Notes in Computer Science 944, 1995, pp. 384-392
• New upper bounds for generalized intersection searching problems
  Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios Tsakalidis
  Lecture Notes in Computer Science 944, 1995, pp. 464-474
• OKFDDs versus OBDDs and OFDDs
  Bernd Becker, Rolf Drechsler, Michael Theobald
  Lecture Notes in Computer Science 944, 1995, pp. 475-486
• Automatic synthesis of real time systems
  Jrgen H. Andersen, Kåre J. Kristoffersen, Kim G. Larsen, Jesper Niedermann
  Lecture Notes in Computer Science 944, 1995, pp. 535-546
• Self-correcting for function fields of finite transcendental degree
  Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian
  Lecture Notes in Computer Science 944, 1995, pp. 547-557
• A characterization of the existence of energies for neural networks
  Michel Cosnard, Eric Goles
  Lecture Notes in Computer Science 944, 1995, pp. 570-580