Bernd Schmeltz

According to our database, Bernd Schmeltz authored at least 5 papers between 1989 and 1992.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1992

Learning Convex Sets Under Uniform Distribution.

Bernd Schmeltz

Proceedings of the Data Structures and Efficient Algorithms, 1992

Area Efficient Methods to Increase the Reliability of Circuits.

Rüdiger Reischuk, Bernd Schmeltz

Proceedings of the Data Structures and Efficient Algorithms, 1992

1991

Optimal Tradeoffs Between Time And Bit Complexity In Distributed Synchronous Rings.

Bernd Schmeltz

Proceedings of the STACS 91, 1991

Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound

Rüdiger Reischuk, Bernd Schmeltz

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1989

Area Efficient Methods to Increase the Reliability of Combinatorial Circuits.

Rüdiger Reischuk, Bernd Schmeltz

Proceedings of the STACS 89, 1989