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

• Language-based security
  Dexter Kozen
  Lecture Notes in Computer Science 1672, 1999, pp. 284-298
• An algebraic approach to knowledge representation
  Jānis Cīrulis
  Lecture Notes in Computer Science 1672, 1999, pp. 299-309
• On the structure of the monadic logic of the binary tree
  D. Janin, G. Lenzi
  Lecture Notes in Computer Science 1672, 1999, pp. 310-320
• A new space bound for the modal logics K4, KD4 and S4
  Linh Anh Nguyen
  Lecture Notes in Computer Science 1672, 1999, pp. 321-331
• On approximating the number of bases of exchange preserving matroids
  Anna Gambin
  Lecture Notes in Computer Science 1672, 1999, pp. 332-342
• The semantic foundations of a compositional proof method for synchronously communicating processes
  F.S. de Boer, W.-P. de Roever, U. Hannemann
  Lecture Notes in Computer Science 1672, 1999, pp. 343-353
• On plain and hereditary history-preserving bisimulation
  Sibylle B. Fröschle, Thomas T. Hildebrandt
  Lecture Notes in Computer Science 1672, 1999, pp. 354-365
• Approximating weak bisimulation on basic process algebras
  Jitka Stȓíbrná
  Lecture Notes in Computer Science 1672, 1999, pp. 366-375
• Edge coloring of bipartite graphs
  Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
  Lecture Notes in Computer Science 1672, 1999, pp. 376-386
• An efficient exact algorithm for constraint bipartite vertex cover
  Henning Fernau, Rolf Niedermeier
  Lecture Notes in Computer Science 1672, 1999, pp. 387-397
• On minimum edge ranking spanning trees
  Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
  Lecture Notes in Computer Science 1672, 1999, pp. 398-409
• Football elimination is hard to decide under the 3-point-rule
  Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt
  Lecture Notes in Computer Science 1672, 1999, pp. 410-418
• Generalized regular counting classes
  Ulrich Hertrampf
  Lecture Notes in Computer Science 1672, 1999, pp. 419-429
• A foundation of programming a multi-tape quantum Turing machine
  Tomoyuki Yamakami
  Lecture Notes in Computer Science 1672, 1999, pp. 430-441
• A type discipline for solving year 2000 problems in COBOL programs
  Mads Tofte
  Lecture Notes in Computer Science 1672, 1999, pp. 442-442
• Type reconstruction for functional programs with subtyping over a lattice of atomic types
  Jerzy Tiuryn
  Lecture Notes in Computer Science 1672, 1999, pp. 443-453