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

• Efficient algorithms for crash recovery in distributed systems
  Tony T-Y. Juang, S. Venkatesan
  Lecture Notes in Computer Science 472, 1990, pp. 349-361
• A non-standard inductive semantics
  Gianna Reggio
  Lecture Notes in Computer Science 472, 1990, pp. 362-372
• Relating full abstraction results for different programming languages
  Kurt Sieber
  Lecture Notes in Computer Science 472, 1990, pp. 373-387
• Towards a theory of commonsense visual reasoning
  B. Chandrasekaran, N. Hari Narayanan
  Lecture Notes in Computer Science 472, 1990, pp. 388-409
• Natural language processing, complexity theory and logic
  Akshar Bharati, Rajeev Sangal, Vineet Chaitanya
  Lecture Notes in Computer Science 472, 1990, pp. 410-420
• A logical operational semantics of full Prolog
  E. Börger
  Lecture Notes in Computer Science 452, 1990, pp. 1-14
• Syntactic theories
  J.-P. Jouannaud
  Lecture Notes in Computer Science 452, 1990, pp. 15-25
• On Kleene algebras and closed semirings
  D. Kozen
  Lecture Notes in Computer Science 452, 1990, pp. 26-47
• Interactive computations of optimal solutions
  J. Krajíc̑ek, P. Pudlák, J. Sgall
  Lecture Notes in Computer Science 452, 1990, pp. 48-60
• Restricted branching programs and their computational power
  Ch. Meinel
  Lecture Notes in Computer Science 452, 1990, pp. 61-75
• Dynamic hashing strategies
  F. Meyer auf der Heide
  Lecture Notes in Computer Science 452, 1990, pp. 76-87
• One-way functions in complexity theory
  A.L. Selman
  Lecture Notes in Computer Science 452, 1990, pp. 88-104
• Type inference problems: A survey
  J. Tiuryn
  Lecture Notes in Computer Science 452, 1990, pp. 105-120
• Counting the number of solutions
  J. Torán
  Lecture Notes in Computer Science 452, 1990, pp. 121-134
• Implementation of parallel graph reduction by explicit annotation and program transformation
  W.G. Vree
  Lecture Notes in Computer Science 452, 1990, pp. 135-151
• Interrogative complexity of \omega-languages' recognition
  M. Alberts
  Lecture Notes in Computer Science 452, 1990, pp. 152-157
• On the power of uniform families of constant depth threshold circuits
  E. Allender, U. Hertrampf
  Lecture Notes in Computer Science 452, 1990, pp. 158-164
• Separating sets of hyperrectangles
  F. d'Amore, P.G. Franciosa
  Lecture Notes in Computer Science 452, 1990, pp. 165-172
• On preemptive scheduling of periodic, real-time tasks on one processor
  S.K. Baruah, R.R. Howell, L.E. Rosier
  Lecture Notes in Computer Science 452, 1990, pp. 173-179
• Retractions in comparing Prolog semantics
  A. de Bruin, E.P. de Vink
  Lecture Notes in Computer Science 452, 1990, pp. 180-186
• Using inductive counting to simulate nondeterministic computation
  G. Buntrock, L.A. Hemachandra, D. Siefkes
  Lecture Notes in Computer Science 452, 1990, pp. 187-194
• Some properties of zerotesting bounded one-way multicounter machines
  I. C̑erná
  Lecture Notes in Computer Science 452, 1990, pp. 195-201
• On fast algorithms for two servers
  M. Chrobak, L.L. Larmore
  Lecture Notes in Computer Science 452, 1990, pp. 202-208
• Decomposition of semi commutations
  M. Clerbout, D. Gonzales
  Lecture Notes in Computer Science 452, 1990, pp. 209-216
• Parallel constructions of minimal suffix and factor automata
  M. Crochemore, W. Rytter
  Lecture Notes in Computer Science 452, 1990, pp. 217-223