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

• On the complexity of inductive inference
  Robert P. Daley, Carl H. Smith
  Lecture Notes in Computer Science 176, 1984, pp. 255-264
• Monotone edge sequences in line arrangements and applications
  Herbert Edelsbrunner, Emmerich Welzl
  Lecture Notes in Computer Science 176, 1984, pp. 265-272
• Many-sorted temporal logic for multi-processes systems
  P. Enjalbert, M. Michel
  Lecture Notes in Computer Science 176, 1984, pp. 273-281
• Process logics: Two decidability results
  Z. Habasiński
  Lecture Notes in Computer Science 176, 1984, pp. 282-290
• On searching of special classes of mazes and finite embedded graphs
  A. Hemmerling, K. Kriegel
  Lecture Notes in Computer Science 176, 1984, pp. 291-300
• The power of the future perfect in program logics
  M. Hennessy, C. Stirling
  Lecture Notes in Computer Science 176, 1984, pp. 301-311
• Hierarchy of reversal and zerotesting bounded multicounter machines
  J. Hromkovic̑
  Lecture Notes in Computer Science 176, 1984, pp. 312-321
• On the power of alternation in finite automata
  Juraj Hromkovic̑
  Lecture Notes in Computer Science 176, 1984, pp. 322-329
• The equivalence problem and correctness formulas for a simple class of programs
  Oscar H. Ibarra, Louis E. Rosier
  Lecture Notes in Computer Science 176, 1984, pp. 330-338
• Lower bounds for polygon simplicity testing and other problems
  Jerzy W. Jaromczyk
  Lecture Notes in Computer Science 176, 1984, pp. 339-347
• A uniform independence of invariant sentences
  M.I. Kanovic̑
  Lecture Notes in Computer Science 176, 1984, pp. 348-354
• On the equivalence of compositions of morphisms and inverse morphisms on regular languages
  J. Karhumäki, H.C.M. Kleijn
  Lecture Notes in Computer Science 176, 1984, pp. 355-363
• Some connections between presentability of complexity classes and the power of formal systems of reasoning
  Wojciech Kowalczyk
  Lecture Notes in Computer Science 176, 1984, pp. 364-369
• Finding a maximum flow in /s,t/-planar network in linear expected time
  L. Kuc̑era
  Lecture Notes in Computer Science 176, 1984, pp. 370-377
• Nondeterministic logspace reductions
  Klaus-Jörn Lange
  Lecture Notes in Computer Science 176, 1984, pp. 378-388
• Factoring multivariate polynomials over algebraic number fields
  Arjen K. Lenstra
  Lecture Notes in Computer Science 176, 1984, pp. 389-396
• Gödel numberings, principal morphisms, combinatory algebras: A category-theoretic characterization of functional completeness
  G. Longo, E. Moggi
  Lecture Notes in Computer Science 176, 1984, pp. 397-406
• Representations of integers and language theory
  Aldo de Luca, Antonio Restivo
  Lecture Notes in Computer Science 176, 1984, pp. 407-415
• New lower bound for polyhedral membership problem with an application to linear programming
  Jaroslav Morávek, Pavel Pudlák
  Lecture Notes in Computer Science 176, 1984, pp. 416-424
• Decidability of the equivalence problem for synchronous deterministic pushdown automata
  A.Sh. Nepomnjashchaja
  Lecture Notes in Computer Science 176, 1984, pp. 425-432
• Models and operators for nondeterministic processes
  Rocco De Nicola
  Lecture Notes in Computer Science 176, 1984, pp. 433-442
• Algorithms for string editing which permit arbitrarily complex edit constraints
  B. John Oommen
  Lecture Notes in Computer Science 176, 1984, pp. 443-451
• The structure of polynomial complexity cores
  Pekka Orponen, Uwe Schöning
  Lecture Notes in Computer Science 176, 1984, pp. 452-458
• Solving visibility problems by using skeleton structures
  Thomas Ottmann, Peter Widmayer
  Lecture Notes in Computer Science 176, 1984, pp. 459-470
• Another look at parameterization using algebras with subsorts
  Axel Poigné
  Lecture Notes in Computer Science 176, 1984, pp. 471-479