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: Booktitle=Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS'95 (Munich, Germany, March 2-4, 1995)

• Concurrent process equivalences: Some decision problems
  Albert R. Meyer
  Lecture Notes in Computer Science 900, 1995, pp. 349
• On the synthesis of strategies in infinite games
  Wolfgang Thomas
  Lecture Notes in Computer Science 900, 1995, pp. 1-13
• Finding the maximum with linear error probabilities: A sequential analysis approach
  Guy Louchard
  Lecture Notes in Computer Science 900, 1995, pp. 14-25
• Completeness and weak completeness under polynomial-size circuits
  David W. Juedes, Jack H. Lutz
  Lecture Notes in Computer Science 900, 1995, pp. 26-37
• Communication complexity of key agreement on small ranges
  Jin-Yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
  Lecture Notes in Computer Science 900, 1995, pp. 38-49
• Pseudorandom generators and the frequency of simplicity
  Yenjo Han, Lane A. Hemaspaandra
  Lecture Notes in Computer Science 900, 1995, pp. 50-59
• Classes of bounded counting type and their inclusion relations
  Ulrich Hertrampf
  Lecture Notes in Computer Science 900, 1995, pp. 60-70
• Lower bounds for depth-three circuits with equals and mod-gates
  Frederic Green
  Lecture Notes in Computer Science 900, 1995, pp. 71-82
• On realizing iterated multiplication by small depth threshold circuits
  Matthias Krause
  Lecture Notes in Computer Science 900, 1995, pp. 83-94
• A random NP-complete problem for inversion of 2D cellular automata
  Bruno Durand
  Lecture Notes in Computer Science 900, 1995, pp. 95-106
• On the subword equivalence problem for infinite words
  Isabelle Fagnot
  Lecture Notes in Computer Science 900, 1995, pp. 107-118
• On the separators on an infinite word generated by a morphism
  Emmanuelle Garel
  Lecture Notes in Computer Science 900, 1995, pp. 119-130
• Systolic tree \omega-languages
  Angelo Monti, Adriano Peron
  Lecture Notes in Computer Science 900, 1995, pp. 131-142
• Structural complexity of \omega-automata
  Sriram C. Krishnan, Anuj Puri, Robert K. Brayton
  Lecture Notes in Computer Science 900, 1995, pp. 143-156
• Algorithms explained by symmetries
  Torsten Minkwitz
  Lecture Notes in Computer Science 900, 1995, pp. 157-167
• Generalized scans and tri-diagonal systems
  Paul F. Fischer, Franco P. Preparata, John E. Savage
  Lecture Notes in Computer Science 900, 1995, pp. 168-180
• Two-dimensional pattern matching in linear time and small space
  Maxime Crochemore, Leszek Ga̧sieniec, Wojciech Plandowski, Wojciech Rytter
  Lecture Notes in Computer Science 900, 1995, pp. 181-192
• On-line and dynamic algorithms for shortest path problems
  Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
  Lecture Notes in Computer Science 900, 1995, pp. 193-204
• On compact representations of propositional circumscription
  Marco Cadoli, Francesco M. Donini, Marco Schaerf
  Lecture Notes in Computer Science 900, 1995, pp. 205-216
• A set-theoretic translation method for (poly)modal logics
  Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
  Lecture Notes in Computer Science 900, 1995, pp. 217-228
• On the synthesis of discrete controllers for timed systems
  Oded Maler, Amir Pnueli, Joseph Sifakis
  Lecture Notes in Computer Science 900, 1995, pp. 229-242
• A fully abstract semantics for causality in the \pi-calculus
  Michele Boreale, Davide Sangiorgi
  Lecture Notes in Computer Science 900, 1995, pp. 243-254
• On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
  J. Hromkovic̑, K. Loryś, P. Kanarek, R. Klasing, W. Unger, H. Wagener
  Lecture Notes in Computer Science 900, 1995, pp. 255-266
• Exploiting storage redundancy to speed up randomized shared memory simulations
  Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann
  Lecture Notes in Computer Science 900, 1995, pp. 267-278
• Interval routing schemes
  Michele Flammini, Giorgio Gambosi, Sandro Salomone
  Lecture Notes in Computer Science 900, 1995, pp. 279-290