Bernd Voigt

According to our database1, Bernd Voigt authored at least 34 papers between 1980 and 2001.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2001
Software Engineering Challenges: A CIO's Perspective.
Proceedings of the 23rd International Conference on Software Engineering, 2001

1997
Symmetric Chain Decompositions of Linear Lattices.
Comb. Probab. Comput., 1997

1994
Preface.
Discret. Math., 1994

1993
Monochromatic Trees with Respect to Edge Partitions.
J. Comb. Theory, Ser. B, 1993

1992
Ramsey properties of random graphs.
J. Comb. Theory, Ser. B, 1992

From wqo to bqo, via Ellentuck's theorem.
Discret. Math., 1992

1991
Partitions of reals: Measurable approach.
J. Comb. Theory, Ser. A, 1991

Graham-Rothschild parameter words and measurable partitions.
Comb., 1991

1990
Finding Minimally Weighted Subgraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

1989
Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple
Inf. Comput., October, 1989

Partitions of A<sup>omega</sup>.
SIAM J. Discret. Math., 1989

A short proof of the restricted Ramsey theorem for finite set systems.
J. Comb. Theory, Ser. A, 1989

A combinatorial interpretation of (1/k!)Delta<sup>k</sup>t<sup>n</sup>.
Discret. Math., 1989

1988
A Remark on Minimal Polynomials of Boolean Functions.
Proceedings of the CSL '88, 1988

1986
A dual form of Erdös-Rado's canonization theorem.
J. Comb. Theory, Ser. A, 1986

Hereditary attributes of surjections and parameter sets.
Eur. J. Comb., 1986

Properties of Complexity Measures for PRAMs and WRAMs.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
Canonizing Partition Theorems: Diversification, Products, and Iterated Versions.
J. Comb. Theory, Ser. A, 1985

Canonical Forms of Borel-Measurable Mappings Delta: [omega]<sup>omega</sup> -> R.
J. Comb. Theory, Ser. A, 1985

Canonizing Ordering Theorems for Hales Jewett Structures.
J. Comb. Theory, Ser. A, 1985

Canonizing Ramsey theorems for finite graphs and hypergraphs.
Discret. Math., 1985

On the sum of the reciprocals of cycle lengths in sparse graphs.
Comb., 1985

1984
A remark on infinite arithmetic progressions.
Discret. Math., 1984

Canonization theorems for finite affine and linear spaces.
Comb., 1984

1983
Canonical Partition Theorems for Parameter Sets.
J. Comb. Theory, Ser. A, 1983

A Canonical Partition Theorem for Equivalence Relations on Z<sup>t</sup>.
J. Comb. Theory, Ser. A, 1983

Combinatorial properties of regressive mappings.
Discret. Math., 1983

Density theorems for finitistic trees.
Comb., 1983

1982
Ein Zerlegungssatz für [k]<sup><k</sup>.
J. Comb. Theory, Ser. A, 1982

Induced Partition Theorems.
J. Comb. Theory, Ser. A, 1982

Partitionseigenschaften endlicher affiner und projektiver Räume.
Eur. J. Comb., 1982

1981
Partition theorems for parameter systems and graphs.
Discret. Math., 1981

Recent results in partition (Ramsey) theory for finite lattices.
Discret. Math., 1981

1980
The Partition Problem for Finite Abelian Groups.
J. Comb. Theory, Ser. A, 1980


  Loading...