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

• A lower bound on complexity of branching programs
  P. Pudlák
  Lecture Notes in Computer Science 176, 1984, pp. 480-489
• From dynamic algebras to test algebras
  Jan Reiterman, Vȇra Trnková
  Lecture Notes in Computer Science 176, 1984, pp. 490-497
• Combinatorial games with exponential space complete decision problems
  J.M. Robson
  Lecture Notes in Computer Science 176, 1984, pp. 498-506
• Fast recognitions of pushdown automaton and context-free languages
  Wojciech Rytter
  Lecture Notes in Computer Science 176, 1984, pp. 507-515
• Multiprocessor systems and their concurrency
  Peter H. Starke
  Lecture Notes in Computer Science 176, 1984, pp. 516-525
• Free constructions in algebraic institutions
  Andrzej Tarlecki
  Lecture Notes in Computer Science 176, 1984, pp. 526-534
• Remarks on comparing expressive power of logics of programs
  Jerzy Tiuryn, Paweƚ Urzyczyn
  Lecture Notes in Computer Science 176, 1984, pp. 535-543
• The complexity of problems concerning graphs with regularities
  K. Wagner
  Lecture Notes in Computer Science 176, 1984, pp. 544-552
• On the complexity of slice functions
  I. Wegener
  Lecture Notes in Computer Science 176, 1984, pp. 553-561
• An exponential lower bound for one-time-only branching programs
  Stanislav Z̑ák
  Lecture Notes in Computer Science 176, 1984, pp. 562-566
• A topological view of some problems in complexity theory
  Michael Sipser
  Lecture Notes in Computer Science 176, 1984, pp. 567-572
• Propositional dynamic logic with strong loop predicate
  Ryszard Danecki
  Lecture Notes in Computer Science 176, 1984, pp. 573-581
• Homogeneous linear difference equation (Frobenius-Boole method)
  J. Della Dora, E. Tournier
  Lecture Notes in Computer Science 174, 1984, pp. 2-12
• An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation
  S. Watanabe
  Lecture Notes in Computer Science 174, 1984, pp. 13-22
• Operational calculus techniques for solving differential equations
  N. Glinos, B.D. Saunders
  Lecture Notes in Computer Science 174, 1984, pp. 23-34
• On the application of symbolic computation to nonlinear control theory
  G. Cesareo, R. Marino
  Lecture Notes in Computer Science 174, 1984, pp. 35-46
• Quartic equations and algorithms for Riemann tensor classification
  J.E. Åman, R.A. d'Inverno, G.C. Joly, M.A.H. MacCallum
  Lecture Notes in Computer Science 174, 1984, pp. 47-58
• Symbolic computation and the Dirichlet problem
  R.W. Wilkerson
  Lecture Notes in Computer Science 174, 1984, pp. 59-63
• Simplification of polynomials in n variables
  G. Viry
  Lecture Notes in Computer Science 174, 1984, pp. 64-73
• On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems
  M. Navarro, F. Orejas
  Lecture Notes in Computer Science 174, 1984, pp. 74-85
• Implementation of a p-adic package for polynomial factorization and other related operations
  P.S. Wang
  Lecture Notes in Computer Science 174, 1984, pp. 86-99
• Computations on curves
  C. Dicrescenzo, D. Duval
  Lecture Notes in Computer Science 174, 1984, pp. 100-107
• Detecting torsion divisors on curves of genus 2
  T.G. Berry
  Lecture Notes in Computer Science 174, 1984, pp. 108-114
• Computation in radical extensions
  H. Najid-Zejli
  Lecture Notes in Computer Science 174, 1984, pp. 115-122
• A primer: 11 keys to new Scratchpad
  R.D. Jenks
  Lecture Notes in Computer Science 174, 1984, pp. 123-147