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

• 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
• On a parallel-algorithms method for string matching problems (overview)
  Suleyman Cenk Sahinalp, Uzi Vishkin
  Lecture Notes in Computer Science 778, 1994, pp. 22-32
• Some open problems in approximation
  Mihalis Yannakakis
  Lecture Notes in Computer Science 778, 1994, pp. 33-39
• 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 non-interactive electronic cash system
  Giovanni di Crescenzo
  Lecture Notes in Computer Science 778, 1994, pp. 109-124
• 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
• Time-message trade-offs for the weak unison problem
  Amos Israeli, Evangelos Kranakis, Danny Krizanc, Nicola Santoro
  Lecture Notes in Computer Science 778, 1994, pp. 167-178
• On set equality-testing
  Tak Wah Lam, Ka Hing Lee
  Lecture Notes in Computer Science 778, 1994, pp. 179-191
• On the complexity of some reachability problems
  Angelo Monti, Alessandro Roncato
  Lecture Notes in Computer Science 778, 1994, pp. 192-202
• On self-reducible sets of low information content
  Martin Mundhenk
  Lecture Notes in Computer Science 778, 1994, pp. 203-212