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

• Proof theory of fuzzy logics: Urquhart's C and related logics
  Matthias Baaz, Agata Ciabattoni, Christian Fermüller, Helmut Veith
  Lecture Notes in Computer Science 1450, 1998, pp. 203-212
• Nonstochastic languages as projections of 2-tape quasideterministic languages
  Richard Bonner, Rūsiņs̆ Freivalds, Jānis Lapiņs̆, Antra Lukjanska
  Lecture Notes in Computer Science 1450, 1998, pp. 213-219
• The semi-full closure of pure type systems
  Gilles Barthe
  Lecture Notes in Computer Science 1450, 1998, pp. 316-325
• Predicative polymorphic subtyping
  Marcin Benke
  Lecture Notes in Computer Science 1450, 1998, pp. 326-335
• A computational interpretation of the \lambda\mu-calculus
  G.M. Bierman
  Lecture Notes in Computer Science 1450, 1998, pp. 336-345
• Polymorphic subtyping without distributivity
  Jacek Chrza̧szcz
  Lecture Notes in Computer Science 1450, 1998, pp. 346-355
• A superpolynomial lower bound for a circuit computing the clique function with at most (1/6)\log\log n negation gates
  Kazuyuki Amano, Akira Maruoka
  Lecture Notes in Computer Science 1450, 1998, pp. 399-408
• On counting AC^0 circuits with negative constants
  Andris Ambainis, David Mix Barrington, Huong LêThanh
  Lecture Notes in Computer Science 1450, 1998, pp. 409-417
• Randomness vs.\ completeness: On the diagonalization strength of resource-bounded random sets
  Klaus Ambos-Spies, Steffen Lempp, Gunter Mainhardt
  Lecture Notes in Computer Science 1450, 1998, pp. 465-473
• Positive Turing and truth-table completeness for NEXP are incomparable
  Levke Bentzien
  Lecture Notes in Computer Science 1450, 1998, pp. 474-482
• When can an equational simple graph be generated by hyperedge replacement?
  Klaus Barthelmann
  Lecture Notes in Computer Science 1450, 1998, pp. 543-552
• Facial circuits of planar graphs and context-free languages
  Bruno Courcelle, Denis Lapoire
  Lecture Notes in Computer Science 1450, 1998, pp. 616-624
• Equations in transfinite strings
  Christian Choffrut, Sandor Horvath
  Lecture Notes in Computer Science 1450, 1998, pp. 656-664
• Minimal forbidden words and factor automata
  M. Crochemore, F. Mignosi, A. Restivo
  Lecture Notes in Computer Science 1450, 1998, pp. 665-673
• Embedding of hypercubes into grids
  S.L. Bezrukov, J.D. Chavez, L.H. Harper, M. Röttger, U.-P. Schroeder
  Lecture Notes in Computer Science 1450, 1998, pp. 693-701
• Tree decompositions of small diameter
  Hans L. Bodlaender, Torben Hagerup
  Lecture Notes in Computer Science 1450, 1998, pp. 702-712
• Degree-preserving forests
  Hajo Broersma, Andreas Huck, Ton Kloks, Otto Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
  Lecture Notes in Computer Science 1450, 1998, pp. 713-721
• A parallelization of Dijkstra's shortest path algorithm
  A. Crauser, K. Mehlhorn, U. Meyer, P. Sanders
  Lecture Notes in Computer Science 1450, 1998, pp. 722-731
• On the complexity of wavelength converters
  Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
  Lecture Notes in Computer Science 1450, 1998, pp. 771-779
• On Boolean vs.\ modular arithmetic for circuits and communication protocols
  Carsten Damm
  Lecture Notes in Computer Science 1450, 1998, pp. 780-788
• One guess one-way cellular arrays
  Thomas Buchholz, Andreas Klein, Martin Kutrib
  Lecture Notes in Computer Science 1450, 1998, pp. 807-815
• Topological definitions of chaos applied to cellular automata dynamics
  Gianpiero Cattaneo, Luciano Margara
  Lecture Notes in Computer Science 1450, 1998, pp. 816-824
• Combinatorial problems arising in massive data sets
  Fan Chung Graham
  Lecture Notes in Computer Science 1449, 1998, pp. 2-2
• On computing new classes of optimal triangulations with angular constraints
  Yang Dai, Naoki Katoh
  Lecture Notes in Computer Science 1449, 1998, pp. 15-24
• Space-efficient algorithms for approximating polygonal curves in two dimensional space
  Danny Z. Chen, Ovidiu Daescu
  Lecture Notes in Computer Science 1449, 1998, pp. 45-54