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

• A linear-time heuristic for minimum rectangular coverings
  Christos Levcopoulos, Joachim Gudmundsson
  Lecture Notes in Computer Science 1279, 1997, pp. 305-316
• On occurrence net semantics for Petri nets with contacts
  Irina A. Lomazova
  Lecture Notes in Computer Science 1279, 1997, pp. 317-328
• Cellular automata universality revisited
  Bruno Martin
  Lecture Notes in Computer Science 1279, 1997, pp. 329-339
• Trade-off results for connection management
  Marios Mavronicolas, Nikos Papadakis
  Lecture Notes in Computer Science 1279, 1997, pp. 340-351
• On the average complexity of the membership problem for a generalized Dyck language
  Markus E. Nebel
  Lecture Notes in Computer Science 1279, 1997, pp. 352-363
• Towards optimal locality in mesh-indexings
  Rolf Niedermeier, Klaus Reinhardt, Peter Sanders
  Lecture Notes in Computer Science 1279, 1997, pp. 364-375
• On the hierarchy of nondeterministic branching k-programs
  Elizaveta A. Okol'nishnikova
  Lecture Notes in Computer Science 1279, 1997, pp. 376-387
• FDT is undecidable for finitely presented monoids with solvable word problems
  Friedrich Otto, Andrea Sattler-Klein
  Lecture Notes in Computer Science 1279, 1997, pp. 388-399
• The equivalence of pebbles and sensing heads for finite automata
  Holger Petersen
  Lecture Notes in Computer Science 1279, 1997, pp. 400-410
• From finite automata toward hybrid systems
  A. Rabinovich, B.A. Trakhtenbrot
  Lecture Notes in Computer Science 1279, 1997, pp. 411-422
• On an optimal quantified propositional proof system and a complete language for NP\cap co-NP
  Zenon Sadowski
  Lecture Notes in Computer Science 1279, 1997, pp. 423-428
• Lower bounds in on-line geometric searching
  Sven Schuierer
  Lecture Notes in Computer Science 1279, 1997, pp. 429-440
• The complexity of universal text-learners
  Frank C. Stephan, Sebastiaan A. Terwijn
  Lecture Notes in Computer Science 1279, 1997, pp. 441-451
• Unique normal forms for nonlinear term rewriting systems: Root overlaps
  Rakesh M. Verma
  Lecture Notes in Computer Science 1279, 1997, pp. 452-462
• Behavioural characterizations of partial order logics
  Irina Virbitskaite, Anzhelika Votintseva
  Lecture Notes in Computer Science 1279, 1997, pp. 463-474