Peter Mysliwietz

According to our database1, Peter Mysliwietz authored at least 13 papers between 1989 and 1997.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1997
A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract).
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1996
The Shuffle Exchange Network has a Hamiltonian Path.
Math. Syst. Theory, 1996

1995
Verteilte Spielbaumsuche.
Informationstechnik Tech. Inform., 1995

Controlled Conspiracy-Number Search.
J. Int. Comput. Games Assoc., 1995

1994
Optimal algorithms for dissemination of information in generalized communication modes.
Discret. Appl. Math., 1994

Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation.
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Konstruktion und Optimierung von Bewertungsfunktionen beim Schach.
PhD thesis, 1994

1992
Optimal Algorithms for Disemination of Information in Generalized Communication Modes.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

Distributed Game Tree Search on a Massively Parallel System.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1991
Report on the 1st International Paderborn Computer Chess Championship.
J. Int. Comput. Games Assoc., 1991

1990
Response to a Comment on 'Distributed Game-Tree Search'.
J. Int. Comput. Games Assoc., 1990

1989
A Conjecture Challenged.
J. Int. Comput. Games Assoc., 1989

Distributed Game-Tree Search.
J. Int. Comput. Games Assoc., 1989


  Loading...