default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernd Voigt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[c4]Bernd Voigt:
Software Engineering Challenges: A CIO's Perspective. ICSE 2001: 666
1990 – 1999
- 1997
- [j30]Frank Vogt, Bernd Voigt:
Symmetric Chain Decompositions of Linear Lattices. Comb. Probab. Comput. 6(2): 231-245 (1997) - 1994
- [j29]Walter A. Deuber, Hans Jürgen Prömel, Bernd Voigt:
Preface. Discret. Math. 136(1-3): 1 (1994) - 1993
- [j28]Vojtech Rödl, Bernd Voigt:
Monochromatic Trees with Respect to Edge Partitions. J. Comb. Theory B 58(2): 291-298 (1993) - 1992
- [j27]Hans Jürgen Prömel, Bernd Voigt:
From wqo to bqo, via Ellentuck's theorem. Discret. Math. 108(1-3): 83-106 (1992) - [j26]Tomasz Luczak
, Andrzej Rucinski, Bernd Voigt:
Ramsey properties of random graphs. J. Comb. Theory B 56(1): 55-68 (1992) - 1991
- [j25]Hans Jürgen Prömel, Bernd Voigt:
Graham-Rothschild parameter words and measurable partitions. Comb. 11(3): 253-260 (1991) - [j24]Szymon Plewik, Bernd Voigt:
Partitions of reals: Measurable approach. J. Comb. Theory A 58(1): 136-140 (1991) - 1990
- [c3]Jürgen Plehn, Bernd Voigt:
Finding Minimally Weighted Subgraphs. WG 1990: 18-29
1980 – 1989
- 1989
- [j23]A. Benzait, Bernd Voigt:
A combinatorial interpretation of (1/k!)Deltaktn. Discret. Math. 73(1-2): 27-35 (1989) - [j22]Bernd Voigt, Ingo Wegener:
Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple. Inf. Comput. 83(1): 65-79 (1989) - [j21]Hans Jürgen Prömel, Bernd Voigt:
A short proof of the restricted Ramsey theorem for finite set systems. J. Comb. Theory A 52(2): 313-320 (1989) - [j20]Hanno Lefmann, Bernd Voigt:
Partitions of Aomega. SIAM J. Discret. Math. 2(4): 524-529 (1989) - 1988
- [c2]Bernd Voigt, Ingo Wegener:
A Remark on Minimal Polynomials of Boolean Functions. CSL 1988: 372-383 - 1986
- [j19]Hans Jürgen Prömel, Bernd Voigt:
Hereditary attributes of surjections and parameter sets. Eur. J. Comb. 7(2): 161-170 (1986) - [j18]Hans Jürgen Prömel, Stephen G. Simpson, Bernd Voigt:
A dual form of Erdös-Rado's canonization theorem. J. Comb. Theory A 42(2): 159-178 (1986) - [c1]Siegfried Bublitz, Ute Schürfeld, Bernd Voigt, Ingo Wegener:
Properties of Complexity Measures for PRAMs and WRAMs. MFCS 1986: 230-238 - 1985
- [j17]András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt:
On the sum of the reciprocals of cycle lengths in sparse graphs. Comb. 5(1): 41-52 (1985) - [j16]Hans Jürgen Prömel, Bernd Voigt:
Canonizing Ramsey theorems for finite graphs and hypergraphs. Discret. Math. 54(1): 49-59 (1985) - [j15]Bernd Voigt:
Canonizing Partition Theorems: Diversification, Products, and Iterated Versions. J. Comb. Theory A 40(2): 349-376 (1985) - [j14]Jaroslav Nesetril, Hans Jürgen Prömel, Vojtech Rödl, Bernd Voigt:
Canonizing Ordering Theorems for Hales Jewett Structures. J. Comb. Theory A 40(2): 394-408 (1985) - [j13]Hans Jürgen Prömel, Bernd Voigt:
Canonical Forms of Borel-Measurable Mappings Delta: [omega]omega -> R. J. Comb. Theory A 40(2): 409-417 (1985) - 1984
- [j12]Bernd Voigt:
Canonization theorems for finite affine and linear spaces. Comb. 4(2): 219-239 (1984) - [j11]Hanno Lefmann, Bernd Voigt:
A remark on infinite arithmetic progressions. Discret. Math. 52(2-3): 285-286 (1984) - 1983
- [j10]Ralf Bicker, Bernd Voigt:
Density theorems for finitistic trees. Comb. 3(3): 305-313 (1983) - [j9]Bernd Voigt:
Combinatorial properties of regressive mappings. Discret. Math. 47: 97-108 (1983) - [j8]Walter A. Deuber, Ronald L. Graham, Hans Jürgen Prömel, Bernd Voigt:
A Canonical Partition Theorem for Equivalence Relations on Zt. J. Comb. Theory A 34(3): 331-339 (1983) - [j7]Hans Jürgen Prömel, Bernd Voigt:
Canonical Partition Theorems for Parameter Sets. J. Comb. Theory A 35(3): 309-327 (1983) - 1982
- [j6]Walter A. Deuber, Bernd Voigt:
Partitionseigenschaften endlicher affiner und projektiver Räume. Eur. J. Comb. 3(4): 329-340 (1982) - [j5]Walter A. Deuber, B. L. Rothschild, Bernd Voigt:
Induced Partition Theorems. J. Comb. Theory A 32(2): 225-240 (1982) - [j4]Bernd Voigt, Kurt Wolfsdorf:
Ein Zerlegungssatz für [k]<k. J. Comb. Theory A 33(2): 195-200 (1982) - 1981
- [j3]Hans Jürgen Prömel, Bernd Voigt:
Recent results in partition (Ramsey) theory for finite lattices. Discret. Math. 35(1-3): 185-198 (1981) - [j2]Hans Jürgen Prömel, Bernd Voigt:
Partition theorems for parameter systems and graphs. Discret. Math. 36(1): 83-96 (1981) - 1980
- [j1]Bernd Voigt:
The Partition Problem for Finite Abelian Groups. J. Comb. Theory A 28(3): 257-271 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
