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

• Strong splitting rules in automated theorem proving
  M. Baaz, A. Leitsch
  Lecture Notes in Computer Science 378, 1989, pp. 424-425
• Towards a refined classification of geometric search and computation problems
  T. Fischer
  Lecture Notes in Computer Science 378, 1989, pp. 426-437
• Matrix-Padé fractions
  G. Labahn, S. Cabay
  Lecture Notes in Computer Science 378, 1989, pp. 438-449
• A critical pair criterion for completion modulo a congruence
  L. Bachmair, N. Dershowitz
  Lecture Notes in Computer Science 378, 1989, pp. 452-453
• Practical aspects of symbolic integration over Q(x)
  D.M. Gillies, B.W. Char
  Lecture Notes in Computer Science 378, 1989, pp. 463-464
• Integration: Solving the Risch differential equation
  J.A. Abbott
  Lecture Notes in Computer Science 378, 1989, pp. 465-467
• Computation and simplification in Lie fields
  J. Apel, W. Lassner
  Lecture Notes in Computer Science 378, 1989, pp. 468-478
• An algorithm for the integration of elementary functions
  M. Bronstein
  Lecture Notes in Computer Science 378, 1989, pp. 491-497
• Realizable and unrealizable specifications of reactive systems
  M. Abadi, L. Lamport, P. Wolper
  Lecture Notes in Computer Science 372, 1989, pp. 1-17
• Limitations of the upward separation technique
  E. Allender
  Lecture Notes in Computer Science 372, 1989, pp. 18-30
• Lower bounds for the low hierarchy
  E. Allender, L.A. Hemachandra
  Lecture Notes in Computer Science 372, 1989, pp. 31-45
• Efficient text searching of regular expressions
  R.A. Baeza-Yates, G.H. Gonnet
  Lecture Notes in Computer Science 372, 1989, pp. 46-62
• Factors of words
  D. Beauquier, J.E. Pin
  Lecture Notes in Computer Science 372, 1989, pp. 63-79
• Asymptotically optimal distributed consensus
  P. Berman, J.A. Garay
  Lecture Notes in Computer Science 372, 1989, pp. 80-94
• Time lower bounds for CREW-PRAM computation of monotone functions
  G. Bilardi, A. Moitra
  Lecture Notes in Computer Science 372, 1989, pp. 95-108
• Subduing self-application
  C. Böhm
  Lecture Notes in Computer Science 372, 1989, pp. 108-122
• Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
  G. Brassard, C. Crépeau, M. Yung
  Lecture Notes in Computer Science 372, 1989, pp. 123-136
• Polymorphic rewriting conserves algebraic strong normalization and confluence
  V. Breazu-Tannen, J. Gallier
  Lecture Notes in Computer Science 372, 1989, pp. 137-150
• Completion of finite codes with finite deciphering delay
  V. Bruyere
  Lecture Notes in Computer Science 372, 1989, pp. 151-163
• Relational semantics for recursive types and bounded quantification
  F. Cardone
  Lecture Notes in Computer Science 372, 1989, pp. 164-178
• A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
  B. Chazelle, H. Edelsbrunner, L.J. Guibas, M. Sharir
  Lecture Notes in Computer Science 372, 1989, pp. 179-193
• About primitive recursive algorithms
  L. Colson
  Lecture Notes in Computer Science 372, 1989, pp. 194-206
• The definability of equational graphs in monadic second-order logic
  B. Courcelle
  Lecture Notes in Computer Science 372, 1989, pp. 207-221
• Dominoes and the regularity of DNA splicing languages
  K. Culik II, T. Harju
  Lecture Notes in Computer Science 372, 1989, pp. 222-233
• Causal trees
  P. Darondeau, P. Degano
  Lecture Notes in Computer Science 372, 1989, pp. 234-248