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

• Splitsort - An adaptive sorting algorithm
  Ch. Levcopoulos, O. Petersson
  Lecture Notes in Computer Science 452, 1990, pp. 416-422
• Equational calculi for many-sorted algebras with empty carrier sets
  V. Manca, A. Salibra
  Lecture Notes in Computer Science 452, 1990, pp. 423-429
• Semi-commutation and deterministic Petri nets
  E. Ochmański
  Lecture Notes in Computer Science 452, 1990, pp. 430-438
• Internal labellings in Lambda-Calculus
  M. Parigot
  Lecture Notes in Computer Science 452, 1990, pp. 439-445
• A sup-preserving completion of ordered partial algebras
  A. Pasztor
  Lecture Notes in Computer Science 452, 1990, pp. 446-456
• ATIME(n) is closed under counting
  M. Piotrów
  Lecture Notes in Computer Science 452, 1990, pp. 457-463
• Investigation of finitary calculi for the temporal logics by means of infinitary calculi
  R. Plius̑kevic̑ius
  Lecture Notes in Computer Science 452, 1990, pp. 464-469
• Typed Horn logic
  A. Poigné
  Lecture Notes in Computer Science 452, 1990, pp. 470-477
• Results on the glory of the past
  I. Sain
  Lecture Notes in Computer Science 452, 1990, pp. 478-484
• A stronger version of Parikh theorem
  P.H. Uyen
  Lecture Notes in Computer Science 452, 1990, pp. 485-491
• The parallel complexity of some constructions in combinatorial group theory
  S. Waack
  Lecture Notes in Computer Science 452, 1990, pp. 492-498
• Gentzen type axiomatization for PAL
  I. Walukiewicz
  Lecture Notes in Computer Science 452, 1990, pp. 499-507
• Distance automata having large finite distance or finite ambiguity
  A. Weber
  Lecture Notes in Computer Science 452, 1990, pp. 508-515
• Bottom up-heap sort, a new variant of heap sort beating on average quick sort
  I. Wegener
  Lecture Notes in Computer Science 452, 1990, pp. 516-522
• Symmetric functions in AC^0 can be computed in constant depth with very small size
  I. Wegener, N. Wurm, S.-Z. Yi
  Lecture Notes in Computer Science 452, 1990, pp. 523-529
• The k-section of treewidth restricted graphs
  M. Wiegers
  Lecture Notes in Computer Science 452, 1990, pp. 530-537
• Computing large polynomial powers very fast in parallel
  T. Zeugmann
  Lecture Notes in Computer Science 452, 1990, pp. 538-544
• Recent progress in string algorithms
  Zvi Galil
  Lecture Notes in Computer Science 450, 1990, pp. 1-1
• Selection networks
  Nicholas Pippenger
  Lecture Notes in Computer Science 450, 1990, pp. 2-11
• Computing edge-connectivity in multiple and capacitated graphs
  Hiroshi Nagamochi, Toshihide Ibaraki
  Lecture Notes in Computer Science 450, 1990, pp. 12-20
• Efficient sequential and parallel algorithms for planar minimum cost flow
  Hiroshi Imai, Kazuo Iwano
  Lecture Notes in Computer Science 450, 1990, pp. 21-30
• Structural analyses on the complexity of inverting functions
  Osamu Watanabe, Seinosuke Toda
  Lecture Notes in Computer Science 450, 1990, pp. 31-38
• Oracles versus proof techniques that do not relativize
  Eric Allender
  Lecture Notes in Computer Science 450, 1990, pp. 39-52
• 20-relative neighborhood graphs are Hamiltonian
  Maw Shang Chang, C.Y. Tang, R.C.T. Lee
  Lecture Notes in Computer Science 450, 1990, pp. 53-65
• The k-Gabriel graphs and their applications
  Tung-Hsin Su, Ruei-Chuan Chang
  Lecture Notes in Computer Science 450, 1990, pp. 66-75