Claudia Bertram-Kretzberg

According to our database, Claudia Bertram-Kretzberg authored at least 11 papers between 1995 and 2001.

Collaborative distances:

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

2001

Erfahrungen mit dem Data Warehouse bei der DOUGLAS Holding.

Claudia Bertram-Kretzberg, Andreas Birkendorf

HMD Prax. Wirtsch., 2001

2000

An Algorithm for Heilbronn's Problem.

Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann

SIAM J. Comput., 2000

MOD_p-tests, almost independence and small probability spaces.

Claudia Bertram-Kretzberg, Hanno Lefmann

Random Struct. Algorithms, 2000

1999

The Algorithmic Aspects of Uncrowded Hypergraphs.

Claudia Bertram-Kretzberg, Hanno Lefmann

SIAM J. Comput., 1999

Sparse 0-1-Matrices And Forbidden Hypergraphs.

Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann

Comb. Probab. Comput., 1999

1998

Derandomisierung, unabhängige Mengen und effiziente Schaltkreise.

Claudia Bertram-Kretzberg

PhD thesis, 1998

Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract).

Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

MOD_p-tests, Almost Independence and Small Probability Spaces (Extended Abstract).

Claudia Bertram-Kretzberg, Hanno Lefmann

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract).

Claudia Bertram-Kretzberg, Hanno Lefmann

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Proper Bounded Edge-Colorings.

Claudia Bertram-Kretzberg, Hanno Lefmann, Vojtech Rödl, Beata Wysocka

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

Multiple Product Modulo Arbitrary Numbers

Claudia Bertram-Kretzberg, Thomas Hofmeister

Electron. Colloquium Comput. Complex., 1995