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 YEAR=1989

• Infinite normal forms
  N. Dershowitz, S. Kaplan, D.A. Plaisted
  Lecture Notes in Computer Science 372, 1989, pp. 249-262
• On recent trends in algebraic specification
  H. Ehrig, P. Pepper, F. Orejas
  Lecture Notes in Computer Science 372, 1989, pp. 263-288
• Automata with storage on infinite words
  J. Engelfriet, H.J. Hoogeboom
  Lecture Notes in Computer Science 372, 1989, pp. 289-303
• Parallel algorithmic techniques for combinatorial computation
  D. Eppstein, Z. Galil
  Lecture Notes in Computer Science 372, 1989, pp. 304-318
• On dice and coins: Models of computation for random generation
  D. Feldman, R. Impagliazzo, M. Naor, N. Nisan, S. Rudich, A. Shamir
  Lecture Notes in Computer Science 372, 1989, pp. 319-340
• An optimal probabilistic algorithm for synchronous Byzantine agreement
  P. Feldman, S. Micali
  Lecture Notes in Computer Science 372, 1989, pp. 341-378
• Finding triconnected components by local replacements
  D. Fussel, V. Ramachandran, R. Thurimella
  Lecture Notes in Computer Science 372, 1989, pp. 379-393
• An improved algorithm for approximate string matching
  Z. Galil, K. Park
  Lecture Notes in Computer Science 372, 1989, pp. 394-404
• A pointer-free data structure for merging heaps and min-max heaps
  G. Gambosi, E. Nardelli, M. Talamo
  Lecture Notes in Computer Science 372, 1989, pp. 405-422
• Structured operational semantics and bisimulation as a congruence
  J.F. Groote, F. Vaandrager
  Lecture Notes in Computer Science 372, 1989, pp. 423-438
• Parallel retrievel of scattered information
  T. Hagerup, M. Nowak
  Lecture Notes in Computer Science 372, 1989, pp. 439-450
• Tensor rank is NP-complete
  J. Håstad
  Lecture Notes in Computer Science 372, 1989, pp. 451-460
• The complexity of nonlinear separable optimization
  D.S. Hochbaum, J.G. Shanthikumar
  Lecture Notes in Computer Science 372, 1989, pp. 461-472
• General methods for the analysis of the maximal size of dynamic data structures
  C.M. Kenyon-Mathieu, J.S. Vitter
  Lecture Notes in Computer Science 372, 1989, pp. 473-487
• Dynamic maintenance of paths and path expressions on graphs
  G. Ausiello, A. Marchetti Spaccamela, U. Nanni
  Lecture Notes in Computer Science 358, 1989, pp. 1-12
• Fast reduction of the Risch differential equation
  M. Bronstein
  Lecture Notes in Computer Science 358, 1989, pp. 64-72
• An application of REDUCE to the approximation of f(x,y)
  C. Chaffy-Camus
  Lecture Notes in Computer Science 358, 1989, pp. 73-84
• Experiments with quadtree representation of matrices
  S.K. Abdali, D.S. Wise
  Lecture Notes in Computer Science 358, 1989, pp. 96-108
• Discovering inequality conditions in the analytical solution of optimization problems
  B.W. Char, A.R. Macnaughton, P.A. Strooper
  Lecture Notes in Computer Science 358, 1989, pp. 109-115
• Solving systems of algebraic equations
  H. Kobayashi, S. Moritsugu, R.W. Hogan
  Lecture Notes in Computer Science 358, 1989, pp. 139-149
• Greater easy common divisor and standard basis completion algorithms
  A. Galligo, L. Pottier, C. Traverso
  Lecture Notes in Computer Science 358, 1989, pp. 162-176
• Experiments with a projection operator for algebraic decomposition
  S. Arnborg
  Lecture Notes in Computer Science 358, 1989, pp. 177-182
• Rational Newton algorithm for computing formal solutions of linear differential equations
  M.A. Barkatou
  Lecture Notes in Computer Science 358, 1989, pp. 183-195
• An algorithm for symbolic computation of center manifolds
  E. Freire, E. Gamero, E. Ponce, L.G. Franquelo
  Lecture Notes in Computer Science 358, 1989, pp. 218-230
• Effective tests for cyclotomic polynomials
  R.J. Bradford, J.H. Davenport
  Lecture Notes in Computer Science 358, 1989, pp. 244-251