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 [3]	Hilfe

Suche: Series=LNCS AND Volume=775

• On the star operation and the finite power property in free partially commutative monoids
  Yves Métivier, Gwénaël Richomme
  Lecture Notes in Computer Science 775, 1994, pp. 341-352
• Coding with traces
  Véronique Bruyère, Clelia De Felice, Giovanna Guaiana
  Lecture Notes in Computer Science 775, 1994, pp. 353-364
• Monadic second-order logic over pictures and recognizability by tiling systems
  Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas
  Lecture Notes in Computer Science 775, 1994, pp. 365-375
• q-grammars: Results, implementation
  Maylis Delest, Jean-Philippe Dubernard
  Lecture Notes in Computer Science 775, 1994, pp. 377-388
• A topology for complete semirings
  Georg Karner
  Lecture Notes in Computer Science 775, 1994, pp. 389-400
• The global power of additional queries to random oracles
  Ronald V. Book, Jack H. Lutz, David M., Jr. Martin
  Lecture Notes in Computer Science 775, 1994, pp. 403-414
• Cook versus Karp-Levin: Separating completeness notions if NP is not small
  Jack H. Lutz, Elvira Mayordomo
  Lecture Notes in Computer Science 775, 1994, pp. 415-426
• On sets bounded truth-table reducible to P-selective sets
  Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
  Lecture Notes in Computer Science 775, 1994, pp. 427-438
• Two refinements of the polynomial hierarchy
  V.L. Selivanov
  Lecture Notes in Computer Science 775, 1994, pp. 439-448
• On different reducibility notions for function classes
  Heribert Vollmer
  Lecture Notes in Computer Science 775, 1994, pp. 449-460
• Optimal parallelization of Las Vegas algorithms
  Michael Luby, Wolfgang Ertel
  Lecture Notes in Computer Science 775, 1994, pp. 463-474
• Efficient parallel algorithms for geometric k-clustering problems
  Amitava Datta
  Lecture Notes in Computer Science 775, 1994, pp. 475-486
• A simple optimal parallel algorithm for reporting paths in a tree
  Anil Maheshwari, Andrzej Lingas
  Lecture Notes in Computer Science 775, 1994, pp. 487-495
• Parallel detection of all palindromes in a string
  Alberto Apostolico, Dany Breslauer, Zvi Galil
  Lecture Notes in Computer Science 775, 1994, pp. 497-506
• On the structure of parameterized problems in NP
  Liming Cai, Jianer Chen, Rodney Downey, Michael Fellows
  Lecture Notes in Computer Science 775, 1994, pp. 509-520
• On the approximability of finding maximum feasible subsystems of linear systems
  Edoardo Amaldi, Viggo Kann
  Lecture Notes in Computer Science 775, 1994, pp. 521-532
• On the acceptance power of regular languages
  Bernd Borchert
  Lecture Notes in Computer Science 775, 1994, pp. 533-541
• Complexity classes with finite acceptance types
  Ulrich Hertrampf
  Lecture Notes in Computer Science 775, 1994, pp. 543-553
• The complete axiomatization of cs-congruence
  Joachim Parrow, Peter Sjödin
  Lecture Notes in Computer Science 775, 1994, pp. 557-568
• Transition system specifications in stalk format with bisimulation as a congruence
  V. van Oostrom, E.P. de Vink
  Lecture Notes in Computer Science 775, 1994, pp. 569-580
• Decidability questions for bisimilarity of Petri nets and some related problems
  Petr Janc̑ar
  Lecture Notes in Computer Science 775, 1994, pp. 581-592
• The variable membership problem: Succinctness versus complexity
  Gerhard Buntrock, Krzysztof Loryś
  Lecture Notes in Computer Science 775, 1994, pp. 595-606
• Economy of description for single-valued transducers
  Andreas Weber, Reinhard Klemm
  Lecture Notes in Computer Science 775, 1994, pp. 607-618
• Automaticity: Properties of a measure of descriptional complexity
  Jeffrey Shallit, Yuri Breitbart
  Lecture Notes in Computer Science 775, 1994, pp. 619-630
• Towards a theory of recursive structures
  David Harel
  Lecture Notes in Computer Science 775, 1994, pp. 633-645