12. STACS 1995:
Munich,
Germany
Ernst W. Mayr, Claude Puech (Eds.):
STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings.
Lecture Notes in Computer Science 900 Springer 1995, ISBN 3-540-59042-0 BibTeX
@proceedings{DBLP:conf/stacs/1995,
editor = {Ernst W. Mayr and
Claude Puech},
title = {STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer
Science, Munich, Germany, March 2-4, 1995, Proceedings},
booktitle = {STACS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {900},
year = {1995},
isbn = {3-540-59042-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Talk
Complexity Theory I
Cryptography
Complexity Theory II
Automata Theory I
Algorithms
Logic
Theory of Parallel Computing I
- Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener:
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
255-266 BibTeX
- Friedhelm Meyer auf der Heide, Christian Scheideler, Volker Stemann:
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.
267-278 BibTeX
- Michele Flammini, Giorgio Gambosi, Sandro Salomone:
Interval Routing Schemes.
279-290 BibTeX
- Friedhelm Meyer auf der Heide, Berthold Vöcking:
A Packet Routing Protocol for Arbitrary Networks.
291-302 BibTeX
Automata Theory II
Invited Talk
Communication Theory
Automata Theory III
Graph Theory,
Data Bases
Automata Theory IV
Theory of Parallel Computing II
Complexity Theory III
Computational Geometry
Complexity Theory IV
Invited Talk
Copyright © Sat May 16 23:43:05 2009
by Michael Ley (ley@uni-trier.de)
