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

• Reachability and the power of local ordering
  Kousha Etessami, Neil Immerman
  Lecture Notes in Computer Science 775, 1994, pp. 123-135
• Ground reducibility and automata with disequality constraints
  Hubert Comon, Florent Jacquemard
  Lecture Notes in Computer Science 775, 1994, pp. 151-162
• Optimal pattern matching on meshes
  Bogdan S. Chlebus, Leszek Ga̧sieniec
  Lecture Notes in Computer Science 775, 1994, pp. 213-224
• A unifying type-theoretic framework for objects
  Martin Hofmann, Benjamin Pierce
  Lecture Notes in Computer Science 775, 1994, pp. 251-262
• Operational specifications with built-ins
  Jürgen Avenhaus, Klaus Becker
  Lecture Notes in Computer Science 775, 1994, pp. 263-274
• Reactive variables for system specification and design
  E. Pascal Gribomont, Jacques Hagelstein
  Lecture Notes in Computer Science 775, 1994, pp. 275-286
• On adaptive dlogtime and polylogtime reductions
  Carme Álvarez, Birgit Jenner
  Lecture Notes in Computer Science 775, 1994, pp. 301-312
• Hypertransition systems
  André Arnold
  Lecture Notes in Computer Science 775, 1994, pp. 327-338
• 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
• 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
• Efficient parallel algorithms for geometric k-clustering problems
  Amitava Datta
  Lecture Notes in Computer Science 775, 1994, pp. 475-486
• 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 variable membership problem: Succinctness versus complexity
  Gerhard Buntrock, Krzysztof Loryś
  Lecture Notes in Computer Science 775, 1994, pp. 595-606
• Towards a theory of recursive structures
  David Harel
  Lecture Notes in Computer Science 775, 1994, pp. 633-645
• Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data
  Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki
  Lecture Notes in Computer Science 775, 1994, pp. 649-660
• Upper bounds for the expected length of a longest common subsequence of two binary sequences
  Vlado Danc̑ík, Mike Paterson
  Lecture Notes in Computer Science 775, 1994, pp. 669-678
• Dominating cliques in graphs with hypertree structure
  Feodor F. Dragan, Andreas Brandstädt
  Lecture Notes in Computer Science 775, 1994, pp. 735-746
• On vertex ranking for permutation and other graphs
  J.S. Deogun, T. Kloks, D. Kratsch, H. Müller
  Lecture Notes in Computer Science 775, 1994, pp. 747-758
• On the complexity of the maximum cut problem
  Hans L. Bodlaender, Klaus Jansen
  Lecture Notes in Computer Science 775, 1994, pp. 769-780