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	Hilfe

Suche: Series=LNCS AND YEAR=1994

• Parametric recomputing in alignment graphs
  Xiaoqiu Huang, Pavel A. Pevzner, Webb Miller
  Lecture Notes in Computer Science 807, 1994, pp. 87-101
• Shortest common superstrings for strings of random letters
  Kenneth S. Alexander
  Lecture Notes in Computer Science 807, 1994, pp. 164-172
• Dictionary-matching on unbounded alphabets: Uniform length dictionaries
  Dany Breslauer
  Lecture Notes in Computer Science 807, 1994, pp. 184-197
• Proximity matching using fixed-queries trees
  Ricardo Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu
  Lecture Notes in Computer Science 807, 1994, pp. 198-212
• Approximate string matching with don't care characters
  Tatsuya Akutsu
  Lecture Notes in Computer Science 807, 1994, pp. 240-249
• Approximate string matching and local similarity
  William I. Chang, Thomas G. Marr
  Lecture Notes in Computer Science 807, 1994, pp. 259-273
• Data-flow synchronous languages
  Albert Benveniste, Paul Caspi, Paul le Guernic, Nicholas Halbwachs
  Lecture Notes in Computer Science 803, 1994, pp. 1-45
• Process algebra with backtracking
  J.A. Bergstra, A. Ponse, J.J. van Wamel
  Lecture Notes in Computer Science 803, 1994, pp. 46-91
• Some chemical abstract machines
  Gérard Boudol
  Lecture Notes in Computer Science 803, 1994, pp. 92-123
• Verification tools for finite-state concurrent systems
  E. Clarke, O. Grumberg, D. Long
  Lecture Notes in Computer Science 803, 1994, pp. 124-175
• Linear logic on Petri nets
  Uffe Engberg, Glynn Winskel
  Lecture Notes in Computer Science 803, 1994, pp. 176-229
• On the intellectual terrain around NP
  Juris Hartmanis, Suresh Chari
  Lecture Notes in Computer Science 778, 1994, pp. 1-11
• Advances in graph drawing
  Ashim Garg, Roberto Tamassia
  Lecture Notes in Computer Science 778, 1994, pp. 12-21
• New local search approximation techniques for maximum generalized satisfiability problems
  Paola Alimonti
  Lecture Notes in Computer Science 778, 1994, pp. 40-53
• Learning behaviors of automata from multiplicity and equivalence queries
  F. Bergadano, S. Varricchio
  Lecture Notes in Computer Science 778, 1994, pp. 54-62
• Measures of Boolean function complexity based on harmonic analysis
  A. Bernasconi, B. Codenotti
  Lecture Notes in Computer Science 778, 1994, pp. 63-72
• Graph theory and interactive protocols for reachability problems on finite cellular automata
  A. Clementi, R. Impagliazzo
  Lecture Notes in Computer Science 778, 1994, pp. 73-90
• Parallel pruning decomposition (PDS) and biconnected components of graphs
  Eliezer Dekel, Jie Hu
  Lecture Notes in Computer Science 778, 1994, pp. 91-108
• A unified scheme for routing in expander based networks
  Shimon Even, Ami Litman
  Lecture Notes in Computer Science 778, 1994, pp. 125-135
• Dynamization of backtrack-free search for the constraint satisfaction problem
  Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
  Lecture Notes in Computer Science 778, 1994, pp. 136-151
• Efficient reorganization of binary search trees
  Micha Hofri, Hadas Shachnai
  Lecture Notes in Computer Science 778, 1994, pp. 152-166
• One binary Horn clause is enough
  Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz
  Lecture Notes in Computer Science 775, 1994, pp. 21-32
• Transforming constraint logic programs
  N. Bensaou, I. Guessarian
  Lecture Notes in Computer Science 775, 1994, pp. 33-46
• The complexity of resource-bounded first-order classical logic
  Jean Goubault
  Lecture Notes in Computer Science 775, 1994, pp. 59-70
• Two proof procedures for a cardinality based language in propositional calculus
  Belaid Benhamou, Lakhdar Sais, Pierre Siegel
  Lecture Notes in Computer Science 775, 1994, pp. 71-82