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

• Synthesis of concurrent schemes
  Ryszard Janicki
  Lecture Notes in Computer Science 64, 1978, pp. 298-307
• Fast matrix multiplication by Boolean RAM in linear storage
  Reinhard Klette
  Lecture Notes in Computer Science 64, 1978, pp. 308-314
• Cycles of partial orders
  Elŏd Knuth
  Lecture Notes in Computer Science 64, 1978, pp. 315-325
• Complexity measures defined by Mazurkiewicz-algorithms
  Gerhard Lischke
  Lecture Notes in Computer Science 64, 1978, pp. 326-332
• On functional grammars
  Leon Łukaszewicz
  Lecture Notes in Computer Science 64, 1978, pp. 333-344
• Analysis of a universal class of hash functions
  George Markowsky, J. Lawrence Carter, Mark N. Wegman
  Lecture Notes in Computer Science 64, 1978, pp. 345-354
• A framework for producing deterministic canonical bottom-up parsers
  O. Mayer
  Lecture Notes in Computer Science 64, 1978, pp. 355-363
• Cooperating grammar systems
  R. Meersman, G. Rozenberg
  Lecture Notes in Computer Science 64, 1978, pp. 364-373
• Synchronized Petri nets : A model for the description of non-autonomous sytems
  M. Moalla, J. Pulou, J. Sifakis
  Lecture Notes in Computer Science 64, 1978, pp. 374-384
• On divergence and halting problems for monadic program schemas
  V.A. Nepomniaschy
  Lecture Notes in Computer Science 64, 1978, pp. 385-392
• Compression of clustered inverted files
  O. Nevalainen, M. Jakobsson, R. Berg
  Lecture Notes in Computer Science 64, 1978, pp. 393-402
• The completeness of propositional dynamic logic
  Rohit Parikh
  Lecture Notes in Computer Science 64, 1978, pp. 403-415
• Improving memory utilization in transforming recursive programs
  Alberto Pettorossi
  Lecture Notes in Computer Science 64, 1978, pp. 416-425
• On two subclasses of real-time grammars
  Jan Pittl
  Lecture Notes in Computer Science 64, 1978, pp. 426-435
• On information storage and retrieval systems - An algebraic approach, part I
  Zbigniew Raś
  Lecture Notes in Computer Science 64, 1978, pp. 436-441
• Probabilistic LCF
  N. Saheb-Djahromi
  Lecture Notes in Computer Science 64, 1978, pp. 442-451
• On Algorithmic Theory of Stacks
  Andrzej Salwicki
  Lecture Notes in Computer Science 64, 1978, pp. 452-461
• Analyzing program solutions of coordination problems by CP-nets
  Michael Schiffers, Horst Wedde
  Lecture Notes in Computer Science 64, 1978, pp. 462-473
• Structural properties of Petri nets
  Joseph Sifakis
  Lecture Notes in Computer Science 64, 1978, pp. 474-483
• Ensuring correctness by arbitrary postfixed-points
  Michel Sintzoff
  Lecture Notes in Computer Science 64, 1978, pp. 484-492
• String-matching in real time: Some properties of the data structure
  A.O. Slisenko
  Lecture Notes in Computer Science 64, 1978, pp. 493-496
• Name independence and database abstraction in the relational model
  N. Spyratos, F. Bancilhon
  Lecture Notes in Computer Science 64, 1978, pp. 497-505
• Free Petri net languages
  Peter H. Starke
  Lecture Notes in Computer Science 64, 1978, pp. 506-515
• Transformations to produce certain covering grammars
  Esko Ukkonen
  Lecture Notes in Computer Science 64, 1978, pp. 516-525
• On the computational power of extended Petri nets
  Rüdiger Valk
  Lecture Notes in Computer Science 64, 1978, pp. 526-535