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

• A decision procedure for one equivalence of two dpdas - One of which is linear
  Yair Itzhaik, Amiram Yehudai
  Lecture Notes in Computer Science 115, 1981, pp. 229-237
• The deducibility problem in propositional dynamic logic
  Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska
  Lecture Notes in Computer Science 115, 1981, pp. 238-248
• Finite models for deterministic propositional dynamic logic
  Mordechai Ben-Ari, Joseph Y. Halpern, Amir Pnueli
  Lecture Notes in Computer Science 115, 1981, pp. 249-263
• Impartiality, justice and fairness: The ethics of concurrent termination
  D. Lehmann, A. Pnueli, J. Stavi
  Lecture Notes in Computer Science 115, 1981, pp. 264-277
• Computing a perfect strategy for n \times n chess requires time exponential in n
  Aviezri S. Fraenkel, David Lichtenstein
  Lecture Notes in Computer Science 115, 1981, pp. 278-293
• On the complexity of simple arithmetic expressions
  Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran
  Lecture Notes in Computer Science 115, 1981, pp. 294-304
• Proving lower bounds for linear decision trees
  Marc Snir
  Lecture Notes in Computer Science 115, 1981, pp. 305-315
• Parikh-bounded languages
  Mera Blattner, Michel Latteux
  Lecture Notes in Computer Science 115, 1981, pp. 316-323
• Generalized Parikh mappings and homomorphisms
  Juhani Karhumäki
  Lecture Notes in Computer Science 115, 1981, pp. 324-332
• Chomsky-Schützenberger representations for families of languages and grammatical types
  Sorin Istrail
  Lecture Notes in Computer Science 115, 1981, pp. 333-347
• Algebraically specified programming systems and Hoare's logic
  J.A. Bergstra, J.V. Tucker
  Lecture Notes in Computer Science 115, 1981, pp. 348-362
• Automatic construction of verification condition generators from Hoare logics
  Marc Moricani, Richard L. Schwartz
  Lecture Notes in Computer Science 115, 1981, pp. 363-377
• Circular expressions: Elimination of static environments
  Ravi Sethi
  Lecture Notes in Computer Science 115, 1981, pp. 378-392
• An axiomatic approach to the Korenjak-Hopcroft algorithms
  B. Courcelle
  Lecture Notes in Computer Science 115, 1981, pp. 393-407
• On the (generalized) post correspondence problem with lists of length 2
  A. Ehrenfeucht, G. Rozenberg
  Lecture Notes in Computer Science 115, 1981, pp. 408-416
• A sparse table implementation of priority queues
  Alon Itai, Alan G. Konheim, Michael Rodeh
  Lecture Notes in Computer Science 115, 1981, pp. 417-431
• Comparing and putting together recursive path ordering, simplification orderings and non-ascending property for termination proofs of term rewriting systems
  Alberto Pettorossi
  Lecture Notes in Computer Science 115, 1981, pp. 432-447
• Termination of linear rewriting systems
  Nachum Dershowitz
  Lecture Notes in Computer Science 115, 1981, pp. 448-458
• Realizing an equational specification
  A. Pnueli, R. Zarhi
  Lecture Notes in Computer Science 115, 1981, pp. 459-478
• A Cook's tour of countable nondeterminsm
  K.R. Apt, G.D. Plotkin
  Lecture Notes in Computer Science 115, 1981, pp. 479-494
• The complexity of decision problems for finite-turn multicounter machines
  Eitan M. Gurari, Oscar H. Ibarra
  Lecture Notes in Computer Science 115, 1981, pp. 495-505
• Alternating multihead finite automata
  K.N. King
  Lecture Notes in Computer Science 115, 1981, pp. 506-520
• The solution for the branching factor of the alpha-beta pruning algorithm
  Judea Pearl
  Lecture Notes in Computer Science 115, 1981, pp. 521-529
• Uniform complexity and digital signatures
  Karl Lieberherr
  Lecture Notes in Computer Science 115, 1981, pp. 530-543
• On the generation of cryptographically strong pseudo-random sequences
  Adi Shamir
  Lecture Notes in Computer Science 115, 1981, pp. 544-550