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

• Linear searching for a square in a word
  M. Crochemore
  Lecture Notes in Computer Science 172, 1984, pp. 137
• Automates boustrophédon, semi-groupe de Birget et monoide inversif libre
  J.P. Pécuchet
  Lecture Notes in Computer Science 172, 1984, pp. 390
• The theory of data dependencies - an overview
  R. Fagin, M.Y. Vardi
  Lecture Notes in Computer Science 172, 1984, pp. 1-22
• The VLSI revolution in theoretical circles
  A.L. Rosenberg
  Lecture Notes in Computer Science 172, 1984, pp. 23-40
• Tuple sequences and indexes
  S. Abiteboul, S. Ginsburg
  Lecture Notes in Computer Science 172, 1984, pp. 41-50
• The complexity of cubical graphs
  F. Afrati, C.H. Papadimitriou, G. Papageorgiou
  Lecture Notes in Computer Science 172, 1984, pp. 51-57
• P-generic sets
  K. Ambos-Spies, H. Fleischhack, H. Huwig
  Lecture Notes in Computer Science 172, 1984, pp. 58-68
• Functional dependencies and disjunctive existence constraints in database relations with null values
  P. Atzeni, N.M. Morfuni
  Lecture Notes in Computer Science 172, 1984, pp. 69-81
• The algebra of recursively defined processes and the algebra of regular processes
  J.A. Bergstra, J.W. Klop
  Lecture Notes in Computer Science 172, 1984, pp. 82-94
• Algebraic specification of exception handling and error recovery by means of declarations and equations
  M. Bidoit
  Lecture Notes in Computer Science 172, 1984, pp. 95-108
• Building the minimal DFA for the set of all subwords of a word on-line in linear time
  A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, R. McConnell
  Lecture Notes in Computer Science 172, 1984, pp. 109-118
• The complexity and decidability of separation
  B. Chazelle, T. Ottmann, E. Soisalon-Soininen, D. Wood
  Lecture Notes in Computer Science 172, 1984, pp. 119-127
• Concurrent transmissions in broadcast networks
  C.J. Colbourn, A. Proskurowski
  Lecture Notes in Computer Science 172, 1984, pp. 128-136
• Domain algebras
  P. Dybjer
  Lecture Notes in Computer Science 172, 1984, pp. 138-150
• Principality results about some matrix language families
  D. Ferment
  Lecture Notes in Computer Science 172, 1984, pp. 151-161
• Oriented equational clauses as a programming language
  L. Fribourg
  Lecture Notes in Computer Science 172, 1984, pp. 162-173
• Relational algebra operations and sizes of relations
  D. Gardy, C. Puech
  Lecture Notes in Computer Science 172, 1984, pp. 174-186
• Some results about finite and infinite behaviours of a pushdown automaton
  D. Girault-Beauquier
  Lecture Notes in Computer Science 172, 1984, pp. 187-195
• On the relationship of CCS and Petri nets
  U. Goltz, A. Mycroft
  Lecture Notes in Computer Science 172, 1984, pp. 196-208
• Communicating finite state machines with priority channels
  M.G. Gouda, L.E. Rosier
  Lecture Notes in Computer Science 172, 1984, pp. 209-221
• A modal characterization of observational congruence on finite terms of CCS
  S. Graf, J. Sifakis
  Lecture Notes in Computer Science 172, 1984, pp. 222-234
• Communication complexity
  J. Hromkovic̑
  Lecture Notes in Computer Science 172, 1984, pp. 235-246
• Space and time efficient simulations and characterizations of some restricted classes of PDAS
  O.H. Ibarra, S.M. Kim, L.E. Rosier
  Lecture Notes in Computer Science 172, 1984, pp. 247-259
• A complete axiom system for algebra of closed-regular expression
  H. Izumi, Y. Inagaki, N. Honda
  Lecture Notes in Computer Science 172, 1984, pp. 260-269
• The complexity of finding minimum-length generator sequences
  M. Jerrum
  Lecture Notes in Computer Science 172, 1984, pp. 270-280