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

• Witness-isomorphic reductions and the local search problem
  Sophie Fischer, Lane Hemaspaandra, Leen Torenvliet
  Lecture Notes in Computer Science 969, 1995, pp. 277-287
• Multiple product modulo arbitrary numbers
  Claudia Bertram-Kretzberg, Thomas Hofmeister
  Lecture Notes in Computer Science 969, 1995, pp. 288-298
• Lower bounds for the majority communication complexity of various graph accessibility problems
  Christoph Meinel, Stephan Waack
  Lecture Notes in Computer Science 969, 1995, pp. 299-308
• Strong optimal lower bounds for Turing machines that accept nonregular languages
  Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
  Lecture Notes in Computer Science 969, 1995, pp. 309-318
• A superpolynomial lower bound for (1,+k(n))-branching programs
  Stanislav Z̑ák
  Lecture Notes in Computer Science 969, 1995, pp. 319-325
• Deterministic parsing for augmented context-free grammars
  Luca Breveglieri, Alessandra Cherubini, Stefano Crespi Reghizzi
  Lecture Notes in Computer Science 969, 1995, pp. 326-336
• A periodicity theorem on words and applications
  Filippo Mignosi, Antonio Restivo, Sergio Salemi
  Lecture Notes in Computer Science 969, 1995, pp. 337-348
• A new approach to analyse coupled-context-free languages
  Günter Hotz, Gisela Pitsch
  Lecture Notes in Computer Science 969, 1995, pp. 349-358
• Computational complexity of simultaneous elementary matching problems
  Miki Hermann, Phokion G. Kolaitis
  Lecture Notes in Computer Science 969, 1995, pp. 359-370
• Graph reducibility of term rewriting systems
  M.R.K. Krishna Rao
  Lecture Notes in Computer Science 969, 1995, pp. 371-381
• Positive recursive type assignment
  Pawel Urzyczyn
  Lecture Notes in Computer Science 969, 1995, pp. 382-391
• String recognition on anonymous rings
  Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio
  Lecture Notes in Computer Science 969, 1995, pp. 392-401
• The firing squad synchronization problem on Cayley graphs
  Zsuzsanna Róka
  Lecture Notes in Computer Science 969, 1995, pp. 402-411
• The Firing Squad Synchronization Problem on Cayley graphs
  Zsuzsanna Róka
  Lecture Notes in Computer Science 969, 1995, pp. 402-411
• Solving cheap graph problems on meshes
  Jop F. Sibeyn, Michael Kaufmann
  Lecture Notes in Computer Science 969, 1995, pp. 412-422
• An elementary bisimulation decision procedure for arbitrary context-free processes
  Olaf Burkart, Didier Caucal, Bernhard Steffen
  Lecture Notes in Computer Science 969, 1995, pp. 423-433
• On congruences and partial orders
  Serge Bauget, Paul Gastin
  Lecture Notes in Computer Science 969, 1995, pp. 434-443
• Performance preorder: Ordering processes with respect to speed
  Flavio Corradini, Roberto Gorrieri, Marco Roccetti
  Lecture Notes in Computer Science 969, 1995, pp. 444-453
• Towards a semantic theory of CML
  W. Ferreira, M. Hennessy
  Lecture Notes in Computer Science 969, 1995, pp. 454-466
• Modular constructions of distributing automata
  Sébastian Huguet, Antoine Petit
  Lecture Notes in Computer Science 969, 1995, pp. 467-478
• On the proof method for bisimulation
  Davide Sangiorgi
  Lecture Notes in Computer Science 969, 1995, pp. 479-488
• Towards a calculus of predicate transformers
  Clare Martin
  Lecture Notes in Computer Science 969, 1995, pp. 489-498
• An abstract account of composition
  Martín Abadi, Stephan Merz
  Lecture Notes in Computer Science 969, 1995, pp. 499-508
• Syntax and semantics of Procol
  Roel van der Goot, Arie de Bruin
  Lecture Notes in Computer Science 969, 1995, pp. 509-518
• Synthesizing distinguishing formulae for real time systems
  Jens Chr. Godskesen, Kim G. Larsen
  Lecture Notes in Computer Science 969, 1995, pp. 519-528