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

• A downward translation in the polynomial hierarchy
  Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
  Lecture Notes in Computer Science 1200, 1997, pp. 319-328
• Strict sequential P-completeness
  Klaus Reinhardt
  Lecture Notes in Computer Science 1200, 1997, pp. 329-338
• An unambiguous class possessing a complete set
  Klaus-Jörn Lange
  Lecture Notes in Computer Science 1200, 1997, pp. 339-350
• Deadlock-free interval routing schemes
  Michele Flammini
  Lecture Notes in Computer Science 1200, 1997, pp. 351-362
• Power consumption in packet radio networks
  Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
  Lecture Notes in Computer Science 1200, 1997, pp. 363-374
• The complexity of generating test instances
  Christoph Karg, Johannes Köbler, Rainer Schuler
  Lecture Notes in Computer Science 1200, 1997, pp. 375-386
• Efficient constructions of hitting sets for systems of linear functions
  Alexander E. Andreev, Andrea E.F. Clementi, José D.P. Rolim
  Lecture Notes in Computer Science 1200, 1997, pp. 387-398
• Protocols for collusion-secure asymmetric fingerprinting
  Ingrid Biehl, Bernd Meyer
  Lecture Notes in Computer Science 1200, 1997, pp. 399-412
• Minimal transition systems for history-preserving bisimulation
  Ugo Montanari, Marco Pistore
  Lecture Notes in Computer Science 1200, 1997, pp. 413-425
• On ergodic linear cellular automata over Z_m
  Gianpiero Cattaneo, Enrico Formenti, Giovanni Manzini, Luciano Margara
  Lecture Notes in Computer Science 1200, 1997, pp. 427-438
• Intrinsic universality of a 1-dimensional reversible cellular automaton
  Jérôme Olivier Durand-Lose
  Lecture Notes in Computer Science 1200, 1997, pp. 439-450
• The computational complexity of some problems of linear algebra
  Jonathan F. Buss, Gudmund S. Frandsen, Jeffrey O. Shallit
  Lecture Notes in Computer Science 1200, 1997, pp. 451-462
• Algebraic and logical characterizations of deterministic linear time classes
  Thomas Schwentick
  Lecture Notes in Computer Science 1200, 1997, pp. 463-474
• Finding the k shortest paths in parallel
  Eric Ruppert
  Lecture Notes in Computer Science 1200, 1997, pp. 475-486
• Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
  Elias Dahlhaus
  Lecture Notes in Computer Science 1200, 1997, pp. 487-498
• Distance approximating spanning trees
  Erich Prisner
  Lecture Notes in Computer Science 1200, 1997, pp. 499-510
• A better upper bound on the bisection width of de Bruijn networks
  Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke
  Lecture Notes in Computer Science 1200, 1997, pp. 511-522
• An information-theoretic treatment of random-self-reducibility
  Joan Feigenbaum, Martin Strauss
  Lecture Notes in Computer Science 1200, 1997, pp. 523-534
• Equivalence of measures of complexity classes
  Josef M. Breutzmann, Jack H. Lutz
  Lecture Notes in Computer Science 1200, 1997, pp. 535-546
• Better algorithms for minimum weight vertex-connectivity problems
  Vincenzo Auletta, Mimmo Parente
  Lecture Notes in Computer Science 1200, 1997, pp. 547-558
• RNC-approximation algorithms for the Steiner problem
  Hans Jürgen Prömel, Angelika Steger
  Lecture Notes in Computer Science 1200, 1997, pp. 559-570
• Pattern matching in trace monoids
  Jochen Messner
  Lecture Notes in Computer Science 1200, 1997, pp. 571-582
• Removing \varepsilon-transitions in timed automata
  Volker Diekert, Paul Gastin, Antoine Petit
  Lecture Notes in Computer Science 1200, 1997, pp. 583-594
• Probabilistic proof systems - A survey
  Oded Goldreich
  Lecture Notes in Computer Science 1200, 1997, pp. 595-611