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 YEAR=1988

• Context-free-like forms for the phrase-structure grammars
  V. Geffert
  Lecture Notes in Computer Science 324, 1988, pp. 309-317
• On the expressive strength of the finitely typed lambda-terms
  A. Goerdt
  Lecture Notes in Computer Science 324, 1988, pp. 318-328
• Hoare calculi for higher-type control structures and their completeness in the sense of Cook
  A. Goerdt
  Lecture Notes in Computer Science 324, 1988, pp. 329-338
• On representing CCS programs by finite Petri nets
  U. Goltz
  Lecture Notes in Computer Science 324, 1988, pp. 339-350
• A taxonomy of fairness and temporal logic problems for Petri nets
  R.R. Howell, L.E. Rosier, H.-C. Yen
  Lecture Notes in Computer Science 324, 1988, pp. 351-359
• Branching programs as a tool for proving lower bounds on VLSI computations and optimal algorithms for systolic arrays
  J. Hromkovic̑, J. Procházka
  Lecture Notes in Computer Science 324, 1988, pp. 360-370
• Two lower bounds for circuits over the basis (&,\vee,-)
  S.P. Jukna
  Lecture Notes in Computer Science 324, 1988, pp. 371-380
• Positive/negative conditional rewriting
  S. Kaplan
  Lecture Notes in Computer Science 324, 1988, pp. 381-395
• On the computational complexity of codes in graphs
  J. Kratochvíl, M. Kȓivánek
  Lecture Notes in Computer Science 324, 1988, pp. 396-404
• Separating the eraser Turing machine classes L_e, NL_e, co-NL_e and P_e
  M. Krause, Ch. Meinel, S. Waack
  Lecture Notes in Computer Science 324, 1988, pp. 405-413
• Compositional proofs by partial specification of processes
  K.G. Larsen, B. Thomsen
  Lecture Notes in Computer Science 324, 1988, pp. 414-423
• Introducing negative information in relational databases
  D. Laurent, N. Spyratos
  Lecture Notes in Computer Science 324, 1988, pp. 424-432
• On positive occur-checks in unification
  P. Le Chenadec
  Lecture Notes in Computer Science 324, 1988, pp. 433-444
• Two applications of Fürer's counter to one-tape nondeterministic TMs
  K. Loryś, M. Liśkiewicz
  Lecture Notes in Computer Science 324, 1988, pp. 445-453
• \Delta^p_2-complete lexicographically first maximal subgraph problems
  S. Miyano
  Lecture Notes in Computer Science 324, 1988, pp. 454-462
• Proof system for weakest prespecification and its applications
  E. Orƚowska
  Lecture Notes in Computer Science 324, 1988, pp. 463-471
• On complexity of counting
  M. Piotrów
  Lecture Notes in Computer Science 324, 1988, pp. 472-482
• Design, proof and analysis of new efficient algorithms for incremental attribute evaluation
  Q. Lu, J. Qian
  Lecture Notes in Computer Science 324, 1988, pp. 483-491
• On efficiency of interval routing algorithms
  P. Ruz̑ic̑ka
  Lecture Notes in Computer Science 324, 1988, pp. 492-500
• An almost linear Robinson unification algorithm
  P. Ruz̑ic̑ka, I. Prívara
  Lecture Notes in Computer Science 324, 1988, pp. 501-511
• Random Boolean formulas representing any Boolean function with asymptotically equal probability (extended abstract)
  P. Savicky
  Lecture Notes in Computer Science 324, 1988, pp. 512-517
• On the power of communication in alternating machines
  A. Slobodová
  Lecture Notes in Computer Science 324, 1988, pp. 518-529
• Parallel algorithms for evaluating sequences of set manipulation operations (preliminary version)
  M.J. Atallah, M.T. Goodrich, S.R. Kosaraju
  Lecture Notes in Computer Science 319, 1988, pp. 1-10
• Fast parallel and sequential algorithms for edge-coloring planar graphs (extended abstract)
  M. Chrobak, M. Yung
  Lecture Notes in Computer Science 319, 1988, pp. 11-23
• Optimal parallel algorithms on planar graphs
  T. Hagerup
  Lecture Notes in Computer Science 319, 1988, pp. 24-32