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 Volume=71

• Dags and Chomsky hierarchy
  T. Kamimura, G. Slutzki
  Lecture Notes in Computer Science 71, 1979, pp. 331-337
• Recent advances in the probabilistic analysis of graph-theoretic algorithms
  R. Karp
  Lecture Notes in Computer Science 71, 1979, pp. 338-339
• On the average stack size of regularly distributed binary trees
  R. Kemp
  Lecture Notes in Computer Science 71, 1979, pp. 340-355
• On reductions of parallel programs
  W. Kowalk, R. Valk
  Lecture Notes in Computer Science 71, 1979, pp. 356-369
• On the height of derivation trees
  W. Kuich, H. Prodinger, F.J. Urbanek
  Lecture Notes in Computer Science 71, 1979, pp. 370-384
• The modal logic of programs
  Z. Manna, A. Pnueli
  Lecture Notes in Computer Science 71, 1979, pp. 385-410
• A comparision between two variations of a pebble game on graphs
  F. Meyer auf der Heide
  Lecture Notes in Computer Science 71, 1979, pp. 411-421
• LL(k) parsing for attributed grammars
  D.R. Milton, C.N. Fischer
  Lecture Notes in Computer Science 71, 1979, pp. 422-430
• On eliminating nondeterminism from Turing machines which use less than logarithm worktape space
  B. Monien, I.H. Sudborough
  Lecture Notes in Computer Science 71, 1979, pp. 431-445
• Structure preserving transformations on non-left-recursive grammars
  A. Nijholt
  Lecture Notes in Computer Science 71, 1979, pp. 446-459
• The complexity of restricted minimum spanning tree problems
  C.H. Papadimitriou, M. Yannakakis
  Lecture Notes in Computer Science 71, 1979, pp. 460-470
• A systematic approach to formal language theory through parallel rewriting
  G. Rozenberg
  Lecture Notes in Computer Science 71, 1979, pp. 471-478
• Extending the notion of finite index
  G. Rozenberg, D. Vermeir
  Lecture Notes in Computer Science 71, 1979, pp. 479-488
• On the complexity of general context-free language parsing and recognition
  W.L. Ruzzo
  Lecture Notes in Computer Science 71, 1979, pp. 489-497
• Space-time tradeoffs for oblivious integer multiplication
  J.E. Savage, S. Swamy
  Lecture Notes in Computer Science 71, 1979, pp. 498-504
• Investigating programs in terms of partial graphs
  G. Schmidt
  Lecture Notes in Computer Science 71, 1979, pp. 505-519
• On the power of random access machines
  A. Schönhage
  Lecture Notes in Computer Science 71, 1979, pp. 520-529
• An axiomatic treatment of ALGOL 68 routines
  R.L. Schwartz
  Lecture Notes in Computer Science 71, 1979, pp. 530-545
• P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP
  A.L. Selman
  Lecture Notes in Computer Science 71, 1979, pp. 546-555
• Constructing call-by-value continuation semantics
  R. Sethi, A. Tang
  Lecture Notes in Computer Science 71, 1979, pp. 556-570
• A formal semantics for concurrent systems
  M.W. Shields, P.E. Lauer
  Lecture Notes in Computer Science 71, 1979, pp. 571-584
• On constructing LL(k) parsers
  S. Sippu, E. Soisalon-Soininen
  Lecture Notes in Computer Science 71, 1979, pp. 585-595
• More on advice on structuring compilers and proving them correct
  J.W. Thatcher, E.G. Wagner, J.B. Wright
  Lecture Notes in Computer Science 71, 1979, pp. 596-615
• Languages of nilpotent and solvable groups
  D. Thérien
  Lecture Notes in Computer Science 71, 1979, pp. 616-632
• Unique fixed points vs. least fixed points
  J. Tiuryn
  Lecture Notes in Computer Science 71, 1979, pp. 633-645