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

Suche: Series=LNCS AND YEAR=1993

• A new class of sequences: Mapping sequences
  Guang Gong
  Lecture Notes in Computer Science 673, 1993, pp. 147-161
• A zero-test and an interpolation algorithm for the shifted sparse polynomials
  Dima Grigoriev, Marek Karpinski
  Lecture Notes in Computer Science 673, 1993, pp. 162-169
• Parallelization of quantifier elimination on a workstation network
  Hoon Hong
  Lecture Notes in Computer Science 673, 1993, pp. 170-179
• Hyperplane sections of Fermat varieties in P^3 in char.\ 2 and some applications to cyclic codes
  H. Janwa, R.M. Wilson
  Lecture Notes in Computer Science 673, 1993, pp. 180-194
• Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems
  Erich Kaltofen
  Lecture Notes in Computer Science 673, 1993, pp. 195-212
• Relations among Lie formal series and constructions of symplectic integrators
  P.-V. Koseleff
  Lecture Notes in Computer Science 673, 1993, pp. 213-230
• Exponential sums as discrete Fourier transform with invariant phase functions
  Gilles Lachaud
  Lecture Notes in Computer Science 673, 1993, pp. 231-243
• Application of finite fields to memory interleaving
  Abraham Lempel, Gadiel Seroussi
  Lecture Notes in Computer Science 673, 1993, pp. 244-256
• Causal and distributed semantics for concurrent
  Ilaria Castellani
  Lecture Notes in Computer Science 665, 1993, pp. 1
• Locating P/poly optimally in the extended low hierarchy
  Johannes Köbler
  Lecture Notes in Computer Science 665, 1993, pp. 28-37
• Halting problem of one binary Horn clause is undecidable
  Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier
  Lecture Notes in Computer Science 665, 1993, pp. 48-57
• Decidability and undecidability results for duration calculus
  Zhou Chaochen, Michael R. Hansen, Peter Sestoft
  Lecture Notes in Computer Science 665, 1993, pp. 58-68
• The complexity of logic-based abduction
  Thomas Eiter, Georg Gottlob
  Lecture Notes in Computer Science 665, 1993, pp. 70-79
• Treewidth of chordal bipartite graphs
  T. Kloks, D. Kratsch
  Lecture Notes in Computer Science 665, 1993, pp. 80-89
• On paths in networks with valves
  Ulrich Huckenbeck
  Lecture Notes in Computer Science 665, 1993, pp. 90-99
• The synthesis problem of Petri nets
  Jörg Desel, Wolfgang Reisig
  Lecture Notes in Computer Science 665, 1993, pp. 120-129
• General refinement and recursion operators for the Petri box calculus
  Eike Best, Raymond Devillers, Javier Esparza
  Lecture Notes in Computer Science 665, 1993, pp. 130-140
• On fairness in distributed automated deduction
  Maria Paola Bonacina, Jieh Hsiang
  Lecture Notes in Computer Science 665, 1993, pp. 141-152
• A first-order isomorphism theorem
  Eric Allender, José Balcázar, Neil Immerman
  Lecture Notes in Computer Science 665, 1993, pp. 163-174
• Splittings, robustness and structure of complete sets
  Harry Buhrman, Albrecht Hoene, Leen Torenvliet
  Lecture Notes in Computer Science 665, 1993, pp. 175-184
• Defying upward and downward separation
  Lane A. Hemachandra, Sudhir K. Jha
  Lecture Notes in Computer Science 665, 1993, pp. 185-195
• Counting, selecting, and sorting by query-bounded machines
  Albrecht Hoene, Arfst Nickelsen
  Lecture Notes in Computer Science 665, 1993, pp. 196-205
• Cancellation in context-free languages: Enrichment by reduction
  M. Jantzen, H. Petersen
  Lecture Notes in Computer Science 665, 1993, pp. 206-215
• Counting overlap-free binary words
  Julien Cassaigne
  Lecture Notes in Computer Science 665, 1993, pp. 216-225
• Partially commutative Lyndon words
  D. Krob, P. Lalonde
  Lecture Notes in Computer Science 665, 1993, pp. 237-246